{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KI7ZVNHA26XWIMDSTEE2WS2HED","short_pith_number":"pith:KI7ZVNHA","canonical_record":{"source":{"id":"1009.6008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-29T21:30:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ee0f18537ae01c7e9b60c373ab1afcdbecf00db5d8f26c0ed869e8d7bc4386f","abstract_canon_sha256":"3c0c69c2df9ef03472137e5b38f49cf0788a41027dbceedec17cd82437891940"},"schema_version":"1.0"},"canonical_sha256":"523f9ab4e0d7af6430729909ab4b4720f220ff14bd2ae9e8bcf001facb6e842c","source":{"kind":"arxiv","id":"1009.6008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6008","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6008v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6008","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"KI7ZVNHA26XW","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KI7ZVNHA26XWIMDS","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KI7ZVNHA","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KI7ZVNHA26XWIMDSTEE2WS2HED","target":"record","payload":{"canonical_record":{"source":{"id":"1009.6008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-29T21:30:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ee0f18537ae01c7e9b60c373ab1afcdbecf00db5d8f26c0ed869e8d7bc4386f","abstract_canon_sha256":"3c0c69c2df9ef03472137e5b38f49cf0788a41027dbceedec17cd82437891940"},"schema_version":"1.0"},"canonical_sha256":"523f9ab4e0d7af6430729909ab4b4720f220ff14bd2ae9e8bcf001facb6e842c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.229828Z","signature_b64":"LQ6Sd3SXjUq5ZKkKBaPTnnGSDcufhT+tiUUbBp7Gr/M09QnPdJKpy1Nc27Xqn6bY8E0J52QbCVf4/buuHEwZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523f9ab4e0d7af6430729909ab4b4720f220ff14bd2ae9e8bcf001facb6e842c","last_reissued_at":"2026-05-18T03:33:38.229108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.229108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.6008","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KIm1vKpz9tingXn9CERdfGFL18JOks8kIHEux20IZcg1G3StYkF+2RL/1bXUILR0OArmLEMPN1NB/9Otg70OCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:38:00.778621Z"},"content_sha256":"3f064ca9af8f1dec1dd90d0c8626f1f9e5c816c13781234b4af0cdd4fafd662b","schema_version":"1.0","event_id":"sha256:3f064ca9af8f1dec1dd90d0c8626f1f9e5c816c13781234b4af0cdd4fafd662b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KI7ZVNHA26XWIMDSTEE2WS2HED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Access Channels with Cooperative Encoders and Channel State Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farokh Marvasti, Reza K. Farsani","submitted_at":"2010-09-29T21:30:21Z","abstract_excerpt":"The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with conferencing encoders (MACCE). For both situations, the two cases where the CSI is known to the encoders either non-causally or causally are studied. Achievable rate regions are established for both discrete memoryless channels and Gaussian channels with additive interference. The achievable rate regions derived for the Gaussian models with additive interference k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6008","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsxZpamwDIwXYRy9Mn47k9x1nMaPJ2YXRazUptrUsGlg8wgzg78BFLjg71oPgK+hqB12fMN0gLeLDPtIy1yqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:38:00.778957Z"},"content_sha256":"aaf469db3221cef98d2f388af743cf2a85707e08279562872d19e06756cea179","schema_version":"1.0","event_id":"sha256:aaf469db3221cef98d2f388af743cf2a85707e08279562872d19e06756cea179"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI7ZVNHA26XWIMDSTEE2WS2HED/bundle.json","state_url":"https://pith.science/pith/KI7ZVNHA26XWIMDSTEE2WS2HED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI7ZVNHA26XWIMDSTEE2WS2HED/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-05T17:38:00Z","links":{"resolver":"https://pith.science/pith/KI7ZVNHA26XWIMDSTEE2WS2HED","bundle":"https://pith.science/pith/KI7ZVNHA26XWIMDSTEE2WS2HED/bundle.json","state":"https://pith.science/pith/KI7ZVNHA26XWIMDSTEE2WS2HED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI7ZVNHA26XWIMDSTEE2WS2HED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KI7ZVNHA26XWIMDSTEE2WS2HED","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":"3c0c69c2df9ef03472137e5b38f49cf0788a41027dbceedec17cd82437891940","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-29T21:30:21Z","title_canon_sha256":"0ee0f18537ae01c7e9b60c373ab1afcdbecf00db5d8f26c0ed869e8d7bc4386f"},"schema_version":"1.0","source":{"id":"1009.6008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6008","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6008v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6008","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"KI7ZVNHA26XW","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KI7ZVNHA26XWIMDS","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KI7ZVNHA","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:aaf469db3221cef98d2f388af743cf2a85707e08279562872d19e06756cea179","target":"graph","created_at":"2026-05-18T03:33:38Z","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":"The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with conferencing encoders (MACCE). For both situations, the two cases where the CSI is known to the encoders either non-causally or causally are studied. Achievable rate regions are established for both discrete memoryless channels and Gaussian channels with additive interference. The achievable rate regions derived for the Gaussian models with additive interference k","authors_text":"Farokh Marvasti, Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-29T21:30:21Z","title":"Multiple Access Channels with Cooperative Encoders and Channel State Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6008","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:3f064ca9af8f1dec1dd90d0c8626f1f9e5c816c13781234b4af0cdd4fafd662b","target":"record","created_at":"2026-05-18T03:33:38Z","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":"3c0c69c2df9ef03472137e5b38f49cf0788a41027dbceedec17cd82437891940","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-29T21:30:21Z","title_canon_sha256":"0ee0f18537ae01c7e9b60c373ab1afcdbecf00db5d8f26c0ed869e8d7bc4386f"},"schema_version":"1.0","source":{"id":"1009.6008","kind":"arxiv","version":1}},"canonical_sha256":"523f9ab4e0d7af6430729909ab4b4720f220ff14bd2ae9e8bcf001facb6e842c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523f9ab4e0d7af6430729909ab4b4720f220ff14bd2ae9e8bcf001facb6e842c","first_computed_at":"2026-05-18T03:33:38.229108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.229108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQ6Sd3SXjUq5ZKkKBaPTnnGSDcufhT+tiUUbBp7Gr/M09QnPdJKpy1Nc27Xqn6bY8E0J52QbCVf4/buuHEwZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.229828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.6008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f064ca9af8f1dec1dd90d0c8626f1f9e5c816c13781234b4af0cdd4fafd662b","sha256:aaf469db3221cef98d2f388af743cf2a85707e08279562872d19e06756cea179"],"state_sha256":"43358554146e7315d0341c0cc9f532233f4e654b314bac5a2cf49692e9cad354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HilGRFZfVyuXdk3phXmID+QPz3n5mTP3pHKaZU9Vqd2OzMVspGafL/YqzDLKf4WUj2ksCU08wAC2UefCrNRUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:38:00.780875Z","bundle_sha256":"55bfdf7d1a27189f8ea8b9d2960318401c3408a77e685416ede4874c092d5fac"}}