{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7M7ZZJM6YGW2CVQJ4OM6UEZJKI","short_pith_number":"pith:7M7ZZJM6","schema_version":"1.0","canonical_sha256":"fb3f9ca59ec1ada15609e399ea132952061991050993497f57ad28511eed338c","source":{"kind":"arxiv","id":"1512.02157","version":2},"attestation_state":"computed","paper":{"title":"Finding $k$ Simple Shortest Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Udit Agarwal, Vijaya Ramachandran","submitted_at":"2015-12-07T18:33:17Z","abstract_excerpt":"The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair, it is known that two simple shortest paths cannot be found in time polynomially smaller than $n^3$ (where $n=|V|$) unless the All-Pairs Shortest Paths problem can be solved in a similar time bound. The latter is a well-known open problem in algorithm design. We consider the all-pairs version of the problem, and we give a new algorithm to find"},"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":"1512.02157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T18:33:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"af45af737fb7930c8dedd632af68d5e8f056dce3f334a614dd0cbd3a0af37875","abstract_canon_sha256":"9f9c60488298c88b250c977db76b7140408075830df201a7da9465dfb8881b63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:08.705016Z","signature_b64":"wQbfU2+1PsOi/2KaG9XQEWilPelgQhkMoXEfPFd0dK0iKBtwQ3I0JhDqmpeTHAF2JIYDrM7I7svZ1jYQ0XTsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb3f9ca59ec1ada15609e399ea132952061991050993497f57ad28511eed338c","last_reissued_at":"2026-05-18T01:20:08.704524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:08.704524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding $k$ Simple Shortest Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Udit Agarwal, Vijaya Ramachandran","submitted_at":"2015-12-07T18:33:17Z","abstract_excerpt":"The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair, it is known that two simple shortest paths cannot be found in time polynomially smaller than $n^3$ (where $n=|V|$) unless the All-Pairs Shortest Paths problem can be solved in a similar time bound. The latter is a well-known open problem in algorithm design. We consider the all-pairs version of the problem, and we give a new algorithm to find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02157","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":""},"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":"1512.02157","created_at":"2026-05-18T01:20:08.704594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02157v2","created_at":"2026-05-18T01:20:08.704594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02157","created_at":"2026-05-18T01:20:08.704594+00:00"},{"alias_kind":"pith_short_12","alias_value":"7M7ZZJM6YGW2","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7M7ZZJM6YGW2CVQJ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7M7ZZJM6","created_at":"2026-05-18T12:29:10.953037+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/7M7ZZJM6YGW2CVQJ4OM6UEZJKI","json":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI.json","graph_json":"https://pith.science/api/pith-number/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/graph.json","events_json":"https://pith.science/api/pith-number/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/events.json","paper":"https://pith.science/paper/7M7ZZJM6"},"agent_actions":{"view_html":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI","download_json":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI.json","view_paper":"https://pith.science/paper/7M7ZZJM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02157&json=true","fetch_graph":"https://pith.science/api/pith-number/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/graph.json","fetch_events":"https://pith.science/api/pith-number/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/action/storage_attestation","attest_author":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/action/author_attestation","sign_citation":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/action/citation_signature","submit_replication":"https://pith.science/pith/7M7ZZJM6YGW2CVQJ4OM6UEZJKI/action/replication_record"}},"created_at":"2026-05-18T01:20:08.704594+00:00","updated_at":"2026-05-18T01:20:08.704594+00:00"}