{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:QIMPKSOTJWKSE5WRXB7VJRAPZF","short_pith_number":"pith:QIMPKSOT","schema_version":"1.0","canonical_sha256":"8218f549d34d952276d1b87f54c40fc95730bc3a90d3569d8f9e92abe39323a4","source":{"kind":"arxiv","id":"0706.3752","version":1},"attestation_state":"computed","paper":{"title":"Secure Nested Codes for Type II Wiretap Channels","license":"","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Predrag Spasojevic, Ruoheng Liu, Yingbin Liang","submitted_at":"2007-06-26T03:57:34Z","abstract_excerpt":"This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcting code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived ba"},"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":"0706.3752","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-06-26T03:57:34Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"5b4ca0405fe6b1f0ec536d84c8f1de6a61cf1e3936a17a443a50e6d36a0be6a9","abstract_canon_sha256":"d32e0af3dae5469ebe6e9a79eefaaa93f67be14300bdc7d1db7442c5cef1a21c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:02.384163Z","signature_b64":"FvMpY68Sq12Bfk2yqJVpVWAA83t9VW3xR6zBIrZsdhChYMHpUPZ5W1tDKVbz63Z9395/cE9QsP4X90mHD8i7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8218f549d34d952276d1b87f54c40fc95730bc3a90d3569d8f9e92abe39323a4","last_reissued_at":"2026-05-18T00:58:02.383543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:02.383543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Nested Codes for Type II Wiretap Channels","license":"","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Predrag Spasojevic, Ruoheng Liu, Yingbin Liang","submitted_at":"2007-06-26T03:57:34Z","abstract_excerpt":"This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcting code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.3752","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":"0706.3752","created_at":"2026-05-18T00:58:02.383622+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.3752v1","created_at":"2026-05-18T00:58:02.383622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.3752","created_at":"2026-05-18T00:58:02.383622+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIMPKSOTJWKS","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIMPKSOTJWKSE5WR","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIMPKSOT","created_at":"2026-05-18T12:25:55.427421+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/QIMPKSOTJWKSE5WRXB7VJRAPZF","json":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF.json","graph_json":"https://pith.science/api/pith-number/QIMPKSOTJWKSE5WRXB7VJRAPZF/graph.json","events_json":"https://pith.science/api/pith-number/QIMPKSOTJWKSE5WRXB7VJRAPZF/events.json","paper":"https://pith.science/paper/QIMPKSOT"},"agent_actions":{"view_html":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF","download_json":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF.json","view_paper":"https://pith.science/paper/QIMPKSOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.3752&json=true","fetch_graph":"https://pith.science/api/pith-number/QIMPKSOTJWKSE5WRXB7VJRAPZF/graph.json","fetch_events":"https://pith.science/api/pith-number/QIMPKSOTJWKSE5WRXB7VJRAPZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF/action/storage_attestation","attest_author":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF/action/author_attestation","sign_citation":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF/action/citation_signature","submit_replication":"https://pith.science/pith/QIMPKSOTJWKSE5WRXB7VJRAPZF/action/replication_record"}},"created_at":"2026-05-18T00:58:02.383622+00:00","updated_at":"2026-05-18T00:58:02.383622+00:00"}