{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NKS3K2FHXNUGMKUK3J3XX4N5SA","short_pith_number":"pith:NKS3K2FH","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"},"canonical_sha256":"6aa5b568a7bb68662a8ada777bf1bd901cd7eb162a7febe8e9f8e7564b1a42cf","source":{"kind":"arxiv","id":"1808.04360","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04360","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04360v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04360","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"NKS3K2FHXNUG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NKS3K2FHXNUGMKUK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NKS3K2FH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NKS3K2FHXNUGMKUK3J3XX4N5SA","target":"record","payload":{"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"},"canonical_sha256":"6aa5b568a7bb68662a8ada777bf1bd901cd7eb162a7febe8e9f8e7564b1a42cf","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"},"source_kind":"arxiv","source_id":"1808.04360","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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fk0576e2Hpe3/ZXTOgU3obye2xyJJU6Bxe9mMv9xVgFRCdhfagc1DOoAQw33qzKsjkcYsJKYvvQthykTjmZoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:47:44.401715Z"},"content_sha256":"af41f41adc4ac4fb79cdf2237dab7291097b6992191fe6d91700e6ecdf109bb0","schema_version":"1.0","event_id":"sha256:af41f41adc4ac4fb79cdf2237dab7291097b6992191fe6d91700e6ecdf109bb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NKS3K2FHXNUGMKUK3J3XX4N5SA","target":"graph","payload":{"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"},"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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9ao0o6ZdncXd4RTtxL5wAw5oB4j3OUAakwjyhEQc7SwyQmIY3DV02Aff93zq+IK0mo3PsRMS+e9gyioXlyHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:47:44.402060Z"},"content_sha256":"de560badf0235d943714520192c1ee98f8ddeeee9310c170e84e4fc301cc2c2b","schema_version":"1.0","event_id":"sha256:de560badf0235d943714520192c1ee98f8ddeeee9310c170e84e4fc301cc2c2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/bundle.json","state_url":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/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-24T19:47:44Z","links":{"resolver":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA","bundle":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/bundle.json","state":"https://pith.science/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKS3K2FHXNUGMKUK3J3XX4N5SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NKS3K2FHXNUGMKUK3J3XX4N5SA","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":"bc58544adae41565cde6a7ad6552e78d74174ea80ed108fc7f45a01b66798370","cross_cats_sorted":["cs.SY","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-11T02:45:21Z","title_canon_sha256":"51d8e02194d6323b91218a5f2514dd5c99064beeb1f0950bc31cd233545a787f"},"schema_version":"1.0","source":{"id":"1808.04360","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04360","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04360v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04360","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"NKS3K2FHXNUG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NKS3K2FHXNUGMKUK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NKS3K2FH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:de560badf0235d943714520192c1ee98f8ddeeee9310c170e84e4fc301cc2c2b","target":"graph","created_at":"2026-05-17T23:59:27Z","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":"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","authors_text":"Samitha Samaranayake, Sebastien Blandin, Yang Liu","cross_cats":["cs.SY","math.OC","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-11T02:45:21Z","title":"Stochastic on-time arrival problem in transit networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04360","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:af41f41adc4ac4fb79cdf2237dab7291097b6992191fe6d91700e6ecdf109bb0","target":"record","created_at":"2026-05-17T23:59:27Z","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":"bc58544adae41565cde6a7ad6552e78d74174ea80ed108fc7f45a01b66798370","cross_cats_sorted":["cs.SY","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-11T02:45:21Z","title_canon_sha256":"51d8e02194d6323b91218a5f2514dd5c99064beeb1f0950bc31cd233545a787f"},"schema_version":"1.0","source":{"id":"1808.04360","kind":"arxiv","version":2}},"canonical_sha256":"6aa5b568a7bb68662a8ada777bf1bd901cd7eb162a7febe8e9f8e7564b1a42cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aa5b568a7bb68662a8ada777bf1bd901cd7eb162a7febe8e9f8e7564b1a42cf","first_computed_at":"2026-05-17T23:59:27.779937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:27.779937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvHhO61+N8outk9NpOYkUeRT7T/xviEENO/ymsWN9LzG/yb2scirUinzeBDL++zBF+ST2fTjZiUReEUmDPyRDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:27.780494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04360","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af41f41adc4ac4fb79cdf2237dab7291097b6992191fe6d91700e6ecdf109bb0","sha256:de560badf0235d943714520192c1ee98f8ddeeee9310c170e84e4fc301cc2c2b"],"state_sha256":"2941971303e4a2309bb9ef07c0491419e1652929f5461fd18046fa27c059a00c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"algHXnQ0pV+GvxVb0suA5N5BfX1tKxXJUhlSFT+nWsGrV7UaKygxknnP1gN756wW36/cEfE8UHxOph7WBA/ECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:47:44.403948Z","bundle_sha256":"165ead90daecf9739aa127be5abe6ab358321705a5e31fa1d84c348096abfe3c"}}