{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GA44RL7IPX4C54LDHUZRUW77MB","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":"4f39cad6617d8ec701a875d270eb08b2fb625c5e8714b177c0fd7479e722e7f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-15T12:09:01Z","title_canon_sha256":"74de6649503c2e24dd709be16b56e74999577ba95fa845b0826536158618e270"},"schema_version":"1.0","source":{"id":"1004.2616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2616","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2616v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2616","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"GA44RL7IPX4C","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GA44RL7IPX4C54LD","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GA44RL7I","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:3bf20403bf1435e42755d78fab35f1234dee05761bc4139ee46cc130260fb6a8","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":"We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression [max]\\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented for the capacity of this channel. For linear assignment to f(.), i.e. X=U-{\\beta}S, this expression leads to the compensation strategy proposed previously by Willems to obtain an achievable rate for the DTC. We show that linear assignment to f(.) is optimal, under the condition that there exists a real number {\\beta}^* such that the pair (X+{\\beta}^* S,U) is independent of interference ","authors_text":"Bahareh Akhbari, Mohammad Reza Aref, Reza K. Farsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-15T12:09:01Z","title":"Achievable Rate Regions for Dirty Tape Channels and \"Joint Writing on Dirty Paper and Dirty Tape\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2616","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:84c3f627244ed0e63439a4a076e24091247cfe13380a1725dc5ed68de7975993","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":"4f39cad6617d8ec701a875d270eb08b2fb625c5e8714b177c0fd7479e722e7f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-15T12:09:01Z","title_canon_sha256":"74de6649503c2e24dd709be16b56e74999577ba95fa845b0826536158618e270"},"schema_version":"1.0","source":{"id":"1004.2616","kind":"arxiv","version":1}},"canonical_sha256":"3039c8afe87df82ef1633d331a5bff607120cbf7e34ee87604c0548849f30de7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3039c8afe87df82ef1633d331a5bff607120cbf7e34ee87604c0548849f30de7","first_computed_at":"2026-05-18T03:33:38.248836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.248836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xABAcikV8N1iXiE+3Bdyu2ccVZjE5KWrAeM0offCPqRB1Z3uTPR8Vy9aacUXk9iF+jQRvY/LqoJtz5dFT8wNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.249464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84c3f627244ed0e63439a4a076e24091247cfe13380a1725dc5ed68de7975993","sha256:3bf20403bf1435e42755d78fab35f1234dee05761bc4139ee46cc130260fb6a8"],"state_sha256":"92e97918c94d1f6e98ccc769d40fb791e70d52a21796011d12aa3913064d5732"}