{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZQ7TDP22FOSXOR3LVQVA3BKPFZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"95709bcc71915e72d84d462a7c5f07439716d742b08e32b9aeba28934bdfdb8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T09:49:38Z","title_canon_sha256":"116e70e3b82b4a3350a5b6e3feafdc6d8477d7d7da45eca934016760022803cf"},"schema_version":"1.0","source":{"id":"1009.3130","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3130","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3130v3","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3130","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZQ7TDP22FOSX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZQ7TDP22FOSXOR3L","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZQ7TDP22","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:50bb9efefb836b755a45ba3daf09b8ad5c38e4229b45da9e88b8c2cb63812594","target":"graph","created_at":"2026-05-18T00:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Matthieu Bloch, Steven W. McLaughlin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T09:49:38Z","title":"Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3130","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3e873432660a8165d45711961100b02128b67d0ad7dba1cb186290ae451094c1","target":"record","created_at":"2026-05-18T00:58:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"95709bcc71915e72d84d462a7c5f07439716d742b08e32b9aeba28934bdfdb8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-16T09:49:38Z","title_canon_sha256":"116e70e3b82b4a3350a5b6e3feafdc6d8477d7d7da45eca934016760022803cf"},"schema_version":"1.0","source":{"id":"1009.3130","kind":"arxiv","version":3}},"canonical_sha256":"cc3f31bf5a2ba577476bac2a0d854f2e55c3075d5ec360e987f79079c89ecfe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc3f31bf5a2ba577476bac2a0d854f2e55c3075d5ec360e987f79079c89ecfe5","first_computed_at":"2026-05-18T00:58:19.376647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.376647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ATF5HvsVGuuIQUS144VzJfkaiLuucZvZwA351H4lYonU3G9r1gNjbHOnCU94Dqxb4OhICiyjPo4jQkHyHGtlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.377374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3130","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e873432660a8165d45711961100b02128b67d0ad7dba1cb186290ae451094c1","sha256:50bb9efefb836b755a45ba3daf09b8ad5c38e4229b45da9e88b8c2cb63812594"],"state_sha256":"c84c5c5ab6f78dacda1252c0272db712aafac161d6286b4a7c86352a65287104"}