{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:L4H2YC6QK3DQ3OL5ARSAPZ556F","short_pith_number":"pith:L4H2YC6Q","canonical_record":{"source":{"id":"2503.18245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-24T00:03:16Z","cross_cats_sorted":[],"title_canon_sha256":"b832426626fe9aaf97b4a3f2593d3906f8680fec2d298a7be34b875b62654f54","abstract_canon_sha256":"ba0f6d46c9232abb20aeb1bdf8ea4c548b492f2594d65cc8b5e402b9812864cf"},"schema_version":"1.0"},"canonical_sha256":"5f0fac0bd056c70db97d046407e7bdf165c695f0c30995726a5051924257cd09","source":{"kind":"arxiv","id":"2503.18245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.18245","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2503.18245v1","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18245","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"L4H2YC6QK3DQ","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"L4H2YC6QK3DQ3OL5","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"L4H2YC6Q","created_at":"2026-07-05T10:38:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:L4H2YC6QK3DQ3OL5ARSAPZ556F","target":"record","payload":{"canonical_record":{"source":{"id":"2503.18245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-24T00:03:16Z","cross_cats_sorted":[],"title_canon_sha256":"b832426626fe9aaf97b4a3f2593d3906f8680fec2d298a7be34b875b62654f54","abstract_canon_sha256":"ba0f6d46c9232abb20aeb1bdf8ea4c548b492f2594d65cc8b5e402b9812864cf"},"schema_version":"1.0"},"canonical_sha256":"5f0fac0bd056c70db97d046407e7bdf165c695f0c30995726a5051924257cd09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:05.959625Z","signature_b64":"/p6msXdYdPETIhORia/HqhAv6vK8oWuNe6EZXOgzr0E6+Hq9iAaYey4TshGbS/QtaBliq9hVTL4qqTFT0h9xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0fac0bd056c70db97d046407e7bdf165c695f0c30995726a5051924257cd09","last_reissued_at":"2026-07-05T10:38:05.959056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:05.959056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.18245","source_version":1,"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-07-05T10:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GiFWgiDhiV8qqXz+hGTc8mdmr1bZpKvRn6ePRADwCB6w4uhe6pYBt7uXqVc9My0lCYoIkYnvdpxVoTNG3WrYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:45:03.064755Z"},"content_sha256":"5d35be96c77781e21847044198f87c79cfe6a377108a6a28a58dc3fa2d4c3f58","schema_version":"1.0","event_id":"sha256:5d35be96c77781e21847044198f87c79cfe6a377108a6a28a58dc3fa2d4c3f58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:L4H2YC6QK3DQ3OL5ARSAPZ556F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dong Wen, Hanchen Wang, Wei Huang, Wenjie Zhang, Xuemin Lin, Ying Zhang","submitted_at":"2025-03-24T00:03:16Z","abstract_excerpt":"The Graph Edit Distance (GED) problem, which aims to compute the minimum number of edit operations required to transform one graph into another, is a fundamental challenge in graph analysis with wide-ranging applications. However, due to its NP-hard nature, traditional A* approaches often suffer from scalability issue, making them computationally intractable for large graphs. Many recent deep learning frameworks address GED by formulating it as a regression task, which, while efficient, fails to recover the edit path -- a central interest in GED. Furthermore, recent hybrid approaches that comb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18245","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/2503.18245/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"},"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-07-05T10:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnii7ABv8InVk13Lbk2Ub6WjXOjatjh5j8aThpxJGIesMx/bDPiNHvntcYJYYZnGgd2kvNIKiHitZLfbg21GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:45:03.065551Z"},"content_sha256":"66693a1e7e17aeb79b109ca6ed76724735834df090343236b596ede682c53587","schema_version":"1.0","event_id":"sha256:66693a1e7e17aeb79b109ca6ed76724735834df090343236b596ede682c53587"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F/bundle.json","state_url":"https://pith.science/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F/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-08-06T22:45:03Z","links":{"resolver":"https://pith.science/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F","bundle":"https://pith.science/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F/bundle.json","state":"https://pith.science/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4H2YC6QK3DQ3OL5ARSAPZ556F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:L4H2YC6QK3DQ3OL5ARSAPZ556F","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":"ba0f6d46c9232abb20aeb1bdf8ea4c548b492f2594d65cc8b5e402b9812864cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-24T00:03:16Z","title_canon_sha256":"b832426626fe9aaf97b4a3f2593d3906f8680fec2d298a7be34b875b62654f54"},"schema_version":"1.0","source":{"id":"2503.18245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.18245","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2503.18245v1","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18245","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"L4H2YC6QK3DQ","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"L4H2YC6QK3DQ3OL5","created_at":"2026-07-05T10:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"L4H2YC6Q","created_at":"2026-07-05T10:38:05Z"}],"graph_snapshots":[{"event_id":"sha256:66693a1e7e17aeb79b109ca6ed76724735834df090343236b596ede682c53587","target":"graph","created_at":"2026-07-05T10:38:05Z","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/2503.18245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Graph Edit Distance (GED) problem, which aims to compute the minimum number of edit operations required to transform one graph into another, is a fundamental challenge in graph analysis with wide-ranging applications. However, due to its NP-hard nature, traditional A* approaches often suffer from scalability issue, making them computationally intractable for large graphs. Many recent deep learning frameworks address GED by formulating it as a regression task, which, while efficient, fails to recover the edit path -- a central interest in GED. Furthermore, recent hybrid approaches that comb","authors_text":"Dong Wen, Hanchen Wang, Wei Huang, Wenjie Zhang, Xuemin Lin, Ying Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-24T00:03:16Z","title":"DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18245","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:5d35be96c77781e21847044198f87c79cfe6a377108a6a28a58dc3fa2d4c3f58","target":"record","created_at":"2026-07-05T10:38:05Z","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":"ba0f6d46c9232abb20aeb1bdf8ea4c548b492f2594d65cc8b5e402b9812864cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-24T00:03:16Z","title_canon_sha256":"b832426626fe9aaf97b4a3f2593d3906f8680fec2d298a7be34b875b62654f54"},"schema_version":"1.0","source":{"id":"2503.18245","kind":"arxiv","version":1}},"canonical_sha256":"5f0fac0bd056c70db97d046407e7bdf165c695f0c30995726a5051924257cd09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0fac0bd056c70db97d046407e7bdf165c695f0c30995726a5051924257cd09","first_computed_at":"2026-07-05T10:38:05.959056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:38:05.959056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/p6msXdYdPETIhORia/HqhAv6vK8oWuNe6EZXOgzr0E6+Hq9iAaYey4TshGbS/QtaBliq9hVTL4qqTFT0h9xCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:38:05.959625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.18245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d35be96c77781e21847044198f87c79cfe6a377108a6a28a58dc3fa2d4c3f58","sha256:66693a1e7e17aeb79b109ca6ed76724735834df090343236b596ede682c53587"],"state_sha256":"832911183e9389f976acb4e04e36f27b90980ad5569f3d26ae5aa29c53fd78de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6YIeY2dau59RcLC0puLL3Gd/Fe9py+AuPs7Er9Mn6q2aHzJlzmZv/mma+rTK4DMx4xCAF+hSbg4SvusD3RzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:45:03.070842Z","bundle_sha256":"198170ba0474980ceb302c9d5f0592311235ff16291ea1e4e6262c49632339ec"}}