{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:32ATUXLUPKVZPQLBIV7CPDELOQ","short_pith_number":"pith:32ATUXLU","canonical_record":{"source":{"id":"1304.1188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T21:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"be836ec3b3005c03028493cc61a5d1b19dfdfdfc13d48ab0ba78b2dc27479b66","abstract_canon_sha256":"69f51ff3836181c50a1e40ec97b65db475f02999770ac053726109a94c4957a2"},"schema_version":"1.0"},"canonical_sha256":"de813a5d747aab97c161457e278c8b7402c3a0779bce92023b0ab48440ed0c95","source":{"kind":"arxiv","id":"1304.1188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1188","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1188v2","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1188","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"32ATUXLUPKVZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"32ATUXLUPKVZPQLB","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"32ATUXLU","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:32ATUXLUPKVZPQLBIV7CPDELOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T21:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"be836ec3b3005c03028493cc61a5d1b19dfdfdfc13d48ab0ba78b2dc27479b66","abstract_canon_sha256":"69f51ff3836181c50a1e40ec97b65db475f02999770ac053726109a94c4957a2"},"schema_version":"1.0"},"canonical_sha256":"de813a5d747aab97c161457e278c8b7402c3a0779bce92023b0ab48440ed0c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:18.982013Z","signature_b64":"FqQShTpNtZwOoZYohhyHJ2O9LpI9YUAdaWGU0HuCTCGggZnaORq93niN8wCD7KSwwcsjQZ82NoO5Cr5jtodMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de813a5d747aab97c161457e278c8b7402c3a0779bce92023b0ab48440ed0c95","last_reissued_at":"2026-05-18T03:28:18.981358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:18.981358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1188","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-18T03:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0ES+7nxyAfnw7+XAbKT+IZ3zcI6Bf9wHtrlfsKqBARRAUao/CpACAKemHOg7L+1u1GBgQILT1+3k2YnyHNeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:14:14.006526Z"},"content_sha256":"b26c669d38c019cf0b036f17cb40fb90960cd232a8e9d512dea350b131701834","schema_version":"1.0","event_id":"sha256:b26c669d38c019cf0b036f17cb40fb90960cd232a8e9d512dea350b131701834"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:32ATUXLUPKVZPQLBIV7CPDELOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Approximate A Set Without Knowing Its Size In Advance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gil Segev, Rasmus Pagh, Udi Wieder","submitted_at":"2013-04-03T21:07:05Z","abstract_excerpt":"The dynamic approximate membership problem asks to represent a set S of size n, whose elements are provided in an on-line fashion, supporting membership queries without false negatives and with a false positive rate at most epsilon. That is, the membership algorithm must be correct on each x in S, and may err with probability at most epsilon on each x not in S.\n  We study a well-motivated, yet insufficiently explored, variant of this problem where the size n of the set is not known in advance. Existing optimal approximate membership data structures require that the size is known in advance, bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1188","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-18T03:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2zrD4Xl7aer0fv/0z+wJvqli73FA+omd732A+6lejZxo3YlF2EyPaHCi+uAvt4eBAb+MMDvMVgoTFBYaxgUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:14:14.006959Z"},"content_sha256":"0fde9f942d7266120414d0883be571f3a35195e790c4a758db544b91621fe27a","schema_version":"1.0","event_id":"sha256:0fde9f942d7266120414d0883be571f3a35195e790c4a758db544b91621fe27a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/bundle.json","state_url":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/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-05T01:14:14Z","links":{"resolver":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ","bundle":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/bundle.json","state":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:32ATUXLUPKVZPQLBIV7CPDELOQ","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":"69f51ff3836181c50a1e40ec97b65db475f02999770ac053726109a94c4957a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T21:07:05Z","title_canon_sha256":"be836ec3b3005c03028493cc61a5d1b19dfdfdfc13d48ab0ba78b2dc27479b66"},"schema_version":"1.0","source":{"id":"1304.1188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1188","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1188v2","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1188","created_at":"2026-05-18T03:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"32ATUXLUPKVZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"32ATUXLUPKVZPQLB","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"32ATUXLU","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:0fde9f942d7266120414d0883be571f3a35195e790c4a758db544b91621fe27a","target":"graph","created_at":"2026-05-18T03:28:18Z","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":"The dynamic approximate membership problem asks to represent a set S of size n, whose elements are provided in an on-line fashion, supporting membership queries without false negatives and with a false positive rate at most epsilon. That is, the membership algorithm must be correct on each x in S, and may err with probability at most epsilon on each x not in S.\n  We study a well-motivated, yet insufficiently explored, variant of this problem where the size n of the set is not known in advance. Existing optimal approximate membership data structures require that the size is known in advance, bu","authors_text":"Gil Segev, Rasmus Pagh, Udi Wieder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T21:07:05Z","title":"How to Approximate A Set Without Knowing Its Size In Advance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1188","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:b26c669d38c019cf0b036f17cb40fb90960cd232a8e9d512dea350b131701834","target":"record","created_at":"2026-05-18T03:28:18Z","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":"69f51ff3836181c50a1e40ec97b65db475f02999770ac053726109a94c4957a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-03T21:07:05Z","title_canon_sha256":"be836ec3b3005c03028493cc61a5d1b19dfdfdfc13d48ab0ba78b2dc27479b66"},"schema_version":"1.0","source":{"id":"1304.1188","kind":"arxiv","version":2}},"canonical_sha256":"de813a5d747aab97c161457e278c8b7402c3a0779bce92023b0ab48440ed0c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de813a5d747aab97c161457e278c8b7402c3a0779bce92023b0ab48440ed0c95","first_computed_at":"2026-05-18T03:28:18.981358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:18.981358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FqQShTpNtZwOoZYohhyHJ2O9LpI9YUAdaWGU0HuCTCGggZnaORq93niN8wCD7KSwwcsjQZ82NoO5Cr5jtodMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:18.982013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b26c669d38c019cf0b036f17cb40fb90960cd232a8e9d512dea350b131701834","sha256:0fde9f942d7266120414d0883be571f3a35195e790c4a758db544b91621fe27a"],"state_sha256":"621946d37e59aef5cbb815053ed6db27e88217a2e7510c396bf0f744a6da29d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDKwwHMpH+JQa9hYfXx1r3HhEL9bhd96EckfsT6+/9ttXsnU8U7DaUEjS55AA/wVWpcTovGn3q6dAsLwkFkKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:14:14.010186Z","bundle_sha256":"fa73116761fe0ac2db4f55d4804aa14c8b3ba8ec02e4c5151420a7dae1e6e446"}}