{"id":"W7110198478","doi":"10.4230/lipics.itcs.2025.89","title":"Optimal Communication Complexity of Chained Index","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"String (physics); Generalization; Upper and lower bounds; Index (typography); Position (finance); Value (mathematics)","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006982451,0.0002915747,0.0004811583,0.0004378414,0.0004265205,0.0002407113,0.002576611,0.0001691513,0.00001920922],"category_scores_gemma":[0.00008883746,0.0002870782,0.0002700678,0.000803442,0.0004826429,0.001147113,0.001248351,0.000391985,0.00001618148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008260509,"about_ca_system_score_gemma":0.0001176391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005016858,"about_ca_topic_score_gemma":0.00002812322,"domain_scores_codex":[0.9976865,0.00006584574,0.001125313,0.0002341556,0.0003939506,0.0004942429],"domain_scores_gemma":[0.9972456,0.0002193262,0.0004609484,0.001552204,0.0004165454,0.0001053652],"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.0001112835,0.0006255417,0.004245268,0.0007158106,0.0002558809,0.000001135545,0.006636017,0.0007674079,0.00004615298,0.9554352,0.004214096,0.02694627],"study_design_scores_gemma":[0.003736562,0.0002248279,0.00705141,0.0003691817,0.00003364793,0.00001752421,0.0009278111,0.8986163,0.00188209,0.04899419,0.03758081,0.0005656488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04679941,0.00009544664,0.9403441,0.001240308,0.0006162857,0.0008589573,0.0002063174,0.0002419659,0.009597213],"genre_scores_gemma":[0.8009088,0.00003565839,0.1977684,0.0007575288,0.00002871601,0.00006953644,0.0001889585,0.00001284303,0.0002295531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.906441,"threshold_uncertainty_score":0.9999582,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02479467919637605,"score_gpt":0.2786343058150276,"score_spread":0.2538396266186515,"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."}}