{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FQ26LPG3B3QIYSCGYIGMAB4KLU","short_pith_number":"pith:FQ26LPG3","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"},"canonical_sha256":"2c35e5bcdb0ee08c4846c20cc0078a5d3753733666b59a63c4bed2fd9fdd5a05","source":{"kind":"arxiv","id":"1701.03620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03620","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03620v2","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03620","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"FQ26LPG3B3QI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQ26LPG3B3QIYSCG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQ26LPG3","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FQ26LPG3B3QIYSCGYIGMAB4KLU","target":"record","payload":{"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"},"canonical_sha256":"2c35e5bcdb0ee08c4846c20cc0078a5d3753733666b59a63c4bed2fd9fdd5a05","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"},"source_kind":"arxiv","source_id":"1701.03620","source_version":2,"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-18T00:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPiXUQoXYRH++vjGNYKLrbhn6ax7m28LI88Zo6UAS5wdVlciMbpC/ZvszT/riAOIWpbRYNSzPFakKVEwYnVxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:43:08.963488Z"},"content_sha256":"4896d9daf4c24fe5e2ef88e5bf55f3361ef4c6eb59548a0784ac0e3769e150bc","schema_version":"1.0","event_id":"sha256:4896d9daf4c24fe5e2ef88e5bf55f3361ef4c6eb59548a0784ac0e3769e150bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FQ26LPG3B3QIYSCGYIGMAB4KLU","target":"graph","payload":{"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"},"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-18T00:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Tu4KTKk73eSSzw6tYNFBGa79ViDKzVHTac2HqA+Ekr0liaRsTh5Bd7+3NzzbJDvu6k/j3/UDIIkjfrc4tSwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:43:08.963844Z"},"content_sha256":"845cf2abac6caa629293d5d8ab1d27297a7b3ad50d5465ea2b5b65b07b145d4a","schema_version":"1.0","event_id":"sha256:845cf2abac6caa629293d5d8ab1d27297a7b3ad50d5465ea2b5b65b07b145d4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/bundle.json","state_url":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/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-06-02T09:43:08Z","links":{"resolver":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU","bundle":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/bundle.json","state":"https://pith.science/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQ26LPG3B3QIYSCGYIGMAB4KLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FQ26LPG3B3QIYSCGYIGMAB4KLU","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":"a4da87be5893a5e2528391344deed6969825f0c26698d2dd565f49a331476bba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T10:46:23Z","title_canon_sha256":"425412969797f063c8adbd092441b9525432c142d2e09af316c3b16c0f649c22"},"schema_version":"1.0","source":{"id":"1701.03620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03620","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03620v2","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03620","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"FQ26LPG3B3QI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQ26LPG3B3QIYSCG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQ26LPG3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:845cf2abac6caa629293d5d8ab1d27297a7b3ad50d5465ea2b5b65b07b145d4a","target":"graph","created_at":"2026-05-18T00:44:57Z","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":"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","authors_text":"Lingyan Huang, Wenyi Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T10:46:23Z","title":"On OR Many-Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03620","kind":"arxiv","version":2},"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:4896d9daf4c24fe5e2ef88e5bf55f3361ef4c6eb59548a0784ac0e3769e150bc","target":"record","created_at":"2026-05-18T00:44:57Z","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":"a4da87be5893a5e2528391344deed6969825f0c26698d2dd565f49a331476bba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T10:46:23Z","title_canon_sha256":"425412969797f063c8adbd092441b9525432c142d2e09af316c3b16c0f649c22"},"schema_version":"1.0","source":{"id":"1701.03620","kind":"arxiv","version":2}},"canonical_sha256":"2c35e5bcdb0ee08c4846c20cc0078a5d3753733666b59a63c4bed2fd9fdd5a05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c35e5bcdb0ee08c4846c20cc0078a5d3753733666b59a63c4bed2fd9fdd5a05","first_computed_at":"2026-05-18T00:44:57.434357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:57.434357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DeMwYAFiJQoshCyhI7IoUTCAcPBUlEF/bPKGsFcuf+Fsx2umvYir6PUUyCcjg1W5gyEczg4v8lVfYLlGeA7aCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:57.434860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4896d9daf4c24fe5e2ef88e5bf55f3361ef4c6eb59548a0784ac0e3769e150bc","sha256:845cf2abac6caa629293d5d8ab1d27297a7b3ad50d5465ea2b5b65b07b145d4a"],"state_sha256":"c5f7eb8266ff6c217cb605ae2eb3748f6742cf8d3d2034039e40a413a881be76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9E0mVTUWvHN5WfoHwSmeTgOl0q1fZiYoLfP6ksxHgK8shc8Q4ZG+FhqxG9xHOei7GS8Y37slKCKJNYwlpGvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:43:08.965850Z","bundle_sha256":"f263206cc820fe212746eccff5f6de1c3e28c529d87c4f17fad5449675d913f0"}}