{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TS64F4BMQ27JEGBGY4MDFN5NUU","short_pith_number":"pith:TS64F4BM","schema_version":"1.0","canonical_sha256":"9cbdc2f02c86be921826c71832b7ada5113ea089328adc8a527b2483867bd57f","source":{"kind":"arxiv","id":"1612.09388","version":1},"attestation_state":"computed","paper":{"title":"Set membership with non-adaptive 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":"2016-12-30T04:50:26Z","abstract_excerpt":"We consider the non-adaptive 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 non-adaptively probing the bit vector at t places. Let s_N(m,n,t) be the minimum number of bits of storage needed for such a scheme. In this work, we show existence of non-adaptive and adaptive schemes for a range of t that improves an upper bound of Buhrman, Miltersen, Radhakrishnan and Srinivasan (2002) on s_N(m,n,t). For three non-adaptive probes,"},"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":"1612.09388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-30T04:50:26Z","cross_cats_sorted":[],"title_canon_sha256":"4c9686e4fe1b5526fed6e3b1ecfcb37830d829565d3478b34161f01dd14e689b","abstract_canon_sha256":"dc8e8297b64ab2252790a1f732f22dd19eb35c5bacbf3602f800f54c9952dab4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:41.639209Z","signature_b64":"rStTzTMq+Co3DX7oTyzEHRDLzKOh1MjcFbcXQ6qbEXx9x0gqd5mesroK15/wD/1uIeo8M36aqLhwqiQflgzuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cbdc2f02c86be921826c71832b7ada5113ea089328adc8a527b2483867bd57f","last_reissued_at":"2026-05-18T00:53:41.638851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:41.638851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set membership with non-adaptive 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":"2016-12-30T04:50:26Z","abstract_excerpt":"We consider the non-adaptive 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 non-adaptively probing the bit vector at t places. Let s_N(m,n,t) be the minimum number of bits of storage needed for such a scheme. In this work, we show existence of non-adaptive and adaptive schemes for a range of t that improves an upper bound of Buhrman, Miltersen, Radhakrishnan and Srinivasan (2002) on s_N(m,n,t). For three non-adaptive probes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09388","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":"1612.09388","created_at":"2026-05-18T00:53:41.638908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.09388v1","created_at":"2026-05-18T00:53:41.638908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09388","created_at":"2026-05-18T00:53:41.638908+00:00"},{"alias_kind":"pith_short_12","alias_value":"TS64F4BMQ27J","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TS64F4BMQ27JEGBG","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TS64F4BM","created_at":"2026-05-18T12:30:46.583412+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/TS64F4BMQ27JEGBGY4MDFN5NUU","json":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU.json","graph_json":"https://pith.science/api/pith-number/TS64F4BMQ27JEGBGY4MDFN5NUU/graph.json","events_json":"https://pith.science/api/pith-number/TS64F4BMQ27JEGBGY4MDFN5NUU/events.json","paper":"https://pith.science/paper/TS64F4BM"},"agent_actions":{"view_html":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU","download_json":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU.json","view_paper":"https://pith.science/paper/TS64F4BM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.09388&json=true","fetch_graph":"https://pith.science/api/pith-number/TS64F4BMQ27JEGBGY4MDFN5NUU/graph.json","fetch_events":"https://pith.science/api/pith-number/TS64F4BMQ27JEGBGY4MDFN5NUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU/action/storage_attestation","attest_author":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU/action/author_attestation","sign_citation":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU/action/citation_signature","submit_replication":"https://pith.science/pith/TS64F4BMQ27JEGBGY4MDFN5NUU/action/replication_record"}},"created_at":"2026-05-18T00:53:41.638908+00:00","updated_at":"2026-05-18T00:53:41.638908+00:00"}