{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AV5YAZ46PJ6FU3OIDFYYC76EOE","short_pith_number":"pith:AV5YAZ46","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"},"canonical_sha256":"057b80679e7a7c5a6dc81971817fc47131de14bc162ce7b5575b2ae0f29f6fd4","source":{"kind":"arxiv","id":"1107.2229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2229","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2229v1","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2229","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"AV5YAZ46PJ6F","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AV5YAZ46PJ6FU3OI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AV5YAZ46","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AV5YAZ46PJ6FU3OIDFYYC76EOE","target":"record","payload":{"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"},"canonical_sha256":"057b80679e7a7c5a6dc81971817fc47131de14bc162ce7b5575b2ae0f29f6fd4","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"},"source_kind":"arxiv","source_id":"1107.2229","source_version":1,"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-18T04:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dQGrnbr+mnpAXci1DnUtG8LTOPIQO6w1j4FxEoaL83aDQoMCxFXZHpHij8fJ+XzwysuvU1WZLNt10Inh55YqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:54:29.696787Z"},"content_sha256":"7a72effdb633702c416e3d2a265214b219b02b356ffee26af798892b03e0457e","schema_version":"1.0","event_id":"sha256:7a72effdb633702c416e3d2a265214b219b02b356ffee26af798892b03e0457e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AV5YAZ46PJ6FU3OIDFYYC76EOE","target":"graph","payload":{"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"},"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-18T04:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jTC9QFGbvGa53xCbQU1gGH8UJ9aTfDw2xPoSBZ6+5+yL+7szSHfIJIiDjBPxaonJe94IXurm6Vl+ndERGcADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:54:29.697491Z"},"content_sha256":"844dfe1e34475a7f6a79429d489c187506b7b848eb2240624773b6f2105ba841","schema_version":"1.0","event_id":"sha256:844dfe1e34475a7f6a79429d489c187506b7b848eb2240624773b6f2105ba841"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/bundle.json","state_url":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/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-25T16:54:29Z","links":{"resolver":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE","bundle":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/bundle.json","state":"https://pith.science/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AV5YAZ46PJ6FU3OIDFYYC76EOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AV5YAZ46PJ6FU3OIDFYYC76EOE","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":"f7756bbabaf7ac6911fb1cda2ae74b512c084aeaefd815a4ca17736227dc9bb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-12T09:53:36Z","title_canon_sha256":"633c2a3b3c4acd98b4c1cbc835ed66b53d34455eacb2bf44cf4a6e9f4ed4c2c8"},"schema_version":"1.0","source":{"id":"1107.2229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2229","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2229v1","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2229","created_at":"2026-05-18T04:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"AV5YAZ46PJ6F","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AV5YAZ46PJ6FU3OI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AV5YAZ46","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:844dfe1e34475a7f6a79429d489c187506b7b848eb2240624773b6f2105ba841","target":"graph","created_at":"2026-05-18T04:18:25Z","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":"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","authors_text":"Pablo M. Olmos, R\\\"udiger Urbanke","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-12T09:53:36Z","title":"Scaling Behavior of Convolutional LDPC Ensembles over the BEC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2229","kind":"arxiv","version":1},"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:7a72effdb633702c416e3d2a265214b219b02b356ffee26af798892b03e0457e","target":"record","created_at":"2026-05-18T04:18:25Z","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":"f7756bbabaf7ac6911fb1cda2ae74b512c084aeaefd815a4ca17736227dc9bb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-12T09:53:36Z","title_canon_sha256":"633c2a3b3c4acd98b4c1cbc835ed66b53d34455eacb2bf44cf4a6e9f4ed4c2c8"},"schema_version":"1.0","source":{"id":"1107.2229","kind":"arxiv","version":1}},"canonical_sha256":"057b80679e7a7c5a6dc81971817fc47131de14bc162ce7b5575b2ae0f29f6fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"057b80679e7a7c5a6dc81971817fc47131de14bc162ce7b5575b2ae0f29f6fd4","first_computed_at":"2026-05-18T04:18:25.015740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:25.015740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GqN84SHiqA2alr1hmaGkL32pcwFf2eJiWH4j2bcE/2M55RkwZT5IVb+OCT8gmsTZTmIrSKHtbwbwXhVhsAG3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:25.016293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a72effdb633702c416e3d2a265214b219b02b356ffee26af798892b03e0457e","sha256:844dfe1e34475a7f6a79429d489c187506b7b848eb2240624773b6f2105ba841"],"state_sha256":"71b7281e73c44e2dd89ddf02aed0f84a683cba2bfb67945e854456cd4bb08c4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47L3lx/NksVIFN+Ero+MSe9fld2L255ruCIXb0+4WAIHn9AZUFstjFNmf8otRNHSq1vIN8t+eoXc4ucTCilbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:54:29.701282Z","bundle_sha256":"23ad91eda508162973dac8a9d38b8746f37a95035aeb91f41a6337a49fff9dca"}}