{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U524ZOOR7SQJFZGEOCPAIEJ6S4","short_pith_number":"pith:U524ZOOR","schema_version":"1.0","canonical_sha256":"a775ccb9d1fca092e4c4709e04113e9725f4ecfb822d325972695563c6fee67b","source":{"kind":"arxiv","id":"1101.1688","version":3},"attestation_state":"computed","paper":{"title":"Secret Writing on Dirty Paper: A Deterministic View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Costas Georghiades, Mustafa El-Halabi, Shlomo Shamai (Shitz), Tie Liu","submitted_at":"2011-01-10T00:13:39Z","abstract_excerpt":"Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as \"secret writing on dirty paper\") to within half a bit."},"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":"1101.1688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-10T00:13:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f1f83912159d0e423b8787e06d459ebaabe3392395bd678bfe8a4c5a69825de3","abstract_canon_sha256":"e39033b6e1f461447daacc8fb204161e50b3a96650480d4661eb685df54e69aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.731133Z","signature_b64":"L1/GN628fj44EcyrdaIVMkv2MlBLH25SS35huoylA9zGV7sHGi8ewGMBInIXnA6mC9Xjesz0Un+JmcvNwjf6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a775ccb9d1fca092e4c4709e04113e9725f4ecfb822d325972695563c6fee67b","last_reissued_at":"2026-05-18T00:58:43.730593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.730593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret Writing on Dirty Paper: A Deterministic View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Costas Georghiades, Mustafa El-Halabi, Shlomo Shamai (Shitz), Tie Liu","submitted_at":"2011-01-10T00:13:39Z","abstract_excerpt":"Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as \"secret writing on dirty paper\") to within half a bit."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1688","kind":"arxiv","version":3},"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":"1101.1688","created_at":"2026-05-18T00:58:43.730676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1688v3","created_at":"2026-05-18T00:58:43.730676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1688","created_at":"2026-05-18T00:58:43.730676+00:00"},{"alias_kind":"pith_short_12","alias_value":"U524ZOOR7SQJ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U524ZOOR7SQJFZGE","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U524ZOOR","created_at":"2026-05-18T12:26:42.757692+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/U524ZOOR7SQJFZGEOCPAIEJ6S4","json":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4.json","graph_json":"https://pith.science/api/pith-number/U524ZOOR7SQJFZGEOCPAIEJ6S4/graph.json","events_json":"https://pith.science/api/pith-number/U524ZOOR7SQJFZGEOCPAIEJ6S4/events.json","paper":"https://pith.science/paper/U524ZOOR"},"agent_actions":{"view_html":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4","download_json":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4.json","view_paper":"https://pith.science/paper/U524ZOOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1688&json=true","fetch_graph":"https://pith.science/api/pith-number/U524ZOOR7SQJFZGEOCPAIEJ6S4/graph.json","fetch_events":"https://pith.science/api/pith-number/U524ZOOR7SQJFZGEOCPAIEJ6S4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4/action/storage_attestation","attest_author":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4/action/author_attestation","sign_citation":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4/action/citation_signature","submit_replication":"https://pith.science/pith/U524ZOOR7SQJFZGEOCPAIEJ6S4/action/replication_record"}},"created_at":"2026-05-18T00:58:43.730676+00:00","updated_at":"2026-05-18T00:58:43.730676+00:00"}