{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FQ26LPG3B3QIYSCGYIGMAB4KLU","short_pith_number":"pith:FQ26LPG3","schema_version":"1.0","canonical_sha256":"2c35e5bcdb0ee08c4846c20cc0078a5d3753733666b59a63c4bed2fd9fdd5a05","source":{"kind":"arxiv","id":"1701.03620","version":2},"attestation_state":"computed","paper":{"title":"On OR Many-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lingyan Huang, Wenyi Zhang","submitted_at":"2017-01-13T10:46:23Z","abstract_excerpt":"OR multi-access channel is a simple model where the channel output is the Boolean OR among the Boolean channel inputs. We revisit this model, showing that employing Bloom filter, a randomized data structure, as channel inputs achieves its capacity region with joint decoding and the symmetric sum rate of $\\ln 2$ bits per channel use without joint decoding. We then proceed to the \"many-access\" regime where the number of potential users grows without bound, treating both activity recognition and message transmission problems, establishing scaling laws which are optimal within a constant factor, b"},"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":"1701.03620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T10:46:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"425412969797f063c8adbd092441b9525432c142d2e09af316c3b16c0f649c22","abstract_canon_sha256":"a4da87be5893a5e2528391344deed6969825f0c26698d2dd565f49a331476bba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.434860Z","signature_b64":"DeMwYAFiJQoshCyhI7IoUTCAcPBUlEF/bPKGsFcuf+Fsx2umvYir6PUUyCcjg1W5gyEczg4v8lVfYLlGeA7aCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c35e5bcdb0ee08c4846c20cc0078a5d3753733666b59a63c4bed2fd9fdd5a05","last_reissued_at":"2026-05-18T00:44:57.434357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.434357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On OR Many-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lingyan Huang, Wenyi Zhang","submitted_at":"2017-01-13T10:46:23Z","abstract_excerpt":"OR multi-access channel is a simple model where the channel output is the Boolean OR among the Boolean channel inputs. We revisit this model, showing that employing Bloom filter, a randomized data structure, as channel inputs achieves its capacity region with joint decoding and the symmetric sum rate of $\\ln 2$ bits per channel use without joint decoding. We then proceed to the \"many-access\" regime where the number of potential users grows without bound, treating both activity recognition and message transmission problems, establishing scaling laws which are optimal within a constant factor, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03620","kind":"arxiv","version":2},"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":"1701.03620","created_at":"2026-05-18T00:44:57.434432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03620v2","created_at":"2026-05-18T00:44:57.434432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03620","created_at":"2026-05-18T00:44:57.434432+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQ26LPG3B3QI","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQ26LPG3B3QIYSCG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQ26LPG3","created_at":"2026-05-18T12:31:15.632608+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/FQ26LPG3B3QIYSCGYIGMAB4KLU","json":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU.json","graph_json":"https://pith.science/api/pith-number/FQ26LPG3B3QIYSCGYIGMAB4KLU/graph.json","events_json":"https://pith.science/api/pith-number/FQ26LPG3B3QIYSCGYIGMAB4KLU/events.json","paper":"https://pith.science/paper/FQ26LPG3"},"agent_actions":{"view_html":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU","download_json":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU.json","view_paper":"https://pith.science/paper/FQ26LPG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03620&json=true","fetch_graph":"https://pith.science/api/pith-number/FQ26LPG3B3QIYSCGYIGMAB4KLU/graph.json","fetch_events":"https://pith.science/api/pith-number/FQ26LPG3B3QIYSCGYIGMAB4KLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/action/storage_attestation","attest_author":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/action/author_attestation","sign_citation":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/action/citation_signature","submit_replication":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/action/replication_record"}},"created_at":"2026-05-18T00:44:57.434432+00:00","updated_at":"2026-05-18T00:44:57.434432+00:00"}