{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X7O7CH3FU7H5J6TWA3IFXKRD5Y","short_pith_number":"pith:X7O7CH3F","schema_version":"1.0","canonical_sha256":"bfddf11f65a7cfd4fa7606d05baa23ee02bbaa19629b2f236b56bc869ee5d010","source":{"kind":"arxiv","id":"1904.02450","version":1},"attestation_state":"computed","paper":{"title":"On Polar Coding for Binary Dirty Paper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Barak Beilin, David Burshtein","submitted_at":"2019-04-04T10:10:59Z","abstract_excerpt":"The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communication is proposed. Successive cancellation list (SCL) decoding with properly defined CRC is used for channel coding, and SCL encoding without CRC is used for source coding. The performance is compared to the best achievable rate of any coding scheme for binary DP using nested codes. A well known problem with nested polar codes for binary DP is the existence of frozen channel code bits that are not frozen in the source"},"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":"1904.02450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-04T10:10:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49e3ae9e1bc6803b53892c9c6360611a2a3d56fb09dff19d358b268fe13f7225","abstract_canon_sha256":"b9be33ab9710d7f4d8001ed835ed8516ec0e18e554da3b926852fc44fe3ce4a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:23.632133Z","signature_b64":"+idvAof+2Jkb6+wICvzpNArQkEZ6v33KZZ8XncuCXdF5PFJ/g30irsb13Lgt6Ca8yWc5w1NkilE2MpG3dXWSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfddf11f65a7cfd4fa7606d05baa23ee02bbaa19629b2f236b56bc869ee5d010","last_reissued_at":"2026-05-17T23:49:23.631701Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:23.631701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Polar Coding for Binary Dirty Paper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Barak Beilin, David Burshtein","submitted_at":"2019-04-04T10:10:59Z","abstract_excerpt":"The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communication is proposed. Successive cancellation list (SCL) decoding with properly defined CRC is used for channel coding, and SCL encoding without CRC is used for source coding. The performance is compared to the best achievable rate of any coding scheme for binary DP using nested codes. A well known problem with nested polar codes for binary DP is the existence of frozen channel code bits that are not frozen in the source"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02450","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.02450","created_at":"2026-05-17T23:49:23.631769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02450v1","created_at":"2026-05-17T23:49:23.631769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02450","created_at":"2026-05-17T23:49:23.631769+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7O7CH3FU7H5","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7O7CH3FU7H5J6TW","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7O7CH3F","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y","json":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y.json","graph_json":"https://pith.science/api/pith-number/X7O7CH3FU7H5J6TWA3IFXKRD5Y/graph.json","events_json":"https://pith.science/api/pith-number/X7O7CH3FU7H5J6TWA3IFXKRD5Y/events.json","paper":"https://pith.science/paper/X7O7CH3F"},"agent_actions":{"view_html":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y","download_json":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y.json","view_paper":"https://pith.science/paper/X7O7CH3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02450&json=true","fetch_graph":"https://pith.science/api/pith-number/X7O7CH3FU7H5J6TWA3IFXKRD5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/X7O7CH3FU7H5J6TWA3IFXKRD5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y/action/storage_attestation","attest_author":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y/action/author_attestation","sign_citation":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y/action/citation_signature","submit_replication":"https://pith.science/pith/X7O7CH3FU7H5J6TWA3IFXKRD5Y/action/replication_record"}},"created_at":"2026-05-17T23:49:23.631769+00:00","updated_at":"2026-05-17T23:49:23.631769+00:00"}