{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LP4AID7CGNFPRVFX7Y5E2YACPE","short_pith_number":"pith:LP4AID7C","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"},"canonical_sha256":"5bf8040fe2334af8d4b7fe3a4d6002792a02b98c6a4f85deb2e3eaeef27940f1","source":{"kind":"arxiv","id":"1010.1322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1322","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1322v1","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1322","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"LP4AID7CGNFP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LP4AID7CGNFPRVFX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LP4AID7C","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LP4AID7CGNFPRVFX7Y5E2YACPE","target":"record","payload":{"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"},"canonical_sha256":"5bf8040fe2334af8d4b7fe3a4d6002792a02b98c6a4f85deb2e3eaeef27940f1","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"},"source_kind":"arxiv","source_id":"1010.1322","source_version":1,"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-18T04:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbSKLhb/1RGj3PDGr7z06UdDzfa+0f6pxyHQQZvoOm1JQuH8+L86GbmfG+Rlp3WcvBfLclXckeKPKHcmmrYZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:15:51.287136Z"},"content_sha256":"6a3d4f4927956fa49d17293f69cbdfff749cf2ba75c84e4821c5758858de75cb","schema_version":"1.0","event_id":"sha256:6a3d4f4927956fa49d17293f69cbdfff749cf2ba75c84e4821c5758858de75cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LP4AID7CGNFPRVFX7Y5E2YACPE","target":"graph","payload":{"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"},"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-18T04:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KidT6JKknK0Ppk3egZ7M13PEH8POQqgEP7E3VQ2QGnDRRiEPwxuG8/acCJcxHU7C7Qyk0+FoJ0vgXkViJXFaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:15:51.287831Z"},"content_sha256":"a9fe61a865b8bc04aaffc30031020572a0abdb38460891448a2cc68da2ffeecc","schema_version":"1.0","event_id":"sha256:a9fe61a865b8bc04aaffc30031020572a0abdb38460891448a2cc68da2ffeecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/bundle.json","state_url":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/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-08T01:15:51Z","links":{"resolver":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE","bundle":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/bundle.json","state":"https://pith.science/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LP4AID7CGNFPRVFX7Y5E2YACPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LP4AID7CGNFPRVFX7Y5E2YACPE","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":"ad4c4d76e3823812ec81488602541df049bcc21fcb80eb1205f53f75b130a07b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-07T04:00:47Z","title_canon_sha256":"3df52550f5e353ade90f821e1ffaee275a93af00604f0aeaefc7a887b50aedfb"},"schema_version":"1.0","source":{"id":"1010.1322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1322","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1322v1","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1322","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"LP4AID7CGNFP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LP4AID7CGNFPRVFX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LP4AID7C","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a9fe61a865b8bc04aaffc30031020572a0abdb38460891448a2cc68da2ffeecc","target":"graph","created_at":"2026-05-18T04:39:41Z","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":"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","authors_text":"Achilleas Anastasopoulos, Ali Nazari, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-07T04:00:47Z","title":"A New Upper Bound on the Average Error Exponent for Multiple-Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1322","kind":"arxiv","version":1},"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:6a3d4f4927956fa49d17293f69cbdfff749cf2ba75c84e4821c5758858de75cb","target":"record","created_at":"2026-05-18T04:39:41Z","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":"ad4c4d76e3823812ec81488602541df049bcc21fcb80eb1205f53f75b130a07b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-07T04:00:47Z","title_canon_sha256":"3df52550f5e353ade90f821e1ffaee275a93af00604f0aeaefc7a887b50aedfb"},"schema_version":"1.0","source":{"id":"1010.1322","kind":"arxiv","version":1}},"canonical_sha256":"5bf8040fe2334af8d4b7fe3a4d6002792a02b98c6a4f85deb2e3eaeef27940f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bf8040fe2334af8d4b7fe3a4d6002792a02b98c6a4f85deb2e3eaeef27940f1","first_computed_at":"2026-05-18T04:39:41.420643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:41.420643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ii3fK75vHY+1ORRkG6jg4qf1mv753J8nD2p0wEZqOerc2C8k81CjiLwdufXdPFBzWACpu3nQpYHNHS01lGKtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:41.421112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a3d4f4927956fa49d17293f69cbdfff749cf2ba75c84e4821c5758858de75cb","sha256:a9fe61a865b8bc04aaffc30031020572a0abdb38460891448a2cc68da2ffeecc"],"state_sha256":"4f892c927c16a400fd20e48723ffe50ed595b6ccbd8449244557659337f3f71b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJNMFvDBRk6gfeOwJp5wP2yfLpRwJQUxuXK8DK6g4xd771YEH/CKypb7H7rOp7/5akUmmzo8gvKu9pS0Rh5DCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:15:51.292657Z","bundle_sha256":"7aff9306b06f4b66246eaffc448142d91cdc441846c581271c6690330a1e0feb"}}