{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:4HW4OJO4QCYA7AAHXU7QRJQLYU","short_pith_number":"pith:4HW4OJO4","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"},"canonical_sha256":"e1edc725dc80b00f8007bd3f08a60bc500be5adda906f6258c2046883f0388ea","source":{"kind":"arxiv","id":"cs/0703037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0703037","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0703037v1","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0703037","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"4HW4OJO4QCYA","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"4HW4OJO4QCYA7AAH","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"4HW4OJO4","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:4HW4OJO4QCYA7AAHXU7QRJQLYU","target":"record","payload":{"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"},"canonical_sha256":"e1edc725dc80b00f8007bd3f08a60bc500be5adda906f6258c2046883f0388ea","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"},"source_kind":"arxiv","source_id":"cs/0703037","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHEB5d7KTHMqjQldlQZQBh0Fdf649l1DA2uVIDjk0al7J67s35H2g6Bn+J0Nvcba4vl4QZnV189WwBkulvauDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:35:28.427357Z"},"content_sha256":"383d49e9c49f0396d8b382c193976a8dfa10504feed96d97e5d7e9378a7cac4d","schema_version":"1.0","event_id":"sha256:383d49e9c49f0396d8b382c193976a8dfa10504feed96d97e5d7e9378a7cac4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:4HW4OJO4QCYA7AAHXU7QRJQLYU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+bI1AGJM0IHAZ00NK8pZNbRA2kMhQhl9ekvfST1PffhuPScMXWpXtYZv+TPz7/QYxyazkIz4Gyk3AWOPIwnqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:35:28.427970Z"},"content_sha256":"3f52cf1172ccaf8b179233eb69a291ed47a17afa61ab5024b469adb0410d2af7","schema_version":"1.0","event_id":"sha256:3f52cf1172ccaf8b179233eb69a291ed47a17afa61ab5024b469adb0410d2af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/bundle.json","state_url":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T06:35:28Z","links":{"resolver":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU","bundle":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/bundle.json","state":"https://pith.science/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HW4OJO4QCYA7AAHXU7QRJQLYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:4HW4OJO4QCYA7AAHXU7QRJQLYU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"50df0d692e6f1a1753485cfbbe7b96918df085c352c3bba69dfdeaf2edebc933","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"2007-03-08T17:22:21Z","title_canon_sha256":"03c4b08b8965f6f98cae57cd705464ba8ce5ad7733e13085160124f71ff7efb8"},"schema_version":"1.0","source":{"id":"cs/0703037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0703037","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0703037v1","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0703037","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"4HW4OJO4QCYA","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"4HW4OJO4QCYA7AAH","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"4HW4OJO4","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:3f52cf1172ccaf8b179233eb69a291ed47a17afa61ab5024b469adb0410d2af7","target":"graph","created_at":"2026-05-18T04:41:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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, ","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","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CG","submitted_at":"2007-03-08T17:22:21Z","title":"Constructing Optimal Highways"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0703037","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:383d49e9c49f0396d8b382c193976a8dfa10504feed96d97e5d7e9378a7cac4d","target":"record","created_at":"2026-05-18T04:41:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"50df0d692e6f1a1753485cfbbe7b96918df085c352c3bba69dfdeaf2edebc933","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"2007-03-08T17:22:21Z","title_canon_sha256":"03c4b08b8965f6f98cae57cd705464ba8ce5ad7733e13085160124f71ff7efb8"},"schema_version":"1.0","source":{"id":"cs/0703037","kind":"arxiv","version":1}},"canonical_sha256":"e1edc725dc80b00f8007bd3f08a60bc500be5adda906f6258c2046883f0388ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1edc725dc80b00f8007bd3f08a60bc500be5adda906f6258c2046883f0388ea","first_computed_at":"2026-05-18T04:41:53.065865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:53.065865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ePuzSkoaqIKDz56RGN6Pg2cv6CArQgBT2vazvAO2NOl332Asu005yLGWWNzsihBKzwP1mSdggqu9v/bXqOS3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:53.066372Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0703037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:383d49e9c49f0396d8b382c193976a8dfa10504feed96d97e5d7e9378a7cac4d","sha256:3f52cf1172ccaf8b179233eb69a291ed47a17afa61ab5024b469adb0410d2af7"],"state_sha256":"d9b228f38b7f2cdd0afe83d2acf6c67917f73499b915239126215633ff394d66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJe8AUgFyBC89ndsSMuGlyk3wT/NRiZwUpiCNeWJZyyGlzuoz4KesZTy+9jyicp5hD8qAm/ivD8FPTibrNdpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T06:35:28.431335Z","bundle_sha256":"147f6bbae7855a2e34534f1e65aa15655260313c9ee5211c2e7df381e00f98ed"}}