{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UMNJEGMVDVQNLVG647UKQZVNBO","short_pith_number":"pith:UMNJEGMV","schema_version":"1.0","canonical_sha256":"a31a9219951d60d5d4dee7e8a866ad0ba5016e871401c775e062d367844770a1","source":{"kind":"arxiv","id":"1512.09090","version":1},"attestation_state":"computed","paper":{"title":"Fast Computation of Isochrones in Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Julian Dibbelt, Moritz Baum, Valentin Buchhold","submitted_at":"2015-12-30T20:09:44Z","abstract_excerpt":"We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for this problem (e.g., reachability analyses, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fast computation of isochrones on large, realistic inputs. In this work, we formalize the notion of isochrones in road networks and present a basic approach for the resulting problem based on Dijkstra's algorithm. Moreover, w"},"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":"1512.09090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-30T20:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"2e3322634a801c2228c33c9beaebede042ced59375297ce05e11b796a6fef264","abstract_canon_sha256":"89800a6b447d58b0efe007fd0e0121808502476559d874946051ee891fae366c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:34.055752Z","signature_b64":"L7wMixE5TfPRgoJs8rWbBbtfrKsDSsrGTlYtP/EqUQJvBpXvXp2alWsO6uvxAZ685ykkqJA3LjfNrsp8VJgNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31a9219951d60d5d4dee7e8a866ad0ba5016e871401c775e062d367844770a1","last_reissued_at":"2026-05-18T01:23:34.055031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:34.055031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Computation of Isochrones in Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Julian Dibbelt, Moritz Baum, Valentin Buchhold","submitted_at":"2015-12-30T20:09:44Z","abstract_excerpt":"We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for this problem (e.g., reachability analyses, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fast computation of isochrones on large, realistic inputs. In this work, we formalize the notion of isochrones in road networks and present a basic approach for the resulting problem based on Dijkstra's algorithm. Moreover, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09090","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":"1512.09090","created_at":"2026-05-18T01:23:34.055143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09090v1","created_at":"2026-05-18T01:23:34.055143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09090","created_at":"2026-05-18T01:23:34.055143+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMNJEGMVDVQN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMNJEGMVDVQNLVG6","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMNJEGMV","created_at":"2026-05-18T12:29:44.643036+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/UMNJEGMVDVQNLVG647UKQZVNBO","json":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO.json","graph_json":"https://pith.science/api/pith-number/UMNJEGMVDVQNLVG647UKQZVNBO/graph.json","events_json":"https://pith.science/api/pith-number/UMNJEGMVDVQNLVG647UKQZVNBO/events.json","paper":"https://pith.science/paper/UMNJEGMV"},"agent_actions":{"view_html":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO","download_json":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO.json","view_paper":"https://pith.science/paper/UMNJEGMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09090&json=true","fetch_graph":"https://pith.science/api/pith-number/UMNJEGMVDVQNLVG647UKQZVNBO/graph.json","fetch_events":"https://pith.science/api/pith-number/UMNJEGMVDVQNLVG647UKQZVNBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO/action/storage_attestation","attest_author":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO/action/author_attestation","sign_citation":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO/action/citation_signature","submit_replication":"https://pith.science/pith/UMNJEGMVDVQNLVG647UKQZVNBO/action/replication_record"}},"created_at":"2026-05-18T01:23:34.055143+00:00","updated_at":"2026-05-18T01:23:34.055143+00:00"}