{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EBJGJ2ZS74I7MVCJO4QA6YXRKU","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":"02a5b1125b84f2083dfcdcfac7386aa722ebfb65f2a3ca291d0cf70b4e548486","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-23T13:33:47Z","title_canon_sha256":"2eea63b3e4ba696698ed68cb565368a1d217d967aa769b6bfec52d11c55de5d9"},"schema_version":"1.0","source":{"id":"1203.5235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5235","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5235v1","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5235","created_at":"2026-05-18T03:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"EBJGJ2ZS74I7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EBJGJ2ZS74I7MVCJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EBJGJ2ZS","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:fa029eb2dd19e9911442749beafdb60d9fe3c2f291f7c75c18b47cab076e859c","target":"graph","created_at":"2026-05-18T03:59:26Z","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"},"paper":{"abstract_excerpt":"For two vertices $s$ and $t$ in a graph $G=(V,E)$, the next-to-shortest path is an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path length. In this paper we show that, when the graph is undirected and all edge lengths are nonnegative, the problem can be solved in linear time if the distances from $s$ and $t$ to all other vertices are given. This result generalizes the previous work (DOI 10.1007/s00453-011-9601-7) to allowing zero-length edges.","authors_text":"Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-23T13:33:47Z","title":"A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5235","kind":"arxiv","version":1},"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:95aaf69ad13a95b2f1e18a09732291b51c2b00378cd8357af04a5426b0481c7a","target":"record","created_at":"2026-05-18T03:59:26Z","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":"02a5b1125b84f2083dfcdcfac7386aa722ebfb65f2a3ca291d0cf70b4e548486","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-23T13:33:47Z","title_canon_sha256":"2eea63b3e4ba696698ed68cb565368a1d217d967aa769b6bfec52d11c55de5d9"},"schema_version":"1.0","source":{"id":"1203.5235","kind":"arxiv","version":1}},"canonical_sha256":"205264eb32ff11f6544977200f62f15507facf3153b29256e16f606b17bdf8a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205264eb32ff11f6544977200f62f15507facf3153b29256e16f606b17bdf8a8","first_computed_at":"2026-05-18T03:59:26.536741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:26.536741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2yHztpE5Zj9S6MCjJKgoS4fyqeTesSZ0PE9qC9hfuUsUDnZDKNs6rrTo8cgEsKQ8HjVp2cjHQ7LWKcDqFIufCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:26.537605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95aaf69ad13a95b2f1e18a09732291b51c2b00378cd8357af04a5426b0481c7a","sha256:fa029eb2dd19e9911442749beafdb60d9fe3c2f291f7c75c18b47cab076e859c"],"state_sha256":"660f17d4e1005f9f530a507d28040e39e6a21651c79dc12102b2dd9a06287f87"}