{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HRWVFN33SAZBBBZEHTCWPO5AWX","short_pith_number":"pith:HRWVFN33","canonical_record":{"source":{"id":"1706.05476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-17T05:25:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b099f74df0fc891da822744c71c2b95218f8cd992ac77262202d2c835ac2b930","abstract_canon_sha256":"559c198707456cd0f64d5d2c4f3cd285beb1cf7a90ec1df525c3bc4cbbfbbaf0"},"schema_version":"1.0"},"canonical_sha256":"3c6d52b77b90321087243cc567bba0b5f70559edb58b03adbaeef040038442f1","source":{"kind":"arxiv","id":"1706.05476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05476","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05476v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05476","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"HRWVFN33SAZB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRWVFN33SAZBBBZE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRWVFN33","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HRWVFN33SAZBBBZEHTCWPO5AWX","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-17T05:25:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b099f74df0fc891da822744c71c2b95218f8cd992ac77262202d2c835ac2b930","abstract_canon_sha256":"559c198707456cd0f64d5d2c4f3cd285beb1cf7a90ec1df525c3bc4cbbfbbaf0"},"schema_version":"1.0"},"canonical_sha256":"3c6d52b77b90321087243cc567bba0b5f70559edb58b03adbaeef040038442f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.663861Z","signature_b64":"33w+BK62WLCABt9rd9TBzwksdkklgp8lZ1yA6x+64GRsDqmSt7vPwve2gZgtt4yfS0W44OdMtvlIw+udrfNHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c6d52b77b90321087243cc567bba0b5f70559edb58b03adbaeef040038442f1","last_reissued_at":"2026-05-18T00:25:11.663424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.663424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05476","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-05-18T00:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1y5VZyGBFfF37CH7A6UcPNvVdZkerj8FC52KMLGr7GY4hk4lvLrz6GO9q7QmsVbCciBlO/66QGaqtqP8N36CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:49:00.335310Z"},"content_sha256":"555de70d4f578b356d59c52ee93133ae6908ba303423feac54b1ee38d6b67e05","schema_version":"1.0","event_id":"sha256:555de70d4f578b356d59c52ee93133ae6908ba303423feac54b1ee38d6b67e05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HRWVFN33SAZBBBZEHTCWPO5AWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Probabilistic Approach for Graph Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Lei Chen, Xiang Lian, Xun Jian, Zijian Li","submitted_at":"2017-06-17T05:25:10Z","abstract_excerpt":"Graph similarity search is a common and fundamental operation in graph databases. One of the most popular graph similarity measures is the Graph Edit Distance (GED) mainly because of its broad applicability and high interpretability. Despite its prevalence, exact GED computation is proved to be NP-hard, which could result in unsatisfactory computational efficiency on large graphs. However, exactly accurate search results are usually unnecessary for real-world applications especially when the responsiveness is far more important than the accuracy. Thus, in this paper, we propose a novel probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05476","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":""},"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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+LJWSYd/L3ix26LwWuSeCfHWWiuqS2oY2lKBxLVbwO+NmeQX8GSes1fbp6TB9h8MdOEVVKR7pAn0z7d6PNyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:49:00.335657Z"},"content_sha256":"1bea9e750c2c1048c5c0e789d50db5195d5bfe084d0229c0236c5f9d61118633","schema_version":"1.0","event_id":"sha256:1bea9e750c2c1048c5c0e789d50db5195d5bfe084d0229c0236c5f9d61118633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRWVFN33SAZBBBZEHTCWPO5AWX/bundle.json","state_url":"https://pith.science/pith/HRWVFN33SAZBBBZEHTCWPO5AWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRWVFN33SAZBBBZEHTCWPO5AWX/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-06-03T15:49:00Z","links":{"resolver":"https://pith.science/pith/HRWVFN33SAZBBBZEHTCWPO5AWX","bundle":"https://pith.science/pith/HRWVFN33SAZBBBZEHTCWPO5AWX/bundle.json","state":"https://pith.science/pith/HRWVFN33SAZBBBZEHTCWPO5AWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRWVFN33SAZBBBZEHTCWPO5AWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HRWVFN33SAZBBBZEHTCWPO5AWX","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":"559c198707456cd0f64d5d2c4f3cd285beb1cf7a90ec1df525c3bc4cbbfbbaf0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-17T05:25:10Z","title_canon_sha256":"b099f74df0fc891da822744c71c2b95218f8cd992ac77262202d2c835ac2b930"},"schema_version":"1.0","source":{"id":"1706.05476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05476","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05476v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05476","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"HRWVFN33SAZB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRWVFN33SAZBBBZE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRWVFN33","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:1bea9e750c2c1048c5c0e789d50db5195d5bfe084d0229c0236c5f9d61118633","target":"graph","created_at":"2026-05-18T00:25: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"},"paper":{"abstract_excerpt":"Graph similarity search is a common and fundamental operation in graph databases. One of the most popular graph similarity measures is the Graph Edit Distance (GED) mainly because of its broad applicability and high interpretability. Despite its prevalence, exact GED computation is proved to be NP-hard, which could result in unsatisfactory computational efficiency on large graphs. However, exactly accurate search results are usually unnecessary for real-world applications especially when the responsiveness is far more important than the accuracy. Thus, in this paper, we propose a novel probabi","authors_text":"Lei Chen, Xiang Lian, Xun Jian, Zijian Li","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-17T05:25:10Z","title":"An Efficient Probabilistic Approach for Graph Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05476","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:555de70d4f578b356d59c52ee93133ae6908ba303423feac54b1ee38d6b67e05","target":"record","created_at":"2026-05-18T00:25: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":"559c198707456cd0f64d5d2c4f3cd285beb1cf7a90ec1df525c3bc4cbbfbbaf0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-06-17T05:25:10Z","title_canon_sha256":"b099f74df0fc891da822744c71c2b95218f8cd992ac77262202d2c835ac2b930"},"schema_version":"1.0","source":{"id":"1706.05476","kind":"arxiv","version":2}},"canonical_sha256":"3c6d52b77b90321087243cc567bba0b5f70559edb58b03adbaeef040038442f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c6d52b77b90321087243cc567bba0b5f70559edb58b03adbaeef040038442f1","first_computed_at":"2026-05-18T00:25:11.663424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.663424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33w+BK62WLCABt9rd9TBzwksdkklgp8lZ1yA6x+64GRsDqmSt7vPwve2gZgtt4yfS0W44OdMtvlIw+udrfNHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.663861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:555de70d4f578b356d59c52ee93133ae6908ba303423feac54b1ee38d6b67e05","sha256:1bea9e750c2c1048c5c0e789d50db5195d5bfe084d0229c0236c5f9d61118633"],"state_sha256":"06a7543479d0e34ebbd9a53fe65f1e37b2abda962aac34bc2a793644af28c7c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWrlRtWZQEKhecMfkfsYDdWAlzRWUdKt77MngVFcb7EcT16B2Xu0pjDm9qO2ELSbmz6u3ExOds5IpdWjYxnQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:49:00.337506Z","bundle_sha256":"c1590f7f577a030907b43fbe1d0b5842df1d50f1f948ca4c71054ee75743e09f"}}