{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SOPFUSXNLYBOF2ONIJVNTVES23","short_pith_number":"pith:SOPFUSXN","canonical_record":{"source":{"id":"1409.2100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-07T09:56:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5416fba44eb6577b65a70a0836f279a3422d6623dbe77f990a9068e1be46e59e","abstract_canon_sha256":"3441fd291afed9515589b56a52f6bdd8c52c9683731df2920add9f9c268fa5df"},"schema_version":"1.0"},"canonical_sha256":"939e5a4aed5e02e2e9cd426ad9d492d6c2bc18a1528d0848f13750099e710d6e","source":{"kind":"arxiv","id":"1409.2100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2100","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2100v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2100","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"SOPFUSXNLYBO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SOPFUSXNLYBOF2ON","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SOPFUSXN","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SOPFUSXNLYBOF2ONIJVNTVES23","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-07T09:56:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5416fba44eb6577b65a70a0836f279a3422d6623dbe77f990a9068e1be46e59e","abstract_canon_sha256":"3441fd291afed9515589b56a52f6bdd8c52c9683731df2920add9f9c268fa5df"},"schema_version":"1.0"},"canonical_sha256":"939e5a4aed5e02e2e9cd426ad9d492d6c2bc18a1528d0848f13750099e710d6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:17.868090Z","signature_b64":"2rKTXcJviAZwGvo/h5W907dc3FJUlf4gkCIVtizjihU3rY0tbpBN1gTK/uo0irLQNDubeysPQxabPhKnz+n9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"939e5a4aed5e02e2e9cd426ad9d492d6c2bc18a1528d0848f13750099e710d6e","last_reissued_at":"2026-05-18T02:43:17.867483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:17.867483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2100","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-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yXf09PRjOTh0dtrn4omx1Jwj1e7Tvpu53eS5wUU0wTXmgzWUJwRFpQ9Tb6mJFwkGr/15R7qprYK3FZQfG0m9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:36:23.978263Z"},"content_sha256":"13277dde9e9c5da74e2d45e00cc8e91747642c305102f1e9146afd0e9a30f28e","schema_version":"1.0","event_id":"sha256:13277dde9e9c5da74e2d45e00cc8e91747642c305102f1e9146afd0e9a30f28e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SOPFUSXNLYBOF2ONIJVNTVES23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi layer Gelfand Pinsker Strategies for the Generalized Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Majid Nasiri Khormuji, Mikael Skoglund, Mohammad Javad Emadi, Mohammad Reza Aref","submitted_at":"2014-09-07T09:56:16Z","abstract_excerpt":"We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \\emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by employing rate-splitting, block Markov encoding, Gelfand--Pinsker multicoding, superposition coding and joint typicality decoding. In the proposed scheme, the encoders use a partial decoding strategy to collaborate in the next block, and the receiver uses a backward decoding strategy with joint unique decoding at each stage. Our achievable rate region include"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2100","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-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peRcUUYSV/rxL+Jy43S6D1HFgXQi2Tuu0pb601OXQUurOYRn/NhxxQN26vrNg1QOsTv3MAYwJD1HIhMK1v0BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:36:23.978630Z"},"content_sha256":"04d5d618edd95873f07ee899f1390421336559cd1403b775e9e68ba1b6aadb73","schema_version":"1.0","event_id":"sha256:04d5d618edd95873f07ee899f1390421336559cd1403b775e9e68ba1b6aadb73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOPFUSXNLYBOF2ONIJVNTVES23/bundle.json","state_url":"https://pith.science/pith/SOPFUSXNLYBOF2ONIJVNTVES23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOPFUSXNLYBOF2ONIJVNTVES23/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-23T00:36:23Z","links":{"resolver":"https://pith.science/pith/SOPFUSXNLYBOF2ONIJVNTVES23","bundle":"https://pith.science/pith/SOPFUSXNLYBOF2ONIJVNTVES23/bundle.json","state":"https://pith.science/pith/SOPFUSXNLYBOF2ONIJVNTVES23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOPFUSXNLYBOF2ONIJVNTVES23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SOPFUSXNLYBOF2ONIJVNTVES23","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":"3441fd291afed9515589b56a52f6bdd8c52c9683731df2920add9f9c268fa5df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-07T09:56:16Z","title_canon_sha256":"5416fba44eb6577b65a70a0836f279a3422d6623dbe77f990a9068e1be46e59e"},"schema_version":"1.0","source":{"id":"1409.2100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2100","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2100v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2100","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"SOPFUSXNLYBO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SOPFUSXNLYBOF2ON","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SOPFUSXN","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:04d5d618edd95873f07ee899f1390421336559cd1403b775e9e68ba1b6aadb73","target":"graph","created_at":"2026-05-18T02:43:17Z","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":"We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \\emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by employing rate-splitting, block Markov encoding, Gelfand--Pinsker multicoding, superposition coding and joint typicality decoding. In the proposed scheme, the encoders use a partial decoding strategy to collaborate in the next block, and the receiver uses a backward decoding strategy with joint unique decoding at each stage. Our achievable rate region include","authors_text":"Majid Nasiri Khormuji, Mikael Skoglund, Mohammad Javad Emadi, Mohammad Reza Aref","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-07T09:56:16Z","title":"Multi layer Gelfand Pinsker Strategies for the Generalized Multiple Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2100","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:13277dde9e9c5da74e2d45e00cc8e91747642c305102f1e9146afd0e9a30f28e","target":"record","created_at":"2026-05-18T02:43:17Z","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":"3441fd291afed9515589b56a52f6bdd8c52c9683731df2920add9f9c268fa5df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-07T09:56:16Z","title_canon_sha256":"5416fba44eb6577b65a70a0836f279a3422d6623dbe77f990a9068e1be46e59e"},"schema_version":"1.0","source":{"id":"1409.2100","kind":"arxiv","version":1}},"canonical_sha256":"939e5a4aed5e02e2e9cd426ad9d492d6c2bc18a1528d0848f13750099e710d6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"939e5a4aed5e02e2e9cd426ad9d492d6c2bc18a1528d0848f13750099e710d6e","first_computed_at":"2026-05-18T02:43:17.867483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:17.867483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rKTXcJviAZwGvo/h5W907dc3FJUlf4gkCIVtizjihU3rY0tbpBN1gTK/uo0irLQNDubeysPQxabPhKnz+n9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:17.868090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13277dde9e9c5da74e2d45e00cc8e91747642c305102f1e9146afd0e9a30f28e","sha256:04d5d618edd95873f07ee899f1390421336559cd1403b775e9e68ba1b6aadb73"],"state_sha256":"00f0a74c0c761fafc9e3ec30e2d2b9f302a2a69bd22a14562c0c590a9715a019"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk+HnHEB6c78KgBj7jm4GXU/dXnUc8dbMb2DrjIRsLO0+ulotdmHLs57lmYPvLPscDDWb+K6yamP7dRQSoJ/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:36:23.980571Z","bundle_sha256":"3bfc5a3d2666fdb3d4e3f9d0e92e672aa0c3cf30566928a64c68dff59d9d9550"}}