{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RZZCDUOPQJRTB6KZ5HSROJJBV2","short_pith_number":"pith:RZZCDUOP","canonical_record":{"source":{"id":"1511.06441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-19T23:06:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ecae98d30868e9394f99f27c9a559bff975ec532eb5f825186ee33eee1044d23","abstract_canon_sha256":"01bb8e4426dc179e70c0032e87730697db66108121a80161d6d38333ed65b39c"},"schema_version":"1.0"},"canonical_sha256":"8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0","source":{"kind":"arxiv","id":"1511.06441","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06441","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06441v2","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06441","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"RZZCDUOPQJRT","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RZZCDUOPQJRTB6KZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RZZCDUOP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RZZCDUOPQJRTB6KZ5HSROJJBV2","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-19T23:06:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ecae98d30868e9394f99f27c9a559bff975ec532eb5f825186ee33eee1044d23","abstract_canon_sha256":"01bb8e4426dc179e70c0032e87730697db66108121a80161d6d38333ed65b39c"},"schema_version":"1.0"},"canonical_sha256":"8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:07.431559Z","signature_b64":"S6xa3wpLmN4PvMvJtF7hPuzix6wwsY0UaI5nfk3oAUeM/9COfOR5hHBFPHMkA0ELI01KnGII21/1x5aDDpIIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0","last_reissued_at":"2026-05-18T00:28:07.430807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:07.430807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06441","source_version":2,"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:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aZbXwje3r0hZZFpbe3sfRcc6m7modon1Tt60Sxw7ukj5zn3K7WHXio/lWuWen4kOoacMIohGBdvlil7QzWMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:27:20.219236Z"},"content_sha256":"9bd86169f4c3e54d1a40dedde2fdf17975a5c9b5492fab04159a84283612b80e","schema_version":"1.0","event_id":"sha256:9bd86169f4c3e54d1a40dedde2fdf17975a5c9b5492fab04159a84283612b80e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RZZCDUOPQJRTB6KZ5HSROJJBV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A parallel algorithm for the constrained shortest path problem on lattice graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Ivan Matic","submitted_at":"2015-11-19T23:06:12Z","abstract_excerpt":"The edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the processing elements are not analyzing the entire graph. Instead they are focusing on a subset of vertices called {\\em active vertices}. The set of active vertices at time $t$ is related to the boundary of the ball $B_t$ of radius $t$ in the first passage percolation metric. Although it is believed that the number of active vertices is an order of magnitude "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06441","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"},"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:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBQ01R6OL/hLB7IoSoq++wHsZtS6s9xuBn8ymXJqhKiTXlZyiSeufhqDQQRb66YIfnYUYVyBdW0Yy2Mas8lpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:27:20.219602Z"},"content_sha256":"aab96d5433a8d1f507f9a0961367665f5a6b83357391b691afb86201f92aee29","schema_version":"1.0","event_id":"sha256:aab96d5433a8d1f507f9a0961367665f5a6b83357391b691afb86201f92aee29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2/bundle.json","state_url":"https://pith.science/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2/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-06-02T08:27:20Z","links":{"resolver":"https://pith.science/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2","bundle":"https://pith.science/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2/bundle.json","state":"https://pith.science/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RZZCDUOPQJRTB6KZ5HSROJJBV2","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":"01bb8e4426dc179e70c0032e87730697db66108121a80161d6d38333ed65b39c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-19T23:06:12Z","title_canon_sha256":"ecae98d30868e9394f99f27c9a559bff975ec532eb5f825186ee33eee1044d23"},"schema_version":"1.0","source":{"id":"1511.06441","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06441","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06441v2","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06441","created_at":"2026-05-18T00:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"RZZCDUOPQJRT","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RZZCDUOPQJRTB6KZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RZZCDUOP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:aab96d5433a8d1f507f9a0961367665f5a6b83357391b691afb86201f92aee29","target":"graph","created_at":"2026-05-18T00:28:07Z","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 edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the processing elements are not analyzing the entire graph. Instead they are focusing on a subset of vertices called {\\em active vertices}. The set of active vertices at time $t$ is related to the boundary of the ball $B_t$ of radius $t$ in the first passage percolation metric. Although it is believed that the number of active vertices is an order of magnitude ","authors_text":"Ivan Matic","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-19T23:06:12Z","title":"A parallel algorithm for the constrained shortest path problem on lattice graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06441","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:9bd86169f4c3e54d1a40dedde2fdf17975a5c9b5492fab04159a84283612b80e","target":"record","created_at":"2026-05-18T00:28:07Z","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":"01bb8e4426dc179e70c0032e87730697db66108121a80161d6d38333ed65b39c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-19T23:06:12Z","title_canon_sha256":"ecae98d30868e9394f99f27c9a559bff975ec532eb5f825186ee33eee1044d23"},"schema_version":"1.0","source":{"id":"1511.06441","kind":"arxiv","version":2}},"canonical_sha256":"8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0","first_computed_at":"2026-05-18T00:28:07.430807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:07.430807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6xa3wpLmN4PvMvJtF7hPuzix6wwsY0UaI5nfk3oAUeM/9COfOR5hHBFPHMkA0ELI01KnGII21/1x5aDDpIIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:07.431559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06441","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd86169f4c3e54d1a40dedde2fdf17975a5c9b5492fab04159a84283612b80e","sha256:aab96d5433a8d1f507f9a0961367665f5a6b83357391b691afb86201f92aee29"],"state_sha256":"b9b8d741e27430ff8de99b748cf51a99ebd683445a8819ba10c7b85aeefb4abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VV3zj30yLxTDc6mmk4NvNN9F8Ce2TzmCRUmFTR4q0+SVWJHD7rydFDcbtepUHKEFax3sSRDBAqNVyUpI684PAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:27:20.221712Z","bundle_sha256":"0f255cfbc2e0118d46dac3407fcca37e17a93799b303df908965ba9bc94e18da"}}