{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BZVG7EYN3BLABH4CZKVN4RIZWU","short_pith_number":"pith:BZVG7EYN","canonical_record":{"source":{"id":"1204.5703","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-25T16:44:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"634aa21ece860abffbe2b8c3d5174a56f0d2f36d584b9cae63e60f585cedaa6b","abstract_canon_sha256":"982830624a81f271e47aec629dbb2709b7fa65bef302a1432cad837249e10d7e"},"schema_version":"1.0"},"canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","source":{"kind":"arxiv","id":"1204.5703","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5703","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5703v3","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5703","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"BZVG7EYN3BLA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZVG7EYN3BLABH4C","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZVG7EYN","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BZVG7EYN3BLABH4CZKVN4RIZWU","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5703","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-25T16:44:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"634aa21ece860abffbe2b8c3d5174a56f0d2f36d584b9cae63e60f585cedaa6b","abstract_canon_sha256":"982830624a81f271e47aec629dbb2709b7fa65bef302a1432cad837249e10d7e"},"schema_version":"1.0"},"canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:15.933829Z","signature_b64":"00MRFWXBv1kO1MH5rj9xNbig0ItkSHjqVeaAzw9GIVDm3+0hmW4lxG+8hyVuEg7dKlWO26kGJL8XNUo+qtRqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","last_reissued_at":"2026-05-18T02:21:15.933343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:15.933343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5703","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-18T02:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhkt9eAr6vFkcoFs3ghedsq4pdOCRB0+EtLad0GTTbRMUT25aBezMcJNj9MFvheaNPRKC0mzZKcUmDIFup4CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:14:18.231202Z"},"content_sha256":"969e9e24632d0ab9edaf55fbb3dbfaeb7b97de69441e04f678ad5b9f9cfd93b5","schema_version":"1.0","event_id":"sha256:969e9e24632d0ab9edaf55fbb3dbfaeb7b97de69441e04f678ad5b9f9cfd93b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BZVG7EYN3BLABH4CZKVN4RIZWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Proof of Threshold Saturation for Coupled Scalar Recursions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Yedla, Henry D. Pfister, Phong S. Nguyen, Yung-Yih Jian","submitted_at":"2012-04-25T16:44:24Z","abstract_excerpt":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is the threshold saturation phenomenon, which is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system.\n  In this paper, we present a simple proof of threshold saturation that applies to a broad class of coupled scalar recursions. The conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5703","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-18T02:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UywUf7Bx+akukEy7QjUXJUTOZxATeLqvTdPaaP3pwyeTpX4UiivYS99FP3lnHsOcPzvxOmljrpSFtQtmAYS/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:14:18.231646Z"},"content_sha256":"aac2d7301c3c8864935c1816cff77f2193d6fa54ce72f7e67e39dced1c81f157","schema_version":"1.0","event_id":"sha256:aac2d7301c3c8864935c1816cff77f2193d6fa54ce72f7e67e39dced1c81f157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/bundle.json","state_url":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/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-27T22:14:18Z","links":{"resolver":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU","bundle":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/bundle.json","state":"https://pith.science/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZVG7EYN3BLABH4CZKVN4RIZWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BZVG7EYN3BLABH4CZKVN4RIZWU","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":"982830624a81f271e47aec629dbb2709b7fa65bef302a1432cad837249e10d7e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-25T16:44:24Z","title_canon_sha256":"634aa21ece860abffbe2b8c3d5174a56f0d2f36d584b9cae63e60f585cedaa6b"},"schema_version":"1.0","source":{"id":"1204.5703","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5703","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5703v3","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5703","created_at":"2026-05-18T02:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"BZVG7EYN3BLA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZVG7EYN3BLABH4C","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZVG7EYN","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:aac2d7301c3c8864935c1816cff77f2193d6fa54ce72f7e67e39dced1c81f157","target":"graph","created_at":"2026-05-18T02:21:15Z","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":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is the threshold saturation phenomenon, which is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system.\n  In this paper, we present a simple proof of threshold saturation that applies to a broad class of coupled scalar recursions. The conditio","authors_text":"Arvind Yedla, Henry D. Pfister, Phong S. Nguyen, Yung-Yih Jian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-25T16:44:24Z","title":"A Simple Proof of Threshold Saturation for Coupled Scalar Recursions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5703","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:969e9e24632d0ab9edaf55fbb3dbfaeb7b97de69441e04f678ad5b9f9cfd93b5","target":"record","created_at":"2026-05-18T02:21:15Z","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":"982830624a81f271e47aec629dbb2709b7fa65bef302a1432cad837249e10d7e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-25T16:44:24Z","title_canon_sha256":"634aa21ece860abffbe2b8c3d5174a56f0d2f36d584b9cae63e60f585cedaa6b"},"schema_version":"1.0","source":{"id":"1204.5703","kind":"arxiv","version":3}},"canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e6a6f930dd856009f82caaade4519b537531c0041fc1c19270a3e30308775b4","first_computed_at":"2026-05-18T02:21:15.933343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:15.933343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00MRFWXBv1kO1MH5rj9xNbig0ItkSHjqVeaAzw9GIVDm3+0hmW4lxG+8hyVuEg7dKlWO26kGJL8XNUo+qtRqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:15.933829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5703","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:969e9e24632d0ab9edaf55fbb3dbfaeb7b97de69441e04f678ad5b9f9cfd93b5","sha256:aac2d7301c3c8864935c1816cff77f2193d6fa54ce72f7e67e39dced1c81f157"],"state_sha256":"07ae524077da95cdb1092e6314676b1dec2afca03a0f11711256f6ed8c24e0af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZE+A666+THV4NLGBp1Cr3JHLGHWpHtd9i1BpnTMVbxXbMFr1cfI8CIKEzpzBdU9SAo5IIfakNZ/pTO+/tBZnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:14:18.234839Z","bundle_sha256":"736eeca137e02c9a11b99ec5face85b4ccb11ce04e91a16beee84782201ef0d5"}}