{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2S6INTJW5TMMWGBTPZXFN4I3QC","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":"741e551f2351c8d8ca92454e75229cb40b4430b4869522744c431715f178e400","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T15:27:00Z","title_canon_sha256":"c921ecc222383d3730cdfe6f204ccf2de2886573b8975a088ddc17da1195fc72"},"schema_version":"1.0","source":{"id":"1105.0608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0608","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0608v1","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0608","created_at":"2026-05-18T03:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"2S6INTJW5TMM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2S6INTJW5TMMWGBT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2S6INTJW","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:18bf8f029f8c4b1a4014bfc4a272dd3928cc1efbee08a9d0701f0462208de282","target":"graph","created_at":"2026-05-18T03:59: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"},"paper":{"abstract_excerpt":"Given an undirected graph $G=(V,E)$ with positive edge lengths and two vertices $s$ and $t$, the next-to-shortest path problem is to find an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path length. In this paper we show that the problem can be solved in linear time if the distances from $s$ and $t$ to all other vertices are given. Particularly our new algorithm runs in $O(|V|\\log |V|+|E|)$ time for general graphs, which improves the previous result of $O(|V|^2)$ time for sparse graphs, and takes only linear time for unweighted graphs, planar graph","authors_text":"Bang Ye Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T15:27:00Z","title":"A simpler and more efficient algorithm for the next-to-shortest path problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0608","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:65244e3f18ff4bcb01cd742829a0eaffae08ea091da0fc4530cf713bb12c06c5","target":"record","created_at":"2026-05-18T03:59: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":"741e551f2351c8d8ca92454e75229cb40b4430b4869522744c431715f178e400","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T15:27:00Z","title_canon_sha256":"c921ecc222383d3730cdfe6f204ccf2de2886573b8975a088ddc17da1195fc72"},"schema_version":"1.0","source":{"id":"1105.0608","kind":"arxiv","version":1}},"canonical_sha256":"d4bc86cd36ecd8cb18337e6e56f11b80b21807da0636ee460b25b89bc36272fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4bc86cd36ecd8cb18337e6e56f11b80b21807da0636ee460b25b89bc36272fe","first_computed_at":"2026-05-18T03:59:38.264530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:38.264530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hcujWV/an3BVQ0OxizI4794qVqLPddPaftbsAuTGPFup6v1gedzuQxa5FmJKKnmzGJkPAPEbXG6hZZlQ1iW7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:38.265248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65244e3f18ff4bcb01cd742829a0eaffae08ea091da0fc4530cf713bb12c06c5","sha256:18bf8f029f8c4b1a4014bfc4a272dd3928cc1efbee08a9d0701f0462208de282"],"state_sha256":"731f63885167546b09500a0b2e28e21f6cfa5240ed8c5dc21fb1c38389eda1b5"}