{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:4HW4OJO4QCYA7AAHXU7QRJQLYU","short_pith_number":"pith:4HW4OJO4","schema_version":"1.0","canonical_sha256":"e1edc725dc80b00f8007bd3f08a60bc500be5adda906f6258c2046883f0388ea","source":{"kind":"arxiv","id":"cs/0703037","version":1},"attestation_state":"computed","paper":{"title":"Constructing Optimal Highways","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Chan-Su Shin, Christian Knauer, Hee-Kap Ahn, Helmut Alt, Hyeon-Suk Na, Otfried Cheong, Peter Brass, Sang Won Bae, Tetsuo Asano","submitted_at":"2007-03-08T17:22:21Z","abstract_excerpt":"For two points $p$ and $q$ in the plane, a straight line $h$, called a highway, and a real $v>1$, we define the \\emph{travel time} (also known as the \\emph{city distance}) from $p$ and $q$ to be the time needed to traverse a quickest path from $p$ to $q$, where the distance is measured with speed $v$ on $h$ and with speed 1 in the underlying metric elsewhere.\n  Given a set $S$ of $n$ points in the plane and a highway speed $v$, we consider the problem of finding a \\emph{highway} that minimizes the maximum travel time over all pairs of points in $S$. If the orientation of the highway is fixed, "},"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":"cs/0703037","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"2007-03-08T17:22:21Z","cross_cats_sorted":[],"title_canon_sha256":"03c4b08b8965f6f98cae57cd705464ba8ce5ad7733e13085160124f71ff7efb8","abstract_canon_sha256":"50df0d692e6f1a1753485cfbbe7b96918df085c352c3bba69dfdeaf2edebc933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:53.066372Z","signature_b64":"ePuzSkoaqIKDz56RGN6Pg2cv6CArQgBT2vazvAO2NOl332Asu005yLGWWNzsihBKzwP1mSdggqu9v/bXqOS3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1edc725dc80b00f8007bd3f08a60bc500be5adda906f6258c2046883f0388ea","last_reissued_at":"2026-05-18T04:41:53.065865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:53.065865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Optimal Highways","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Chan-Su Shin, Christian Knauer, Hee-Kap Ahn, Helmut Alt, Hyeon-Suk Na, Otfried Cheong, Peter Brass, Sang Won Bae, Tetsuo Asano","submitted_at":"2007-03-08T17:22:21Z","abstract_excerpt":"For two points $p$ and $q$ in the plane, a straight line $h$, called a highway, and a real $v>1$, we define the \\emph{travel time} (also known as the \\emph{city distance}) from $p$ and $q$ to be the time needed to traverse a quickest path from $p$ to $q$, where the distance is measured with speed $v$ on $h$ and with speed 1 in the underlying metric elsewhere.\n  Given a set $S$ of $n$ points in the plane and a highway speed $v$, we consider the problem of finding a \\emph{highway} that minimizes the maximum travel time over all pairs of points in $S$. If the orientation of the highway is fixed, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0703037","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":"cs/0703037","created_at":"2026-05-18T04:41:53.065942+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0703037v1","created_at":"2026-05-18T04:41:53.065942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0703037","created_at":"2026-05-18T04:41:53.065942+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HW4OJO4QCYA","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HW4OJO4QCYA7AAH","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HW4OJO4","created_at":"2026-05-18T12:25:54.717736+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/4HW4OJO4QCYA7AAHXU7QRJQLYU","json":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU.json","graph_json":"https://pith.science/api/pith-number/4HW4OJO4QCYA7AAHXU7QRJQLYU/graph.json","events_json":"https://pith.science/api/pith-number/4HW4OJO4QCYA7AAHXU7QRJQLYU/events.json","paper":"https://pith.science/paper/4HW4OJO4"},"agent_actions":{"view_html":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU","download_json":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU.json","view_paper":"https://pith.science/paper/4HW4OJO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0703037&json=true","fetch_graph":"https://pith.science/api/pith-number/4HW4OJO4QCYA7AAHXU7QRJQLYU/graph.json","fetch_events":"https://pith.science/api/pith-number/4HW4OJO4QCYA7AAHXU7QRJQLYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/action/storage_attestation","attest_author":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/action/author_attestation","sign_citation":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/action/citation_signature","submit_replication":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/action/replication_record"}},"created_at":"2026-05-18T04:41:53.065942+00:00","updated_at":"2026-05-18T04:41:53.065942+00:00"}