{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZQ7TDP22FOSXOR3LVQVA3BKPFZ","short_pith_number":"pith:ZQ7TDP22","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"},"canonical_sha256":"cc3f31bf5a2ba577476bac2a0d854f2e55c3075d5ec360e987f79079c89ecfe5","source":{"kind":"arxiv","id":"1009.3130","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZQ7TDP22FOSXOR3LVQVA3BKPFZ","target":"record","payload":{"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"},"canonical_sha256":"cc3f31bf5a2ba577476bac2a0d854f2e55c3075d5ec360e987f79079c89ecfe5","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"},"source_kind":"arxiv","source_id":"1009.3130","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bf+k8bj7FOCESxCIBzTJo08KMlMg1JkvmQQTTorWSDv44No1roCYoHKSw0a93P7hB5YqiopQA6oOr4eyt94WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:21:14.088868Z"},"content_sha256":"3e873432660a8165d45711961100b02128b67d0ad7dba1cb186290ae451094c1","schema_version":"1.0","event_id":"sha256:3e873432660a8165d45711961100b02128b67d0ad7dba1cb186290ae451094c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZQ7TDP22FOSXOR3LVQVA3BKPFZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONAHPupQXocqqoa/uBvMm3g1NYo7v4LFv8prtOO1IKilhNXN80J++xjQY90yuScwSLh1cRJzPzu7VE4YZyb6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:21:14.089555Z"},"content_sha256":"50bb9efefb836b755a45ba3daf09b8ad5c38e4229b45da9e88b8c2cb63812594","schema_version":"1.0","event_id":"sha256:50bb9efefb836b755a45ba3daf09b8ad5c38e4229b45da9e88b8c2cb63812594"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/bundle.json","state_url":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:21:14Z","links":{"resolver":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ","bundle":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/bundle.json","state":"https://pith.science/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQ7TDP22FOSXOR3LVQVA3BKPFZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jW0WWXeTlarafolxe+DYwN/h9SLcEJb77X6SkKIUpbOajz0VEUhk2aOwlvD688Wdf3Bp0VFaQ0MWxq3k0wD6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:21:14.092662Z","bundle_sha256":"569a282d8ee4c14db460b3b0948e8a1d2a7f5a0a53418cbf4f40b8e824b06b2e"}}