{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AV5YAZ46PJ6FU3OIDFYYC76EOE","short_pith_number":"pith:AV5YAZ46","schema_version":"1.0","canonical_sha256":"057b80679e7a7c5a6dc81971817fc47131de14bc162ce7b5575b2ae0f29f6fd4","source":{"kind":"arxiv","id":"1107.2229","version":1},"attestation_state":"computed","paper":{"title":"Scaling Behavior of Convolutional LDPC Ensembles over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pablo M. Olmos, R\\\"udiger Urbanke","submitted_at":"2011-07-12T09:53:36Z","abstract_excerpt":"We study the scaling behavior of coupled sparse graph codes over the binary erasure channel. In particular, let 2L+1 be the length of the coupled chain, let M be the number of variables in each of the 2L + 1 local copies, let l be the number of iterations, let Pb denote the bit error probability, and let {\\epsilon} denote the channel parameter. We are interested in how these quantities scale when we let the blocklength (2L + 1)M tend to infinity. Based on empirical evidence we show that the threshold saturation phenomenon is rather stable with respect to the scaling of the various parameters a"},"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":"1107.2229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-12T09:53:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"633c2a3b3c4acd98b4c1cbc835ed66b53d34455eacb2bf44cf4a6e9f4ed4c2c8","abstract_canon_sha256":"f7756bbabaf7ac6911fb1cda2ae74b512c084aeaefd815a4ca17736227dc9bb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:25.016293Z","signature_b64":"GqN84SHiqA2alr1hmaGkL32pcwFf2eJiWH4j2bcE/2M55RkwZT5IVb+OCT8gmsTZTmIrSKHtbwbwXhVhsAG3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057b80679e7a7c5a6dc81971817fc47131de14bc162ce7b5575b2ae0f29f6fd4","last_reissued_at":"2026-05-18T04:18:25.015740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:25.015740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Behavior of Convolutional LDPC Ensembles over the BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pablo M. Olmos, R\\\"udiger Urbanke","submitted_at":"2011-07-12T09:53:36Z","abstract_excerpt":"We study the scaling behavior of coupled sparse graph codes over the binary erasure channel. In particular, let 2L+1 be the length of the coupled chain, let M be the number of variables in each of the 2L + 1 local copies, let l be the number of iterations, let Pb denote the bit error probability, and let {\\epsilon} denote the channel parameter. We are interested in how these quantities scale when we let the blocklength (2L + 1)M tend to infinity. Based on empirical evidence we show that the threshold saturation phenomenon is rather stable with respect to the scaling of the various parameters a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2229","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":"1107.2229","created_at":"2026-05-18T04:18:25.015811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2229v1","created_at":"2026-05-18T04:18:25.015811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2229","created_at":"2026-05-18T04:18:25.015811+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV5YAZ46PJ6F","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV5YAZ46PJ6FU3OI","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV5YAZ46","created_at":"2026-05-18T12:26:24.575870+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/AV5YAZ46PJ6FU3OIDFYYC76EOE","json":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE.json","graph_json":"https://pith.science/api/pith-number/AV5YAZ46PJ6FU3OIDFYYC76EOE/graph.json","events_json":"https://pith.science/api/pith-number/AV5YAZ46PJ6FU3OIDFYYC76EOE/events.json","paper":"https://pith.science/paper/AV5YAZ46"},"agent_actions":{"view_html":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE","download_json":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE.json","view_paper":"https://pith.science/paper/AV5YAZ46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2229&json=true","fetch_graph":"https://pith.science/api/pith-number/AV5YAZ46PJ6FU3OIDFYYC76EOE/graph.json","fetch_events":"https://pith.science/api/pith-number/AV5YAZ46PJ6FU3OIDFYYC76EOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/action/storage_attestation","attest_author":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/action/author_attestation","sign_citation":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/action/citation_signature","submit_replication":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/action/replication_record"}},"created_at":"2026-05-18T04:18:25.015811+00:00","updated_at":"2026-05-18T04:18:25.015811+00:00"}