{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RPHDNUGCD277HWV2CNLSIKYNIR","short_pith_number":"pith:RPHDNUGC","schema_version":"1.0","canonical_sha256":"8bce36d0c21ebff3daba1357242b0d4448ecd30dd09db96b642cfd982cedb9d6","source":{"kind":"arxiv","id":"1004.5540","version":1},"attestation_state":"computed","paper":{"title":"Strong Secrecy for Erasure Wiretap Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ananda T. Suresh, Andrew Thangaraj, Arunkumar Subramanian, Matthieu Bloch, Steven McLaughlin","submitted_at":"2010-04-30T14:36:50Z","abstract_excerpt":"We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of ensembles of LDPC codes with block length $n$ and girth $\\geq 2k$, for some $k \\geq 2$. We show that if the minimum left degree of the ensemble is $l_\\mathrm{min}$, the expected probability of block error is $\\calO(\\frac{1}{n^{\\lceil l_\\mathrm{min} k /2 \\rceil - k}})$ when the erasure probability $\\epsilon < \\epsilon_\\mathrm{ef}$, where $\\epsilon_\\mathrm{ef}$ depe"},"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":"1004.5540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-30T14:36:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60cece2bc210b9d08417135a7bbcdc61c3ead3ef56cb5da86f15c60fa6370794","abstract_canon_sha256":"3ac172489e84e4dfc2a2e2d7b62fcd4dc3a7b1b52117167953a09475c6c633f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:50.564934Z","signature_b64":"5GeHGBk6cStXnExm0hTPXQqbHlcQWhdIpbbvINnBbjkQgLo3BZ8qtRsd1yFV9RyPQrAjVzMs77PvpJJpL/7MCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bce36d0c21ebff3daba1357242b0d4448ecd30dd09db96b642cfd982cedb9d6","last_reissued_at":"2026-05-18T04:38:50.564384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:50.564384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Secrecy for Erasure Wiretap Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ananda T. Suresh, Andrew Thangaraj, Arunkumar Subramanian, Matthieu Bloch, Steven McLaughlin","submitted_at":"2010-04-30T14:36:50Z","abstract_excerpt":"We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of ensembles of LDPC codes with block length $n$ and girth $\\geq 2k$, for some $k \\geq 2$. We show that if the minimum left degree of the ensemble is $l_\\mathrm{min}$, the expected probability of block error is $\\calO(\\frac{1}{n^{\\lceil l_\\mathrm{min} k /2 \\rceil - k}})$ when the erasure probability $\\epsilon < \\epsilon_\\mathrm{ef}$, where $\\epsilon_\\mathrm{ef}$ depe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5540","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":"1004.5540","created_at":"2026-05-18T04:38:50.564469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.5540v1","created_at":"2026-05-18T04:38:50.564469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5540","created_at":"2026-05-18T04:38:50.564469+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPHDNUGCD277","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPHDNUGCD277HWV2","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPHDNUGC","created_at":"2026-05-18T12:26:13.927090+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/RPHDNUGCD277HWV2CNLSIKYNIR","json":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR.json","graph_json":"https://pith.science/api/pith-number/RPHDNUGCD277HWV2CNLSIKYNIR/graph.json","events_json":"https://pith.science/api/pith-number/RPHDNUGCD277HWV2CNLSIKYNIR/events.json","paper":"https://pith.science/paper/RPHDNUGC"},"agent_actions":{"view_html":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR","download_json":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR.json","view_paper":"https://pith.science/paper/RPHDNUGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.5540&json=true","fetch_graph":"https://pith.science/api/pith-number/RPHDNUGCD277HWV2CNLSIKYNIR/graph.json","fetch_events":"https://pith.science/api/pith-number/RPHDNUGCD277HWV2CNLSIKYNIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR/action/storage_attestation","attest_author":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR/action/author_attestation","sign_citation":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR/action/citation_signature","submit_replication":"https://pith.science/pith/RPHDNUGCD277HWV2CNLSIKYNIR/action/replication_record"}},"created_at":"2026-05-18T04:38:50.564469+00:00","updated_at":"2026-05-18T04:38:50.564469+00:00"}