{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MAMEVYHRJYXCZX7SOZHRP7SU4P","short_pith_number":"pith:MAMEVYHR","canonical_record":{"source":{"id":"2011.15039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T17:41:02Z","cross_cats_sorted":[],"title_canon_sha256":"9182efad896d836dbe0d10714f8ccc34d460774d88278348ef36b440a5da4d23","abstract_canon_sha256":"d79a012727e862c79943a77d5f9540d52e561657b2a376c6f019459b16ed8151"},"schema_version":"1.0"},"canonical_sha256":"60184ae0f14e2e2cdff2764f17fe54e3ec331feb38167473561e0826ef506725","source":{"kind":"arxiv","id":"2011.15039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.15039","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2011.15039v2","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.15039","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"MAMEVYHRJYXC","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAMEVYHRJYXCZX7S","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAMEVYHR","created_at":"2026-07-05T01:56:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MAMEVYHRJYXCZX7SOZHRP7SU4P","target":"record","payload":{"canonical_record":{"source":{"id":"2011.15039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T17:41:02Z","cross_cats_sorted":[],"title_canon_sha256":"9182efad896d836dbe0d10714f8ccc34d460774d88278348ef36b440a5da4d23","abstract_canon_sha256":"d79a012727e862c79943a77d5f9540d52e561657b2a376c6f019459b16ed8151"},"schema_version":"1.0"},"canonical_sha256":"60184ae0f14e2e2cdff2764f17fe54e3ec331feb38167473561e0826ef506725","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:32.863931Z","signature_b64":"w2eT8I4Yz13rdUJj4E1/s4nrTPvY+7vcGrooXDYPXJ9vNz3c2OQxxl8UbLPl9dXm8hfJat8dRmdoshZfKA2IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60184ae0f14e2e2cdff2764f17fe54e3ec331feb38167473561e0826ef506725","last_reissued_at":"2026-07-05T01:56:32.863533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:32.863533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.15039","source_version":2,"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-05T01:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xd25QMEQ3feBkEVsyP+urmLkR2iGXxXOI2s9axs4T33IYlLrSY/fYvtRNpgm4IooZDs1gGXBbjQXXjqKgNSjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:14:40.530417Z"},"content_sha256":"dbb140a64158a9ba4648c23d8aa5afd65349c4fda5c7543a3ca17e3e32286b82","schema_version":"1.0","event_id":"sha256:dbb140a64158a9ba4648c23d8aa5afd65349c4fda5c7543a3ca17e3e32286b82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MAMEVYHRJYXCZX7SOZHRP7SU4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Learning of Graph Edit Distance via Dynamic Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junchi Yan, Runzhong Wang, Tianqi Zhang, Tianshu Yu, Xiaokang Yang","submitted_at":"2020-11-30T17:41:02Z","abstract_excerpt":"Graph Edit Distance (GED) is a popular similarity measurement for pairwise graphs and it also refers to the recovery of the edit path from the source graph to the target graph. Traditional A* algorithm suffers scalability issues due to its exhaustive nature, whose search heuristics heavily rely on human prior knowledge. This paper presents a hybrid approach by combing the interpretability of traditional search-based techniques for producing the edit path, as well as the efficiency and adaptivity of deep embedding models to achieve a cost-effective GED solver. Inspired by dynamic programming, n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.15039","kind":"arxiv","version":2},"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/2011.15039/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-05T01:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYszn0pCZ6nzVFDqtKBKevArTiMR6j3PXfM7wvFchr4YZGl909c45JwehZHhjMscMlcdu+O+5y9LJB6GF3fuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:14:40.531015Z"},"content_sha256":"7ab3e721aa72c6d02face228e9b38ab6801be9b80c524a838765c3a0338ec44a","schema_version":"1.0","event_id":"sha256:7ab3e721aa72c6d02face228e9b38ab6801be9b80c524a838765c3a0338ec44a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P/bundle.json","state_url":"https://pith.science/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P/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-13T08:14:40Z","links":{"resolver":"https://pith.science/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P","bundle":"https://pith.science/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P/bundle.json","state":"https://pith.science/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAMEVYHRJYXCZX7SOZHRP7SU4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MAMEVYHRJYXCZX7SOZHRP7SU4P","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":"d79a012727e862c79943a77d5f9540d52e561657b2a376c6f019459b16ed8151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T17:41:02Z","title_canon_sha256":"9182efad896d836dbe0d10714f8ccc34d460774d88278348ef36b440a5da4d23"},"schema_version":"1.0","source":{"id":"2011.15039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.15039","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2011.15039v2","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.15039","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"MAMEVYHRJYXC","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAMEVYHRJYXCZX7S","created_at":"2026-07-05T01:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAMEVYHR","created_at":"2026-07-05T01:56:32Z"}],"graph_snapshots":[{"event_id":"sha256:7ab3e721aa72c6d02face228e9b38ab6801be9b80c524a838765c3a0338ec44a","target":"graph","created_at":"2026-07-05T01:56:32Z","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/2011.15039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Edit Distance (GED) is a popular similarity measurement for pairwise graphs and it also refers to the recovery of the edit path from the source graph to the target graph. Traditional A* algorithm suffers scalability issues due to its exhaustive nature, whose search heuristics heavily rely on human prior knowledge. This paper presents a hybrid approach by combing the interpretability of traditional search-based techniques for producing the edit path, as well as the efficiency and adaptivity of deep embedding models to achieve a cost-effective GED solver. Inspired by dynamic programming, n","authors_text":"Junchi Yan, Runzhong Wang, Tianqi Zhang, Tianshu Yu, Xiaokang Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T17:41:02Z","title":"Combinatorial Learning of Graph Edit Distance via Dynamic Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.15039","kind":"arxiv","version":2},"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:dbb140a64158a9ba4648c23d8aa5afd65349c4fda5c7543a3ca17e3e32286b82","target":"record","created_at":"2026-07-05T01:56:32Z","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":"d79a012727e862c79943a77d5f9540d52e561657b2a376c6f019459b16ed8151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T17:41:02Z","title_canon_sha256":"9182efad896d836dbe0d10714f8ccc34d460774d88278348ef36b440a5da4d23"},"schema_version":"1.0","source":{"id":"2011.15039","kind":"arxiv","version":2}},"canonical_sha256":"60184ae0f14e2e2cdff2764f17fe54e3ec331feb38167473561e0826ef506725","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60184ae0f14e2e2cdff2764f17fe54e3ec331feb38167473561e0826ef506725","first_computed_at":"2026-07-05T01:56:32.863533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:56:32.863533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w2eT8I4Yz13rdUJj4E1/s4nrTPvY+7vcGrooXDYPXJ9vNz3c2OQxxl8UbLPl9dXm8hfJat8dRmdoshZfKA2IDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:56:32.863931Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.15039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbb140a64158a9ba4648c23d8aa5afd65349c4fda5c7543a3ca17e3e32286b82","sha256:7ab3e721aa72c6d02face228e9b38ab6801be9b80c524a838765c3a0338ec44a"],"state_sha256":"3072853ab0d5f965a18b9391e4f671014c40555b14e4946f5df8c5eb156d790f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BzmHHz06bE7kBUNGPdoHrwlflTB3RDDgI5HjIkZs5e2ezsYaEyJpCmU3qzU6vDObnv7PBgYimW/XDtZJ+gOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:14:40.536706Z","bundle_sha256":"f9cabbc82b76a5039ceccb6955a824a9668852a84f19fb8fb7dbb56f519b5d0d"}}