{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KLZNNRUYVQ44WAZEOVCQY5HXC3","short_pith_number":"pith:KLZNNRUY","canonical_record":{"source":{"id":"1509.05751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T19:04:04Z","cross_cats_sorted":[],"title_canon_sha256":"cb12d6eb02d60fe715fe7ecdd578f9f6c4f410e87e95fd7c949fc778b0805640","abstract_canon_sha256":"41087e2c89412198783987e98765f511e2715b952aad5248fac64f7772463719"},"schema_version":"1.0"},"canonical_sha256":"52f2d6c698ac39cb032475450c74f716eca340c0b5c1e89437ce72e65cd37285","source":{"kind":"arxiv","id":"1509.05751","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05751","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05751v2","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05751","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"KLZNNRUYVQ44","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KLZNNRUYVQ44WAZE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KLZNNRUY","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KLZNNRUYVQ44WAZEOVCQY5HXC3","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T19:04:04Z","cross_cats_sorted":[],"title_canon_sha256":"cb12d6eb02d60fe715fe7ecdd578f9f6c4f410e87e95fd7c949fc778b0805640","abstract_canon_sha256":"41087e2c89412198783987e98765f511e2715b952aad5248fac64f7772463719"},"schema_version":"1.0"},"canonical_sha256":"52f2d6c698ac39cb032475450c74f716eca340c0b5c1e89437ce72e65cd37285","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.299812Z","signature_b64":"gHeJ77Dq2v0xC7HVWICW+dWwvrDU1acspQrIe3FIXNJTSPCEFPW6SlIAjZ3kRTeQPeWjMXvHYmFqOfin1UxbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f2d6c698ac39cb032475450c74f716eca340c0b5c1e89437ce72e65cd37285","last_reissued_at":"2026-05-18T00:42:33.298722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.298722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05751","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-18T00:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yN1+JQZIPyKwAdyQzSCDn68h7bLsouy4djJt1kh31lqk+kf23gFCTbjBP730+RLt71odEyxSzYMzLwmFY9NMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:56:03.162653Z"},"content_sha256":"b6ec22e5ea747e090b2828a1151bef505797094825b3381405559c8e281dc911","schema_version":"1.0","event_id":"sha256:b6ec22e5ea747e090b2828a1151bef505797094825b3381405559c8e281dc911"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KLZNNRUYVQ44WAZEOVCQY5HXC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Gromov-Hausdorff Distance for Metric Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abhinandan Nath, Anastasios Sidiropoulos, Kyle Fox, Pankaj K. Agarwal, Yusu Wang","submitted_at":"2015-09-18T19:04:04Z","abstract_excerpt":"The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is $\\mathrm{NP}$-hard to approximate the Gromov-Hausdorff distance better than a factor of $3$ for geodesic metrics on a pair of trees. We complement this result by providing a polynomial time $O(\\min\\{n, \\sqrt{rn}\\})$-approximation algorithm for computing the GH distance between a pair of metric trees, where $r$ is the ratio of the longest edge length in both trees to the shortest edge length. For metric trees with unit length edges, this yields an $O(\\sqrt{n})$-approximation al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05751","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-18T00:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGO7KKI0CBPeU2HFdiqD2Y2GWgPRPThp91KJLLWosE+Rw9OEKO57GoNANXIUAVxka1iu+YZCsq/vNM9WWfgPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:56:03.163056Z"},"content_sha256":"dc608102a099a82687173b564f3c0c8bfa59000addbd056eaaa655cd1076c044","schema_version":"1.0","event_id":"sha256:dc608102a099a82687173b564f3c0c8bfa59000addbd056eaaa655cd1076c044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/bundle.json","state_url":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/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-26T17:56:03Z","links":{"resolver":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3","bundle":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/bundle.json","state":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KLZNNRUYVQ44WAZEOVCQY5HXC3","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":"41087e2c89412198783987e98765f511e2715b952aad5248fac64f7772463719","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T19:04:04Z","title_canon_sha256":"cb12d6eb02d60fe715fe7ecdd578f9f6c4f410e87e95fd7c949fc778b0805640"},"schema_version":"1.0","source":{"id":"1509.05751","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05751","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05751v2","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05751","created_at":"2026-05-18T00:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"KLZNNRUYVQ44","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KLZNNRUYVQ44WAZE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KLZNNRUY","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:dc608102a099a82687173b564f3c0c8bfa59000addbd056eaaa655cd1076c044","target":"graph","created_at":"2026-05-18T00:42:33Z","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":"The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is $\\mathrm{NP}$-hard to approximate the Gromov-Hausdorff distance better than a factor of $3$ for geodesic metrics on a pair of trees. We complement this result by providing a polynomial time $O(\\min\\{n, \\sqrt{rn}\\})$-approximation algorithm for computing the GH distance between a pair of metric trees, where $r$ is the ratio of the longest edge length in both trees to the shortest edge length. For metric trees with unit length edges, this yields an $O(\\sqrt{n})$-approximation al","authors_text":"Abhinandan Nath, Anastasios Sidiropoulos, Kyle Fox, Pankaj K. Agarwal, Yusu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T19:04:04Z","title":"Computing the Gromov-Hausdorff Distance for Metric Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05751","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:b6ec22e5ea747e090b2828a1151bef505797094825b3381405559c8e281dc911","target":"record","created_at":"2026-05-18T00:42:33Z","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":"41087e2c89412198783987e98765f511e2715b952aad5248fac64f7772463719","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T19:04:04Z","title_canon_sha256":"cb12d6eb02d60fe715fe7ecdd578f9f6c4f410e87e95fd7c949fc778b0805640"},"schema_version":"1.0","source":{"id":"1509.05751","kind":"arxiv","version":2}},"canonical_sha256":"52f2d6c698ac39cb032475450c74f716eca340c0b5c1e89437ce72e65cd37285","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f2d6c698ac39cb032475450c74f716eca340c0b5c1e89437ce72e65cd37285","first_computed_at":"2026-05-18T00:42:33.298722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:33.298722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gHeJ77Dq2v0xC7HVWICW+dWwvrDU1acspQrIe3FIXNJTSPCEFPW6SlIAjZ3kRTeQPeWjMXvHYmFqOfin1UxbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:33.299812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05751","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6ec22e5ea747e090b2828a1151bef505797094825b3381405559c8e281dc911","sha256:dc608102a099a82687173b564f3c0c8bfa59000addbd056eaaa655cd1076c044"],"state_sha256":"0f30714379957973eb925fbe4d12cee6bc4bbad82af1454dd2730f3601f39b22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEc+wnA7dc6a5ucYEuI/iD4MYu/Aodfq7WU3IT2RSRkffWm9z/ddtDxdcUjMqONPbqeMfAw7GDxuzzLbs+hAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:56:03.166611Z","bundle_sha256":"d6f488d4410efff36b6859b1d13d3b83bd974c113605dd31d6f31f971a3dbc56"}}