{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NQZJEODG7AW7ATYFB5LOOMYWMS","short_pith_number":"pith:NQZJEODG","canonical_record":{"source":{"id":"1610.06934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T20:02:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a7ec4459cb8ca0b55887a029e2beb6b112972d846b60eb0fdc64562e9d887621","abstract_canon_sha256":"f88027e630d90d67e27fcc7a0d5249c3ebfc332bc0b2b4a632fca9450fe215ab"},"schema_version":"1.0"},"canonical_sha256":"6c32923866f82df04f050f56e7331664b19114568b527637deba3b2d7bcc6aa0","source":{"kind":"arxiv","id":"1610.06934","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06934","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06934v3","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06934","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"NQZJEODG7AW7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQZJEODG7AW7ATYF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQZJEODG","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NQZJEODG7AW7ATYFB5LOOMYWMS","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T20:02:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a7ec4459cb8ca0b55887a029e2beb6b112972d846b60eb0fdc64562e9d887621","abstract_canon_sha256":"f88027e630d90d67e27fcc7a0d5249c3ebfc332bc0b2b4a632fca9450fe215ab"},"schema_version":"1.0"},"canonical_sha256":"6c32923866f82df04f050f56e7331664b19114568b527637deba3b2d7bcc6aa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:13.778101Z","signature_b64":"M8ePPpwTtaeULfI3iyDjXyWpsiXOYZOi7HZJSHDwztkHXKdLdDlnwlTMFSFYZgRXRYuPKBs7GRCY4edfDV2fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c32923866f82df04f050f56e7331664b19114568b527637deba3b2d7bcc6aa0","last_reissued_at":"2026-05-18T00:31:13.777380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:13.777380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06934","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTX8C87CmjZMCpdr9AyFkqng/+WVz61yeVeXzyhTb2c+EzIZecYuE+S31n5Bwp33/GYClEBHo0A0b0orZYGuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:21:58.904869Z"},"content_sha256":"41a9acbcb43efd4eb06d3c630f875b1aef1cc23f5091f0c25468fae5cc747cb3","schema_version":"1.0","event_id":"sha256:41a9acbcb43efd4eb06d3c630f875b1aef1cc23f5091f0c25468fae5cc747cb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NQZJEODG7AW7ATYFB5LOOMYWMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The K Shortest Paths Problem with Application to Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"David Burstein, Leigh Metcalf","submitted_at":"2016-10-21T20:02:53Z","abstract_excerpt":"Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted real-world networks. First, we present an easy to implement $O(m\\log m+kL)$ solution for finding all (nonbacktracking) paths with bounded length $D$ between two arbitrary nodes on a positively weighted graph, where $L$ is an upperbound for the number of nodes in any of the $k$ outputted paths. Subsequently, we illustrate that for undirected Chung-Lu random graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06934","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhWwQQ2Mg1OU8HRmPH7rZahpkmVsATZKK9iK3roA1ivDkuGhF255P82vdOHKV4ZK4cEgyCJgqWTnJjXc40xzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:21:58.905297Z"},"content_sha256":"274b569ff4eff5032182602fed70d6078f61abd45f98612a26d343645182f878","schema_version":"1.0","event_id":"sha256:274b569ff4eff5032182602fed70d6078f61abd45f98612a26d343645182f878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQZJEODG7AW7ATYFB5LOOMYWMS/bundle.json","state_url":"https://pith.science/pith/NQZJEODG7AW7ATYFB5LOOMYWMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQZJEODG7AW7ATYFB5LOOMYWMS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T12:21:58Z","links":{"resolver":"https://pith.science/pith/NQZJEODG7AW7ATYFB5LOOMYWMS","bundle":"https://pith.science/pith/NQZJEODG7AW7ATYFB5LOOMYWMS/bundle.json","state":"https://pith.science/pith/NQZJEODG7AW7ATYFB5LOOMYWMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQZJEODG7AW7ATYFB5LOOMYWMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NQZJEODG7AW7ATYFB5LOOMYWMS","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":"f88027e630d90d67e27fcc7a0d5249c3ebfc332bc0b2b4a632fca9450fe215ab","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T20:02:53Z","title_canon_sha256":"a7ec4459cb8ca0b55887a029e2beb6b112972d846b60eb0fdc64562e9d887621"},"schema_version":"1.0","source":{"id":"1610.06934","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06934","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06934v3","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06934","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"NQZJEODG7AW7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQZJEODG7AW7ATYF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQZJEODG","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:274b569ff4eff5032182602fed70d6078f61abd45f98612a26d343645182f878","target":"graph","created_at":"2026-05-18T00:31:13Z","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":"Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted real-world networks. First, we present an easy to implement $O(m\\log m+kL)$ solution for finding all (nonbacktracking) paths with bounded length $D$ between two arbitrary nodes on a positively weighted graph, where $L$ is an upperbound for the number of nodes in any of the $k$ outputted paths. Subsequently, we illustrate that for undirected Chung-Lu random graphs","authors_text":"David Burstein, Leigh Metcalf","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T20:02:53Z","title":"The K Shortest Paths Problem with Application to Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06934","kind":"arxiv","version":3},"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:41a9acbcb43efd4eb06d3c630f875b1aef1cc23f5091f0c25468fae5cc747cb3","target":"record","created_at":"2026-05-18T00:31:13Z","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":"f88027e630d90d67e27fcc7a0d5249c3ebfc332bc0b2b4a632fca9450fe215ab","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T20:02:53Z","title_canon_sha256":"a7ec4459cb8ca0b55887a029e2beb6b112972d846b60eb0fdc64562e9d887621"},"schema_version":"1.0","source":{"id":"1610.06934","kind":"arxiv","version":3}},"canonical_sha256":"6c32923866f82df04f050f56e7331664b19114568b527637deba3b2d7bcc6aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c32923866f82df04f050f56e7331664b19114568b527637deba3b2d7bcc6aa0","first_computed_at":"2026-05-18T00:31:13.777380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:13.777380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M8ePPpwTtaeULfI3iyDjXyWpsiXOYZOi7HZJSHDwztkHXKdLdDlnwlTMFSFYZgRXRYuPKBs7GRCY4edfDV2fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:13.778101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06934","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41a9acbcb43efd4eb06d3c630f875b1aef1cc23f5091f0c25468fae5cc747cb3","sha256:274b569ff4eff5032182602fed70d6078f61abd45f98612a26d343645182f878"],"state_sha256":"bd4128a97be2a31f6361077e95329dd60c248e52ec8b5f2ef4ba29e7ebfe8a8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUxJ2ewMB2D5JZ6yZDc1Dvp6ai1I2EAPnDxhY21sPX85FQ7wlZki9NIkfNmm0gQYoGW5kueF64OMe2BLiuxeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:21:58.908255Z","bundle_sha256":"07230778676b686bb5bd6fb1c1d7aef3d6139690901bd734a3683c07baef7531"}}