{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SSDF73L2GFGQPGUEYGATIJS662","short_pith_number":"pith:SSDF73L2","schema_version":"1.0","canonical_sha256":"94865fed7a314d079a84c18134265ef691eb8d3b93c3165bb80ca799be72e16e","source":{"kind":"arxiv","id":"1703.05997","version":1},"attestation_state":"computed","paper":{"title":"Connection Scan Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser, Dorothea Wagner, Julian Dibbelt, Thomas Pajor","submitted_at":"2017-03-17T12:57:18Z","abstract_excerpt":"We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position and a desired target position. The output consist is a sequence of vehicles such as trains or buses that a traveler should take to get from the source to the target. We study several problem variations such as the earliest arrival and profile problems. We present algorithm variants that only optimize the arrival time or additionally optimize the number of transfers in the Pareto sense. An advantage of CSA is that is c"},"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":"1703.05997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T12:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"3f18ff7cd30a6ca4cd8a1173ed4c38fd6e3201da1f5efcaea6403b02e7be01bc","abstract_canon_sha256":"ca60085a3f2df84176909db0bf5ed7b83c0e4bd6a14bc3afe3148ab4e371fe6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.762964Z","signature_b64":"dx2FEld1H0A+hCtgyJr+aiIOGK0wbd/OiNEjDQG9BNuUM8lnyp+36q6l1SlvAhxQt3AIA3ZMnGDwvLP9OO5rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94865fed7a314d079a84c18134265ef691eb8d3b93c3165bb80ca799be72e16e","last_reissued_at":"2026-05-18T00:48:29.762082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.762082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connection Scan Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser, Dorothea Wagner, Julian Dibbelt, Thomas Pajor","submitted_at":"2017-03-17T12:57:18Z","abstract_excerpt":"We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position and a desired target position. The output consist is a sequence of vehicles such as trains or buses that a traveler should take to get from the source to the target. We study several problem variations such as the earliest arrival and profile problems. We present algorithm variants that only optimize the arrival time or additionally optimize the number of transfers in the Pareto sense. An advantage of CSA is that is c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05997","kind":"arxiv","version":1},"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":"1703.05997","created_at":"2026-05-18T00:48:29.762210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05997v1","created_at":"2026-05-18T00:48:29.762210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05997","created_at":"2026-05-18T00:48:29.762210+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSDF73L2GFGQ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSDF73L2GFGQPGUE","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSDF73L2","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2603.12592","citing_title":"Early Pruning for Public Transport Routing","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2603.12592","citing_title":"Early Pruning for Public Transport Routing","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":259,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662","json":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662.json","graph_json":"https://pith.science/api/pith-number/SSDF73L2GFGQPGUEYGATIJS662/graph.json","events_json":"https://pith.science/api/pith-number/SSDF73L2GFGQPGUEYGATIJS662/events.json","paper":"https://pith.science/paper/SSDF73L2"},"agent_actions":{"view_html":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662","download_json":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662.json","view_paper":"https://pith.science/paper/SSDF73L2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05997&json=true","fetch_graph":"https://pith.science/api/pith-number/SSDF73L2GFGQPGUEYGATIJS662/graph.json","fetch_events":"https://pith.science/api/pith-number/SSDF73L2GFGQPGUEYGATIJS662/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662/action/storage_attestation","attest_author":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662/action/author_attestation","sign_citation":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662/action/citation_signature","submit_replication":"https://pith.science/pith/SSDF73L2GFGQPGUEYGATIJS662/action/replication_record"}},"created_at":"2026-05-18T00:48:29.762210+00:00","updated_at":"2026-05-18T00:48:29.762210+00:00"}