{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:VUSFVNJLZY5MOG2H7RYQQIFFGQ","short_pith_number":"pith:VUSFVNJL","schema_version":"1.0","canonical_sha256":"ad245ab52bce3ac71b47fc710820a5341aa8ac06cc17aed5b0a6203e7a2b6ff2","source":{"kind":"arxiv","id":"0802.3401","version":1},"attestation_state":"computed","paper":{"title":"On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bixio Rimoldi, Ninoslav Marina","submitted_at":"2008-02-23T01:30:37Z","abstract_excerpt":"The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive decoding. It is also known that an extension of successive decoding applies to the dominant face of such polytopes. The extension consists of forming groups of users in such a way that users within a group are decoded jointly whereas groups are decoded successively. This paper goes one step further. It is shown that successive decoding extends to every face of the above mentioned polytopes"},"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":"0802.3401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-23T01:30:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70dcd794b025cced828256f0195a563dfd677922ef7f058a7d5954fb53e3823a","abstract_canon_sha256":"a5e47ad8aba25ef53acab08eb566116d4cccfb629ce6f7dab11df845f51f2272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.657613Z","signature_b64":"a98dVEzMttv9dXex/Rju1TevV9/fGoYC9MXO/cwSWM2qPbAxy1W5KMQTTi0mA0afcB3qiXuYnRNnU/G4NyG4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad245ab52bce3ac71b47fc710820a5341aa8ac06cc17aed5b0a6203e7a2b6ff2","last_reissued_at":"2026-05-18T00:58:48.656891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.656891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bixio Rimoldi, Ninoslav Marina","submitted_at":"2008-02-23T01:30:37Z","abstract_excerpt":"The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive decoding. It is also known that an extension of successive decoding applies to the dominant face of such polytopes. The extension consists of forming groups of users in such a way that users within a group are decoded jointly whereas groups are decoded successively. This paper goes one step further. It is shown that successive decoding extends to every face of the above mentioned polytopes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.3401","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":"0802.3401","created_at":"2026-05-18T00:58:48.656990+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.3401v1","created_at":"2026-05-18T00:58:48.656990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.3401","created_at":"2026-05-18T00:58:48.656990+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUSFVNJLZY5M","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUSFVNJLZY5MOG2H","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUSFVNJL","created_at":"2026-05-18T12:25:58.018023+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/VUSFVNJLZY5MOG2H7RYQQIFFGQ","json":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ.json","graph_json":"https://pith.science/api/pith-number/VUSFVNJLZY5MOG2H7RYQQIFFGQ/graph.json","events_json":"https://pith.science/api/pith-number/VUSFVNJLZY5MOG2H7RYQQIFFGQ/events.json","paper":"https://pith.science/paper/VUSFVNJL"},"agent_actions":{"view_html":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ","download_json":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ.json","view_paper":"https://pith.science/paper/VUSFVNJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.3401&json=true","fetch_graph":"https://pith.science/api/pith-number/VUSFVNJLZY5MOG2H7RYQQIFFGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VUSFVNJLZY5MOG2H7RYQQIFFGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ/action/storage_attestation","attest_author":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ/action/author_attestation","sign_citation":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ/action/citation_signature","submit_replication":"https://pith.science/pith/VUSFVNJLZY5MOG2H7RYQQIFFGQ/action/replication_record"}},"created_at":"2026-05-18T00:58:48.656990+00:00","updated_at":"2026-05-18T00:58:48.656990+00:00"}