{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KLZNNRUYVQ44WAZEOVCQY5HXC3","short_pith_number":"pith:KLZNNRUY","schema_version":"1.0","canonical_sha256":"52f2d6c698ac39cb032475450c74f716eca340c0b5c1e89437ce72e65cd37285","source":{"kind":"arxiv","id":"1509.05751","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05751","created_at":"2026-05-18T00:42:33.298820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05751v2","created_at":"2026-05-18T00:42:33.298820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05751","created_at":"2026-05-18T00:42:33.298820+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLZNNRUYVQ44","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLZNNRUYVQ44WAZE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLZNNRUY","created_at":"2026-05-18T12:29:29.992203+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/KLZNNRUYVQ44WAZEOVCQY5HXC3","json":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3.json","graph_json":"https://pith.science/api/pith-number/KLZNNRUYVQ44WAZEOVCQY5HXC3/graph.json","events_json":"https://pith.science/api/pith-number/KLZNNRUYVQ44WAZEOVCQY5HXC3/events.json","paper":"https://pith.science/paper/KLZNNRUY"},"agent_actions":{"view_html":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3","download_json":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3.json","view_paper":"https://pith.science/paper/KLZNNRUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05751&json=true","fetch_graph":"https://pith.science/api/pith-number/KLZNNRUYVQ44WAZEOVCQY5HXC3/graph.json","fetch_events":"https://pith.science/api/pith-number/KLZNNRUYVQ44WAZEOVCQY5HXC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/action/storage_attestation","attest_author":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/action/author_attestation","sign_citation":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/action/citation_signature","submit_replication":"https://pith.science/pith/KLZNNRUYVQ44WAZEOVCQY5HXC3/action/replication_record"}},"created_at":"2026-05-18T00:42:33.298820+00:00","updated_at":"2026-05-18T00:42:33.298820+00:00"}