{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002260935,0.000649757,0.001040459,0.0005768057,0.0008529542,0.0009059704,0.001201471,0.0007120381,0.001321509],"category_scores_gemma":[0.01400006,0.0005952788,0.0004188716,0.000791078,0.001585339,0.002277632,0.001852347,0.001024169,0.0003095463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086881,"about_ca_system_score_gemma":0.001284793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007612235,"about_ca_topic_score_gemma":0.0008912542,"domain_scores_codex":[0.9980682,0.0007261552,0.00007554735,0.0002873708,0.0005550587,0.0002878055],"domain_scores_gemma":[0.9905891,0.007049763,0.0007653937,0.0008821869,0.0003864189,0.0003270307],"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.0008223295,0.0001174187,0.0009711298,0.0003192709,0.00005074976,0.0003773155,0.0005513567,0.6813248,0.02201196,0.2527569,0.002086763,0.03860995],"study_design_scores_gemma":[0.0000642762,0.0001796813,0.0002501457,0.00002439449,0.00001419997,0.0001541972,0.00005642147,0.8714612,0.0047741,0.1219675,0.001031023,0.00002287762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07315028,0.0002806256,0.9230738,0.0003946815,0.0000338848,0.00008542607,0.0001435571,0.0004249286,0.002412697],"genre_scores_gemma":[0.8996313,0.0002110055,0.09815822,0.0001661652,0.00005728938,0.0002178157,0.0001694892,0.00006160795,0.001327271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002260935,"threshold_uncertainty_score":0.01195711,"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."}}