{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LP4AID7CGNFPRVFX7Y5E2YACPE","short_pith_number":"pith:LP4AID7C","schema_version":"1.0","canonical_sha256":"5bf8040fe2334af8d4b7fe3a4d6002792a02b98c6a4f85deb2e3eaeef27940f1","source":{"kind":"arxiv","id":"1010.1322","version":1},"attestation_state":"computed","paper":{"title":"A New Upper Bound on the Average Error Exponent for Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Achilleas Anastasopoulos, Ali Nazari, S. Sandeep Pradhan","submitted_at":"2010-10-07T04:00:47Z","abstract_excerpt":"A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users' input distributions (conditioned on the time-sharing auxiliary variable) results in a tighter sphere-packing exponent in comparison to Haroutunian's. Also, the relationship between average and maximal error probabilities is studied. Finally, by using a known sphere packing bound on the maxi"},"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":"1010.1322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-07T04:00:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3df52550f5e353ade90f821e1ffaee275a93af00604f0aeaefc7a887b50aedfb","abstract_canon_sha256":"ad4c4d76e3823812ec81488602541df049bcc21fcb80eb1205f53f75b130a07b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:41.421112Z","signature_b64":"ii3fK75vHY+1ORRkG6jg4qf1mv753J8nD2p0wEZqOerc2C8k81CjiLwdufXdPFBzWACpu3nQpYHNHS01lGKtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf8040fe2334af8d4b7fe3a4d6002792a02b98c6a4f85deb2e3eaeef27940f1","last_reissued_at":"2026-05-18T04:39:41.420643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:41.420643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Upper Bound on the Average Error Exponent for Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Achilleas Anastasopoulos, Ali Nazari, S. Sandeep Pradhan","submitted_at":"2010-10-07T04:00:47Z","abstract_excerpt":"A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users' input distributions (conditioned on the time-sharing auxiliary variable) results in a tighter sphere-packing exponent in comparison to Haroutunian's. Also, the relationship between average and maximal error probabilities is studied. Finally, by using a known sphere packing bound on the maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1322","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":"1010.1322","created_at":"2026-05-18T04:39:41.420705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1322v1","created_at":"2026-05-18T04:39:41.420705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1322","created_at":"2026-05-18T04:39:41.420705+00:00"},{"alias_kind":"pith_short_12","alias_value":"LP4AID7CGNFP","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LP4AID7CGNFPRVFX","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LP4AID7C","created_at":"2026-05-18T12:26:10.704358+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/LP4AID7CGNFPRVFX7Y5E2YACPE","json":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE.json","graph_json":"https://pith.science/api/pith-number/LP4AID7CGNFPRVFX7Y5E2YACPE/graph.json","events_json":"https://pith.science/api/pith-number/LP4AID7CGNFPRVFX7Y5E2YACPE/events.json","paper":"https://pith.science/paper/LP4AID7C"},"agent_actions":{"view_html":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE","download_json":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE.json","view_paper":"https://pith.science/paper/LP4AID7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1322&json=true","fetch_graph":"https://pith.science/api/pith-number/LP4AID7CGNFPRVFX7Y5E2YACPE/graph.json","fetch_events":"https://pith.science/api/pith-number/LP4AID7CGNFPRVFX7Y5E2YACPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/action/storage_attestation","attest_author":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/action/author_attestation","sign_citation":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/action/citation_signature","submit_replication":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/action/replication_record"}},"created_at":"2026-05-18T04:39:41.420705+00:00","updated_at":"2026-05-18T04:39:41.420705+00:00"}