{"id":"W3080963765","doi":"10.1109/isit44484.2020.9174336","title":"Minimum Feedback for Collision-Free Scheduling in Massive Random Access","year":2020,"lang":"en","type":"article","venue":"","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Random access; Computer science; Scheduling (production processes); Hypergraph; Hash function; Binary logarithm; Schedule; Base station; Theoretical computer science; Discrete mathematics; Combinatorics; Computer network; Mathematics; Mathematical optimization","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.0001017904,0.0001157797,0.0002045164,0.00003171563,0.00002935744,0.00008817262,0.0003153843,0.00008249562,0.0001313977],"category_scores_gemma":[0.00009020123,0.0001034941,0.00005887303,0.0002156978,0.000008553974,0.0001577478,0.00007360209,0.0001120475,0.00002083068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002076641,"about_ca_system_score_gemma":0.00001490305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004975586,"about_ca_topic_score_gemma":0.00001617797,"domain_scores_codex":[0.9993218,0.00001076507,0.0002141997,0.000144844,0.00007924023,0.0002291599],"domain_scores_gemma":[0.9995475,0.0001874895,0.00001804568,0.0001379618,0.00002654622,0.00008248905],"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.000360736,0.00001049498,0.0003963741,0.0002156373,0.00002544499,0.000006699748,0.0002274106,0.9519134,0.0004785114,0.0004476866,0.0433138,0.002603833],"study_design_scores_gemma":[0.00594397,0.0000443078,0.0001268675,0.00006612025,0.000005666876,3.17559e-7,0.00005909548,0.9719352,0.004202778,0.0009185535,0.01649927,0.0001978997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1315025,0.0006035359,0.7765893,0.007966311,0.001191266,0.04080012,0.00006247492,0.001047094,0.04023737],"genre_scores_gemma":[0.9639747,0.00004152953,0.02571091,0.001253689,0.001005655,0.007659424,0.00001842125,0.00008810803,0.0002475406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8324722,"threshold_uncertainty_score":0.4220365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0324985588004705,"score_gpt":0.2778328279976641,"score_spread":0.2453342691971936,"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."}}