{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7M7ZZJM6YGW2CVQJ4OM6UEZJKI","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":"9f9c60488298c88b250c977db76b7140408075830df201a7da9465dfb8881b63","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T18:33:17Z","title_canon_sha256":"af45af737fb7930c8dedd632af68d5e8f056dce3f334a614dd0cbd3a0af37875"},"schema_version":"1.0","source":{"id":"1512.02157","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02157","created_at":"2026-05-18T01:20:08Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02157v2","created_at":"2026-05-18T01:20:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02157","created_at":"2026-05-18T01:20:08Z"},{"alias_kind":"pith_short_12","alias_value":"7M7ZZJM6YGW2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7M7ZZJM6YGW2CVQJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7M7ZZJM6","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b9adbbb05063d4b43709283687fedf5140bffeeacab96e3f7e86eade046414d4","target":"graph","created_at":"2026-05-18T01:20:08Z","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":"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","authors_text":"Udit Agarwal, Vijaya Ramachandran","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T18:33:17Z","title":"Finding $k$ Simple Shortest Paths and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02157","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:e15179c054f712516df9b3ad572213645833d854802fda86d86dc6f905aeb171","target":"record","created_at":"2026-05-18T01:20:08Z","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":"9f9c60488298c88b250c977db76b7140408075830df201a7da9465dfb8881b63","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T18:33:17Z","title_canon_sha256":"af45af737fb7930c8dedd632af68d5e8f056dce3f334a614dd0cbd3a0af37875"},"schema_version":"1.0","source":{"id":"1512.02157","kind":"arxiv","version":2}},"canonical_sha256":"fb3f9ca59ec1ada15609e399ea132952061991050993497f57ad28511eed338c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb3f9ca59ec1ada15609e399ea132952061991050993497f57ad28511eed338c","first_computed_at":"2026-05-18T01:20:08.704524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:08.704524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wQbfU2+1PsOi/2KaG9XQEWilPelgQhkMoXEfPFd0dK0iKBtwQ3I0JhDqmpeTHAF2JIYDrM7I7svZ1jYQ0XTsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:08.705016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02157","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e15179c054f712516df9b3ad572213645833d854802fda86d86dc6f905aeb171","sha256:b9adbbb05063d4b43709283687fedf5140bffeeacab96e3f7e86eade046414d4"],"state_sha256":"d77838ebbe04244debc384a05dfdf100830d7b90433e0d0f4a00a6567484ca0b"}