{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004878758,0.00020318,0.0002279361,0.00004835302,0.0002258645,0.0001805661,0.0002841575,0.00007312617,0.0001638177],"category_scores_gemma":[0.00002190579,0.0001265946,0.000206307,0.00007073133,0.00003528378,0.0001294392,0.00001632976,0.0002620917,0.00008922716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009559267,"about_ca_system_score_gemma":0.00001315247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.621501e-7,"about_ca_topic_score_gemma":0.000002733094,"domain_scores_codex":[0.998891,0.00002530351,0.000396075,0.0001011254,0.000290902,0.0002956014],"domain_scores_gemma":[0.9991848,0.0002935739,0.0001233259,0.000261786,0.00003048494,0.0001059646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000333446,0.0007769663,0.00002472005,0.0007762656,0.002888775,0.00004800479,0.02108455,0.6997849,0.01259144,0.125415,0.1246604,0.01161552],"study_design_scores_gemma":[0.003523998,0.0008052998,0.00006552682,0.001555951,0.0004693636,0.0002112858,0.006771219,0.4596868,0.0119219,0.2529259,0.2607005,0.001362292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3273225,0.003725106,0.5896918,0.003794908,0.006657026,0.003434835,0.0005006079,0.0007104584,0.06416271],"genre_scores_gemma":[0.9959467,0.00008305152,0.002330504,0.0001177572,0.0006163616,0.00005698931,0.000004560397,0.0000594254,0.0007846686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6686242,"threshold_uncertainty_score":0.5162377,"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."}}