{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4LES4BWU5I7B2SAZUFYCBJVIK3","short_pith_number":"pith:4LES4BWU","canonical_record":{"source":{"id":"1606.00996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T07:51:56Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"bcf6a92559c67c10f26ae4e29cfc95e6d386d8c1e0635a45d344ebf1f60cf914","abstract_canon_sha256":"64cc22c7a357484af3de878760a4cba1ca833caa0f8effbde8a112f30688064f"},"schema_version":"1.0"},"canonical_sha256":"e2c92e06d4ea3e1d4819a17020a6a856e41a0d810faec229b0bddfe5c2da51ce","source":{"kind":"arxiv","id":"1606.00996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00996","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00996v1","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00996","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"4LES4BWU5I7B","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4LES4BWU5I7B2SAZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4LES4BWU","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4LES4BWU5I7B2SAZUFYCBJVIK3","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T07:51:56Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"bcf6a92559c67c10f26ae4e29cfc95e6d386d8c1e0635a45d344ebf1f60cf914","abstract_canon_sha256":"64cc22c7a357484af3de878760a4cba1ca833caa0f8effbde8a112f30688064f"},"schema_version":"1.0"},"canonical_sha256":"e2c92e06d4ea3e1d4819a17020a6a856e41a0d810faec229b0bddfe5c2da51ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:59.923081Z","signature_b64":"7egmF0W7UgjekPZJZohQYdYks2jUSZGV3XLHLv1qFFLKmTaHjn1ag3Sy8zMegLiQBznNmy1a/0ceuhlbPgVEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2c92e06d4ea3e1d4819a17020a6a856e41a0d810faec229b0bddfe5c2da51ce","last_reissued_at":"2026-05-18T01:12:59.922648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:59.922648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00996","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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2sUiUpnxhOGhNuaAlm0Vw6mv/j+sM2LUnv8HWJFqSxyQqjo8CC3Cy7xBlA5r/ZfqNrj9ww5ws/QJRM5pCZfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:32:31.184632Z"},"content_sha256":"3e6d8e561ebfe616314a8568d12d88038587f5a0bbf1249bd2e62338545cfd3d","schema_version":"1.0","event_id":"sha256:3e6d8e561ebfe616314a8568d12d88038587f5a0bbf1249bd2e62338545cfd3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4LES4BWU5I7B2SAZUFYCBJVIK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Minimal Variance Estimator for the Cardinality of Big Data Set Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Aviv Yehezkel, Liran Katzir, Reuven Cohen","submitted_at":"2016-06-03T07:51:56Z","abstract_excerpt":"In recent years there has been a growing interest in developing \"streaming algorithms\" for efficient processing and querying of continuous data streams. These algorithms seek to provide accurate results while minimizing the required storage and the processing time, at the price of a small inaccuracy in their output. A fundamental query of interest is the intersection size of two big data streams. This problem arises in many different application areas, such as network monitoring, database systems, data integration and information retrieval. In this paper we develop a new algorithm for this pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00996","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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNtIWk3HAU/Arm0GU0aZIH58Fu8OVkN8z0MrOSLTi+uGR7kBJKUAbgGZ1xfKMOdJc88O32G9BNtD0Q6yqEJ1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:32:31.184977Z"},"content_sha256":"6b8720efaf00862dcecaf0164a15785964d2294fcf5d8e63a855f6b95842a18c","schema_version":"1.0","event_id":"sha256:6b8720efaf00862dcecaf0164a15785964d2294fcf5d8e63a855f6b95842a18c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LES4BWU5I7B2SAZUFYCBJVIK3/bundle.json","state_url":"https://pith.science/pith/4LES4BWU5I7B2SAZUFYCBJVIK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LES4BWU5I7B2SAZUFYCBJVIK3/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-27T03:32:31Z","links":{"resolver":"https://pith.science/pith/4LES4BWU5I7B2SAZUFYCBJVIK3","bundle":"https://pith.science/pith/4LES4BWU5I7B2SAZUFYCBJVIK3/bundle.json","state":"https://pith.science/pith/4LES4BWU5I7B2SAZUFYCBJVIK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LES4BWU5I7B2SAZUFYCBJVIK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4LES4BWU5I7B2SAZUFYCBJVIK3","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":"64cc22c7a357484af3de878760a4cba1ca833caa0f8effbde8a112f30688064f","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T07:51:56Z","title_canon_sha256":"bcf6a92559c67c10f26ae4e29cfc95e6d386d8c1e0635a45d344ebf1f60cf914"},"schema_version":"1.0","source":{"id":"1606.00996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00996","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00996v1","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00996","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"4LES4BWU5I7B","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4LES4BWU5I7B2SAZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4LES4BWU","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:6b8720efaf00862dcecaf0164a15785964d2294fcf5d8e63a855f6b95842a18c","target":"graph","created_at":"2026-05-18T01:12:59Z","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 recent years there has been a growing interest in developing \"streaming algorithms\" for efficient processing and querying of continuous data streams. These algorithms seek to provide accurate results while minimizing the required storage and the processing time, at the price of a small inaccuracy in their output. A fundamental query of interest is the intersection size of two big data streams. This problem arises in many different application areas, such as network monitoring, database systems, data integration and information retrieval. In this paper we develop a new algorithm for this pro","authors_text":"Aviv Yehezkel, Liran Katzir, Reuven Cohen","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T07:51:56Z","title":"A Minimal Variance Estimator for the Cardinality of Big Data Set Intersection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00996","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:3e6d8e561ebfe616314a8568d12d88038587f5a0bbf1249bd2e62338545cfd3d","target":"record","created_at":"2026-05-18T01:12:59Z","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":"64cc22c7a357484af3de878760a4cba1ca833caa0f8effbde8a112f30688064f","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-03T07:51:56Z","title_canon_sha256":"bcf6a92559c67c10f26ae4e29cfc95e6d386d8c1e0635a45d344ebf1f60cf914"},"schema_version":"1.0","source":{"id":"1606.00996","kind":"arxiv","version":1}},"canonical_sha256":"e2c92e06d4ea3e1d4819a17020a6a856e41a0d810faec229b0bddfe5c2da51ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2c92e06d4ea3e1d4819a17020a6a856e41a0d810faec229b0bddfe5c2da51ce","first_computed_at":"2026-05-18T01:12:59.922648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:59.922648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7egmF0W7UgjekPZJZohQYdYks2jUSZGV3XLHLv1qFFLKmTaHjn1ag3Sy8zMegLiQBznNmy1a/0ceuhlbPgVEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:59.923081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e6d8e561ebfe616314a8568d12d88038587f5a0bbf1249bd2e62338545cfd3d","sha256:6b8720efaf00862dcecaf0164a15785964d2294fcf5d8e63a855f6b95842a18c"],"state_sha256":"bb25abb49b8476637b28fa7250c9c77b17f8ef07207d5ae2a6be90f031938372"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1KHLFwMlNsu0R/TOGcGihVvhiU6QitlPfwFi7CdDwfEirdSP6NRcMrXuyD1u2331QCn+yypOeK7BpkFnb4ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:32:31.186879Z","bundle_sha256":"275f927cfd328efee6751bbe3dbc1b815a71f74410f06665ded740a81aaee098"}}