{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ODRRVNRERZ344BXM47VMMAMOC4","short_pith_number":"pith:ODRRVNRE","schema_version":"1.0","canonical_sha256":"70e31ab6248e77ce06ece7eac6018e173bd4dbafd36ab67653d0b36e8c83c1eb","source":{"kind":"arxiv","id":"1102.5538","version":4},"attestation_state":"computed","paper":{"title":"Pseudo-random graphs and bit probe schemes with one-sided error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrei Romashchenko","submitted_at":"2011-02-27T19:24:32Z","abstract_excerpt":"We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type \"Is x in A?\" can be answered very quickly. H.Buhrman, P.B.Miltersen, J.Radhakrishnan, and S.Venkatesh proposed a bit-probe scheme based on expanders. Their scheme needs space of $O(n\\log m)$ bits, and requires to read only one randomly chosen bit from the memory to answer a query. The answer is correct with high probability with two-sided errors. In this paper we show that for the same problem there exists a bit-p"},"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":"1102.5538","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-27T19:24:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cef221a0dea21f424ff8bdd67d42c7f99b49b8d2bbe99dc547c28967cd824cd4","abstract_canon_sha256":"5b28260ae80653ff8de1f38576d27dd269e1b3611e6d7e4eda009eee74a352e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:05.586462Z","signature_b64":"t0RhAe52jnnzAbLke/Y2EOsRGD4kMnLtOhSwXKtDz65/Nf4X2osiOpaeSwA/05cW1JpOixUgnGx+pKolZ3NtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e31ab6248e77ce06ece7eac6018e173bd4dbafd36ab67653d0b36e8c83c1eb","last_reissued_at":"2026-05-18T04:13:05.585737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:05.585737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudo-random graphs and bit probe schemes with one-sided error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrei Romashchenko","submitted_at":"2011-02-27T19:24:32Z","abstract_excerpt":"We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type \"Is x in A?\" can be answered very quickly. H.Buhrman, P.B.Miltersen, J.Radhakrishnan, and S.Venkatesh proposed a bit-probe scheme based on expanders. Their scheme needs space of $O(n\\log m)$ bits, and requires to read only one randomly chosen bit from the memory to answer a query. The answer is correct with high probability with two-sided errors. In this paper we show that for the same problem there exists a bit-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5538","kind":"arxiv","version":4},"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":"1102.5538","created_at":"2026-05-18T04:13:05.585858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5538v4","created_at":"2026-05-18T04:13:05.585858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5538","created_at":"2026-05-18T04:13:05.585858+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODRRVNRERZ34","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODRRVNRERZ344BXM","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODRRVNRE","created_at":"2026-05-18T12:26:37.096874+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/ODRRVNRERZ344BXM47VMMAMOC4","json":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4.json","graph_json":"https://pith.science/api/pith-number/ODRRVNRERZ344BXM47VMMAMOC4/graph.json","events_json":"https://pith.science/api/pith-number/ODRRVNRERZ344BXM47VMMAMOC4/events.json","paper":"https://pith.science/paper/ODRRVNRE"},"agent_actions":{"view_html":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4","download_json":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4.json","view_paper":"https://pith.science/paper/ODRRVNRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5538&json=true","fetch_graph":"https://pith.science/api/pith-number/ODRRVNRERZ344BXM47VMMAMOC4/graph.json","fetch_events":"https://pith.science/api/pith-number/ODRRVNRERZ344BXM47VMMAMOC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4/action/storage_attestation","attest_author":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4/action/author_attestation","sign_citation":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4/action/citation_signature","submit_replication":"https://pith.science/pith/ODRRVNRERZ344BXM47VMMAMOC4/action/replication_record"}},"created_at":"2026-05-18T04:13:05.585858+00:00","updated_at":"2026-05-18T04:13:05.585858+00:00"}