{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:O4F2M3C2HW67DACLXTUPYIDBUS","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":"e7637e04100909eef2230b0a524ff299341dcde4fb3fa5cc5954ae6d1ab06c22","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-13T10:23:27Z","title_canon_sha256":"1c565b989475648e99a2b643b4c657b52f0a4c44754b90a595eabcf9546020ec"},"schema_version":"1.0","source":{"id":"2412.12185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12185","created_at":"2026-07-05T09:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12185v1","created_at":"2026-07-05T09:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12185","created_at":"2026-07-05T09:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"O4F2M3C2HW67","created_at":"2026-07-05T09:50:11Z"},{"alias_kind":"pith_short_16","alias_value":"O4F2M3C2HW67DACL","created_at":"2026-07-05T09:50:11Z"},{"alias_kind":"pith_short_8","alias_value":"O4F2M3C2","created_at":"2026-07-05T09:50:11Z"}],"graph_snapshots":[{"event_id":"sha256:d708f2b722d17661f2bdf058af3305251b46fabbe699d4720d7535ead8b940e4","target":"graph","created_at":"2026-07-05T09:50:11Z","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.12185/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"\\Graph similarity computation is an essential task in many real-world graph-related applications such as retrieving the similar drugs given a query chemical compound or finding the user's potential friends from the social network database. Graph Edit Distance (GED) and Maximum Common Subgraphs (MCS) are the two commonly used domain-agnostic metrics to evaluate graph similarity in practice. Unfortunately, computing the exact GED is known to be a NP-hard problem. To solve this limitation, neural network based models have been proposed to approximate the calculations of GED/MCS. However, deep lea","authors_text":"Fu Lee Wang, Haoran Xie, Hongjie Zhu, Jingjing Wang, Xiaoliang Xu, Yuxiang Wang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-13T10:23:27Z","title":"Graph Similarity Computation via Interpretable Neural Node Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12185","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:a46b72f024527595952d5a2a40b72a0df95062ba97c0697e4308d7b1665d360e","target":"record","created_at":"2026-07-05T09:50:11Z","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":"e7637e04100909eef2230b0a524ff299341dcde4fb3fa5cc5954ae6d1ab06c22","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-13T10:23:27Z","title_canon_sha256":"1c565b989475648e99a2b643b4c657b52f0a4c44754b90a595eabcf9546020ec"},"schema_version":"1.0","source":{"id":"2412.12185","kind":"arxiv","version":1}},"canonical_sha256":"770ba66c5a3dbdf1804bbce8fc2061a49265b71c6cc90f09c22ff2ddc4379127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"770ba66c5a3dbdf1804bbce8fc2061a49265b71c6cc90f09c22ff2ddc4379127","first_computed_at":"2026-07-05T09:50:11.250363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:11.250363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVefGXnx+X88OCYwa9mUdEIE4LiVm79aS7ervahJht1KHKLAayHlI48KtfHKW3ywCS+xn9q9QAnShON/sy6+Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:11.250792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.12185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a46b72f024527595952d5a2a40b72a0df95062ba97c0697e4308d7b1665d360e","sha256:d708f2b722d17661f2bdf058af3305251b46fabbe699d4720d7535ead8b940e4"],"state_sha256":"f082ba7a9eb18ad585feac61e59c140c538bfe6cdfce8b257b1d1f377b84d424"}