{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SW4X4JCZ7XPYH4Y64WZRLVGVXS","short_pith_number":"pith:SW4X4JCZ","schema_version":"1.0","canonical_sha256":"95b97e2459fddf83f31ee5b315d4d5bca983c74ec0ffec693b18d8fface3a54c","source":{"kind":"arxiv","id":"1607.01299","version":2},"attestation_state":"computed","paper":{"title":"Trip-Based Public Transit Routing Using Condensed Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sascha Witt","submitted_at":"2016-07-05T15:32:06Z","abstract_excerpt":"We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the trip-based model focuses on trips and transfers between them, constructing journeys as a sequence of trips. In this paper, we develop a speed-up technique for this model inspired by principles behind existing state-of-the-art speed-up techniques, Transfer Pattern and Hub Labelling. The resulting algorithm allows us to compute Pareto-optimal (with respect to arr"},"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":"1607.01299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-05T15:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"75a7772c46d5bd6ec5592e6eef2a058afb1972ee3128831ecb1fd07d323d3906","abstract_canon_sha256":"5b3af3955a71e657c4672a850849e8ca66d0b89e3411e394ff2b6fba6510ffd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.142213Z","signature_b64":"rRJWCIbekEKnQdM5hLt511zIEo1U4AB97EWiF3LlgXETRp8QyqCEy9h3SsDKlPX5JF20q26jPVk94PgB9bbFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b97e2459fddf83f31ee5b315d4d5bca983c74ec0ffec693b18d8fface3a54c","last_reissued_at":"2026-05-18T01:04:37.141540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.141540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trip-Based Public Transit Routing Using Condensed Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sascha Witt","submitted_at":"2016-07-05T15:32:06Z","abstract_excerpt":"We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the trip-based model focuses on trips and transfers between them, constructing journeys as a sequence of trips. In this paper, we develop a speed-up technique for this model inspired by principles behind existing state-of-the-art speed-up techniques, Transfer Pattern and Hub Labelling. The resulting algorithm allows us to compute Pareto-optimal (with respect to arr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01299","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":"1607.01299","created_at":"2026-05-18T01:04:37.141643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01299v2","created_at":"2026-05-18T01:04:37.141643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01299","created_at":"2026-05-18T01:04:37.141643+00:00"},{"alias_kind":"pith_short_12","alias_value":"SW4X4JCZ7XPY","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SW4X4JCZ7XPYH4Y6","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SW4X4JCZ","created_at":"2026-05-18T12:30:44.179134+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/SW4X4JCZ7XPYH4Y64WZRLVGVXS","json":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS.json","graph_json":"https://pith.science/api/pith-number/SW4X4JCZ7XPYH4Y64WZRLVGVXS/graph.json","events_json":"https://pith.science/api/pith-number/SW4X4JCZ7XPYH4Y64WZRLVGVXS/events.json","paper":"https://pith.science/paper/SW4X4JCZ"},"agent_actions":{"view_html":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS","download_json":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS.json","view_paper":"https://pith.science/paper/SW4X4JCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01299&json=true","fetch_graph":"https://pith.science/api/pith-number/SW4X4JCZ7XPYH4Y64WZRLVGVXS/graph.json","fetch_events":"https://pith.science/api/pith-number/SW4X4JCZ7XPYH4Y64WZRLVGVXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS/action/storage_attestation","attest_author":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS/action/author_attestation","sign_citation":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS/action/citation_signature","submit_replication":"https://pith.science/pith/SW4X4JCZ7XPYH4Y64WZRLVGVXS/action/replication_record"}},"created_at":"2026-05-18T01:04:37.141643+00:00","updated_at":"2026-05-18T01:04:37.141643+00:00"}