{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002434448,0.001432466,0.001564568,0.003379473,0.001421329,0.003541178,0.002793526,0.00162142,0.01551811],"category_scores_gemma":[0.02191277,0.0008359194,0.001155445,0.006355519,0.001896697,0.008948148,0.004381355,0.005354408,0.004642783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001771376,"about_ca_system_score_gemma":0.002274591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014594,"about_ca_topic_score_gemma":0.002917611,"domain_scores_codex":[0.9977928,0.0005466032,0.0001897521,0.000427547,0.0009013218,0.0001419136],"domain_scores_gemma":[0.9926482,0.003494238,0.0004809652,0.002391014,0.0007453535,0.0002401312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005043001,0.0002878429,0.0009655351,0.0005771841,0.00005734387,0.0001610646,0.0003428896,0.0370397,0.003287042,0.5527117,0.05417633,0.3498889],"study_design_scores_gemma":[0.00006829778,0.00009398731,0.0002013413,0.000123161,0.00003123216,0.000214848,0.0000656104,0.09429734,0.002201334,0.8798495,0.02281783,0.00003567778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01157825,0.0023763,0.9607171,0.001620342,0.0007320123,0.0001884884,0.002330551,0.002681969,0.01777505],"genre_scores_gemma":[0.135329,0.002423925,0.8368814,0.0008896269,0.0009236935,0.0006851779,0.005200183,0.001581144,0.01608578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01551811,"threshold_uncertainty_score":0.0519132,"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."}}