{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002807525,0.0004368447,0.0004711746,0.0002071087,0.0002324392,0.000312028,0.002423179,0.0002047675,0.00002156351],"category_scores_gemma":[0.00003303824,0.0003987742,0.0001702751,0.0005051317,0.0001320574,0.0002716126,0.003943804,0.0009119129,0.00003934231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007428943,"about_ca_system_score_gemma":0.000285579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001310776,"about_ca_topic_score_gemma":0.00004180281,"domain_scores_codex":[0.9975482,0.00006372608,0.000360688,0.001139146,0.0003903057,0.000497931],"domain_scores_gemma":[0.9975309,0.0001203266,0.0001875954,0.001903678,0.0001289697,0.0001285163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007447111,0.001012302,0.7400678,0.001829078,0.0009706353,0.0009354976,0.004603737,0.01214305,0.0003598546,0.1336271,0.002870448,0.101506],"study_design_scores_gemma":[0.002477381,0.0006365217,0.3633526,0.005305855,0.00030898,0.0001884061,0.000251493,0.4893321,0.00702724,0.07860538,0.04651471,0.005999309],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2446003,0.0004550797,0.737774,0.0007737931,0.00206431,0.0005936379,0.00006111905,0.0009115406,0.01276626],"genre_scores_gemma":[0.9087263,0.0001675173,0.08813631,0.0007579654,0.0003028668,0.0001562215,0.00005103898,0.00003442389,0.001667322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.664126,"threshold_uncertainty_score":0.9998464,"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."}}