{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NKS3K2FHXNUGMKUK3J3XX4N5SA","short_pith_number":"pith:NKS3K2FH","schema_version":"1.0","canonical_sha256":"6aa5b568a7bb68662a8ada777bf1bd901cd7eb162a7febe8e9f8e7564b1a42cf","source":{"kind":"arxiv","id":"1808.04360","version":2},"attestation_state":"computed","paper":{"title":"Stochastic on-time arrival problem in transit networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.AP"],"primary_cat":"cs.DS","authors_text":"Samitha Samaranayake, Sebastien Blandin, Yang Liu","submitted_at":"2018-08-11T02:45:21Z","abstract_excerpt":"This article considers the stochastic on-time arrival problem in transit networks where both the travel time and the waiting time for transit services are stochastic. A specific challenge of this problem is the combinatorial solution space due to the unknown ordering of transit line arrivals. We propose a network structure appropriate to the online decision-making of a passenger, including boarding, waiting and transferring. In this framework, we design a dynamic programming algorithm that is pseudo-polynomial in the number of transit stations and travel time budget, and exponential in the num"},"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":"1808.04360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-11T02:45:21Z","cross_cats_sorted":["cs.SY","math.OC","stat.AP"],"title_canon_sha256":"51d8e02194d6323b91218a5f2514dd5c99064beeb1f0950bc31cd233545a787f","abstract_canon_sha256":"bc58544adae41565cde6a7ad6552e78d74174ea80ed108fc7f45a01b66798370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.780494Z","signature_b64":"mvHhO61+N8outk9NpOYkUeRT7T/xviEENO/ymsWN9LzG/yb2scirUinzeBDL++zBF+ST2fTjZiUReEUmDPyRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aa5b568a7bb68662a8ada777bf1bd901cd7eb162a7febe8e9f8e7564b1a42cf","last_reissued_at":"2026-05-17T23:59:27.779937Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.779937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic on-time arrival problem in transit networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.AP"],"primary_cat":"cs.DS","authors_text":"Samitha Samaranayake, Sebastien Blandin, Yang Liu","submitted_at":"2018-08-11T02:45:21Z","abstract_excerpt":"This article considers the stochastic on-time arrival problem in transit networks where both the travel time and the waiting time for transit services are stochastic. A specific challenge of this problem is the combinatorial solution space due to the unknown ordering of transit line arrivals. We propose a network structure appropriate to the online decision-making of a passenger, including boarding, waiting and transferring. In this framework, we design a dynamic programming algorithm that is pseudo-polynomial in the number of transit stations and travel time budget, and exponential in the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04360","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":"1808.04360","created_at":"2026-05-17T23:59:27.780025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04360v2","created_at":"2026-05-17T23:59:27.780025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04360","created_at":"2026-05-17T23:59:27.780025+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKS3K2FHXNUG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKS3K2FHXNUGMKUK","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKS3K2FH","created_at":"2026-05-18T12:32:40.477152+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/NKS3K2FHXNUGMKUK3J3XX4N5SA","json":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA.json","graph_json":"https://pith.science/api/pith-number/NKS3K2FHXNUGMKUK3J3XX4N5SA/graph.json","events_json":"https://pith.science/api/pith-number/NKS3K2FHXNUGMKUK3J3XX4N5SA/events.json","paper":"https://pith.science/paper/NKS3K2FH"},"agent_actions":{"view_html":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA","download_json":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA.json","view_paper":"https://pith.science/paper/NKS3K2FH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04360&json=true","fetch_graph":"https://pith.science/api/pith-number/NKS3K2FHXNUGMKUK3J3XX4N5SA/graph.json","fetch_events":"https://pith.science/api/pith-number/NKS3K2FHXNUGMKUK3J3XX4N5SA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/action/storage_attestation","attest_author":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/action/author_attestation","sign_citation":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/action/citation_signature","submit_replication":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/action/replication_record"}},"created_at":"2026-05-17T23:59:27.780025+00:00","updated_at":"2026-05-17T23:59:27.780025+00:00"}