{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AIVVSTKXLA7G3CHC6D3GK3YAU3","short_pith_number":"pith:AIVVSTKX","canonical_record":{"source":{"id":"1809.00458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-03T06:02:21Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"29894c5e418b59b2faa3148accd281207961e73439a0c309dd2f70cff1ca8ac4","abstract_canon_sha256":"3827ab60d677b6e290723074455314e73a49f3175e51ea8e050e61eb81644ee6"},"schema_version":"1.0"},"canonical_sha256":"022b594d57583e6d88e2f0f6656f00a6f311b4fcd41963e9db99f19d4960d42c","source":{"kind":"arxiv","id":"1809.00458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00458","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00458v1","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00458","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"AIVVSTKXLA7G","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIVVSTKXLA7G3CHC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIVVSTKX","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AIVVSTKXLA7G3CHC6D3GK3YAU3","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-03T06:02:21Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"29894c5e418b59b2faa3148accd281207961e73439a0c309dd2f70cff1ca8ac4","abstract_canon_sha256":"3827ab60d677b6e290723074455314e73a49f3175e51ea8e050e61eb81644ee6"},"schema_version":"1.0"},"canonical_sha256":"022b594d57583e6d88e2f0f6656f00a6f311b4fcd41963e9db99f19d4960d42c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:35.190509Z","signature_b64":"fM/Al6CYl0up1fpG7q6KpvnWGosF+dKPxWlrAK5AKIWeBTDHzahcpTG178Po9KtFunAMaMX+8Jk2JRjCimI4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022b594d57583e6d88e2f0f6656f00a6f311b4fcd41963e9db99f19d4960d42c","last_reissued_at":"2026-05-18T00:06:35.190079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:35.190079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00458","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-05-18T00:06:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWJsGlDOtEmTMQwR39iepqWSJeCM4zMPnkS7aBe4S+/fqKwnCFkmBQQjO5KhV3Hxe6K4bm+DCbySh3JbG+q3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:42:31.772765Z"},"content_sha256":"738eca1c80e8ee22041b43bf563ff16e1a6516af0a3bcfe902f92738c7b370bc","schema_version":"1.0","event_id":"sha256:738eca1c80e8ee22041b43bf563ff16e1a6516af0a3bcfe902f92738c7b370bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AIVVSTKXLA7G3CHC6D3GK3YAU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Wenjie Zhang, Yang Yang, Ying Zhang, Zengfeng Huang","submitted_at":"2018-09-03T06:02:21Z","abstract_excerpt":"In this paper, we study the problem of approximate containment similarity search. Given two records Q and X, the containment similarity between Q and X with respect to Q is |Q intersect X|/ |Q|. Given a query record Q and a set of records S, the containment similarity search finds a set of records from S whose containment similarity regarding Q are not less than the given threshold. This problem has many important applications in commercial and scientific fields such as record matching and domain search. Existing solution relies on the asymmetric LSH method by transforming the containment simi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00458","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":""},"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:06:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AjFww5LZ9KydjkA4Nl4RuqnSPKyiLzCa6iVJQZhL1KD42q96mfjzQcYN83/0u0diYzgmJTVGU+D6+RZ65ibAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:42:31.773102Z"},"content_sha256":"a33446fc54f67e2a059097f5d3b0920151d47e291197c443067754e4e986cc45","schema_version":"1.0","event_id":"sha256:a33446fc54f67e2a059097f5d3b0920151d47e291197c443067754e4e986cc45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3/bundle.json","state_url":"https://pith.science/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3/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-02T09:42:31Z","links":{"resolver":"https://pith.science/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3","bundle":"https://pith.science/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3/bundle.json","state":"https://pith.science/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIVVSTKXLA7G3CHC6D3GK3YAU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AIVVSTKXLA7G3CHC6D3GK3YAU3","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":"3827ab60d677b6e290723074455314e73a49f3175e51ea8e050e61eb81644ee6","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-03T06:02:21Z","title_canon_sha256":"29894c5e418b59b2faa3148accd281207961e73439a0c309dd2f70cff1ca8ac4"},"schema_version":"1.0","source":{"id":"1809.00458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00458","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00458v1","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00458","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"AIVVSTKXLA7G","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIVVSTKXLA7G3CHC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIVVSTKX","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a33446fc54f67e2a059097f5d3b0920151d47e291197c443067754e4e986cc45","target":"graph","created_at":"2026-05-18T00:06:35Z","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":"In this paper, we study the problem of approximate containment similarity search. Given two records Q and X, the containment similarity between Q and X with respect to Q is |Q intersect X|/ |Q|. Given a query record Q and a set of records S, the containment similarity search finds a set of records from S whose containment similarity regarding Q are not less than the given threshold. This problem has many important applications in commercial and scientific fields such as record matching and domain search. Existing solution relies on the asymmetric LSH method by transforming the containment simi","authors_text":"Wenjie Zhang, Yang Yang, Ying Zhang, Zengfeng Huang","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-03T06:02:21Z","title":"GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00458","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:738eca1c80e8ee22041b43bf563ff16e1a6516af0a3bcfe902f92738c7b370bc","target":"record","created_at":"2026-05-18T00:06:35Z","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":"3827ab60d677b6e290723074455314e73a49f3175e51ea8e050e61eb81644ee6","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-03T06:02:21Z","title_canon_sha256":"29894c5e418b59b2faa3148accd281207961e73439a0c309dd2f70cff1ca8ac4"},"schema_version":"1.0","source":{"id":"1809.00458","kind":"arxiv","version":1}},"canonical_sha256":"022b594d57583e6d88e2f0f6656f00a6f311b4fcd41963e9db99f19d4960d42c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"022b594d57583e6d88e2f0f6656f00a6f311b4fcd41963e9db99f19d4960d42c","first_computed_at":"2026-05-18T00:06:35.190079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:35.190079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fM/Al6CYl0up1fpG7q6KpvnWGosF+dKPxWlrAK5AKIWeBTDHzahcpTG178Po9KtFunAMaMX+8Jk2JRjCimI4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:35.190509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:738eca1c80e8ee22041b43bf563ff16e1a6516af0a3bcfe902f92738c7b370bc","sha256:a33446fc54f67e2a059097f5d3b0920151d47e291197c443067754e4e986cc45"],"state_sha256":"cbd2390a9c2e75e2250474a8d0235990ca9bfdf20b9a2875e9c444102e3fa4a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SraF67RGDKCjVsVivlcUS+H8riIjR2tAPldG64J9tP+3iQSqt6xwzIwFuRGx2iSUdalWDTw1YjvmZzWiwY7zCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:42:31.775003Z","bundle_sha256":"41dc43fce99ed782d7eec73f477d95c5fd2c63f703d6ca90ed977527b7e8f76c"}}