{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:TP7QBSIZLRZGITDJFDQZRPMJLO","short_pith_number":"pith:TP7QBSIZ","canonical_record":{"source":{"id":"0802.0823","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2008-02-06T16:29:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e9bf72b67e149a026690b55f702d1be54ea11270a5e03e4ac85437a8d8c4b5a","abstract_canon_sha256":"bcb250a99d2a2ff4a008f7c3a6fd7e900d8c3375958fda6f01beaafa70d9523b"},"schema_version":"1.0"},"canonical_sha256":"9bff00c9195c72644c6928e198bd895bb2dfd245d206b65b1c219a0a6102ef83","source":{"kind":"arxiv","id":"0802.0823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.0823","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"0802.0823v1","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.0823","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"TP7QBSIZLRZG","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"TP7QBSIZLRZGITDJ","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"TP7QBSIZ","created_at":"2026-07-04T17:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:TP7QBSIZLRZGITDJFDQZRPMJLO","target":"record","payload":{"canonical_record":{"source":{"id":"0802.0823","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2008-02-06T16:29:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e9bf72b67e149a026690b55f702d1be54ea11270a5e03e4ac85437a8d8c4b5a","abstract_canon_sha256":"bcb250a99d2a2ff4a008f7c3a6fd7e900d8c3375958fda6f01beaafa70d9523b"},"schema_version":"1.0"},"canonical_sha256":"9bff00c9195c72644c6928e198bd895bb2dfd245d206b65b1c219a0a6102ef83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:32:16.201121Z","signature_b64":"8H4DYVsEyjgl/BEcro0I92G4HuUhepovxs/OtorcR9XPK6KVHfd7HJQVFxA27tPjeZJ+S3307JE4KktFq5jjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bff00c9195c72644c6928e198bd895bb2dfd245d206b65b1c219a0a6102ef83","last_reissued_at":"2026-07-04T17:32:16.200730Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:32:16.200730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.0823","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-07-04T17:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qfuwbhntw6OZZRG6yNwU8+RSzddFW6a8ZMxIGSyADHEF7LB7Y5W1sRVeLFA2ulTdhJmv4oUGPh1I2UrqljsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:47:06.604486Z"},"content_sha256":"480fa44849a9b275e89f6f392b8802b35b0e77d1a1574f2e29757403e623f020","schema_version":"1.0","event_id":"sha256:480fa44849a9b275e89f6f392b8802b35b0e77d1a1574f2e29757403e623f020"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:TP7QBSIZLRZGITDJFDQZRPMJLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Doubly-Generalized LDPC Codes: Stability Bound over the BEC","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Enrico Paolini, Marc Fossorier, Marco Chiani","submitted_at":"2008-02-06T16:29:14Z","abstract_excerpt":"The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of the stability condition, and is here referred to as stability bound. In this paper, a stability bound over the BEC is developed for doubly-generalized LDPC codes, where the variable and the check nodes can be generic linear block codes, assuming maximum a posteriori erasure correction at each node. It is proved that in this generalized context as well the bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.0823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0802.0823/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Lu51Ag+dOaIcUE0LdwpRRFbtvz8xgmi2b7mzTVZm0Yj378V5uk1Ebwyc6SfMYgwUoOYfiRTK5TscEtpfhIMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:47:06.604864Z"},"content_sha256":"300533b133a5542ccf3bcf49b8986d0446ae8d7b9ce250eb96a969df27680061","schema_version":"1.0","event_id":"sha256:300533b133a5542ccf3bcf49b8986d0446ae8d7b9ce250eb96a969df27680061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TP7QBSIZLRZGITDJFDQZRPMJLO/bundle.json","state_url":"https://pith.science/pith/TP7QBSIZLRZGITDJFDQZRPMJLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TP7QBSIZLRZGITDJFDQZRPMJLO/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-08-04T08:47:06Z","links":{"resolver":"https://pith.science/pith/TP7QBSIZLRZGITDJFDQZRPMJLO","bundle":"https://pith.science/pith/TP7QBSIZLRZGITDJFDQZRPMJLO/bundle.json","state":"https://pith.science/pith/TP7QBSIZLRZGITDJFDQZRPMJLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TP7QBSIZLRZGITDJFDQZRPMJLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:TP7QBSIZLRZGITDJFDQZRPMJLO","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":"bcb250a99d2a2ff4a008f7c3a6fd7e900d8c3375958fda6f01beaafa70d9523b","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2008-02-06T16:29:14Z","title_canon_sha256":"3e9bf72b67e149a026690b55f702d1be54ea11270a5e03e4ac85437a8d8c4b5a"},"schema_version":"1.0","source":{"id":"0802.0823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.0823","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"0802.0823v1","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.0823","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"TP7QBSIZLRZG","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"TP7QBSIZLRZGITDJ","created_at":"2026-07-04T17:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"TP7QBSIZ","created_at":"2026-07-04T17:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:300533b133a5542ccf3bcf49b8986d0446ae8d7b9ce250eb96a969df27680061","target":"graph","created_at":"2026-07-04T17:32:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0802.0823/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of the stability condition, and is here referred to as stability bound. In this paper, a stability bound over the BEC is developed for doubly-generalized LDPC codes, where the variable and the check nodes can be generic linear block codes, assuming maximum a posteriori erasure correction at each node. It is proved that in this generalized context as well the bou","authors_text":"Enrico Paolini, Marc Fossorier, Marco Chiani","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2008-02-06T16:29:14Z","title":"Doubly-Generalized LDPC Codes: Stability Bound over the BEC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.0823","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:480fa44849a9b275e89f6f392b8802b35b0e77d1a1574f2e29757403e623f020","target":"record","created_at":"2026-07-04T17:32:16Z","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":"bcb250a99d2a2ff4a008f7c3a6fd7e900d8c3375958fda6f01beaafa70d9523b","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2008-02-06T16:29:14Z","title_canon_sha256":"3e9bf72b67e149a026690b55f702d1be54ea11270a5e03e4ac85437a8d8c4b5a"},"schema_version":"1.0","source":{"id":"0802.0823","kind":"arxiv","version":1}},"canonical_sha256":"9bff00c9195c72644c6928e198bd895bb2dfd245d206b65b1c219a0a6102ef83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bff00c9195c72644c6928e198bd895bb2dfd245d206b65b1c219a0a6102ef83","first_computed_at":"2026-07-04T17:32:16.200730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:32:16.200730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8H4DYVsEyjgl/BEcro0I92G4HuUhepovxs/OtorcR9XPK6KVHfd7HJQVFxA27tPjeZJ+S3307JE4KktFq5jjBw==","signature_status":"signed_v1","signed_at":"2026-07-04T17:32:16.201121Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.0823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480fa44849a9b275e89f6f392b8802b35b0e77d1a1574f2e29757403e623f020","sha256:300533b133a5542ccf3bcf49b8986d0446ae8d7b9ce250eb96a969df27680061"],"state_sha256":"f0399a06f61e889fa768aa6616529fe147bad802fc2b6ea6824bf3819fa01bfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YfAK7QgXvmmdka8fooacYFLExkyUAvv+s+IajRowyldw1alcU+zT7gTcxWd4ukjJCGYxHd1T2bvQAOtUZbUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:47:06.608046Z","bundle_sha256":"13a7aaf2eeb82eb0de119963dbf0c46dbfa272c5d560feaaaec20fe5f370b299"}}