{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2S6INTJW5TMMWGBTPZXFN4I3QC","short_pith_number":"pith:2S6INTJW","schema_version":"1.0","canonical_sha256":"d4bc86cd36ecd8cb18337e6e56f11b80b21807da0636ee460b25b89bc36272fe","source":{"kind":"arxiv","id":"1105.0608","version":1},"attestation_state":"computed","paper":{"title":"A simpler and more efficient algorithm for the next-to-shortest path problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2011-05-03T15:27:00Z","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"},"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":"1105.0608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T15:27:00Z","cross_cats_sorted":[],"title_canon_sha256":"c921ecc222383d3730cdfe6f204ccf2de2886573b8975a088ddc17da1195fc72","abstract_canon_sha256":"741e551f2351c8d8ca92454e75229cb40b4430b4869522744c431715f178e400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:38.265248Z","signature_b64":"hcujWV/an3BVQ0OxizI4794qVqLPddPaftbsAuTGPFup6v1gedzuQxa5FmJKKnmzGJkPAPEbXG6hZZlQ1iW7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4bc86cd36ecd8cb18337e6e56f11b80b21807da0636ee460b25b89bc36272fe","last_reissued_at":"2026-05-18T03:59:38.264530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:38.264530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simpler and more efficient algorithm for the next-to-shortest path problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2011-05-03T15:27:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0608","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1105.0608","created_at":"2026-05-18T03:59:38.264660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0608v1","created_at":"2026-05-18T03:59:38.264660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0608","created_at":"2026-05-18T03:59:38.264660+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S6INTJW5TMM","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S6INTJW5TMMWGBT","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S6INTJW","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC","json":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC.json","graph_json":"https://pith.science/api/pith-number/2S6INTJW5TMMWGBTPZXFN4I3QC/graph.json","events_json":"https://pith.science/api/pith-number/2S6INTJW5TMMWGBTPZXFN4I3QC/events.json","paper":"https://pith.science/paper/2S6INTJW"},"agent_actions":{"view_html":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC","download_json":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC.json","view_paper":"https://pith.science/paper/2S6INTJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0608&json=true","fetch_graph":"https://pith.science/api/pith-number/2S6INTJW5TMMWGBTPZXFN4I3QC/graph.json","fetch_events":"https://pith.science/api/pith-number/2S6INTJW5TMMWGBTPZXFN4I3QC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC/action/storage_attestation","attest_author":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC/action/author_attestation","sign_citation":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC/action/citation_signature","submit_replication":"https://pith.science/pith/2S6INTJW5TMMWGBTPZXFN4I3QC/action/replication_record"}},"created_at":"2026-05-18T03:59:38.264660+00:00","updated_at":"2026-05-18T03:59:38.264660+00:00"}