{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GOBFEH23LFF2VLJHW7SE65LN64","short_pith_number":"pith:GOBFEH23","canonical_record":{"source":{"id":"1107.0901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-05T15:27:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea747a32c09b99b8e8293de72858a068686027de5dc43f47df7dbf55600cff8b","abstract_canon_sha256":"765edadc90a64c75b04d8f49e03db46114760556803daec4255a0fc7c68deff1"},"schema_version":"1.0"},"canonical_sha256":"3382521f5b594baaad27b7e44f756df70916fe68efcad4c261ea7f48d002e617","source":{"kind":"arxiv","id":"1107.0901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0901","created_at":"2026-05-18T03:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0901v2","created_at":"2026-05-18T03:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0901","created_at":"2026-05-18T03:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"GOBFEH23LFF2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GOBFEH23LFF2VLJH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GOBFEH23","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GOBFEH23LFF2VLJHW7SE65LN64","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-05T15:27:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea747a32c09b99b8e8293de72858a068686027de5dc43f47df7dbf55600cff8b","abstract_canon_sha256":"765edadc90a64c75b04d8f49e03db46114760556803daec4255a0fc7c68deff1"},"schema_version":"1.0"},"canonical_sha256":"3382521f5b594baaad27b7e44f756df70916fe68efcad4c261ea7f48d002e617","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:58.157975Z","signature_b64":"nupWHq/8vixrNmMQjcn8gB0H1vNWkPfoEbLXNGV+ZSx6MHXPEPyP0JhwJtBAqfCJbnTQTlhoJ2y1KwGnMzudCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3382521f5b594baaad27b7e44f756df70916fe68efcad4c261ea7f48d002e617","last_reissued_at":"2026-05-18T03:56:58.156111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:58.156111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0901","source_version":2,"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-18T03:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDCN6AQcJJug19CxGFYdM4YTdoAoODglz6ApuzHKinN1x54Pe1xRtrRx/JpEP7vFiesIbtBDLcMqIqG52A+bDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:21:49.856532Z"},"content_sha256":"2b544aaef8cb26ae05e301f4f432899d5ac1955777973f8f35eb42364781a01f","schema_version":"1.0","event_id":"sha256:2b544aaef8cb26ae05e301f4f432899d5ac1955777973f8f35eb42364781a01f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GOBFEH23LFF2VLJHW7SE65LN64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Minimum Manhattan Networks in Higher Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Aparna Das, Emden R. Gansner, Joachim Spoerhase, Michael Kaufmann, Stephen Kobourov","submitted_at":"2011-07-05T15:27:34Z","abstract_excerpt":"We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \\emph{terminals} in $\\R^d$, find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair's Manhattan (that is, $L_1$-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless ${\\cal P}={\\cal NP}$). Approximation algorithms are known for 2D, but not for 3D.\n  We present, for any fixed dimension $d$ and any $\\eps>0$, an $O(n^\\eps)$-approximation algorithm. For 3D, we also give a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0901","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"},"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-18T03:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9k7FM8pA1y97dva6yAtAaobYjbZW3EKwgkwnikHCCgT4INkN4a2wudZ6r6gT/fZvs5dho4joC8ov4TPUsmcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:21:49.856881Z"},"content_sha256":"986264929df40e26a1a9a34350481eb259c6048ef51e249fd2e5a86499c1fb52","schema_version":"1.0","event_id":"sha256:986264929df40e26a1a9a34350481eb259c6048ef51e249fd2e5a86499c1fb52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOBFEH23LFF2VLJHW7SE65LN64/bundle.json","state_url":"https://pith.science/pith/GOBFEH23LFF2VLJHW7SE65LN64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOBFEH23LFF2VLJHW7SE65LN64/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-28T03:21:49Z","links":{"resolver":"https://pith.science/pith/GOBFEH23LFF2VLJHW7SE65LN64","bundle":"https://pith.science/pith/GOBFEH23LFF2VLJHW7SE65LN64/bundle.json","state":"https://pith.science/pith/GOBFEH23LFF2VLJHW7SE65LN64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOBFEH23LFF2VLJHW7SE65LN64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GOBFEH23LFF2VLJHW7SE65LN64","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":"765edadc90a64c75b04d8f49e03db46114760556803daec4255a0fc7c68deff1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-05T15:27:34Z","title_canon_sha256":"ea747a32c09b99b8e8293de72858a068686027de5dc43f47df7dbf55600cff8b"},"schema_version":"1.0","source":{"id":"1107.0901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0901","created_at":"2026-05-18T03:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0901v2","created_at":"2026-05-18T03:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0901","created_at":"2026-05-18T03:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"GOBFEH23LFF2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GOBFEH23LFF2VLJH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GOBFEH23","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:986264929df40e26a1a9a34350481eb259c6048ef51e249fd2e5a86499c1fb52","target":"graph","created_at":"2026-05-18T03:56:58Z","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":"We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \\emph{terminals} in $\\R^d$, find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair's Manhattan (that is, $L_1$-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless ${\\cal P}={\\cal NP}$). Approximation algorithms are known for 2D, but not for 3D.\n  We present, for any fixed dimension $d$ and any $\\eps>0$, an $O(n^\\eps)$-approximation algorithm. For 3D, we also give a ","authors_text":"Alexander Wolff, Aparna Das, Emden R. Gansner, Joachim Spoerhase, Michael Kaufmann, Stephen Kobourov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-05T15:27:34Z","title":"Approximating Minimum Manhattan Networks in Higher Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0901","kind":"arxiv","version":2},"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:2b544aaef8cb26ae05e301f4f432899d5ac1955777973f8f35eb42364781a01f","target":"record","created_at":"2026-05-18T03:56:58Z","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":"765edadc90a64c75b04d8f49e03db46114760556803daec4255a0fc7c68deff1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-05T15:27:34Z","title_canon_sha256":"ea747a32c09b99b8e8293de72858a068686027de5dc43f47df7dbf55600cff8b"},"schema_version":"1.0","source":{"id":"1107.0901","kind":"arxiv","version":2}},"canonical_sha256":"3382521f5b594baaad27b7e44f756df70916fe68efcad4c261ea7f48d002e617","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3382521f5b594baaad27b7e44f756df70916fe68efcad4c261ea7f48d002e617","first_computed_at":"2026-05-18T03:56:58.156111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:58.156111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nupWHq/8vixrNmMQjcn8gB0H1vNWkPfoEbLXNGV+ZSx6MHXPEPyP0JhwJtBAqfCJbnTQTlhoJ2y1KwGnMzudCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:58.157975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b544aaef8cb26ae05e301f4f432899d5ac1955777973f8f35eb42364781a01f","sha256:986264929df40e26a1a9a34350481eb259c6048ef51e249fd2e5a86499c1fb52"],"state_sha256":"c84e920d8e1b590b8dc4b19361a3f362138529b4514af94b10637dc464175fc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYQuV5nRLhLHoN3HkIPnHmnY3cJ1z3hK1wQiHlXRnnx+iYp96pjUJMHGL0zdNhJz/5CVAGkhuH0SvX16epGGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:21:49.858857Z","bundle_sha256":"0fc88229fbaec262e4a2eacc706638caee6296cb4134c27050d20cce180fbbfc"}}