{"id":"W2134525515","doi":"10.1142/s0129054107004863","title":"IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Range (aeronautics); Set (abstract data type); Power consumption; Computer science; Mathematics; Simple (philosophy); Mathematical optimization; Power (physics)","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.004796428,0.000141197,0.0002468417,0.0007060617,0.000268644,0.000413132,0.005413027,0.00005731823,0.000004441137],"category_scores_gemma":[0.0001561819,0.0001301919,0.0002003595,0.0007226506,0.0003782241,0.001531481,0.000542185,0.0002056316,0.000001019114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003257337,"about_ca_system_score_gemma":0.0006804478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005596054,"about_ca_topic_score_gemma":0.00000563195,"domain_scores_codex":[0.997155,0.00004970007,0.0009912539,0.0002958725,0.001102641,0.0004055635],"domain_scores_gemma":[0.9921791,0.001224056,0.0008898078,0.0005176967,0.004995536,0.0001938092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006507562,0.0002842826,0.00008649447,0.000007922999,0.00009888709,0.000002816718,0.0002778031,0.02712932,0.00105989,0.01540382,0.0009605237,0.9546232],"study_design_scores_gemma":[0.001359634,0.000357793,0.0005556647,0.00007056232,0.000007222249,0.00005732449,0.00001117171,0.9865144,0.001740636,0.001395636,0.007802241,0.0001276674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005197524,0.0001007301,0.9944668,0.002027709,0.002098,0.0006880487,0.000008748723,0.00002113018,0.00006906771],"genre_scores_gemma":[0.1862214,0.00004264558,0.8128236,0.0001290007,0.0006947309,0.00003001824,0.000006292688,0.000009154963,0.00004314311],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9593851,"threshold_uncertainty_score":0.9999682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03364534168025078,"score_gpt":0.3541425856134184,"score_spread":0.3204972439331676,"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."}}