{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KBJ4BRWYN4J5NBVVJ5SSF46EAK","short_pith_number":"pith:KBJ4BRWY","schema_version":"1.0","canonical_sha256":"5053c0c6d86f13d686b54f6522f3c402aff550a1b051926de7edba5e19565c9a","source":{"kind":"arxiv","id":"1707.04512","version":6},"attestation_state":"computed","paper":{"title":"On the Construction of Polar Codes for Achieving the Capacity of Marginal Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amirsina Torfi, Siamak Aram, Sobhan Soleymani, Vahid Tabataba Vakili","submitted_at":"2017-07-12T15:20:44Z","abstract_excerpt":"Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect secrecy rates for binary-input degraded wiretap channels in symmetric settings, they are investigated extensively in the literature recently. In this paper, a polar coding scheme to achieve secrecy capacity in non-symmetric binary input channels is proposed. The proposed scheme satisfies security and reliability conditions. The wiretap channel is assumed to b"},"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":"1707.04512","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T15:20:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50e61b5c25a88207d2e51734ae19aabcc359ff8fd51e05d583888d7e9937ea63","abstract_canon_sha256":"f203ae0021f6e0bdba08fa915d4a564c47dfb47da872fd2d17d035a31f1c09d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:28.953450Z","signature_b64":"4Rc6epQzuEQ63Q8rJIlHiWvKWmNn8FVDKCR8/QQwqDwhPeqqpdT6AfRn87Pjq3tDIZD0v4hHJwqsk+5B8UZbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5053c0c6d86f13d686b54f6522f3c402aff550a1b051926de7edba5e19565c9a","last_reissued_at":"2026-05-18T00:25:28.952880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:28.952880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Construction of Polar Codes for Achieving the Capacity of Marginal Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amirsina Torfi, Siamak Aram, Sobhan Soleymani, Vahid Tabataba Vakili","submitted_at":"2017-07-12T15:20:44Z","abstract_excerpt":"Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect secrecy rates for binary-input degraded wiretap channels in symmetric settings, they are investigated extensively in the literature recently. In this paper, a polar coding scheme to achieve secrecy capacity in non-symmetric binary input channels is proposed. The proposed scheme satisfies security and reliability conditions. The wiretap channel is assumed to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04512","kind":"arxiv","version":6},"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":"1707.04512","created_at":"2026-05-18T00:25:28.952979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04512v6","created_at":"2026-05-18T00:25:28.952979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04512","created_at":"2026-05-18T00:25:28.952979+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBJ4BRWYN4J5","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBJ4BRWYN4J5NBVV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBJ4BRWY","created_at":"2026-05-18T12:31:24.725408+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/KBJ4BRWYN4J5NBVVJ5SSF46EAK","json":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK.json","graph_json":"https://pith.science/api/pith-number/KBJ4BRWYN4J5NBVVJ5SSF46EAK/graph.json","events_json":"https://pith.science/api/pith-number/KBJ4BRWYN4J5NBVVJ5SSF46EAK/events.json","paper":"https://pith.science/paper/KBJ4BRWY"},"agent_actions":{"view_html":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK","download_json":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK.json","view_paper":"https://pith.science/paper/KBJ4BRWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04512&json=true","fetch_graph":"https://pith.science/api/pith-number/KBJ4BRWYN4J5NBVVJ5SSF46EAK/graph.json","fetch_events":"https://pith.science/api/pith-number/KBJ4BRWYN4J5NBVVJ5SSF46EAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK/action/storage_attestation","attest_author":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK/action/author_attestation","sign_citation":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK/action/citation_signature","submit_replication":"https://pith.science/pith/KBJ4BRWYN4J5NBVVJ5SSF46EAK/action/replication_record"}},"created_at":"2026-05-18T00:25:28.952979+00:00","updated_at":"2026-05-18T00:25:28.952979+00:00"}