{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920944,0.002077501,0.003130306,0.00111523,0.00189046,0.004563559,0.006548491,0.00350934,0.01498035],"category_scores_gemma":[0.03054188,0.001164356,0.001689499,0.003130553,0.002525626,0.01272264,0.005503057,0.004454696,0.00201221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005254922,"about_ca_system_score_gemma":0.003983242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004264499,"about_ca_topic_score_gemma":0.003237491,"domain_scores_codex":[0.99322,0.001671657,0.0003632584,0.001712464,0.001338948,0.001693625],"domain_scores_gemma":[0.9618992,0.02865791,0.001979341,0.004264265,0.00147026,0.001728994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003668208,0.0008936514,0.003625981,0.001400485,0.0002257975,0.0006301598,0.001075221,0.6542608,0.006757402,0.1961238,0.03434544,0.0969931],"study_design_scores_gemma":[0.0002162564,0.0001494241,0.0002444814,0.00004631216,0.00003983682,0.000132217,0.0001020142,0.8124862,0.001837736,0.1826536,0.002062576,0.00002932236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4237282,0.00334622,0.5137674,0.009028798,0.000500482,0.0006805749,0.005379113,0.003315009,0.04025427],"genre_scores_gemma":[0.8478982,0.001021126,0.1308711,0.001042099,0.0004180721,0.0005915036,0.004158631,0.001029074,0.01297014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01498035,"threshold_uncertainty_score":0.05011427,"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."}}