{"id":"W4416052615","doi":"10.48550/arxiv.2504.11256","title":"Covering Approximate Shortest Paths with DAGs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Directed acyclic graph; Upper and lower bounds; Directed graph; Probabilistic logic; Embedding; Tree (set theory); Cover (algebra); Simple (philosophy); K-ary tree","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061337,0.001226946,0.00133097,0.001614359,0.0006733487,0.001557254,0.001906184,0.001172272,0.004626362],"category_scores_gemma":[0.01128627,0.0007313658,0.001036657,0.00384742,0.0009662966,0.006619142,0.002539068,0.001594344,0.001051389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00221977,"about_ca_system_score_gemma":0.001128892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00326674,"about_ca_topic_score_gemma":0.003880075,"domain_scores_codex":[0.9980322,0.0004075449,0.0001070377,0.0004734466,0.0006939631,0.0002857865],"domain_scores_gemma":[0.9955824,0.002288534,0.0005073628,0.001179841,0.0002539274,0.0001878905],"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.0005408053,0.0001945214,0.002609383,0.0005150102,0.0001273963,0.0003299416,0.0003321243,0.6514322,0.008359776,0.1482135,0.008610934,0.1787343],"study_design_scores_gemma":[0.00004376765,0.000126826,0.0003873957,0.00002831917,0.00003358049,0.0003323724,0.00006748048,0.797347,0.002909397,0.1892599,0.009441271,0.00002269939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164382,0.001824262,0.8676887,0.0008254876,0.0001297348,0.0001724114,0.001348857,0.002052188,0.009520129],"genre_scores_gemma":[0.6243863,0.001587923,0.3629528,0.0004684522,0.0001898219,0.0003108971,0.003127338,0.0005196779,0.006456837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004626362,"threshold_uncertainty_score":0.01610559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04341478645897524,"score_gpt":0.262463454533178,"score_spread":0.2190486680742028,"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."}}