{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GGXVMJ7I6FBRYMPXZOG5CGVRLX","short_pith_number":"pith:GGXVMJ7I","canonical_record":{"source":{"id":"1507.03804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T11:14:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5d53d2266fad007421e9c32f11e6ff092d4fcb4c36469be494fcae1ba6c4e66","abstract_canon_sha256":"3997e5772fbe7fd8d91e9d3fc6cc4705b312d5532b36372040c827ee83c0bfc2"},"schema_version":"1.0"},"canonical_sha256":"31af5627e8f1431c31f7cb8dd11ab15dc068cecee593e82d84e0cfc5700abfe3","source":{"kind":"arxiv","id":"1507.03804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03804","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03804v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03804","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"GGXVMJ7I6FBR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GGXVMJ7I6FBRYMPX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GGXVMJ7I","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GGXVMJ7I6FBRYMPXZOG5CGVRLX","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T11:14:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5d53d2266fad007421e9c32f11e6ff092d4fcb4c36469be494fcae1ba6c4e66","abstract_canon_sha256":"3997e5772fbe7fd8d91e9d3fc6cc4705b312d5532b36372040c827ee83c0bfc2"},"schema_version":"1.0"},"canonical_sha256":"31af5627e8f1431c31f7cb8dd11ab15dc068cecee593e82d84e0cfc5700abfe3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.292939Z","signature_b64":"J6b6rxHxYlUVtbI7O9jKDyd6U+ppwGske/9pcHh1n8G5/jJdD1IdjJkm8+ylZaxAfnzBlrjL0+ShNSlKvu3dBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31af5627e8f1431c31f7cb8dd11ab15dc068cecee593e82d84e0cfc5700abfe3","last_reissued_at":"2026-05-18T01:36:57.292070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.292070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03804","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-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCybgrISuipORDJg9C0hZg6hU/TcEgQ+jtg0xKIgEonGAnnRoWxzS2+yNVjJ/siMJOLee/u1YBOLu+Ug40S0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:36:01.737659Z"},"content_sha256":"0dd792ebbd704a00f49ab6d3262bff79e53952203a19f422bd03e029d1907e75","schema_version":"1.0","event_id":"sha256:0dd792ebbd704a00f49ab6d3262bff79e53952203a19f422bd03e029d1907e75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GGXVMJ7I6FBRYMPXZOG5CGVRLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A lower bound on the data rate of dirty paper coding in general noise and interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Yellin, Itsik Bergel, Shlomo Shamai","submitted_at":"2015-07-14T11:14:30Z","abstract_excerpt":"Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the interference are statistically independent Gaussian random sequences. More recent works extended this approach to the case where the noise and the interference are mutually independent and at least one of them is Gaussian. In this letter we further extend the DPC scheme by relaxing the Gaussian and statistical independence assumptions. We provide lower bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03804","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-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQGj93Jf4x3dccHSHI6rb9mEJPcUt6/4+1MdqLJsKc5f+rzciPnOnLaIBGzIl6e15E3HJ18LdV/hGvHkyOP2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:36:01.738002Z"},"content_sha256":"af0273a14f93fac3187b2ee9e71b46966e576b9e3d050794439d5dccd44e697c","schema_version":"1.0","event_id":"sha256:af0273a14f93fac3187b2ee9e71b46966e576b9e3d050794439d5dccd44e697c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX/bundle.json","state_url":"https://pith.science/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX/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-07T04:36:01Z","links":{"resolver":"https://pith.science/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX","bundle":"https://pith.science/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX/bundle.json","state":"https://pith.science/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGXVMJ7I6FBRYMPXZOG5CGVRLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GGXVMJ7I6FBRYMPXZOG5CGVRLX","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":"3997e5772fbe7fd8d91e9d3fc6cc4705b312d5532b36372040c827ee83c0bfc2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T11:14:30Z","title_canon_sha256":"a5d53d2266fad007421e9c32f11e6ff092d4fcb4c36469be494fcae1ba6c4e66"},"schema_version":"1.0","source":{"id":"1507.03804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03804","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03804v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03804","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"GGXVMJ7I6FBR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GGXVMJ7I6FBRYMPX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GGXVMJ7I","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:af0273a14f93fac3187b2ee9e71b46966e576b9e3d050794439d5dccd44e697c","target":"graph","created_at":"2026-05-18T01:36:57Z","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":"Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the interference are statistically independent Gaussian random sequences. More recent works extended this approach to the case where the noise and the interference are mutually independent and at least one of them is Gaussian. In this letter we further extend the DPC scheme by relaxing the Gaussian and statistical independence assumptions. We provide lower bounds ","authors_text":"Daniel Yellin, Itsik Bergel, Shlomo Shamai","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T11:14:30Z","title":"A lower bound on the data rate of dirty paper coding in general noise and interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03804","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:0dd792ebbd704a00f49ab6d3262bff79e53952203a19f422bd03e029d1907e75","target":"record","created_at":"2026-05-18T01:36:57Z","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":"3997e5772fbe7fd8d91e9d3fc6cc4705b312d5532b36372040c827ee83c0bfc2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T11:14:30Z","title_canon_sha256":"a5d53d2266fad007421e9c32f11e6ff092d4fcb4c36469be494fcae1ba6c4e66"},"schema_version":"1.0","source":{"id":"1507.03804","kind":"arxiv","version":1}},"canonical_sha256":"31af5627e8f1431c31f7cb8dd11ab15dc068cecee593e82d84e0cfc5700abfe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31af5627e8f1431c31f7cb8dd11ab15dc068cecee593e82d84e0cfc5700abfe3","first_computed_at":"2026-05-18T01:36:57.292070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:57.292070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J6b6rxHxYlUVtbI7O9jKDyd6U+ppwGske/9pcHh1n8G5/jJdD1IdjJkm8+ylZaxAfnzBlrjL0+ShNSlKvu3dBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:57.292939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dd792ebbd704a00f49ab6d3262bff79e53952203a19f422bd03e029d1907e75","sha256:af0273a14f93fac3187b2ee9e71b46966e576b9e3d050794439d5dccd44e697c"],"state_sha256":"463780e63a259745e43d03bfc9e6887f780232b55f70c6182ab33d70ebf2bbcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIIemxblQBXRHhSaegKcW0bTzM3UTWAEVNWvBxNUmCmBxPL/Px16B57P3xZP2NEDyriLiP0vYgt5zzooitFxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:36:01.740025Z","bundle_sha256":"ec4abeb177a6ae47570a1497659de1fa12c34267a6a1b24c661ec05dbb5debb5"}}