{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WL66DEPI5NUSSLRKTAD26WYPG2","short_pith_number":"pith:WL66DEPI","canonical_record":{"source":{"id":"1203.6481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-29T10:31:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3ccd88099667610127d97daff26b8203eaf77f325d4383d1dd44db7b2451422b","abstract_canon_sha256":"3cf2412ebda03529d6986a0bb5b421be79c13c506d62f7f4b37c61a7e1fd17c5"},"schema_version":"1.0"},"canonical_sha256":"b2fde191e8eb69292e2a9807af5b0f3694ff333d53dd59973e16930f0a5dbfa5","source":{"kind":"arxiv","id":"1203.6481","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6481","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6481v2","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6481","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"WL66DEPI5NUS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WL66DEPI5NUSSLRK","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WL66DEPI","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WL66DEPI5NUSSLRKTAD26WYPG2","target":"record","payload":{"canonical_record":{"source":{"id":"1203.6481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-29T10:31:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3ccd88099667610127d97daff26b8203eaf77f325d4383d1dd44db7b2451422b","abstract_canon_sha256":"3cf2412ebda03529d6986a0bb5b421be79c13c506d62f7f4b37c61a7e1fd17c5"},"schema_version":"1.0"},"canonical_sha256":"b2fde191e8eb69292e2a9807af5b0f3694ff333d53dd59973e16930f0a5dbfa5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:15.672391Z","signature_b64":"DGZb1eCRevimmgNfIk4bivZ/7lNw+voBPDwPh4ewif3Ts5XuR445c/nDXRNvl1CukP26KjUaQZ1hBgneM31EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2fde191e8eb69292e2a9807af5b0f3694ff333d53dd59973e16930f0a5dbfa5","last_reissued_at":"2026-05-18T03:57:15.671885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:15.671885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.6481","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:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Mrz1D6sSSgI+gIlFR5HonBClE6mVZolHHUUF6gH5FgrXSAYpE9Gbx7OmyqPiN+yFf9QUy5lfRjXDF3a0/TuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:09:40.950738Z"},"content_sha256":"94e34f344d3d2867564236a2db2396d0678b0f8e8be79d5a61488950c3a1e2b7","schema_version":"1.0","event_id":"sha256:94e34f344d3d2867564236a2db2396d0678b0f8e8be79d5a61488950c3a1e2b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WL66DEPI5NUSSLRKTAD26WYPG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polylogarithmic Approximation for Generalized Minimum Manhattan Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Aparna Das, Joachim Spoerhase, Krzysztof Fleszar, Sankar Veeramoni, Stephen Kobourov","submitted_at":"2012-03-29T10:31:43Z","abstract_excerpt":"Given a set of $n$ terminals, which are points in $d$-dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that connects each pair of terminals by a Manhattan path, that is, a path consisting of axis-parallel segments whose total length equals the pair's Manhattan distance. Even for $d=2$, the problem is NP-hard, but constant-factor approximations are known. For $d \\ge 3$, the problem is APX-hard; it is known to admit, for any $\\eps > 0$, an $O(n^\\eps)$-approximation.\n  In the generalized minimum Manhattan network problem (GMMN)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6481","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:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTGJlYyvMze3oLplanHBDewNjQ1mBDsk9o87UFZj6tx6XPvQk6Y4+u1ND0TOllwW6jcjQfYScxPfxoVZKDzlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:09:40.951264Z"},"content_sha256":"53c91d08f220445b8c4acd0e57b665131610ff397bb6595bd729eb2275056232","schema_version":"1.0","event_id":"sha256:53c91d08f220445b8c4acd0e57b665131610ff397bb6595bd729eb2275056232"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WL66DEPI5NUSSLRKTAD26WYPG2/bundle.json","state_url":"https://pith.science/pith/WL66DEPI5NUSSLRKTAD26WYPG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WL66DEPI5NUSSLRKTAD26WYPG2/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-28T19:09:40Z","links":{"resolver":"https://pith.science/pith/WL66DEPI5NUSSLRKTAD26WYPG2","bundle":"https://pith.science/pith/WL66DEPI5NUSSLRKTAD26WYPG2/bundle.json","state":"https://pith.science/pith/WL66DEPI5NUSSLRKTAD26WYPG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WL66DEPI5NUSSLRKTAD26WYPG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WL66DEPI5NUSSLRKTAD26WYPG2","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":"3cf2412ebda03529d6986a0bb5b421be79c13c506d62f7f4b37c61a7e1fd17c5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-29T10:31:43Z","title_canon_sha256":"3ccd88099667610127d97daff26b8203eaf77f325d4383d1dd44db7b2451422b"},"schema_version":"1.0","source":{"id":"1203.6481","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6481","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6481v2","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6481","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"WL66DEPI5NUS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WL66DEPI5NUSSLRK","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WL66DEPI","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:53c91d08f220445b8c4acd0e57b665131610ff397bb6595bd729eb2275056232","target":"graph","created_at":"2026-05-18T03:57:15Z","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":"Given a set of $n$ terminals, which are points in $d$-dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that connects each pair of terminals by a Manhattan path, that is, a path consisting of axis-parallel segments whose total length equals the pair's Manhattan distance. Even for $d=2$, the problem is NP-hard, but constant-factor approximations are known. For $d \\ge 3$, the problem is APX-hard; it is known to admit, for any $\\eps > 0$, an $O(n^\\eps)$-approximation.\n  In the generalized minimum Manhattan network problem (GMMN)","authors_text":"Alexander Wolff, Aparna Das, Joachim Spoerhase, Krzysztof Fleszar, Sankar Veeramoni, Stephen Kobourov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-29T10:31:43Z","title":"Polylogarithmic Approximation for Generalized Minimum Manhattan Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6481","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:94e34f344d3d2867564236a2db2396d0678b0f8e8be79d5a61488950c3a1e2b7","target":"record","created_at":"2026-05-18T03:57:15Z","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":"3cf2412ebda03529d6986a0bb5b421be79c13c506d62f7f4b37c61a7e1fd17c5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-29T10:31:43Z","title_canon_sha256":"3ccd88099667610127d97daff26b8203eaf77f325d4383d1dd44db7b2451422b"},"schema_version":"1.0","source":{"id":"1203.6481","kind":"arxiv","version":2}},"canonical_sha256":"b2fde191e8eb69292e2a9807af5b0f3694ff333d53dd59973e16930f0a5dbfa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2fde191e8eb69292e2a9807af5b0f3694ff333d53dd59973e16930f0a5dbfa5","first_computed_at":"2026-05-18T03:57:15.671885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:15.671885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DGZb1eCRevimmgNfIk4bivZ/7lNw+voBPDwPh4ewif3Ts5XuR445c/nDXRNvl1CukP26KjUaQZ1hBgneM31EBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:15.672391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6481","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94e34f344d3d2867564236a2db2396d0678b0f8e8be79d5a61488950c3a1e2b7","sha256:53c91d08f220445b8c4acd0e57b665131610ff397bb6595bd729eb2275056232"],"state_sha256":"229dec584ad6947a4c60dcd8a2e5ffebd6d3dc7206ad0c6a05c1a47f34178e05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TI9Mbe88sP+n0rbgkV78+C6PUxoF1heaefNlhDc/I1hyd15wbFD8TyJ0tatHRJ3s0LDP2Y5cAtC1lxOpHaRUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:09:40.954113Z","bundle_sha256":"cb5bad802abeb57827821af4b414f7cb78e3eb1e59855ccba53b4c5a9f66c8bf"}}