{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DKTHOKQ6OIPDCAHQSJKKTSJ57W","short_pith_number":"pith:DKTHOKQ6","schema_version":"1.0","canonical_sha256":"1aa6772a1e721e3100f09254a9c93dfd8196a3cf691b6b2823e9a4bdc5f5ed5f","source":{"kind":"arxiv","id":"1010.1303","version":1},"attestation_state":"computed","paper":{"title":"Error Exponent for Multiple-Access Channels:Lower Bounds","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-07T00:08:41Z","abstract_excerpt":"A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a two-user discrete memoryless (DM) multiple-access channel (MAC), three lower bounds on the reliability function are derived. The first one (random coding) is identical to the best known lower bound on the reliability function of DM-MAC. It is shown that the random coding bound is the performance of the average code in the constant composition code ensemble. T"},"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.1303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-07T00:08:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13f26d148139ec2043221311e6bc90df7c2f328c62b165ba1f4990d46b00e848","abstract_canon_sha256":"2fa0528aaea516a3e743be1a0d26ac93b864a3db04115dba2d5e9e5de9e978fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:41.459524Z","signature_b64":"EmTVO6R7zVopQcHvi4Xq4a4o2JVkwSxwHgm29DwCLBWe2RCXibNDp+mBBVQmpezWAjsDZfhScAEyYkepnhGvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa6772a1e721e3100f09254a9c93dfd8196a3cf691b6b2823e9a4bdc5f5ed5f","last_reissued_at":"2026-05-18T04:39:41.459056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:41.459056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Exponent for Multiple-Access Channels:Lower Bounds","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-07T00:08:41Z","abstract_excerpt":"A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a two-user discrete memoryless (DM) multiple-access channel (MAC), three lower bounds on the reliability function are derived. The first one (random coding) is identical to the best known lower bound on the reliability function of DM-MAC. It is shown that the random coding bound is the performance of the average code in the constant composition code ensemble. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1303","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.1303","created_at":"2026-05-18T04:39:41.459117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1303v1","created_at":"2026-05-18T04:39:41.459117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1303","created_at":"2026-05-18T04:39:41.459117+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKTHOKQ6OIPD","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKTHOKQ6OIPDCAHQ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKTHOKQ6","created_at":"2026-05-18T12:26:06.534383+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/DKTHOKQ6OIPDCAHQSJKKTSJ57W","json":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W.json","graph_json":"https://pith.science/api/pith-number/DKTHOKQ6OIPDCAHQSJKKTSJ57W/graph.json","events_json":"https://pith.science/api/pith-number/DKTHOKQ6OIPDCAHQSJKKTSJ57W/events.json","paper":"https://pith.science/paper/DKTHOKQ6"},"agent_actions":{"view_html":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W","download_json":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W.json","view_paper":"https://pith.science/paper/DKTHOKQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1303&json=true","fetch_graph":"https://pith.science/api/pith-number/DKTHOKQ6OIPDCAHQSJKKTSJ57W/graph.json","fetch_events":"https://pith.science/api/pith-number/DKTHOKQ6OIPDCAHQSJKKTSJ57W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W/action/storage_attestation","attest_author":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W/action/author_attestation","sign_citation":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W/action/citation_signature","submit_replication":"https://pith.science/pith/DKTHOKQ6OIPDCAHQSJKKTSJ57W/action/replication_record"}},"created_at":"2026-05-18T04:39:41.459117+00:00","updated_at":"2026-05-18T04:39:41.459117+00:00"}