{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:T7COD7HTQDJV5B36YIUCADC362","short_pith_number":"pith:T7COD7HT","schema_version":"1.0","canonical_sha256":"9fc4e1fcf380d35e877ec228200c5bf6a14932f9e715a991e3616fcda72dfa9b","source":{"kind":"arxiv","id":"2004.12465","version":1},"attestation_state":"computed","paper":{"title":"Succinct Filters for Sets of Unknown Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Mingmou Liu, Yitong Yin","submitted_at":"2020-04-26T20:05:56Z","abstract_excerpt":"The membership problem asks to maintain a set $S\\subseteq[u]$, supporting insertions and membership queries, i.e., testing if a given element is in the set. A data structure that computes exact answers is called a dictionary. When a (small) false positive rate $\\epsilon$ is allowed, the data structure is called a filter.\n  The space usages of the standard dictionaries or filters usually depend on the upper bound on the size of $S$, while the actual set can be much smaller.\n  Pagh, Segev and Wieder (FOCS'13) were the first to study filters with varying space usage based on the current $|S|$. Th"},"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":"2004.12465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-26T20:05:56Z","cross_cats_sorted":[],"title_canon_sha256":"cd527bc0ca17fc284f36e07103ca98e2a5aa01a3b3b21a73fa3eecdf140758de","abstract_canon_sha256":"0011fe9fa1b033ed63e23d7b8b6a3c61fda78af747488ab69872f8d17894ebe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:15.767799Z","signature_b64":"/bI6ikVc7GgaFwoGqvzTWGEufQQ2QG+R4y+Dl6oKfPn33zZLnBwVDCPthd0ZE/0gGEqKwwRUdOaxGhMzOCisDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fc4e1fcf380d35e877ec228200c5bf6a14932f9e715a991e3616fcda72dfa9b","last_reissued_at":"2026-07-05T00:58:15.767454Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:15.767454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct Filters for Sets of Unknown Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Mingmou Liu, Yitong Yin","submitted_at":"2020-04-26T20:05:56Z","abstract_excerpt":"The membership problem asks to maintain a set $S\\subseteq[u]$, supporting insertions and membership queries, i.e., testing if a given element is in the set. A data structure that computes exact answers is called a dictionary. When a (small) false positive rate $\\epsilon$ is allowed, the data structure is called a filter.\n  The space usages of the standard dictionaries or filters usually depend on the upper bound on the size of $S$, while the actual set can be much smaller.\n  Pagh, Segev and Wieder (FOCS'13) were the first to study filters with varying space usage based on the current $|S|$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.12465/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.12465","created_at":"2026-07-05T00:58:15.767516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.12465v1","created_at":"2026-07-05T00:58:15.767516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12465","created_at":"2026-07-05T00:58:15.767516+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7COD7HTQDJV","created_at":"2026-07-05T00:58:15.767516+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7COD7HTQDJV5B36","created_at":"2026-07-05T00:58:15.767516+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7COD7HT","created_at":"2026-07-05T00:58:15.767516+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/T7COD7HTQDJV5B36YIUCADC362","json":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362.json","graph_json":"https://pith.science/api/pith-number/T7COD7HTQDJV5B36YIUCADC362/graph.json","events_json":"https://pith.science/api/pith-number/T7COD7HTQDJV5B36YIUCADC362/events.json","paper":"https://pith.science/paper/T7COD7HT"},"agent_actions":{"view_html":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362","download_json":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362.json","view_paper":"https://pith.science/paper/T7COD7HT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.12465&json=true","fetch_graph":"https://pith.science/api/pith-number/T7COD7HTQDJV5B36YIUCADC362/graph.json","fetch_events":"https://pith.science/api/pith-number/T7COD7HTQDJV5B36YIUCADC362/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362/action/storage_attestation","attest_author":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362/action/author_attestation","sign_citation":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362/action/citation_signature","submit_replication":"https://pith.science/pith/T7COD7HTQDJV5B36YIUCADC362/action/replication_record"}},"created_at":"2026-07-05T00:58:15.767516+00:00","updated_at":"2026-07-05T00:58:15.767516+00:00"}