{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F65MW7RGZKI5XG3DLZBIKQKC3P","short_pith_number":"pith:F65MW7RG","schema_version":"1.0","canonical_sha256":"2fbacb7e26ca91db9b635e42854142dbd21ee90ba3060f6e131ccb60434fa876","source":{"kind":"arxiv","id":"1603.05274","version":1},"attestation_state":"computed","paper":{"title":"New Sufficient Conditions for Multiple-Access Channel with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2016-03-16T20:51:58Z","abstract_excerpt":"The problem of three-user Multiple-Access Channel (MAC) with correlated sources is investigated. An extension to the Cover-El Gamal-Salehi (CES) scheme is introduced. We use a combination of this scheme with linear codes and propose a new coding strategy. We derive new sufficient conditions to transmit correlated sources reliably. We consider an example of three-user MAC with binary inputs. Using this example, we show strict improvements over the CES scheme."},"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":"1603.05274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T20:51:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3c3b947487126d52be4366561b6405509019276b500816b9ebcf1cb2ad11890","abstract_canon_sha256":"ac107374ea4bdbb529e56eeb7bc33b39f9834a63b04ef4b1be025359c6d5e7fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.744309Z","signature_b64":"otnHY/YONOkZoTKjPu2AzF2pW4UMBynDoX5/FIezZ4Em5ssgbAxwfbLFhuaPuL2XaZxgIdCuq7ZL13fzLGPBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fbacb7e26ca91db9b635e42854142dbd21ee90ba3060f6e131ccb60434fa876","last_reissued_at":"2026-05-18T01:18:56.743834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.743834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Sufficient Conditions for Multiple-Access Channel with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2016-03-16T20:51:58Z","abstract_excerpt":"The problem of three-user Multiple-Access Channel (MAC) with correlated sources is investigated. An extension to the Cover-El Gamal-Salehi (CES) scheme is introduced. We use a combination of this scheme with linear codes and propose a new coding strategy. We derive new sufficient conditions to transmit correlated sources reliably. We consider an example of three-user MAC with binary inputs. Using this example, we show strict improvements over the CES scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05274","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":"1603.05274","created_at":"2026-05-18T01:18:56.743904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05274v1","created_at":"2026-05-18T01:18:56.743904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05274","created_at":"2026-05-18T01:18:56.743904+00:00"},{"alias_kind":"pith_short_12","alias_value":"F65MW7RGZKI5","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F65MW7RGZKI5XG3D","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F65MW7RG","created_at":"2026-05-18T12:30:15.759754+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/F65MW7RGZKI5XG3DLZBIKQKC3P","json":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P.json","graph_json":"https://pith.science/api/pith-number/F65MW7RGZKI5XG3DLZBIKQKC3P/graph.json","events_json":"https://pith.science/api/pith-number/F65MW7RGZKI5XG3DLZBIKQKC3P/events.json","paper":"https://pith.science/paper/F65MW7RG"},"agent_actions":{"view_html":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P","download_json":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P.json","view_paper":"https://pith.science/paper/F65MW7RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05274&json=true","fetch_graph":"https://pith.science/api/pith-number/F65MW7RGZKI5XG3DLZBIKQKC3P/graph.json","fetch_events":"https://pith.science/api/pith-number/F65MW7RGZKI5XG3DLZBIKQKC3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P/action/storage_attestation","attest_author":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P/action/author_attestation","sign_citation":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P/action/citation_signature","submit_replication":"https://pith.science/pith/F65MW7RGZKI5XG3DLZBIKQKC3P/action/replication_record"}},"created_at":"2026-05-18T01:18:56.743904+00:00","updated_at":"2026-05-18T01:18:56.743904+00:00"}