{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EKWAVUR2OHRFOGU5ZCRNK6KBBH","short_pith_number":"pith:EKWAVUR2","canonical_record":{"source":{"id":"1811.02425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-06T15:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"482e35e6b0cfc8dba416241627cbb61fe812f92b78510027cdee2a363def1b70","abstract_canon_sha256":"acf2a2a152372fffa1e841de523e424c04c675b9187de705395a50bae07963f9"},"schema_version":"1.0"},"canonical_sha256":"22ac0ad23a71e2571a9dc8a2d5794109f6969142fad33e25e16170a498c3ba3f","source":{"kind":"arxiv","id":"1811.02425","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02425","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02425v3","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02425","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"EKWAVUR2OHRF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKWAVUR2OHRFOGU5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKWAVUR2","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EKWAVUR2OHRFOGU5ZCRNK6KBBH","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-06T15:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"482e35e6b0cfc8dba416241627cbb61fe812f92b78510027cdee2a363def1b70","abstract_canon_sha256":"acf2a2a152372fffa1e841de523e424c04c675b9187de705395a50bae07963f9"},"schema_version":"1.0"},"canonical_sha256":"22ac0ad23a71e2571a9dc8a2d5794109f6969142fad33e25e16170a498c3ba3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:34.154524Z","signature_b64":"sK+6bcY4fBF8aqWSTQjztDI5+ZK6h39dsPzR0Obke50mYypRqKw31xMsWe7F0gtT2DQg5cZLIxFt07XXJigJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ac0ad23a71e2571a9dc8a2d5794109f6969142fad33e25e16170a498c3ba3f","last_reissued_at":"2026-05-17T23:40:34.154062Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:34.154062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02425","source_version":3,"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-17T23:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhc4MJw279zLd4uOwtoyKWbdvZAf1TJnj5cBqGsHi3v+b2wQB6hihRTU2fjQD1t1fVcC/bOwr+AsbqNC++6iAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:13:17.174066Z"},"content_sha256":"4058c94aea41a9abb6e638fc8ae4124cc0e7730428895d776a8e0f31f39ce86a","schema_version":"1.0","event_id":"sha256:4058c94aea41a9abb6e638fc8ae4124cc0e7730428895d776a8e0f31f39ce86a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EKWAVUR2OHRFOGU5ZCRNK6KBBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Elena Farahbakhsh Touli, Yusu Wang","submitted_at":"2018-11-06T15:37:05Z","abstract_excerpt":"Gromov-Hausdorff (GH) distance is a natural way to measure the distortion between two metric spaces. However, there has been only limited algorithmic development to compute or approximate this distance. We focus on computing the Gromov-Hausdorff distance between two metric trees. Roughly speaking, a metric tree is a metric space that can be realized by the shortest path metric on a tree. Previously, Agarwal et al. showed that even for trees with unit edge length, it is NP hard to approximate the GH distance between them within a factor of 3. In this paper, we present a fixed-parameter tractabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02425","kind":"arxiv","version":3},"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-17T23:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bU91FDxqmh8QJSW/PEp3gjs0sFAtRpPi73Pltz9woxyG4gsP/cQTrpQJ25ESwSKRYLGbh/r+8MyczUC8NKOCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:13:17.174456Z"},"content_sha256":"66767c6d201ba6b7a099ca1f19f37779cac8efbee12a5e633edbaed4ee57ac00","schema_version":"1.0","event_id":"sha256:66767c6d201ba6b7a099ca1f19f37779cac8efbee12a5e633edbaed4ee57ac00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH/bundle.json","state_url":"https://pith.science/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH/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-06-03T06:13:17Z","links":{"resolver":"https://pith.science/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH","bundle":"https://pith.science/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH/bundle.json","state":"https://pith.science/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKWAVUR2OHRFOGU5ZCRNK6KBBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EKWAVUR2OHRFOGU5ZCRNK6KBBH","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":"acf2a2a152372fffa1e841de523e424c04c675b9187de705395a50bae07963f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-06T15:37:05Z","title_canon_sha256":"482e35e6b0cfc8dba416241627cbb61fe812f92b78510027cdee2a363def1b70"},"schema_version":"1.0","source":{"id":"1811.02425","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02425","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02425v3","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02425","created_at":"2026-05-17T23:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"EKWAVUR2OHRF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKWAVUR2OHRFOGU5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKWAVUR2","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:66767c6d201ba6b7a099ca1f19f37779cac8efbee12a5e633edbaed4ee57ac00","target":"graph","created_at":"2026-05-17T23:40:34Z","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":"Gromov-Hausdorff (GH) distance is a natural way to measure the distortion between two metric spaces. However, there has been only limited algorithmic development to compute or approximate this distance. We focus on computing the Gromov-Hausdorff distance between two metric trees. Roughly speaking, a metric tree is a metric space that can be realized by the shortest path metric on a tree. Previously, Agarwal et al. showed that even for trees with unit edge length, it is NP hard to approximate the GH distance between them within a factor of 3. In this paper, we present a fixed-parameter tractabl","authors_text":"Elena Farahbakhsh Touli, Yusu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-06T15:37:05Z","title":"FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02425","kind":"arxiv","version":3},"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:4058c94aea41a9abb6e638fc8ae4124cc0e7730428895d776a8e0f31f39ce86a","target":"record","created_at":"2026-05-17T23:40:34Z","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":"acf2a2a152372fffa1e841de523e424c04c675b9187de705395a50bae07963f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-06T15:37:05Z","title_canon_sha256":"482e35e6b0cfc8dba416241627cbb61fe812f92b78510027cdee2a363def1b70"},"schema_version":"1.0","source":{"id":"1811.02425","kind":"arxiv","version":3}},"canonical_sha256":"22ac0ad23a71e2571a9dc8a2d5794109f6969142fad33e25e16170a498c3ba3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22ac0ad23a71e2571a9dc8a2d5794109f6969142fad33e25e16170a498c3ba3f","first_computed_at":"2026-05-17T23:40:34.154062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:34.154062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sK+6bcY4fBF8aqWSTQjztDI5+ZK6h39dsPzR0Obke50mYypRqKw31xMsWe7F0gtT2DQg5cZLIxFt07XXJigJDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:34.154524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02425","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4058c94aea41a9abb6e638fc8ae4124cc0e7730428895d776a8e0f31f39ce86a","sha256:66767c6d201ba6b7a099ca1f19f37779cac8efbee12a5e633edbaed4ee57ac00"],"state_sha256":"615520893b1806f6f388d7d18b302aec3fd298eb8dbc4d8ac9ce60cab3dc3c1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APTCD8MA+OIdXwd8tOJGqBTSK+wWxb4yz55A7VfDDx5l+1Zv23HS6chAampUORH9hWiCR1QBxg25gmitO6cTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:13:17.176451Z","bundle_sha256":"3993a49089b7b63cb27dfdae90e7803b08255935535fa7f62598653539bbe486"}}