{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TSFBPRHJTTUC4LSSXKGQMGBJ4M","short_pith_number":"pith:TSFBPRHJ","schema_version":"1.0","canonical_sha256":"9c8a17c4e99ce82e2e52ba8d061829e31077ef82bfa7cca0388ea43b52f40293","source":{"kind":"arxiv","id":"1505.06452","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Error Free Partitioning over Noisy Boolean Multiaccess Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Yuan, Ramachandran Vaidyanathan, Shuangqing Wei, Shuhang Wu, Yue Wang","submitted_at":"2015-05-24T16:07:41Z","abstract_excerpt":"In this paper, we consider the problem of partitioning active users in a manner that facilitates multi-access without collision. The setting is of a noisy, synchronous, Boolean, multi-access channel where $K$ active users (out of a total of $N$ users) seek to access. A solution to the partition problem places each of the $N$ users in one of $K$ groups (or blocks) such that no two active nodes are in the same block. We consider a simple, but non-trivial and illustrative case of $K=2$ active users and study the number of steps $T$ used to solve the partition problem. By random coding and a subop"},"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":"1505.06452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-24T16:07:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e171bddd7158169b4586bf40605f151ac759dc020d2093401f824e8e122c2ba9","abstract_canon_sha256":"63347330ee018a3d95f1f1d0326c3cbe82f56f2220fa49e898641850f14c58aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:01.843114Z","signature_b64":"/ipeBD+sMW7stI9vjaBCmTGJ8JVnJPF4qWrvjvrGSXZ6cVVpeyDKa0MpGMkQl067qtSGj/ir2Xj3m+dL3uzCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c8a17c4e99ce82e2e52ba8d061829e31077ef82bfa7cca0388ea43b52f40293","last_reissued_at":"2026-05-18T00:59:01.842683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:01.842683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Error Free Partitioning over Noisy Boolean Multiaccess Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Yuan, Ramachandran Vaidyanathan, Shuangqing Wei, Shuhang Wu, Yue Wang","submitted_at":"2015-05-24T16:07:41Z","abstract_excerpt":"In this paper, we consider the problem of partitioning active users in a manner that facilitates multi-access without collision. The setting is of a noisy, synchronous, Boolean, multi-access channel where $K$ active users (out of a total of $N$ users) seek to access. A solution to the partition problem places each of the $N$ users in one of $K$ groups (or blocks) such that no two active nodes are in the same block. We consider a simple, but non-trivial and illustrative case of $K=2$ active users and study the number of steps $T$ used to solve the partition problem. By random coding and a subop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06452","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":"1505.06452","created_at":"2026-05-18T00:59:01.842744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06452v1","created_at":"2026-05-18T00:59:01.842744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06452","created_at":"2026-05-18T00:59:01.842744+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSFBPRHJTTUC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSFBPRHJTTUC4LSS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSFBPRHJ","created_at":"2026-05-18T12:29:42.218222+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/TSFBPRHJTTUC4LSSXKGQMGBJ4M","json":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M.json","graph_json":"https://pith.science/api/pith-number/TSFBPRHJTTUC4LSSXKGQMGBJ4M/graph.json","events_json":"https://pith.science/api/pith-number/TSFBPRHJTTUC4LSSXKGQMGBJ4M/events.json","paper":"https://pith.science/paper/TSFBPRHJ"},"agent_actions":{"view_html":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M","download_json":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M.json","view_paper":"https://pith.science/paper/TSFBPRHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06452&json=true","fetch_graph":"https://pith.science/api/pith-number/TSFBPRHJTTUC4LSSXKGQMGBJ4M/graph.json","fetch_events":"https://pith.science/api/pith-number/TSFBPRHJTTUC4LSSXKGQMGBJ4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M/action/storage_attestation","attest_author":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M/action/author_attestation","sign_citation":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M/action/citation_signature","submit_replication":"https://pith.science/pith/TSFBPRHJTTUC4LSSXKGQMGBJ4M/action/replication_record"}},"created_at":"2026-05-18T00:59:01.842744+00:00","updated_at":"2026-05-18T00:59:01.842744+00:00"}