{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XGANAMH6TNMKMHKM6KPGMHGTLA","short_pith_number":"pith:XGANAMH6","schema_version":"1.0","canonical_sha256":"b980d030fe9b58a61d4cf29e661cd358387b4664a162d6a76f4692ce026dc838","source":{"kind":"arxiv","id":"1905.04760","version":1},"attestation_state":"computed","paper":{"title":"Structured Mappings and Conferencing Common Information for Multiple-access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2019-05-12T18:09:38Z","abstract_excerpt":"In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability distribution of discrete memoryless sources, and define a new common information called ``conferencing common information\". We develop a multi-user joint-source channel coding methodology based on structured mappings to encode this common information efficiently and to transmit it over a MAC. We derive a new set of sufficient conditions for this coding strategy usi"},"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":"1905.04760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-12T18:09:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6cc66f6ad0345b80ef9ec3836ef65c6de10ef7ec0accd1f2b9b365817962c35","abstract_canon_sha256":"51166bf5f3af0d4df6afb6ebf55730ffc37d2c89a031eca4df4f799bd5547a7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.620885Z","signature_b64":"snMV+KbFEx9tVMJ1BbFpwKsjjTgVMV1IUgdNyqgA5BioSuXubtyl+5h5fjrxrJfGLVPdBlu2AUKVBa4vUrOHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b980d030fe9b58a61d4cf29e661cd358387b4664a162d6a76f4692ce026dc838","last_reissued_at":"2026-05-17T23:46:23.620284Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.620284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Mappings and Conferencing Common Information for Multiple-access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohsen Heidari, S. Sandeep Pradhan","submitted_at":"2019-05-12T18:09:38Z","abstract_excerpt":"In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability distribution of discrete memoryless sources, and define a new common information called ``conferencing common information\". We develop a multi-user joint-source channel coding methodology based on structured mappings to encode this common information efficiently and to transmit it over a MAC. We derive a new set of sufficient conditions for this coding strategy usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04760","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":"1905.04760","created_at":"2026-05-17T23:46:23.620401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04760v1","created_at":"2026-05-17T23:46:23.620401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04760","created_at":"2026-05-17T23:46:23.620401+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGANAMH6TNMK","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGANAMH6TNMKMHKM","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGANAMH6","created_at":"2026-05-18T12:33:33.725879+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/XGANAMH6TNMKMHKM6KPGMHGTLA","json":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA.json","graph_json":"https://pith.science/api/pith-number/XGANAMH6TNMKMHKM6KPGMHGTLA/graph.json","events_json":"https://pith.science/api/pith-number/XGANAMH6TNMKMHKM6KPGMHGTLA/events.json","paper":"https://pith.science/paper/XGANAMH6"},"agent_actions":{"view_html":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA","download_json":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA.json","view_paper":"https://pith.science/paper/XGANAMH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04760&json=true","fetch_graph":"https://pith.science/api/pith-number/XGANAMH6TNMKMHKM6KPGMHGTLA/graph.json","fetch_events":"https://pith.science/api/pith-number/XGANAMH6TNMKMHKM6KPGMHGTLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/action/storage_attestation","attest_author":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/action/author_attestation","sign_citation":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/action/citation_signature","submit_replication":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/action/replication_record"}},"created_at":"2026-05-17T23:46:23.620401+00:00","updated_at":"2026-05-17T23:46:23.620401+00:00"}