{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SEVJ6XZESGMXEIIXVVYA6X4WKO","short_pith_number":"pith:SEVJ6XZE","canonical_record":{"source":{"id":"1810.10866","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T19:22:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a5640ddcb65422ab120388398de2f15d0187c166f972be7bcc1b1edd604bc080","abstract_canon_sha256":"5c9866d9739d8fe6822541a4ce71ed8d0e3925bdaf6b24a30e8a9979b80d60b6"},"schema_version":"1.0"},"canonical_sha256":"912a9f5f249199722117ad700f5f9653a280fcae260d683da8ba06288061ec1c","source":{"kind":"arxiv","id":"1810.10866","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10866","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10866v3","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10866","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"SEVJ6XZESGMX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SEVJ6XZESGMXEIIX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SEVJ6XZE","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SEVJ6XZESGMXEIIXVVYA6X4WKO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10866","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T19:22:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a5640ddcb65422ab120388398de2f15d0187c166f972be7bcc1b1edd604bc080","abstract_canon_sha256":"5c9866d9739d8fe6822541a4ce71ed8d0e3925bdaf6b24a30e8a9979b80d60b6"},"schema_version":"1.0"},"canonical_sha256":"912a9f5f249199722117ad700f5f9653a280fcae260d683da8ba06288061ec1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.927160Z","signature_b64":"qX3c8SKMrz1MyI6PhRdGzCGoJXtzduRyxydrrp/WVuwTF+9YUKPrFfNjdaC2RvvurhsgK1rjxvvgyld9uy86BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"912a9f5f249199722117ad700f5f9653a280fcae260d683da8ba06288061ec1c","last_reissued_at":"2026-05-18T00:00:42.926777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.926777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10866","source_version":3,"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-05-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6oL/65r/ZVipLKxlWbbZVkeMIk3rgtT01LCoeifq2A+c8o3RmjaZqyatHI1aJ8y2KYe8HBhA+sT/zzH/ZmUBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:01:18.907960Z"},"content_sha256":"9528f7a7a831db3d756317119d6b3b69392439b75f8006cb7f0f64a741ab8d95","schema_version":"1.0","event_id":"sha256:9528f7a7a831db3d756317119d6b3b69392439b75f8006cb7f0f64a741ab8d95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SEVJ6XZESGMXEIIXVVYA6X4WKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional Set Matching for Graph Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hao Ding, Wei Wang, Yizhou Sun, Yunsheng Bai","submitted_at":"2018-10-23T19:22:48Z","abstract_excerpt":"We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/similarity metrics. We demonstrate our model using the Graph Edit Distance (GED) as the example metric. Experiments on three real graph datasets demonstrate that our model achieves the state-of-the-art performance on graph similarity search."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10866","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIiGce/4ghoQUu/hLcXR75q3wVE52eEQr81scMKXiHuf13WgmZIWhlZVYrbjuccgcJ4SzB6PhODzpj9ix454Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:01:18.908634Z"},"content_sha256":"1de6ba71b3cbd4df2143d2a09c12403be976868194909a1bc0f85227eff827e2","schema_version":"1.0","event_id":"sha256:1de6ba71b3cbd4df2143d2a09c12403be976868194909a1bc0f85227eff827e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO/bundle.json","state_url":"https://pith.science/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO/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-05-29T15:01:18Z","links":{"resolver":"https://pith.science/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO","bundle":"https://pith.science/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO/bundle.json","state":"https://pith.science/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEVJ6XZESGMXEIIXVVYA6X4WKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SEVJ6XZESGMXEIIXVVYA6X4WKO","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":"5c9866d9739d8fe6822541a4ce71ed8d0e3925bdaf6b24a30e8a9979b80d60b6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T19:22:48Z","title_canon_sha256":"a5640ddcb65422ab120388398de2f15d0187c166f972be7bcc1b1edd604bc080"},"schema_version":"1.0","source":{"id":"1810.10866","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10866","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10866v3","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10866","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"SEVJ6XZESGMX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SEVJ6XZESGMXEIIX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SEVJ6XZE","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:1de6ba71b3cbd4df2143d2a09c12403be976868194909a1bc0f85227eff827e2","target":"graph","created_at":"2026-05-18T00:00:42Z","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"},"paper":{"abstract_excerpt":"We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/similarity metrics. We demonstrate our model using the Graph Edit Distance (GED) as the example metric. Experiments on three real graph datasets demonstrate that our model achieves the state-of-the-art performance on graph similarity search.","authors_text":"Hao Ding, Wei Wang, Yizhou Sun, Yunsheng Bai","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T19:22:48Z","title":"Convolutional Set Matching for Graph Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10866","kind":"arxiv","version":3},"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:9528f7a7a831db3d756317119d6b3b69392439b75f8006cb7f0f64a741ab8d95","target":"record","created_at":"2026-05-18T00:00:42Z","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":"5c9866d9739d8fe6822541a4ce71ed8d0e3925bdaf6b24a30e8a9979b80d60b6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-23T19:22:48Z","title_canon_sha256":"a5640ddcb65422ab120388398de2f15d0187c166f972be7bcc1b1edd604bc080"},"schema_version":"1.0","source":{"id":"1810.10866","kind":"arxiv","version":3}},"canonical_sha256":"912a9f5f249199722117ad700f5f9653a280fcae260d683da8ba06288061ec1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"912a9f5f249199722117ad700f5f9653a280fcae260d683da8ba06288061ec1c","first_computed_at":"2026-05-18T00:00:42.926777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.926777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qX3c8SKMrz1MyI6PhRdGzCGoJXtzduRyxydrrp/WVuwTF+9YUKPrFfNjdaC2RvvurhsgK1rjxvvgyld9uy86BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.927160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10866","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9528f7a7a831db3d756317119d6b3b69392439b75f8006cb7f0f64a741ab8d95","sha256:1de6ba71b3cbd4df2143d2a09c12403be976868194909a1bc0f85227eff827e2"],"state_sha256":"2a2860b30b4f4c281838c8c0517ec40c23fd96666f119fe9bfb1281103677dbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uy8lv+ISngSyaweaNQh9GiFcHPOzZwhIWHIcv+2tozGa4Fpu4wZyj4rQ50or3N/p+dxLW39QyHXxeMzsbcwLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:01:18.912028Z","bundle_sha256":"c0604394a059b7051543d87b6c9ef41ab0e8715bae04f6af5f54e38a606b1d7c"}}