{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XGANAMH6TNMKMHKM6KPGMHGTLA","short_pith_number":"pith:XGANAMH6","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"},"canonical_sha256":"b980d030fe9b58a61d4cf29e661cd358387b4664a162d6a76f4692ce026dc838","source":{"kind":"arxiv","id":"1905.04760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04760","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04760v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04760","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"XGANAMH6TNMK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XGANAMH6TNMKMHKM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XGANAMH6","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XGANAMH6TNMKMHKM6KPGMHGTLA","target":"record","payload":{"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"},"canonical_sha256":"b980d030fe9b58a61d4cf29e661cd358387b4664a162d6a76f4692ce026dc838","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"},"source_kind":"arxiv","source_id":"1905.04760","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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YaY/lgT/+JVQmZ7UOgZOqAlbL18IDv9mcknUwGQC6kqlHjXcMSuqkHNpUMj3+9Pze1nO6dKFxY/2OqJ7hY2zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:43:00.026661Z"},"content_sha256":"e883aa791753d2a609f916926f91b744370bba645fc30feb32e2bc4c259f32df","schema_version":"1.0","event_id":"sha256:e883aa791753d2a609f916926f91b744370bba645fc30feb32e2bc4c259f32df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XGANAMH6TNMKMHKM6KPGMHGTLA","target":"graph","payload":{"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"},"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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzgRsgk0/uaanM2YTGOwow2LRDId46m/xkQAdGUdemQjcfKT7evMFkSQDwxrtQVk3CSQ14WPhRSitgiweZVACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:43:00.026997Z"},"content_sha256":"765dd931c9f16f7645da936b6141cc0223e466e71bf3d1d2c66932069ed0e86c","schema_version":"1.0","event_id":"sha256:765dd931c9f16f7645da936b6141cc0223e466e71bf3d1d2c66932069ed0e86c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/bundle.json","state_url":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/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-07T14:43:00Z","links":{"resolver":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA","bundle":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/bundle.json","state":"https://pith.science/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGANAMH6TNMKMHKM6KPGMHGTLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XGANAMH6TNMKMHKM6KPGMHGTLA","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":"51166bf5f3af0d4df6afb6ebf55730ffc37d2c89a031eca4df4f799bd5547a7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-12T18:09:38Z","title_canon_sha256":"d6cc66f6ad0345b80ef9ec3836ef65c6de10ef7ec0accd1f2b9b365817962c35"},"schema_version":"1.0","source":{"id":"1905.04760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04760","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04760v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04760","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"XGANAMH6TNMK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XGANAMH6TNMKMHKM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XGANAMH6","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:765dd931c9f16f7645da936b6141cc0223e466e71bf3d1d2c66932069ed0e86c","target":"graph","created_at":"2026-05-17T23:46:23Z","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":"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","authors_text":"Mohsen Heidari, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-12T18:09:38Z","title":"Structured Mappings and Conferencing Common Information for Multiple-access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04760","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:e883aa791753d2a609f916926f91b744370bba645fc30feb32e2bc4c259f32df","target":"record","created_at":"2026-05-17T23:46:23Z","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":"51166bf5f3af0d4df6afb6ebf55730ffc37d2c89a031eca4df4f799bd5547a7f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-12T18:09:38Z","title_canon_sha256":"d6cc66f6ad0345b80ef9ec3836ef65c6de10ef7ec0accd1f2b9b365817962c35"},"schema_version":"1.0","source":{"id":"1905.04760","kind":"arxiv","version":1}},"canonical_sha256":"b980d030fe9b58a61d4cf29e661cd358387b4664a162d6a76f4692ce026dc838","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b980d030fe9b58a61d4cf29e661cd358387b4664a162d6a76f4692ce026dc838","first_computed_at":"2026-05-17T23:46:23.620284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:23.620284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"snMV+KbFEx9tVMJ1BbFpwKsjjTgVMV1IUgdNyqgA5BioSuXubtyl+5h5fjrxrJfGLVPdBlu2AUKVBa4vUrOHDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:23.620885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e883aa791753d2a609f916926f91b744370bba645fc30feb32e2bc4c259f32df","sha256:765dd931c9f16f7645da936b6141cc0223e466e71bf3d1d2c66932069ed0e86c"],"state_sha256":"b5c0e6a5980bfe0e9e635a5e08433c3ffc4b1278cf7d96418d91f501c2fab1e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdmcRlNmAqFiO+hN2W7GJjL5zTWMuNrDWB/HaHR+JPiAWD6cruVhk2ih3GvAt/8IM3mpG8TvWXpYvEzXZT1yAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:43:00.028832Z","bundle_sha256":"49beb9fa390e2636bfa3feb002a495efd25e7f301ecc61239f04619a782d4674"}}