{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GN4AKKBMIGGPLXG2CY6CE7TQOX","short_pith_number":"pith:GN4AKKBM","schema_version":"1.0","canonical_sha256":"337805282c418cf5dcda163c227e7075edfdd69775ce68c0aae0da31047f6acb","source":{"kind":"arxiv","id":"2412.18857","version":1},"attestation_state":"computed","paper":{"title":"Computing Approximate Graph Edit Distance via Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Da Yan, Qihao Cheng, Qin Zhang, Tianhao Wu, Zhongyi Huang","submitted_at":"2024-12-25T09:55:14Z","abstract_excerpt":"Given a graph pair $(G^1, G^2)$, graph edit distance (GED) is defined as the minimum number of edit operations converting $G^1$ to $G^2$. GED is a fundamental operation widely used in many applications, but its exact computation is NP-hard, so the approximation of GED has gained a lot of attention. Data-driven learning-based methods have been found to provide superior results compared to classical approximate algorithms, but they directly fit the coupling relationship between a pair of vertices from their vertex features. We argue that while pairwise vertex features can capture the coupling co"},"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":"2412.18857","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-25T09:55:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"daff0088babae720dda24b66b3c76cb5b8648e016975f619b073248a6c0e43b7","abstract_canon_sha256":"147b196d34a2e2f8d31ba4bd6f55da40031ed1e1b6a9d223cd2473e04503ffdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:12.007339Z","signature_b64":"1XL9XlppbMu7+lSCVNNyDjPoQcp89PTwOvCdDo6T3zxrCxNuhJteGRzSlsWGVFz96NtyjV9ocJ9X93UqzWywBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337805282c418cf5dcda163c227e7075edfdd69775ce68c0aae0da31047f6acb","last_reissued_at":"2026-07-05T09:54:12.006929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:12.006929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Approximate Graph Edit Distance via Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Da Yan, Qihao Cheng, Qin Zhang, Tianhao Wu, Zhongyi Huang","submitted_at":"2024-12-25T09:55:14Z","abstract_excerpt":"Given a graph pair $(G^1, G^2)$, graph edit distance (GED) is defined as the minimum number of edit operations converting $G^1$ to $G^2$. GED is a fundamental operation widely used in many applications, but its exact computation is NP-hard, so the approximation of GED has gained a lot of attention. Data-driven learning-based methods have been found to provide superior results compared to classical approximate algorithms, but they directly fit the coupling relationship between a pair of vertices from their vertex features. We argue that while pairwise vertex features can capture the coupling co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18857","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.18857/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.18857","created_at":"2026-07-05T09:54:12.006986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.18857v1","created_at":"2026-07-05T09:54:12.006986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18857","created_at":"2026-07-05T09:54:12.006986+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN4AKKBMIGGP","created_at":"2026-07-05T09:54:12.006986+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN4AKKBMIGGPLXG2","created_at":"2026-07-05T09:54:12.006986+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN4AKKBM","created_at":"2026-07-05T09:54:12.006986+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/GN4AKKBMIGGPLXG2CY6CE7TQOX","json":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX.json","graph_json":"https://pith.science/api/pith-number/GN4AKKBMIGGPLXG2CY6CE7TQOX/graph.json","events_json":"https://pith.science/api/pith-number/GN4AKKBMIGGPLXG2CY6CE7TQOX/events.json","paper":"https://pith.science/paper/GN4AKKBM"},"agent_actions":{"view_html":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX","download_json":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX.json","view_paper":"https://pith.science/paper/GN4AKKBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.18857&json=true","fetch_graph":"https://pith.science/api/pith-number/GN4AKKBMIGGPLXG2CY6CE7TQOX/graph.json","fetch_events":"https://pith.science/api/pith-number/GN4AKKBMIGGPLXG2CY6CE7TQOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX/action/storage_attestation","attest_author":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX/action/author_attestation","sign_citation":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX/action/citation_signature","submit_replication":"https://pith.science/pith/GN4AKKBMIGGPLXG2CY6CE7TQOX/action/replication_record"}},"created_at":"2026-07-05T09:54:12.006986+00:00","updated_at":"2026-07-05T09:54:12.006986+00:00"}