{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CT7G6YBNEU6J2XAK5LYI4GSJFD","short_pith_number":"pith:CT7G6YBN","canonical_record":{"source":{"id":"1408.4490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T21:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"ea7eeafaf82bbaf4dc83255b3e96371530eb333c06034c332a2e0cebfeea56c0","abstract_canon_sha256":"bab20ed3246c799ae60471185c64eb47d97da91e92d5e147d5d81abe2c36a4b4"},"schema_version":"1.0"},"canonical_sha256":"14fe6f602d253c9d5c0aeaf08e1a4928eddeff531efe172984b238f07c8f2c58","source":{"kind":"arxiv","id":"1408.4490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4490","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4490v2","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4490","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"CT7G6YBNEU6J","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CT7G6YBNEU6J2XAK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CT7G6YBN","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CT7G6YBNEU6J2XAK5LYI4GSJFD","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T21:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"ea7eeafaf82bbaf4dc83255b3e96371530eb333c06034c332a2e0cebfeea56c0","abstract_canon_sha256":"bab20ed3246c799ae60471185c64eb47d97da91e92d5e147d5d81abe2c36a4b4"},"schema_version":"1.0"},"canonical_sha256":"14fe6f602d253c9d5c0aeaf08e1a4928eddeff531efe172984b238f07c8f2c58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:06.690801Z","signature_b64":"ng1xuXU7UZhLi4i8HICxyASfpS5ifNZAZOQLF/CqD26SjwIj9kYUqvdcgsuB5SZeIYUJ9g6ys6MtGkQ+vO7fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14fe6f602d253c9d5c0aeaf08e1a4928eddeff531efe172984b238f07c8f2c58","last_reissued_at":"2026-05-18T01:03:06.690233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:06.690233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4490","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-18T01:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dw4VFcnBVfz1eMmuDEoXvbmcj8TwMfX0L3Wq3aRkuJCCrXu+pQhOeQnToEtYqW+M3Pi/02nuMP4ZJUQ1whxoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:56:35.404442Z"},"content_sha256":"b99bda179c969dcb7db232a4a0c706456525decc57f58f382c3af40d1268766e","schema_version":"1.0","event_id":"sha256:b99bda179c969dcb7db232a4a0c706456525decc57f58f382c3af40d1268766e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CT7G6YBNEU6J2XAK5LYI4GSJFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tractable Pathfinding for the Stochastic On-Time Arrival Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mehrdad Niknami, Samitha Samaranayake","submitted_at":"2014-08-19T21:57:57Z","abstract_excerpt":"We present a new and more efficient technique for computing the route that maximizes the probability of on-time arrival in stochastic networks, also known as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the policy-based SOTA problem---which is of pseudo-polynomial-time complexity in the time budget of the journey---as a search heuristic for the optimal path. In particular, we show that this heuristic can be exceptionally efficient in practice, effectively making it possible to solve the path-based SOTA p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4490","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-18T01:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLIyt1/juhVlH7U9vQAVAXMwuOZRooiD8ae+VyCMRRrCWHBbyyQcZPVeBGGoJgBDa7H1UtvsTjT51Ap4+yNPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:56:35.405562Z"},"content_sha256":"74ec34fb1bbd76c3e0f4fcd0dd51595d4b2ae0e90e64cb66d17a4ba4d748b26c","schema_version":"1.0","event_id":"sha256:74ec34fb1bbd76c3e0f4fcd0dd51595d4b2ae0e90e64cb66d17a4ba4d748b26c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/bundle.json","state_url":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/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-10T09:56:35Z","links":{"resolver":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD","bundle":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/bundle.json","state":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CT7G6YBNEU6J2XAK5LYI4GSJFD","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":"bab20ed3246c799ae60471185c64eb47d97da91e92d5e147d5d81abe2c36a4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T21:57:57Z","title_canon_sha256":"ea7eeafaf82bbaf4dc83255b3e96371530eb333c06034c332a2e0cebfeea56c0"},"schema_version":"1.0","source":{"id":"1408.4490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4490","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4490v2","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4490","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"CT7G6YBNEU6J","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CT7G6YBNEU6J2XAK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CT7G6YBN","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:74ec34fb1bbd76c3e0f4fcd0dd51595d4b2ae0e90e64cb66d17a4ba4d748b26c","target":"graph","created_at":"2026-05-18T01:03:06Z","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":"We present a new and more efficient technique for computing the route that maximizes the probability of on-time arrival in stochastic networks, also known as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the policy-based SOTA problem---which is of pseudo-polynomial-time complexity in the time budget of the journey---as a search heuristic for the optimal path. In particular, we show that this heuristic can be exceptionally efficient in practice, effectively making it possible to solve the path-based SOTA p","authors_text":"Mehrdad Niknami, Samitha Samaranayake","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T21:57:57Z","title":"Tractable Pathfinding for the Stochastic On-Time Arrival Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4490","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:b99bda179c969dcb7db232a4a0c706456525decc57f58f382c3af40d1268766e","target":"record","created_at":"2026-05-18T01:03:06Z","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":"bab20ed3246c799ae60471185c64eb47d97da91e92d5e147d5d81abe2c36a4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-19T21:57:57Z","title_canon_sha256":"ea7eeafaf82bbaf4dc83255b3e96371530eb333c06034c332a2e0cebfeea56c0"},"schema_version":"1.0","source":{"id":"1408.4490","kind":"arxiv","version":2}},"canonical_sha256":"14fe6f602d253c9d5c0aeaf08e1a4928eddeff531efe172984b238f07c8f2c58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14fe6f602d253c9d5c0aeaf08e1a4928eddeff531efe172984b238f07c8f2c58","first_computed_at":"2026-05-18T01:03:06.690233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:06.690233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ng1xuXU7UZhLi4i8HICxyASfpS5ifNZAZOQLF/CqD26SjwIj9kYUqvdcgsuB5SZeIYUJ9g6ys6MtGkQ+vO7fBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:06.690801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b99bda179c969dcb7db232a4a0c706456525decc57f58f382c3af40d1268766e","sha256:74ec34fb1bbd76c3e0f4fcd0dd51595d4b2ae0e90e64cb66d17a4ba4d748b26c"],"state_sha256":"79f916c85040eb3c98a11208a05d44b21483d8758832004e7e75907fec66fef5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLezFpU3OaI2IcqBqKIN5hUJP3TECxcRVO0aO16AmSGXFYoVm+vBjdkS0YlhtxtGm7OK4IyplUS8ITCzkvWxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:56:35.409999Z","bundle_sha256":"75382323f806ce7f1924aa84a1f0d6660ae5c31a25f4eea0891fd7a9450a9374"}}