{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6ZHAVXYH4PXLN4QMTDRZWMYBXQ","short_pith_number":"pith:6ZHAVXYH","schema_version":"1.0","canonical_sha256":"f64e0adf07e3eeb6f20c98e39b3301bc373026f6d5d248efd948ae157649f1a1","source":{"kind":"arxiv","id":"2507.17427","version":1},"attestation_state":"computed","paper":{"title":"Learning to Write on Dirty Paper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elza Erkip, Ezgi Ozyilkan, O\\u{g}uzhan Kubilay \\\"Ulger","submitted_at":"2025-07-23T11:36:43Z","abstract_excerpt":"Dirty paper coding (DPC) is a classical problem in information theory that considers communication in the presence of channel state known only at the transmitter. While the theoretical impact of DPC has been substantial, practical realizations of DPC, such as Tomlinson-Harashima precoding (THP) or lattice-based schemes, often rely on specific modeling assumptions about the input, state and channel. In this work, we explore whether modern learning-based approaches can offer a complementary path forward by revisiting the DPC problem. We propose a data-driven solution in which both the encoder an"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.17427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-23T11:36:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b632375370abb0b0f3126bca222998ba762b8c1165901746745f11e8f8c7c6aa","abstract_canon_sha256":"3e610ac96c37d0f6424fdb03c3bd05ed4e0a34b7511f6e8882b5d681e5816ed4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:07.403699Z","signature_b64":"ot0RK9qqAjfbS79FCIH8N8ZgXvDkk1zQxpGbxo5dwVDWeK75sZZjx7Vt5zwY9H9l+jvEYveVjY9mGuayr6DCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f64e0adf07e3eeb6f20c98e39b3301bc373026f6d5d248efd948ae157649f1a1","last_reissued_at":"2026-07-05T11:42:07.403281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:07.403281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Write on Dirty Paper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elza Erkip, Ezgi Ozyilkan, O\\u{g}uzhan Kubilay \\\"Ulger","submitted_at":"2025-07-23T11:36:43Z","abstract_excerpt":"Dirty paper coding (DPC) is a classical problem in information theory that considers communication in the presence of channel state known only at the transmitter. While the theoretical impact of DPC has been substantial, practical realizations of DPC, such as Tomlinson-Harashima precoding (THP) or lattice-based schemes, often rely on specific modeling assumptions about the input, state and channel. In this work, we explore whether modern learning-based approaches can offer a complementary path forward by revisiting the DPC problem. We propose a data-driven solution in which both the encoder an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17427","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.17427/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.17427","created_at":"2026-07-05T11:42:07.403340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17427v1","created_at":"2026-07-05T11:42:07.403340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17427","created_at":"2026-07-05T11:42:07.403340+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZHAVXYH4PXL","created_at":"2026-07-05T11:42:07.403340+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZHAVXYH4PXLN4QM","created_at":"2026-07-05T11:42:07.403340+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZHAVXYH","created_at":"2026-07-05T11:42:07.403340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23252","citing_title":"Learning to Compute on Dirty Paper","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ","json":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ.json","graph_json":"https://pith.science/api/pith-number/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/graph.json","events_json":"https://pith.science/api/pith-number/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/events.json","paper":"https://pith.science/paper/6ZHAVXYH"},"agent_actions":{"view_html":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ","download_json":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ.json","view_paper":"https://pith.science/paper/6ZHAVXYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17427&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/action/storage_attestation","attest_author":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/action/author_attestation","sign_citation":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/action/citation_signature","submit_replication":"https://pith.science/pith/6ZHAVXYH4PXLN4QMTDRZWMYBXQ/action/replication_record"}},"created_at":"2026-07-05T11:42:07.403340+00:00","updated_at":"2026-07-05T11:42:07.403340+00:00"}