{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VBOXBATBFPRQDUTIFDJJPRLGCM","short_pith_number":"pith:VBOXBATB","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"},"canonical_sha256":"a85d7082612be301d26828d297c566131824d0db8844cb49bf1e2d9583abbfc5","source":{"kind":"arxiv","id":"1504.02035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02035","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02035v1","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02035","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"pith_short_12","alias_value":"VBOXBATBFPRQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VBOXBATBFPRQDUTI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VBOXBATB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VBOXBATBFPRQDUTIFDJJPRLGCM","target":"record","payload":{"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"},"canonical_sha256":"a85d7082612be301d26828d297c566131824d0db8844cb49bf1e2d9583abbfc5","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"},"source_kind":"arxiv","source_id":"1504.02035","source_version":1,"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-18T02:19:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7sPhHNPA1Xsp9rRNdQVAjhtJZY/2yFfYImzPercpkQ6w2c9wiEEptrHsqON+nz2xlIcMiQTKGP7lZNx19XfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:07:29.058875Z"},"content_sha256":"633c396534dabcc3d46dcf0b2a77980126cce1ec3f40ff1034e60f156e4c4443","schema_version":"1.0","event_id":"sha256:633c396534dabcc3d46dcf0b2a77980126cce1ec3f40ff1034e60f156e4c4443"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VBOXBATBFPRQDUTIFDJJPRLGCM","target":"graph","payload":{"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"},"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-18T02:19:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIhUxAYqr4N9itjKDtmpJiJsXlKt5x/pPp+MUpQ2aUn9P6y+ScgbwQFfasqrEeF32FOnuuDrpVnfTievi6/jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:07:29.059221Z"},"content_sha256":"34093a774bc54afdd3c1b9993b1374bffceb3aa0c3806a02eeb891fad4a923be","schema_version":"1.0","event_id":"sha256:34093a774bc54afdd3c1b9993b1374bffceb3aa0c3806a02eeb891fad4a923be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/bundle.json","state_url":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/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-05-28T01:07:29Z","links":{"resolver":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM","bundle":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/bundle.json","state":"https://pith.science/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBOXBATBFPRQDUTIFDJJPRLGCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VBOXBATBFPRQDUTIFDJJPRLGCM","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":"b761e1d770e89e7643494fe2fd3c9a3923a42bc2593a989a47071f24ca865999","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T17:02:30Z","title_canon_sha256":"98b2a10bd7c329cf42796a29ff5f82d9217f5a1e57fff5219a67bc0da6b23ee4"},"schema_version":"1.0","source":{"id":"1504.02035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02035","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02035v1","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02035","created_at":"2026-05-18T02:19:17Z"},{"alias_kind":"pith_short_12","alias_value":"VBOXBATBFPRQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VBOXBATBFPRQDUTI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VBOXBATB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:34093a774bc54afdd3c1b9993b1374bffceb3aa0c3806a02eeb891fad4a923be","target":"graph","created_at":"2026-05-18T02:19:17Z","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":"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).","authors_text":"Jaikumar Radhakrishnan, Mohit Garg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T17:02:30Z","title":"Set Membership with a Few Bit Probes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02035","kind":"arxiv","version":1},"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:633c396534dabcc3d46dcf0b2a77980126cce1ec3f40ff1034e60f156e4c4443","target":"record","created_at":"2026-05-18T02:19:17Z","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":"b761e1d770e89e7643494fe2fd3c9a3923a42bc2593a989a47071f24ca865999","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T17:02:30Z","title_canon_sha256":"98b2a10bd7c329cf42796a29ff5f82d9217f5a1e57fff5219a67bc0da6b23ee4"},"schema_version":"1.0","source":{"id":"1504.02035","kind":"arxiv","version":1}},"canonical_sha256":"a85d7082612be301d26828d297c566131824d0db8844cb49bf1e2d9583abbfc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a85d7082612be301d26828d297c566131824d0db8844cb49bf1e2d9583abbfc5","first_computed_at":"2026-05-18T02:19:17.381392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:17.381392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOA/Mb0PR9bdv2wV4Qwy2hgzXd4ORRQak93P2AgpgyNAvOtQEMJicM/oMu4+o+vrRJlz9geOYBb6KMPGPikkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:17.382223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:633c396534dabcc3d46dcf0b2a77980126cce1ec3f40ff1034e60f156e4c4443","sha256:34093a774bc54afdd3c1b9993b1374bffceb3aa0c3806a02eeb891fad4a923be"],"state_sha256":"ffb22cedeca92ef73154aba9baac4a883d51ed274cd582cbed2fb1c894fc7548"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RermipuOyVqoDLuFOzMXR30VS27GRBKenWNxRsNEZUODS4xxPlw4Mjpw3yzxyy+GwFBMobERTkS1wJrRcOCsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:07:29.061217Z","bundle_sha256":"f3b8af4466daf74b86d30c42ab9ed218b7a289d762f2439eac1c1e981eb2b1f5"}}