{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VBOXBATBFPRQDUTIFDJJPRLGCM","short_pith_number":"pith:VBOXBATB","schema_version":"1.0","canonical_sha256":"a85d7082612be301d26828d297c566131824d0db8844cb49bf1e2d9583abbfc5","source":{"kind":"arxiv","id":"1504.02035","version":1},"attestation_state":"computed","paper":{"title":"Set Membership with a Few Bit Probes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaikumar Radhakrishnan, Mohit Garg","submitted_at":"2015-04-08T17:02:30Z","abstract_excerpt":"We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form \"Is x in S?\" by adaptively probing the bit vector at t places. Let s(m,n,t) be the minimum number of bits of storage needed for such a scheme. Several recent works investigate s(m,n,t) for various ranges of the parameter; we obtain improvements over some of the bounds shown by Buhrman, Miltersen, Radhakrishnan, and Srinivasan (2002) and Alon and Feige (2009)."},"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":"1504.02035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T17:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"98b2a10bd7c329cf42796a29ff5f82d9217f5a1e57fff5219a67bc0da6b23ee4","abstract_canon_sha256":"b761e1d770e89e7643494fe2fd3c9a3923a42bc2593a989a47071f24ca865999"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:17.382223Z","signature_b64":"LOA/Mb0PR9bdv2wV4Qwy2hgzXd4ORRQak93P2AgpgyNAvOtQEMJicM/oMu4+o+vrRJlz9geOYBb6KMPGPikkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a85d7082612be301d26828d297c566131824d0db8844cb49bf1e2d9583abbfc5","last_reissued_at":"2026-05-18T02:19:17.381392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:17.381392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Membership with a Few Bit Probes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaikumar Radhakrishnan, Mohit Garg","submitted_at":"2015-04-08T17:02:30Z","abstract_excerpt":"We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form \"Is x in S?\" by adaptively probing the bit vector at t places. Let s(m,n,t) be the minimum number of bits of storage needed for such a scheme. Several recent works investigate s(m,n,t) for various ranges of the parameter; we obtain improvements over some of the bounds shown by Buhrman, Miltersen, Radhakrishnan, and Srinivasan (2002) and Alon and Feige (2009)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02035","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02035","created_at":"2026-05-18T02:19:17.381515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02035v1","created_at":"2026-05-18T02:19:17.381515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02035","created_at":"2026-05-18T02:19:17.381515+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBOXBATBFPRQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBOXBATBFPRQDUTI","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBOXBATB","created_at":"2026-05-18T12:29:44.643036+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/VBOXBATBFPRQDUTIFDJJPRLGCM","json":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM.json","graph_json":"https://pith.science/api/pith-number/VBOXBATBFPRQDUTIFDJJPRLGCM/graph.json","events_json":"https://pith.science/api/pith-number/VBOXBATBFPRQDUTIFDJJPRLGCM/events.json","paper":"https://pith.science/paper/VBOXBATB"},"agent_actions":{"view_html":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM","download_json":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM.json","view_paper":"https://pith.science/paper/VBOXBATB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02035&json=true","fetch_graph":"https://pith.science/api/pith-number/VBOXBATBFPRQDUTIFDJJPRLGCM/graph.json","fetch_events":"https://pith.science/api/pith-number/VBOXBATBFPRQDUTIFDJJPRLGCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/action/storage_attestation","attest_author":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/action/author_attestation","sign_citation":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/action/citation_signature","submit_replication":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/action/replication_record"}},"created_at":"2026-05-18T02:19:17.381515+00:00","updated_at":"2026-05-18T02:19:17.381515+00:00"}