{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZQ7TDP22FOSXOR3LVQVA3BKPFZ","short_pith_number":"pith:ZQ7TDP22","schema_version":"1.0","canonical_sha256":"cc3f31bf5a2ba577476bac2a0d854f2e55c3075d5ec360e987f79079c89ecfe5","source":{"kind":"arxiv","id":"1009.3130","version":3},"attestation_state":"computed","paper":{"title":"Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Matthieu Bloch, Steven W. McLaughlin","submitted_at":"2010-09-16T09:49:38Z","abstract_excerpt":"For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel with erasure probability $\\epsilon$, decays as $\\mathcal{O}(\\exp(-c_1 n^{c_2}))$ with the block-length $n$ for positive constants $c_1$ and $c_2$, as long as $\\epsilon$ is lesser than the erasure thresho"},"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":"1009.3130","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T09:49:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"116e70e3b82b4a3350a5b6e3feafdc6d8477d7d7da45eca934016760022803cf","abstract_canon_sha256":"95709bcc71915e72d84d462a7c5f07439716d742b08e32b9aeba28934bdfdb8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.377374Z","signature_b64":"ATF5HvsVGuuIQUS144VzJfkaiLuucZvZwA351H4lYonU3G9r1gNjbHOnCU94Dqxb4OhICiyjPo4jQkHyHGtlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc3f31bf5a2ba577476bac2a0d854f2e55c3075d5ec360e987f79079c89ecfe5","last_reissued_at":"2026-05-18T00:58:19.376647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.376647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Matthieu Bloch, Steven W. McLaughlin","submitted_at":"2010-09-16T09:49:38Z","abstract_excerpt":"For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel with erasure probability $\\epsilon$, decays as $\\mathcal{O}(\\exp(-c_1 n^{c_2}))$ with the block-length $n$ for positive constants $c_1$ and $c_2$, as long as $\\epsilon$ is lesser than the erasure thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3130","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":"1009.3130","created_at":"2026-05-18T00:58:19.376766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3130v3","created_at":"2026-05-18T00:58:19.376766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3130","created_at":"2026-05-18T00:58:19.376766+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQ7TDP22FOSX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQ7TDP22FOSXOR3L","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQ7TDP22","created_at":"2026-05-18T12:26:18.847500+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/ZQ7TDP22FOSXOR3LVQVA3BKPFZ","json":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ.json","graph_json":"https://pith.science/api/pith-number/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/graph.json","events_json":"https://pith.science/api/pith-number/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/events.json","paper":"https://pith.science/paper/ZQ7TDP22"},"agent_actions":{"view_html":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ","download_json":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ.json","view_paper":"https://pith.science/paper/ZQ7TDP22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3130&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/action/replication_record"}},"created_at":"2026-05-18T00:58:19.376766+00:00","updated_at":"2026-05-18T00:58:19.376766+00:00"}