{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:WMJR6ORWCJONZJ3U64FEH3DPBP","short_pith_number":"pith:WMJR6ORW","canonical_record":{"source":{"id":"0903.1588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T16:38:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"73d2f29d0408a88e44850e35cc39e8f295825f66f584fccd9ff091fa2a9278c1","abstract_canon_sha256":"c14189cd400624094546c364894ccf92f987247d1fcc6af9ab1c5d994e7cffc5"},"schema_version":"1.0"},"canonical_sha256":"b3131f3a36125cdca774f70a43ec6f0be2f0c903f5f4b0faae8538f7e8233100","source":{"kind":"arxiv","id":"0903.1588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1588","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1588v2","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1588","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"WMJR6ORWCJON","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"pith_short_16","alias_value":"WMJR6ORWCJONZJ3U","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"pith_short_8","alias_value":"WMJR6ORW","created_at":"2026-07-04T17:27:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:WMJR6ORWCJONZJ3U64FEH3DPBP","target":"record","payload":{"canonical_record":{"source":{"id":"0903.1588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T16:38:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"73d2f29d0408a88e44850e35cc39e8f295825f66f584fccd9ff091fa2a9278c1","abstract_canon_sha256":"c14189cd400624094546c364894ccf92f987247d1fcc6af9ab1c5d994e7cffc5"},"schema_version":"1.0"},"canonical_sha256":"b3131f3a36125cdca774f70a43ec6f0be2f0c903f5f4b0faae8538f7e8233100","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:27:53.099679Z","signature_b64":"jkAqFzo4UMXTIaBy+WMZY31oy+RpBuuoaHl5sJ0QqWw4wY7XokRlyIRoEHcjpgPTFnZ0nhl5Znat1B/qtj91Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3131f3a36125cdca774f70a43ec6f0be2f0c903f5f4b0faae8538f7e8233100","last_reissued_at":"2026-07-04T17:27:53.099232Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:27:53.099232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.1588","source_version":2,"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:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbF2zBdAJTQpYo1CHEUa6/Oegl0+HUReLJPvlDkv6nNe0jsYR4DnQA1qPnYCA3d+fHTTTwLlQmE90rfO/b5/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:43:55.217644Z"},"content_sha256":"faaf83636a645dfd27bcc6efb504ab9aac6917407d8b90bb14f908e6c02c3b1c","schema_version":"1.0","event_id":"sha256:faaf83636a645dfd27bcc6efb504ab9aac6917407d8b90bb14f908e6c02c3b1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:WMJR6ORWCJONZJ3U64FEH3DPBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Enrico Paolini, Marc Fossorier, Marco Chiani, Mark F. Flanagan","submitted_at":"2009-03-09T16:38:46Z","abstract_excerpt":"In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable node minimum distance greater than 2 are shown to be have good growth rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1588","kind":"arxiv","version":2},"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/0903.1588/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:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtZX7uHhy5fBguqZA1zK67STaZVzsrBtBBmK9k+Bsb9JI479OxE2Og4eU8ZOydofs41PXyAGHdBZTMWQ01J5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:43:55.218948Z"},"content_sha256":"6ae3f35afa6e406889503fee82c16e302b864bbd35717845ac5ec0940081be8b","schema_version":"1.0","event_id":"sha256:6ae3f35afa6e406889503fee82c16e302b864bbd35717845ac5ec0940081be8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMJR6ORWCJONZJ3U64FEH3DPBP/bundle.json","state_url":"https://pith.science/pith/WMJR6ORWCJONZJ3U64FEH3DPBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMJR6ORWCJONZJ3U64FEH3DPBP/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-04T14:43:55Z","links":{"resolver":"https://pith.science/pith/WMJR6ORWCJONZJ3U64FEH3DPBP","bundle":"https://pith.science/pith/WMJR6ORWCJONZJ3U64FEH3DPBP/bundle.json","state":"https://pith.science/pith/WMJR6ORWCJONZJ3U64FEH3DPBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMJR6ORWCJONZJ3U64FEH3DPBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:WMJR6ORWCJONZJ3U64FEH3DPBP","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":"c14189cd400624094546c364894ccf92f987247d1fcc6af9ab1c5d994e7cffc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T16:38:46Z","title_canon_sha256":"73d2f29d0408a88e44850e35cc39e8f295825f66f584fccd9ff091fa2a9278c1"},"schema_version":"1.0","source":{"id":"0903.1588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1588","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1588v2","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1588","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"WMJR6ORWCJON","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"pith_short_16","alias_value":"WMJR6ORWCJONZJ3U","created_at":"2026-07-04T17:27:53Z"},{"alias_kind":"pith_short_8","alias_value":"WMJR6ORW","created_at":"2026-07-04T17:27:53Z"}],"graph_snapshots":[{"event_id":"sha256:6ae3f35afa6e406889503fee82c16e302b864bbd35717845ac5ec0940081be8b","target":"graph","created_at":"2026-07-04T17:27:53Z","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/0903.1588/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable node minimum distance greater than 2 are shown to be have good growth rate behavior, while for other ensembles a fundamental parameter is identified which discriminates between an asymptotically small and an asymptotically large expected number of small linear-weight codewords. Also, in the","authors_text":"Enrico Paolini, Marc Fossorier, Marco Chiani, Mark F. Flanagan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T16:38:46Z","title":"On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1588","kind":"arxiv","version":2},"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:faaf83636a645dfd27bcc6efb504ab9aac6917407d8b90bb14f908e6c02c3b1c","target":"record","created_at":"2026-07-04T17:27:53Z","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":"c14189cd400624094546c364894ccf92f987247d1fcc6af9ab1c5d994e7cffc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T16:38:46Z","title_canon_sha256":"73d2f29d0408a88e44850e35cc39e8f295825f66f584fccd9ff091fa2a9278c1"},"schema_version":"1.0","source":{"id":"0903.1588","kind":"arxiv","version":2}},"canonical_sha256":"b3131f3a36125cdca774f70a43ec6f0be2f0c903f5f4b0faae8538f7e8233100","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3131f3a36125cdca774f70a43ec6f0be2f0c903f5f4b0faae8538f7e8233100","first_computed_at":"2026-07-04T17:27:53.099232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:27:53.099232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkAqFzo4UMXTIaBy+WMZY31oy+RpBuuoaHl5sJ0QqWw4wY7XokRlyIRoEHcjpgPTFnZ0nhl5Znat1B/qtj91Bg==","signature_status":"signed_v1","signed_at":"2026-07-04T17:27:53.099679Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.1588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faaf83636a645dfd27bcc6efb504ab9aac6917407d8b90bb14f908e6c02c3b1c","sha256:6ae3f35afa6e406889503fee82c16e302b864bbd35717845ac5ec0940081be8b"],"state_sha256":"1c8e5a22d22ffc2425285e819540b6848e8a685955b3ef00f4fed829136aea27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1EWKeOTOGl5p6R6DrTQ67CgdHic1K6w9U1yu4VteJ4AK4tZq06blBBKoFIavd1QPRuH0Ug1E6tR/lyyog3QAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:43:55.226625Z","bundle_sha256":"612ff7a129d2b619a4dbd332c28b03784cce373286b013285645c3f98a8d3f8b"}}