{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EQBSTEXR6F6NO6CSW2NKGVCHBF","short_pith_number":"pith:EQBSTEXR","canonical_record":{"source":{"id":"1510.06828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-23T05:05:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de23567878d644e3f1c1328dc74a8ae285382d700eafcc756e6b012d1f4fe717","abstract_canon_sha256":"43078a95b9d85c2bc5fab3cc4d9f14c3518225acdb7944c289644b2756d5845b"},"schema_version":"1.0"},"canonical_sha256":"24032992f1f17cd77852b69aa35447095490fc81356fc17da702ff01bbbe058b","source":{"kind":"arxiv","id":"1510.06828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06828","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06828v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06828","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"EQBSTEXR6F6N","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQBSTEXR6F6NO6CS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQBSTEXR","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EQBSTEXR6F6NO6CSW2NKGVCHBF","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-23T05:05:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de23567878d644e3f1c1328dc74a8ae285382d700eafcc756e6b012d1f4fe717","abstract_canon_sha256":"43078a95b9d85c2bc5fab3cc4d9f14c3518225acdb7944c289644b2756d5845b"},"schema_version":"1.0"},"canonical_sha256":"24032992f1f17cd77852b69aa35447095490fc81356fc17da702ff01bbbe058b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.300708Z","signature_b64":"2s2OZEaQPJH1MLDKRDR8Dk4zQqqY0/fYOLcShSHBTTfJ+IG9DoVbq/XsLfhoAxtRziIB4nsgJRCxkxl3Qlz1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24032992f1f17cd77852b69aa35447095490fc81356fc17da702ff01bbbe058b","last_reissued_at":"2026-05-18T00:57:50.300118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.300118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06828","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-18T00:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO98yEgj5tSkNRZEIDYc044dZS5PYVa6g5sPOcdgSfvt+yxsr1VYMJcc5wqWjXZMgqVNnbLTwGq6JWxzcOXcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:49:32.298409Z"},"content_sha256":"e73ae74c85b9e8b25b31c44c8dc52caf2eca88cb2bb482d7787f41da054ea4c7","schema_version":"1.0","event_id":"sha256:e73ae74c85b9e8b25b31c44c8dc52caf2eca88cb2bb482d7787f41da054ea4c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EQBSTEXR6F6NO6CSW2NKGVCHBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Near-Capacity Protograph LDPC Code Sequences with Block-Error Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Asit Kumar Pradhan","submitted_at":"2015-10-23T05:05:11Z","abstract_excerpt":"Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and noise level is below threshold. Conditions for stability of protograph density evolution are established and related to the structure of the protograph. Using large-girth graphs, sequences of protograph LDPC codes with block-error threshold equal to bit-error threshold and block-error rate falling near-exponentially with blocklength are constructed determini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06828","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-18T00:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"re9FsQO2H0VGu4RVTrm2iAFKXfZBLwCYeywsCJz7wfH7AT8fnipTA2NmjJ71NSuQYPbW7YHQdUb6Y/AnfAqhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:49:32.299062Z"},"content_sha256":"3d74479cce12ff68f651dd5a3d56b7bb7a061dc7ed23c9b1735507d48b25c4cc","schema_version":"1.0","event_id":"sha256:3d74479cce12ff68f651dd5a3d56b7bb7a061dc7ed23c9b1735507d48b25c4cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF/bundle.json","state_url":"https://pith.science/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF/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-25T08:49:32Z","links":{"resolver":"https://pith.science/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF","bundle":"https://pith.science/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF/bundle.json","state":"https://pith.science/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQBSTEXR6F6NO6CSW2NKGVCHBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EQBSTEXR6F6NO6CSW2NKGVCHBF","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":"43078a95b9d85c2bc5fab3cc4d9f14c3518225acdb7944c289644b2756d5845b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-23T05:05:11Z","title_canon_sha256":"de23567878d644e3f1c1328dc74a8ae285382d700eafcc756e6b012d1f4fe717"},"schema_version":"1.0","source":{"id":"1510.06828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06828","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06828v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06828","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"EQBSTEXR6F6N","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQBSTEXR6F6NO6CS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQBSTEXR","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3d74479cce12ff68f651dd5a3d56b7bb7a061dc7ed23c9b1735507d48b25c4cc","target":"graph","created_at":"2026-05-18T00:57:50Z","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":"Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and noise level is below threshold. Conditions for stability of protograph density evolution are established and related to the structure of the protograph. Using large-girth graphs, sequences of protograph LDPC codes with block-error threshold equal to bit-error threshold and block-error rate falling near-exponentially with blocklength are constructed determini","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Asit Kumar Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-23T05:05:11Z","title":"Construction of Near-Capacity Protograph LDPC Code Sequences with Block-Error Thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06828","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:e73ae74c85b9e8b25b31c44c8dc52caf2eca88cb2bb482d7787f41da054ea4c7","target":"record","created_at":"2026-05-18T00:57:50Z","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":"43078a95b9d85c2bc5fab3cc4d9f14c3518225acdb7944c289644b2756d5845b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-23T05:05:11Z","title_canon_sha256":"de23567878d644e3f1c1328dc74a8ae285382d700eafcc756e6b012d1f4fe717"},"schema_version":"1.0","source":{"id":"1510.06828","kind":"arxiv","version":1}},"canonical_sha256":"24032992f1f17cd77852b69aa35447095490fc81356fc17da702ff01bbbe058b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24032992f1f17cd77852b69aa35447095490fc81356fc17da702ff01bbbe058b","first_computed_at":"2026-05-18T00:57:50.300118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.300118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2s2OZEaQPJH1MLDKRDR8Dk4zQqqY0/fYOLcShSHBTTfJ+IG9DoVbq/XsLfhoAxtRziIB4nsgJRCxkxl3Qlz1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.300708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e73ae74c85b9e8b25b31c44c8dc52caf2eca88cb2bb482d7787f41da054ea4c7","sha256:3d74479cce12ff68f651dd5a3d56b7bb7a061dc7ed23c9b1735507d48b25c4cc"],"state_sha256":"a78c320b86518512ba98ac17bede1308c0413e369a606587a113cb098bed60aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b96LseHbGtrD6xLn+ODRkFXW46iYGn5So1NOFrTAWRMie7gCl4prNAg9/P5myhP18YFp3S0qvs5/yp6iJ142Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:49:32.302368Z","bundle_sha256":"39448bc91309349b715d5dccfeb4f29d98c0c4f9a621c3d585556b47c517edbe"}}