{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GA44RL7IPX4C54LDHUZRUW77MB","short_pith_number":"pith:GA44RL7I","canonical_record":{"source":{"id":"1004.2616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-15T12:09:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74de6649503c2e24dd709be16b56e74999577ba95fa845b0826536158618e270","abstract_canon_sha256":"4f39cad6617d8ec701a875d270eb08b2fb625c5e8714b177c0fd7479e722e7f1"},"schema_version":"1.0"},"canonical_sha256":"3039c8afe87df82ef1633d331a5bff607120cbf7e34ee87604c0548849f30de7","source":{"kind":"arxiv","id":"1004.2616","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GA44RL7IPX4C54LDHUZRUW77MB","target":"record","payload":{"canonical_record":{"source":{"id":"1004.2616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-15T12:09:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74de6649503c2e24dd709be16b56e74999577ba95fa845b0826536158618e270","abstract_canon_sha256":"4f39cad6617d8ec701a875d270eb08b2fb625c5e8714b177c0fd7479e722e7f1"},"schema_version":"1.0"},"canonical_sha256":"3039c8afe87df82ef1633d331a5bff607120cbf7e34ee87604c0548849f30de7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.249464Z","signature_b64":"xABAcikV8N1iXiE+3Bdyu2ccVZjE5KWrAeM0offCPqRB1Z3uTPR8Vy9aacUXk9iF+jQRvY/LqoJtz5dFT8wNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3039c8afe87df82ef1633d331a5bff607120cbf7e34ee87604c0548849f30de7","last_reissued_at":"2026-05-18T03:33:38.248836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.248836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.2616","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+Ax68f+RGKdzwCZQzYGFraG1/z/OOOKXcgNiDfHFVQnabTAIfLgaBrGzSd0okWeMfuG1RSi6+CYBQl2FV3lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:53:03.316581Z"},"content_sha256":"84c3f627244ed0e63439a4a076e24091247cfe13380a1725dc5ed68de7975993","schema_version":"1.0","event_id":"sha256:84c3f627244ed0e63439a4a076e24091247cfe13380a1725dc5ed68de7975993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GA44RL7IPX4C54LDHUZRUW77MB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievable Rate Regions for Dirty Tape Channels and \"Joint Writing on Dirty Paper and Dirty Tape\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bahareh Akhbari, Mohammad Reza Aref, Reza K. Farsani","submitted_at":"2010-04-15T12:09:01Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2616","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7psm3islRRnPvGSKWemnY2/nCC8PKQ+CPxTHpPT/3IcUjnoTXoG4iF1DRiSxqkSK77a4W7ph20emyr/OThO6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:53:03.316930Z"},"content_sha256":"3bf20403bf1435e42755d78fab35f1234dee05761bc4139ee46cc130260fb6a8","schema_version":"1.0","event_id":"sha256:3bf20403bf1435e42755d78fab35f1234dee05761bc4139ee46cc130260fb6a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GA44RL7IPX4C54LDHUZRUW77MB/bundle.json","state_url":"https://pith.science/pith/GA44RL7IPX4C54LDHUZRUW77MB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GA44RL7IPX4C54LDHUZRUW77MB/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-01T06:53:03Z","links":{"resolver":"https://pith.science/pith/GA44RL7IPX4C54LDHUZRUW77MB","bundle":"https://pith.science/pith/GA44RL7IPX4C54LDHUZRUW77MB/bundle.json","state":"https://pith.science/pith/GA44RL7IPX4C54LDHUZRUW77MB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GA44RL7IPX4C54LDHUZRUW77MB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FK4PBjAEvtfSyyoieU0qPwTnZuSfwqDOOce7sugeDKS1R4VJDWuIDQCtFj8Kdly+JZSwWiQvsXMOWM4t+ua5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:53:03.318938Z","bundle_sha256":"93d0301d047d3c3f869668780f88824c2560a6a7a5be7fd13dbd9574c8c0ebc1"}}