{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GN4AKKBMIGGPLXG2CY6CE7TQOX","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":"147b196d34a2e2f8d31ba4bd6f55da40031ed1e1b6a9d223cd2473e04503ffdc","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-25T09:55:14Z","title_canon_sha256":"daff0088babae720dda24b66b3c76cb5b8648e016975f619b073248a6c0e43b7"},"schema_version":"1.0","source":{"id":"2412.18857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.18857","created_at":"2026-07-05T09:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"2412.18857v1","created_at":"2026-07-05T09:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18857","created_at":"2026-07-05T09:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"GN4AKKBMIGGP","created_at":"2026-07-05T09:54:12Z"},{"alias_kind":"pith_short_16","alias_value":"GN4AKKBMIGGPLXG2","created_at":"2026-07-05T09:54:12Z"},{"alias_kind":"pith_short_8","alias_value":"GN4AKKBM","created_at":"2026-07-05T09:54:12Z"}],"graph_snapshots":[{"event_id":"sha256:25a63052671793be3d2c719a8577274192a4c21adae954fa80568e5c7ceca817","target":"graph","created_at":"2026-07-05T09:54:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.18857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Da Yan, Qihao Cheng, Qin Zhang, Tianhao Wu, Zhongyi Huang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-25T09:55:14Z","title":"Computing Approximate Graph Edit Distance via Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18857","kind":"arxiv","version":1},"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:45992c2aea406f05b319bdd84b7c2479622dcf5d9bc2edf7de486aac39f4f49d","target":"record","created_at":"2026-07-05T09:54:12Z","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":"147b196d34a2e2f8d31ba4bd6f55da40031ed1e1b6a9d223cd2473e04503ffdc","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-25T09:55:14Z","title_canon_sha256":"daff0088babae720dda24b66b3c76cb5b8648e016975f619b073248a6c0e43b7"},"schema_version":"1.0","source":{"id":"2412.18857","kind":"arxiv","version":1}},"canonical_sha256":"337805282c418cf5dcda163c227e7075edfdd69775ce68c0aae0da31047f6acb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"337805282c418cf5dcda163c227e7075edfdd69775ce68c0aae0da31047f6acb","first_computed_at":"2026-07-05T09:54:12.006929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:12.006929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XL9XlppbMu7+lSCVNNyDjPoQcp89PTwOvCdDo6T3zxrCxNuhJteGRzSlsWGVFz96NtyjV9ocJ9X93UqzWywBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:12.007339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.18857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45992c2aea406f05b319bdd84b7c2479622dcf5d9bc2edf7de486aac39f4f49d","sha256:25a63052671793be3d2c719a8577274192a4c21adae954fa80568e5c7ceca817"],"state_sha256":"373f1d3dad86b9d3127fa415862c954e6dd39183e147d36aba474a91bb0a54b9"}