{"id":"W2414522820","doi":"10.1007/s00453-016-0170-7","title":"Succinct Indices for Path Minimum, with Applications","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Ackermann function; Path (computing); Combinatorics; Mathematics; Range query (database); Constant (computer programming); Discrete mathematics; Tree traversal; Range (aeronautics); Tree (set theory); Data structure; Inverse; Sigma; Node (physics); Computer science; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0001643831,0.0001356019,0.0001256378,0.00009476365,0.0001420153,0.0001233849,0.00105766,0.00003300194,0.00001526594],"category_scores_gemma":[0.000008766026,0.00008050663,0.0000424371,0.0002822197,0.00005291312,0.0007133758,0.0002016955,0.00003396356,0.0001264308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002090284,"about_ca_system_score_gemma":0.00003612844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000671323,"about_ca_topic_score_gemma":0.000003711543,"domain_scores_codex":[0.9988847,0.00001024426,0.0001513494,0.0004539205,0.0001965071,0.0003032991],"domain_scores_gemma":[0.9989547,0.0001449114,0.00008918386,0.000660213,0.000065287,0.00008571386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006361851,0.00007209059,0.000165248,0.00001428433,0.00004307176,0.000004882523,0.0000450064,3.651606e-7,0.0001635298,0.1009747,0.006695565,0.8918149],"study_design_scores_gemma":[0.002696449,0.0005457137,0.001598531,0.00007379038,0.00005178876,0.00001848615,0.00004526269,0.01056544,0.003643534,0.02920267,0.9508018,0.0007564903],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00037179,0.00004106299,0.9949815,0.002309262,0.00009694388,0.0005471658,0.00005988079,0.0002055752,0.001386806],"genre_scores_gemma":[0.09586786,0.00004326983,0.8966267,0.0006869822,0.0005552543,0.001167511,0.00005466336,0.00003697026,0.004960806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9441063,"threshold_uncertainty_score":0.3282965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009513887450547032,"score_gpt":0.2270798350867203,"score_spread":0.2175659476361733,"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."}}