{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VULPJZDIM6XQ5UQBWBUYBUXQ2H","short_pith_number":"pith:VULPJZDI","schema_version":"1.0","canonical_sha256":"ad16f4e46867af0ed201b06980d2f0d1e6f0fb87582836f65b0a07d057b54cd3","source":{"kind":"arxiv","id":"1504.07149","version":2},"attestation_state":"computed","paper":{"title":"Trip-Based Public Transit Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sascha Witt","submitted_at":"2015-04-27T16:24:17Z","abstract_excerpt":"We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70 ms after a preprocessing phase of 30 s, allowing fast queries in dynamic scenarios."},"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":"1504.07149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T16:24:17Z","cross_cats_sorted":[],"title_canon_sha256":"9d90c5ff0cb444d604b5bb91afed4061814b75a0acd676e56f5b71c05d190d30","abstract_canon_sha256":"deaa6e3f0337bcba04eebd58a9d68b71bb268d3fdba045c3ab444413849a9f72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:33.613254Z","signature_b64":"mJm2EIRdxXNvtjk7lJAAS8kAJgUt/BU17OuqczapQM6w98cCiMmoEVFtIaeSwXQtm3m5/CNr/doWzbbgdiEoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad16f4e46867af0ed201b06980d2f0d1e6f0fb87582836f65b0a07d057b54cd3","last_reissued_at":"2026-05-18T01:11:33.612861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:33.612861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trip-Based Public Transit Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sascha Witt","submitted_at":"2015-04-27T16:24:17Z","abstract_excerpt":"We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel approach, focusing on trips and transfers between them, allowing fine-grained modeling. Our experiments on the metropolitan network of London show that the algorithm computes full 24-hour profiles in 70 ms after a preprocessing phase of 30 s, allowing fast queries in dynamic scenarios."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07149","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":"1504.07149","created_at":"2026-05-18T01:11:33.612922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07149v2","created_at":"2026-05-18T01:11:33.612922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07149","created_at":"2026-05-18T01:11:33.612922+00:00"},{"alias_kind":"pith_short_12","alias_value":"VULPJZDIM6XQ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VULPJZDIM6XQ5UQB","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VULPJZDI","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00091","citing_title":"Locality versus Fock-space structure in East-type models","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H","json":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H.json","graph_json":"https://pith.science/api/pith-number/VULPJZDIM6XQ5UQBWBUYBUXQ2H/graph.json","events_json":"https://pith.science/api/pith-number/VULPJZDIM6XQ5UQBWBUYBUXQ2H/events.json","paper":"https://pith.science/paper/VULPJZDI"},"agent_actions":{"view_html":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H","download_json":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H.json","view_paper":"https://pith.science/paper/VULPJZDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07149&json=true","fetch_graph":"https://pith.science/api/pith-number/VULPJZDIM6XQ5UQBWBUYBUXQ2H/graph.json","fetch_events":"https://pith.science/api/pith-number/VULPJZDIM6XQ5UQBWBUYBUXQ2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H/action/storage_attestation","attest_author":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H/action/author_attestation","sign_citation":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H/action/citation_signature","submit_replication":"https://pith.science/pith/VULPJZDIM6XQ5UQBWBUYBUXQ2H/action/replication_record"}},"created_at":"2026-05-18T01:11:33.612922+00:00","updated_at":"2026-05-18T01:11:33.612922+00:00"}