{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:O54BBJ4LHWKXJT47XD2BS3LZFP","short_pith_number":"pith:O54BBJ4L","canonical_record":{"source":{"id":"0911.4522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-23T23:49:13Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"cb81fb7ceb3a449de97c1919dcb66a312e2d3a26f5c3684157d820414be67168","abstract_canon_sha256":"58fd143f2e60a7e5ee39f6b39e96c53fea0f348d52e661d737abf77fb3f032af"},"schema_version":"1.0"},"canonical_sha256":"777810a78b3d9574cf9fb8f4196d792bdb3acdb4c0ae76c25e7307cd6e814bf3","source":{"kind":"arxiv","id":"0911.4522","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4522","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4522v2","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4522","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"pith_short_12","alias_value":"O54BBJ4LHWKX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O54BBJ4LHWKXJT47","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O54BBJ4L","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:O54BBJ4LHWKXJT47XD2BS3LZFP","target":"record","payload":{"canonical_record":{"source":{"id":"0911.4522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-23T23:49:13Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"cb81fb7ceb3a449de97c1919dcb66a312e2d3a26f5c3684157d820414be67168","abstract_canon_sha256":"58fd143f2e60a7e5ee39f6b39e96c53fea0f348d52e661d737abf77fb3f032af"},"schema_version":"1.0"},"canonical_sha256":"777810a78b3d9574cf9fb8f4196d792bdb3acdb4c0ae76c25e7307cd6e814bf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:20.459689Z","signature_b64":"wJGMuO6HjIMdiVGhg7HXNGpU2Pfc4o8rAQxYTLzfcmGIV0YFZZgdTiNvRjSdpfpyI40g1Hn7S7ft6KWA1KDqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"777810a78b3d9574cf9fb8f4196d792bdb3acdb4c0ae76c25e7307cd6e814bf3","last_reissued_at":"2026-05-18T04:28:20.459068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:20.459068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.4522","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-05-18T04:28:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4+vGJRyNGlXFtvdYokS6MrQWWVlQ5xOeL3Qp5IAVTnctThhu7ooOYWGhZZrEEkTW/N58GMnTUf4AGbZsINZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:13:31.963474Z"},"content_sha256":"9fc6d48bc74e404f9c0da11a83b42a54157a8147633f5e9f53db32aaf7d06ff9","schema_version":"1.0","event_id":"sha256:9fc6d48bc74e404f9c0da11a83b42a54157a8147633f5e9f53db32aaf7d06ff9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:O54BBJ4LHWKXJT47XD2BS3LZFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Number of Errors Correctable with Codes on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Arya Mazumdar","submitted_at":"2009-11-23T23:49:13Z","abstract_excerpt":"We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs. It is known that the average minimum distance of codes in these ensembles grows linearly with the code length. We show that these codes can correct a linearly growing number of errors under simple iterative decoding algorithms. In particular, we show that this property extends to codes constructed by parallel concatenation of Hamming codes and other codes with small minimum distance. Previously"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4522","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":""},"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:28:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHHuKmobfc89ZzlJKEeJOoJZjqYvZ0CEhe9OmEKBoc9d0efFJtz/MWeKSOmgUlOtBrGDjYrYk+sXSePNiQ/vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:13:31.964147Z"},"content_sha256":"a4825f7ee535e1d010043e2fef49d33dbddff3d30b408a0ed5f7ccf1c03e2456","schema_version":"1.0","event_id":"sha256:a4825f7ee535e1d010043e2fef49d33dbddff3d30b408a0ed5f7ccf1c03e2456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O54BBJ4LHWKXJT47XD2BS3LZFP/bundle.json","state_url":"https://pith.science/pith/O54BBJ4LHWKXJT47XD2BS3LZFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O54BBJ4LHWKXJT47XD2BS3LZFP/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-06-07T06:13:31Z","links":{"resolver":"https://pith.science/pith/O54BBJ4LHWKXJT47XD2BS3LZFP","bundle":"https://pith.science/pith/O54BBJ4LHWKXJT47XD2BS3LZFP/bundle.json","state":"https://pith.science/pith/O54BBJ4LHWKXJT47XD2BS3LZFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O54BBJ4LHWKXJT47XD2BS3LZFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:O54BBJ4LHWKXJT47XD2BS3LZFP","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":"58fd143f2e60a7e5ee39f6b39e96c53fea0f348d52e661d737abf77fb3f032af","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-23T23:49:13Z","title_canon_sha256":"cb81fb7ceb3a449de97c1919dcb66a312e2d3a26f5c3684157d820414be67168"},"schema_version":"1.0","source":{"id":"0911.4522","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4522","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4522v2","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4522","created_at":"2026-05-18T04:28:20Z"},{"alias_kind":"pith_short_12","alias_value":"O54BBJ4LHWKX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O54BBJ4LHWKXJT47","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O54BBJ4L","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:a4825f7ee535e1d010043e2fef49d33dbddff3d30b408a0ed5f7ccf1c03e2456","target":"graph","created_at":"2026-05-18T04:28:20Z","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 ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs. It is known that the average minimum distance of codes in these ensembles grows linearly with the code length. We show that these codes can correct a linearly growing number of errors under simple iterative decoding algorithms. In particular, we show that this property extends to codes constructed by parallel concatenation of Hamming codes and other codes with small minimum distance. Previously","authors_text":"Alexander Barg, Arya Mazumdar","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-23T23:49:13Z","title":"On the Number of Errors Correctable with Codes on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4522","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:9fc6d48bc74e404f9c0da11a83b42a54157a8147633f5e9f53db32aaf7d06ff9","target":"record","created_at":"2026-05-18T04:28:20Z","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":"58fd143f2e60a7e5ee39f6b39e96c53fea0f348d52e661d737abf77fb3f032af","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-23T23:49:13Z","title_canon_sha256":"cb81fb7ceb3a449de97c1919dcb66a312e2d3a26f5c3684157d820414be67168"},"schema_version":"1.0","source":{"id":"0911.4522","kind":"arxiv","version":2}},"canonical_sha256":"777810a78b3d9574cf9fb8f4196d792bdb3acdb4c0ae76c25e7307cd6e814bf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"777810a78b3d9574cf9fb8f4196d792bdb3acdb4c0ae76c25e7307cd6e814bf3","first_computed_at":"2026-05-18T04:28:20.459068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:20.459068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wJGMuO6HjIMdiVGhg7HXNGpU2Pfc4o8rAQxYTLzfcmGIV0YFZZgdTiNvRjSdpfpyI40g1Hn7S7ft6KWA1KDqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:20.459689Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4522","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fc6d48bc74e404f9c0da11a83b42a54157a8147633f5e9f53db32aaf7d06ff9","sha256:a4825f7ee535e1d010043e2fef49d33dbddff3d30b408a0ed5f7ccf1c03e2456"],"state_sha256":"9c15fd8a6dc397e23347826648c09d58444abf2c7c627457d1a7f8ce95886cdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kEKbekCtCUlE81mYLuNSejGPjzoi3q3RymzT49tJoemhc9SMaSpYA7T4Gjx5BCmlLzcZLtXOtMcq+vCMqQJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:13:31.967589Z","bundle_sha256":"74ed1f2b73ca06edc9efe71a5a2fcc03c839ddebd73c4db98ee3a88ff117677e"}}