{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:32ATUXLUPKVZPQLBIV7CPDELOQ","short_pith_number":"pith:32ATUXLU","schema_version":"1.0","canonical_sha256":"de813a5d747aab97c161457e278c8b7402c3a0779bce92023b0ab48440ed0c95","source":{"kind":"arxiv","id":"1304.1188","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.1188","created_at":"2026-05-18T03:28:18.981479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1188v2","created_at":"2026-05-18T03:28:18.981479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1188","created_at":"2026-05-18T03:28:18.981479+00:00"},{"alias_kind":"pith_short_12","alias_value":"32ATUXLUPKVZ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"32ATUXLUPKVZPQLB","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"32ATUXLU","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ","json":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ.json","graph_json":"https://pith.science/api/pith-number/32ATUXLUPKVZPQLBIV7CPDELOQ/graph.json","events_json":"https://pith.science/api/pith-number/32ATUXLUPKVZPQLBIV7CPDELOQ/events.json","paper":"https://pith.science/paper/32ATUXLU"},"agent_actions":{"view_html":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ","download_json":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ.json","view_paper":"https://pith.science/paper/32ATUXLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1188&json=true","fetch_graph":"https://pith.science/api/pith-number/32ATUXLUPKVZPQLBIV7CPDELOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/32ATUXLUPKVZPQLBIV7CPDELOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/action/storage_attestation","attest_author":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/action/author_attestation","sign_citation":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/action/citation_signature","submit_replication":"https://pith.science/pith/32ATUXLUPKVZPQLBIV7CPDELOQ/action/replication_record"}},"created_at":"2026-05-18T03:28:18.981479+00:00","updated_at":"2026-05-18T03:28:18.981479+00:00"}