{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:L7XO57CWW5FWRCSLA5LMTQB5HP","short_pith_number":"pith:L7XO57CW","schema_version":"1.0","canonical_sha256":"5feeeefc56b74b688a4b0756c9c03d3bf6661014b79ddaf8be58e786866c9d4a","source":{"kind":"arxiv","id":"2211.07042","version":2},"attestation_state":"computed","paper":{"title":"A Local-to-Global Theorem for Congested Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Nicole Wein, Shyan Akmal","submitted_at":"2022-11-13T23:08:27Z","abstract_excerpt":"Amiri and Wargalla (2020) proved the following local-to-global theorem in directed acyclic graphs (DAGs): if $G$ is a weighted DAG such that for each subset $S$ of 3 nodes there is a shortest path containing every node in $S$, then there exists a pair $(s,t)$ of nodes such that there is a shortest $st$-path containing every node in $G$.\n  We extend this theorem to general graphs. For undirected graphs, we prove that the same theorem holds (up to a difference in the constant 3). For directed graphs, we provide a counterexample to the theorem (for any constant), and prove a roundtrip analogue of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2211.07042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-13T23:08:27Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"87ef76dc0aa68bb3edbc64f4ac958309b093cc2c34023709ef42f847006a09b4","abstract_canon_sha256":"7e0e769128219d3975c2d6345d34ac6059a39bd9d078e7bc6abb9b5dd5ac447a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:38.448875Z","signature_b64":"szIm8WMuZWXAkJaUiMiNxFQAOLXHapr2fSDsw83WGLURD9jHjoTRT7cYewPdYc7YmJh437PE4r1IG4Pk7wOZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5feeeefc56b74b688a4b0756c9c03d3bf6661014b79ddaf8be58e786866c9d4a","last_reissued_at":"2026-07-05T06:25:38.448460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:38.448460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Local-to-Global Theorem for Congested Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Nicole Wein, Shyan Akmal","submitted_at":"2022-11-13T23:08:27Z","abstract_excerpt":"Amiri and Wargalla (2020) proved the following local-to-global theorem in directed acyclic graphs (DAGs): if $G$ is a weighted DAG such that for each subset $S$ of 3 nodes there is a shortest path containing every node in $S$, then there exists a pair $(s,t)$ of nodes such that there is a shortest $st$-path containing every node in $G$.\n  We extend this theorem to general graphs. For undirected graphs, we prove that the same theorem holds (up to a difference in the constant 3). For directed graphs, we provide a counterexample to the theorem (for any constant), and prove a roundtrip analogue of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07042","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.07042/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.07042","created_at":"2026-07-05T06:25:38.448515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.07042v2","created_at":"2026-07-05T06:25:38.448515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07042","created_at":"2026-07-05T06:25:38.448515+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7XO57CWW5FW","created_at":"2026-07-05T06:25:38.448515+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7XO57CWW5FWRCSL","created_at":"2026-07-05T06:25:38.448515+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7XO57CW","created_at":"2026-07-05T06:25:38.448515+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25827","citing_title":"Paths and Intersections: Recognizing Outerplanar Metrics","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP","json":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP.json","graph_json":"https://pith.science/api/pith-number/L7XO57CWW5FWRCSLA5LMTQB5HP/graph.json","events_json":"https://pith.science/api/pith-number/L7XO57CWW5FWRCSLA5LMTQB5HP/events.json","paper":"https://pith.science/paper/L7XO57CW"},"agent_actions":{"view_html":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP","download_json":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP.json","view_paper":"https://pith.science/paper/L7XO57CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.07042&json=true","fetch_graph":"https://pith.science/api/pith-number/L7XO57CWW5FWRCSLA5LMTQB5HP/graph.json","fetch_events":"https://pith.science/api/pith-number/L7XO57CWW5FWRCSLA5LMTQB5HP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP/action/storage_attestation","attest_author":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP/action/author_attestation","sign_citation":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP/action/citation_signature","submit_replication":"https://pith.science/pith/L7XO57CWW5FWRCSLA5LMTQB5HP/action/replication_record"}},"created_at":"2026-07-05T06:25:38.448515+00:00","updated_at":"2026-07-05T06:25:38.448515+00:00"}