{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O6FZUOT66JP74YYWBKHVRYQLWM","short_pith_number":"pith:O6FZUOT6","canonical_record":{"source":{"id":"1001.2218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-13T17:10:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5c57fc649b34ece8bd59a5fd281d860d28fc17680b3ffa884d08e48e05f50e2c","abstract_canon_sha256":"67b978e274b76c95c2df845c803504c2953f9a5fd926e57dab87ae7333e83e9e"},"schema_version":"1.0"},"canonical_sha256":"778b9a3a7ef25ffe63160a8f58e20bb320fec054ba8898ce435eb5d92696a79e","source":{"kind":"arxiv","id":"1001.2218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2218","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2218v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2218","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"O6FZUOT66JP7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O6FZUOT66JP74YYW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O6FZUOT6","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O6FZUOT66JP74YYWBKHVRYQLWM","target":"record","payload":{"canonical_record":{"source":{"id":"1001.2218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-13T17:10:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5c57fc649b34ece8bd59a5fd281d860d28fc17680b3ffa884d08e48e05f50e2c","abstract_canon_sha256":"67b978e274b76c95c2df845c803504c2953f9a5fd926e57dab87ae7333e83e9e"},"schema_version":"1.0"},"canonical_sha256":"778b9a3a7ef25ffe63160a8f58e20bb320fec054ba8898ce435eb5d92696a79e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.807414Z","signature_b64":"abebelsGzFWTIwjsm4tBSzJon4fCTAs3blceLdxGh4QkeBz0zGTOTzdqbuFZfhB5WQVUgvq3zAInnhpMh+H6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"778b9a3a7ef25ffe63160a8f58e20bb320fec054ba8898ce435eb5d92696a79e","last_reissued_at":"2026-05-18T00:58:19.806769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.806769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.2218","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zayWilhPw1H5lQDiWkfvTlhClVE7c3tEnpujYi7vtUqtL1tbtMthqvSOch35QVP6rHZPi6vzEbUm2e9jLKD8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:34:43.873357Z"},"content_sha256":"349da8f06b140d727186cf29a8ce31fcb92e9717c14eab58f07252bb83272a0f","schema_version":"1.0","event_id":"sha256:349da8f06b140d727186cf29a8ce31fcb92e9717c14eab58f07252bb83272a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O6FZUOT66JP74YYWBKHVRYQLWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, Luc Vandendorpe, Pablo Piantanida, Shlomo Shamai (Shitz)","submitted_at":"2010-01-13T17:10:09Z","abstract_excerpt":"We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal transmission involving cognitive and non-cognitive radios. We study the capacity of this communication model. One principal problem in this setup is caused by the relay's not knowing the channel state. In the discrete memoryless (DM) case, we establish lower bounds on channel capacity. For the Gaussian case, we derive lower and upper bounds on the channel capaci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2218","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmLzq0YXX6o7wzqclarh33jTvuCS8N/gG2JuaPLaYGrXGWtx2Ylku1M2DrnytixoMcOpMT6URRcUIZeKHcgdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:34:43.874036Z"},"content_sha256":"3c63c37f8c8e345fee5aa74fa8bb4bdba2b0411ea498678c0dd4d008d591aac4","schema_version":"1.0","event_id":"sha256:3c63c37f8c8e345fee5aa74fa8bb4bdba2b0411ea498678c0dd4d008d591aac4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6FZUOT66JP74YYWBKHVRYQLWM/bundle.json","state_url":"https://pith.science/pith/O6FZUOT66JP74YYWBKHVRYQLWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6FZUOT66JP74YYWBKHVRYQLWM/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-25T23:34:43Z","links":{"resolver":"https://pith.science/pith/O6FZUOT66JP74YYWBKHVRYQLWM","bundle":"https://pith.science/pith/O6FZUOT66JP74YYWBKHVRYQLWM/bundle.json","state":"https://pith.science/pith/O6FZUOT66JP74YYWBKHVRYQLWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6FZUOT66JP74YYWBKHVRYQLWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O6FZUOT66JP74YYWBKHVRYQLWM","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":"67b978e274b76c95c2df845c803504c2953f9a5fd926e57dab87ae7333e83e9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-13T17:10:09Z","title_canon_sha256":"5c57fc649b34ece8bd59a5fd281d860d28fc17680b3ffa884d08e48e05f50e2c"},"schema_version":"1.0","source":{"id":"1001.2218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2218","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2218v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2218","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"O6FZUOT66JP7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O6FZUOT66JP74YYW","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O6FZUOT6","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:3c63c37f8c8e345fee5aa74fa8bb4bdba2b0411ea498678c0dd4d008d591aac4","target":"graph","created_at":"2026-05-18T00:58:19Z","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 three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal transmission involving cognitive and non-cognitive radios. We study the capacity of this communication model. One principal problem in this setup is caused by the relay's not knowing the channel state. In the discrete memoryless (DM) case, we establish lower bounds on channel capacity. For the Gaussian case, we derive lower and upper bounds on the channel capaci","authors_text":"Abdellatif Zaidi, Luc Vandendorpe, 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":"2010-01-13T17:10:09Z","title":"Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2218","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:349da8f06b140d727186cf29a8ce31fcb92e9717c14eab58f07252bb83272a0f","target":"record","created_at":"2026-05-18T00:58:19Z","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":"67b978e274b76c95c2df845c803504c2953f9a5fd926e57dab87ae7333e83e9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-13T17:10:09Z","title_canon_sha256":"5c57fc649b34ece8bd59a5fd281d860d28fc17680b3ffa884d08e48e05f50e2c"},"schema_version":"1.0","source":{"id":"1001.2218","kind":"arxiv","version":1}},"canonical_sha256":"778b9a3a7ef25ffe63160a8f58e20bb320fec054ba8898ce435eb5d92696a79e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"778b9a3a7ef25ffe63160a8f58e20bb320fec054ba8898ce435eb5d92696a79e","first_computed_at":"2026-05-18T00:58:19.806769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.806769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abebelsGzFWTIwjsm4tBSzJon4fCTAs3blceLdxGh4QkeBz0zGTOTzdqbuFZfhB5WQVUgvq3zAInnhpMh+H6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.807414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.2218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349da8f06b140d727186cf29a8ce31fcb92e9717c14eab58f07252bb83272a0f","sha256:3c63c37f8c8e345fee5aa74fa8bb4bdba2b0411ea498678c0dd4d008d591aac4"],"state_sha256":"a14561c578bdd795c3a1a9b49a796317b1050b5f2a42f2e7e9049058aa09a1d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2n2+zt4f5mRwBh5hqFlP3cygbQRG4JXoteexT8PFSfh1JmUpYTeKNorM+SGSD5GQw0609m3qW0B89zQii8rfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:34:43.878294Z","bundle_sha256":"d14c58a5371c7f73755c2abac24e328330d142fc911438aa322886e7f879b50f"}}