{"id":"W4394737032","doi":"10.4230/lipics.itcs.2025.89","title":"Optimal Communication Complexity of Chained Index","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Index (typography); Communication complexity; Computer science; Mathematics; Algorithm; World Wide Web","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.0003689981,0.0002189726,0.0003102605,0.0003329116,0.000103886,0.00007543747,0.001929013,0.0002232632,0.00001541784],"category_scores_gemma":[0.00001787061,0.0002434697,0.0001972462,0.0006796982,0.0003478141,0.000114789,0.004830409,0.0006479673,0.0000514306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000652108,"about_ca_system_score_gemma":0.0001598159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003893918,"about_ca_topic_score_gemma":0.0000283934,"domain_scores_codex":[0.9985885,0.0001493777,0.0002507838,0.0006969318,0.0001031984,0.0002112115],"domain_scores_gemma":[0.9975676,0.00006684333,0.0002458302,0.001792273,0.0002236726,0.0001037624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001128659,0.00006921228,0.0002906601,0.0001144696,0.00006577335,0.00002469993,0.0002581447,0.1587276,0.00005998307,0.8399413,0.000301625,0.0001352597],"study_design_scores_gemma":[0.0001674984,0.00002190973,0.000227693,0.0001347684,0.00002687286,0.000001621855,0.00002453209,0.546803,0.0001465623,0.4522364,0.00004815074,0.0001609713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7266452,0.0005644683,0.2666174,0.0006343626,0.0005887465,0.0003076888,0.00002589978,0.0005383328,0.004077895],"genre_scores_gemma":[0.9911862,0.0001085929,0.008072744,0.00004665488,0.000005091242,6.277221e-7,0.00001913968,0.00001217422,0.0005487483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3880754,"threshold_uncertainty_score":0.9928406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1020460140569285,"score_gpt":0.202594234708476,"score_spread":0.1005482206515474,"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."}}