{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GL56YZ5PYT3X3KCPWOXG2V54KV","short_pith_number":"pith:GL56YZ5P","canonical_record":{"source":{"id":"1202.1209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T17:21:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a80ea60a3068ef405f98c84c1fa97113caecf2f38ddb6197441712336ff218b2","abstract_canon_sha256":"71042f3a12e14aebbaf9b0a1e03ed5da614211270dd56404eec01c2637709eae"},"schema_version":"1.0"},"canonical_sha256":"32fbec67afc4f77da84fb3ae6d57bc55430a71faec4ae49eec67a854f29da6a5","source":{"kind":"arxiv","id":"1202.1209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1209","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1209v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1209","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"GL56YZ5PYT3X","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GL56YZ5PYT3X3KCP","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GL56YZ5P","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GL56YZ5PYT3X3KCPWOXG2V54KV","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T17:21:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a80ea60a3068ef405f98c84c1fa97113caecf2f38ddb6197441712336ff218b2","abstract_canon_sha256":"71042f3a12e14aebbaf9b0a1e03ed5da614211270dd56404eec01c2637709eae"},"schema_version":"1.0"},"canonical_sha256":"32fbec67afc4f77da84fb3ae6d57bc55430a71faec4ae49eec67a854f29da6a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.163082Z","signature_b64":"TeVSBTRa+iauySYFwbjCduB1FrMBmewi4A0K8yQvHC4jdQ7lIVMVtkQRpsmWmJ06f6MfMo4V14/fL2GSJBM4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32fbec67afc4f77da84fb3ae6d57bc55430a71faec4ae49eec67a854f29da6a5","last_reissued_at":"2026-05-18T00:58:43.162595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.162595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1209","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4UXH58CDFo//y53J/6fQwyippf0xEPG7AKuPvnFkl/gJgKMZAXteHPZBh+dgp9r0/OEQ4dzSiHCVCWh9SKKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:44:43.741542Z"},"content_sha256":"e5bfafe2c1ae9f2e3e19e786b7621d326ed67b4a69674befa12e9a9217ba89d5","schema_version":"1.0","event_id":"sha256:e5bfafe2c1ae9f2e3e19e786b7621d326ed67b4a69674befa12e9a9217ba89d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GL56YZ5PYT3X3KCPWOXG2V54KV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wyner-Ziv Type Versus Noisy Network Coding For a State-Dependent MAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Pablo Piantanida, Shlomo Shamai (Shitz)","submitted_at":"2012-02-06T17:21:28Z","abstract_excerpt":"We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual message. We find explicit characterizations of the capacity region of this communication model in both discrete memoryless and memoryless Gaussian cases. The analysis also reveals optimal ways of exploiting the knowledge of the state only strictly causally at the encoder that sends"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1209","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqORkURRGo5RwQpppaaOoZJrgUVgtq08BH7ioi7QrR2QJazHgw1E6tXttNZnrgxQtzd0sLAiXNeyGrQDWGElBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:44:43.742174Z"},"content_sha256":"90daa29cae51be3319cf59ab9fca8d4fa63af5835c86f26c11fed9b74103b538","schema_version":"1.0","event_id":"sha256:90daa29cae51be3319cf59ab9fca8d4fa63af5835c86f26c11fed9b74103b538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GL56YZ5PYT3X3KCPWOXG2V54KV/bundle.json","state_url":"https://pith.science/pith/GL56YZ5PYT3X3KCPWOXG2V54KV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GL56YZ5PYT3X3KCPWOXG2V54KV/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-05-25T20:44:43Z","links":{"resolver":"https://pith.science/pith/GL56YZ5PYT3X3KCPWOXG2V54KV","bundle":"https://pith.science/pith/GL56YZ5PYT3X3KCPWOXG2V54KV/bundle.json","state":"https://pith.science/pith/GL56YZ5PYT3X3KCPWOXG2V54KV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GL56YZ5PYT3X3KCPWOXG2V54KV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GL56YZ5PYT3X3KCPWOXG2V54KV","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":"71042f3a12e14aebbaf9b0a1e03ed5da614211270dd56404eec01c2637709eae","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T17:21:28Z","title_canon_sha256":"a80ea60a3068ef405f98c84c1fa97113caecf2f38ddb6197441712336ff218b2"},"schema_version":"1.0","source":{"id":"1202.1209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1209","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1209v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1209","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"GL56YZ5PYT3X","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GL56YZ5PYT3X3KCP","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GL56YZ5P","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:90daa29cae51be3319cf59ab9fca8d4fa63af5835c86f26c11fed9b74103b538","target":"graph","created_at":"2026-05-18T00:58:43Z","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 consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual message. We find explicit characterizations of the capacity region of this communication model in both discrete memoryless and memoryless Gaussian cases. The analysis also reveals optimal ways of exploiting the knowledge of the state only strictly causally at the encoder that sends","authors_text":"Abdellatif Zaidi, Pablo Piantanida, Shlomo Shamai (Shitz)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T17:21:28Z","title":"Wyner-Ziv Type Versus Noisy Network Coding For a State-Dependent MAC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1209","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:e5bfafe2c1ae9f2e3e19e786b7621d326ed67b4a69674befa12e9a9217ba89d5","target":"record","created_at":"2026-05-18T00:58:43Z","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":"71042f3a12e14aebbaf9b0a1e03ed5da614211270dd56404eec01c2637709eae","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-06T17:21:28Z","title_canon_sha256":"a80ea60a3068ef405f98c84c1fa97113caecf2f38ddb6197441712336ff218b2"},"schema_version":"1.0","source":{"id":"1202.1209","kind":"arxiv","version":1}},"canonical_sha256":"32fbec67afc4f77da84fb3ae6d57bc55430a71faec4ae49eec67a854f29da6a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32fbec67afc4f77da84fb3ae6d57bc55430a71faec4ae49eec67a854f29da6a5","first_computed_at":"2026-05-18T00:58:43.162595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.162595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TeVSBTRa+iauySYFwbjCduB1FrMBmewi4A0K8yQvHC4jdQ7lIVMVtkQRpsmWmJ06f6MfMo4V14/fL2GSJBM4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.163082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5bfafe2c1ae9f2e3e19e786b7621d326ed67b4a69674befa12e9a9217ba89d5","sha256:90daa29cae51be3319cf59ab9fca8d4fa63af5835c86f26c11fed9b74103b538"],"state_sha256":"8164e9210368062c7754d276d756528d62eb0d63cbdb31fdec08a3475d0884c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wf8AAmHpVh6rk7io2jFNwmO4o3YzdILWTBddfrarK3WThrkjAkGIjy+GaV5zFgZURjN4jfnJDtv2KzQKcyPBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:44:43.745571Z","bundle_sha256":"aea6aab4b989388a3eb34b3ed83db0c4b4d18e4faa91219c91c15efe41616afd"}}