{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RDYLET7FPA3PHVSAIXCMWK255O","short_pith_number":"pith:RDYLET7F","canonical_record":{"source":{"id":"1006.2565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-13T21:12:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b10c615fc6cfb8e2706f6b5c8acf8b77d745e87c60e6aeed5edbbb73895cf6cd","abstract_canon_sha256":"0000daf5b36e89d0492923a8b9e4d9191ad0103603122314c2832e7f8ac6b569"},"schema_version":"1.0"},"canonical_sha256":"88f0b24fe57836f3d64045c4cb2b5deb917aabee453ca48fc5dba86ef002fd46","source":{"kind":"arxiv","id":"1006.2565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2565","created_at":"2026-05-18T00:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2565v1","created_at":"2026-05-18T00:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2565","created_at":"2026-05-18T00:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"RDYLET7FPA3P","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RDYLET7FPA3PHVSA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RDYLET7F","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RDYLET7FPA3PHVSAIXCMWK255O","target":"record","payload":{"canonical_record":{"source":{"id":"1006.2565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-13T21:12:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b10c615fc6cfb8e2706f6b5c8acf8b77d745e87c60e6aeed5edbbb73895cf6cd","abstract_canon_sha256":"0000daf5b36e89d0492923a8b9e4d9191ad0103603122314c2832e7f8ac6b569"},"schema_version":"1.0"},"canonical_sha256":"88f0b24fe57836f3d64045c4cb2b5deb917aabee453ca48fc5dba86ef002fd46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:44.084309Z","signature_b64":"6zXkcQMzQhrTSMgsf8VHOIPvzfTuXigbaAwDDXBPlFCZYA8V09Z8hUSEe56uLx2D2HnMWGD4eRjWDA2gZKrvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88f0b24fe57836f3d64045c4cb2b5deb917aabee453ca48fc5dba86ef002fd46","last_reissued_at":"2026-05-18T00:58:44.083810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:44.083810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.2565","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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6DSJjYF71GErOmHV48UAzKdkqetkXihqQIT8y10DB7fqY0PESoNw73oNw76apT38KIzVlzAuwRxXgFOFS3TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:20.918033Z"},"content_sha256":"14d25c837bbf400eefd72e611214c4605fc6b2a28b600ea936ebbf20746d30d8","schema_version":"1.0","event_id":"sha256:14d25c837bbf400eefd72e611214c4605fc6b2a28b600ea936ebbf20746d30d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RDYLET7FPA3PHVSAIXCMWK255O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"State-Dependent Relay Channel with Private Messages with Partial Causal and Non-Causal Channel State Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref","submitted_at":"2010-06-13T21:12:37Z","abstract_excerpt":"In this paper, we introduce a discrete memoryless State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel. We investigate two main cases: SD-RCPM with non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In each case, it is assumed that partial CSI is available at the source and relay. For non-causal case, we establish an achievable rate region using Gel'fand-Pinsker type coding scheme at the nodes informed of CSI, and Compress-and-Forward (CF) scheme at the relay. Using Shannon's strategy and CF scheme, an achi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2565","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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KVL2tpu8LIgz77pBahJhrkdPVR5NFH/VF44+iONptevubiqt0wED7aW3qIlcp/1I083Ck3knlZWdPjfyG66Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:20.918395Z"},"content_sha256":"cebf6de472abf7612532399aee5c5aff3bbb3b008d206d1454cc5ae29b735d48","schema_version":"1.0","event_id":"sha256:cebf6de472abf7612532399aee5c5aff3bbb3b008d206d1454cc5ae29b735d48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDYLET7FPA3PHVSAIXCMWK255O/bundle.json","state_url":"https://pith.science/pith/RDYLET7FPA3PHVSAIXCMWK255O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDYLET7FPA3PHVSAIXCMWK255O/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-01T05:45:20Z","links":{"resolver":"https://pith.science/pith/RDYLET7FPA3PHVSAIXCMWK255O","bundle":"https://pith.science/pith/RDYLET7FPA3PHVSAIXCMWK255O/bundle.json","state":"https://pith.science/pith/RDYLET7FPA3PHVSAIXCMWK255O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDYLET7FPA3PHVSAIXCMWK255O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RDYLET7FPA3PHVSAIXCMWK255O","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":"0000daf5b36e89d0492923a8b9e4d9191ad0103603122314c2832e7f8ac6b569","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-13T21:12:37Z","title_canon_sha256":"b10c615fc6cfb8e2706f6b5c8acf8b77d745e87c60e6aeed5edbbb73895cf6cd"},"schema_version":"1.0","source":{"id":"1006.2565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2565","created_at":"2026-05-18T00:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2565v1","created_at":"2026-05-18T00:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2565","created_at":"2026-05-18T00:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"RDYLET7FPA3P","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RDYLET7FPA3PHVSA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RDYLET7F","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:cebf6de472abf7612532399aee5c5aff3bbb3b008d206d1454cc5ae29b735d48","target":"graph","created_at":"2026-05-18T00:58:44Z","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 paper, we introduce a discrete memoryless State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel. We investigate two main cases: SD-RCPM with non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In each case, it is assumed that partial CSI is available at the source and relay. For non-causal case, we establish an achievable rate region using Gel'fand-Pinsker type coding scheme at the nodes informed of CSI, and Compress-and-Forward (CF) scheme at the relay. Using Shannon's strategy and CF scheme, an achi","authors_text":"Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-13T21:12:37Z","title":"State-Dependent Relay Channel with Private Messages with Partial Causal and Non-Causal Channel State Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2565","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:14d25c837bbf400eefd72e611214c4605fc6b2a28b600ea936ebbf20746d30d8","target":"record","created_at":"2026-05-18T00:58:44Z","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":"0000daf5b36e89d0492923a8b9e4d9191ad0103603122314c2832e7f8ac6b569","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-13T21:12:37Z","title_canon_sha256":"b10c615fc6cfb8e2706f6b5c8acf8b77d745e87c60e6aeed5edbbb73895cf6cd"},"schema_version":"1.0","source":{"id":"1006.2565","kind":"arxiv","version":1}},"canonical_sha256":"88f0b24fe57836f3d64045c4cb2b5deb917aabee453ca48fc5dba86ef002fd46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88f0b24fe57836f3d64045c4cb2b5deb917aabee453ca48fc5dba86ef002fd46","first_computed_at":"2026-05-18T00:58:44.083810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:44.083810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6zXkcQMzQhrTSMgsf8VHOIPvzfTuXigbaAwDDXBPlFCZYA8V09Z8hUSEe56uLx2D2HnMWGD4eRjWDA2gZKrvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:44.084309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.2565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14d25c837bbf400eefd72e611214c4605fc6b2a28b600ea936ebbf20746d30d8","sha256:cebf6de472abf7612532399aee5c5aff3bbb3b008d206d1454cc5ae29b735d48"],"state_sha256":"0eae49a858de57ad08125a7669936c06778cf8a4d4500108eb54c1dd5ab089a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXYh/on9SX5iZdX+rC8QhbwPnvmo+r9uhCQs++Y+kld57Qmn3uw6FsADZpwhF52kz4Z8f/q9RE00FSz737KvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:45:20.920374Z","bundle_sha256":"c6b0a175dd1302703d92e60b737666b9d7aeac7ec6f8c6394e9249ebcfaf774a"}}