{"id":"W2001034532","doi":"10.1137/s0895480101384402","title":"Lower Bounds from Tile Covers for the Channel Assignment Problem","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Cover (algebra); Mathematics; Reduction (mathematics); Clique; Channel (broadcasting); Constraint (computer-aided design); Tile; Upper and lower bounds; Combinatorics; Enumeration; Mathematical optimization; Assignment problem; Discrete mathematics; Computer science; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003604618,0.003599666,0.002071333,0.004223967,0.00188205,0.005418716,0.002794975,0.00222357,0.01595745],"category_scores_gemma":[0.01909868,0.001415814,0.00361016,0.003693786,0.002180691,0.006759956,0.004210485,0.007901085,0.003561092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003637061,"about_ca_system_score_gemma":0.001502289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001522667,"about_ca_topic_score_gemma":0.00203151,"domain_scores_codex":[0.9957985,0.00102824,0.0001506925,0.0004548064,0.001779553,0.0007882083],"domain_scores_gemma":[0.9842451,0.01204415,0.0006418493,0.00129878,0.001253293,0.0005168353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004086272,0.0002717589,0.001273772,0.0008041016,0.0001920949,0.0002800565,0.0004179975,0.3675829,0.007051476,0.4948519,0.03645238,0.09041291],"study_design_scores_gemma":[0.0000614245,0.0001444058,0.000518959,0.0001764745,0.00009701992,0.0002083757,0.00008944059,0.5132744,0.004806319,0.4614753,0.01910355,0.00004430367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02114622,0.002450455,0.9201123,0.001280392,0.0003161393,0.0002188087,0.001067787,0.0007409801,0.05266688],"genre_scores_gemma":[0.4273248,0.007088333,0.5237482,0.001349655,0.001691753,0.00230519,0.007554672,0.002461219,0.0264761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01595745,"threshold_uncertainty_score":0.05338299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01180277747908987,"score_gpt":0.2196632457915288,"score_spread":0.207860468312439,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}