{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:L7XO57CWW5FWRCSLA5LMTQB5HP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7e0e769128219d3975c2d6345d34ac6059a39bd9d078e7bc6abb9b5dd5ac447a","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-13T23:08:27Z","title_canon_sha256":"87ef76dc0aa68bb3edbc64f4ac958309b093cc2c34023709ef42f847006a09b4"},"schema_version":"1.0","source":{"id":"2211.07042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07042","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07042v2","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07042","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"L7XO57CWW5FW","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_16","alias_value":"L7XO57CWW5FWRCSL","created_at":"2026-07-05T06:25:38Z"},{"alias_kind":"pith_short_8","alias_value":"L7XO57CW","created_at":"2026-07-05T06:25:38Z"}],"graph_snapshots":[{"event_id":"sha256:bf5f8b87acbd2a862e7ebff9e07df596c74f418184cdc3946b4c784de1050fe9","target":"graph","created_at":"2026-07-05T06:25:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.07042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Nicole Wein, Shyan Akmal","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-13T23:08:27Z","title":"A Local-to-Global Theorem for Congested Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07042","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35f4b995e320491f5bc53f9420bce0675970d3977022028ecc70c6930f496d54","target":"record","created_at":"2026-07-05T06:25:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7e0e769128219d3975c2d6345d34ac6059a39bd9d078e7bc6abb9b5dd5ac447a","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-13T23:08:27Z","title_canon_sha256":"87ef76dc0aa68bb3edbc64f4ac958309b093cc2c34023709ef42f847006a09b4"},"schema_version":"1.0","source":{"id":"2211.07042","kind":"arxiv","version":2}},"canonical_sha256":"5feeeefc56b74b688a4b0756c9c03d3bf6661014b79ddaf8be58e786866c9d4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5feeeefc56b74b688a4b0756c9c03d3bf6661014b79ddaf8be58e786866c9d4a","first_computed_at":"2026-07-05T06:25:38.448460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:25:38.448460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"szIm8WMuZWXAkJaUiMiNxFQAOLXHapr2fSDsw83WGLURD9jHjoTRT7cYewPdYc7YmJh437PE4r1IG4Pk7wOZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:25:38.448875Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.07042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35f4b995e320491f5bc53f9420bce0675970d3977022028ecc70c6930f496d54","sha256:bf5f8b87acbd2a862e7ebff9e07df596c74f418184cdc3946b4c784de1050fe9"],"state_sha256":"cf20552c0997a098215ff4f53052c055b9a4c6638f0e272d827fcc9f182c09e3"}