{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CT7G6YBNEU6J2XAK5LYI4GSJFD","short_pith_number":"pith:CT7G6YBN","schema_version":"1.0","canonical_sha256":"14fe6f602d253c9d5c0aeaf08e1a4928eddeff531efe172984b238f07c8f2c58","source":{"kind":"arxiv","id":"1408.4490","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.4490","created_at":"2026-05-18T01:03:06.690313+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4490v2","created_at":"2026-05-18T01:03:06.690313+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4490","created_at":"2026-05-18T01:03:06.690313+00:00"},{"alias_kind":"pith_short_12","alias_value":"CT7G6YBNEU6J","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CT7G6YBNEU6J2XAK","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CT7G6YBN","created_at":"2026-05-18T12:28:22.404517+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/CT7G6YBNEU6J2XAK5LYI4GSJFD","json":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD.json","graph_json":"https://pith.science/api/pith-number/CT7G6YBNEU6J2XAK5LYI4GSJFD/graph.json","events_json":"https://pith.science/api/pith-number/CT7G6YBNEU6J2XAK5LYI4GSJFD/events.json","paper":"https://pith.science/paper/CT7G6YBN"},"agent_actions":{"view_html":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD","download_json":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD.json","view_paper":"https://pith.science/paper/CT7G6YBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4490&json=true","fetch_graph":"https://pith.science/api/pith-number/CT7G6YBNEU6J2XAK5LYI4GSJFD/graph.json","fetch_events":"https://pith.science/api/pith-number/CT7G6YBNEU6J2XAK5LYI4GSJFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/action/storage_attestation","attest_author":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/action/author_attestation","sign_citation":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/action/citation_signature","submit_replication":"https://pith.science/pith/CT7G6YBNEU6J2XAK5LYI4GSJFD/action/replication_record"}},"created_at":"2026-05-18T01:03:06.690313+00:00","updated_at":"2026-05-18T01:03:06.690313+00:00"}