{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:QR7ZV5PSDMJLFWGCEIQA26PNBY","short_pith_number":"pith:QR7ZV5PS","canonical_record":{"source":{"id":"0806.0036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-30T22:03:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af0df22498e07f139a79a477061090d926b747cb1761d14a78e9bf1a72a4f443","abstract_canon_sha256":"820145a9c09ce439595cd38e884ae1de5ff2cf21828b450e4a1c1be4ed87f04f"},"schema_version":"1.0"},"canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","source":{"kind":"arxiv","id":"0806.0036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.0036","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0806.0036v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0036","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"QR7ZV5PSDMJL","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"QR7ZV5PSDMJLFWGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"QR7ZV5PS","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:QR7ZV5PSDMJLFWGCEIQA26PNBY","target":"record","payload":{"canonical_record":{"source":{"id":"0806.0036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-30T22:03:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af0df22498e07f139a79a477061090d926b747cb1761d14a78e9bf1a72a4f443","abstract_canon_sha256":"820145a9c09ce439595cd38e884ae1de5ff2cf21828b450e4a1c1be4ed87f04f"},"schema_version":"1.0"},"canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.533247Z","signature_b64":"3rwlEM0CzngR1fZRoMG6LmokJdkbyCXbe3nRII6n1WEu7a/Vu9zgxEVw34GyZzrOX9q+af9ekaZloQtdUgGnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","last_reissued_at":"2026-05-18T00:58:48.532537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.532537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.0036","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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMugQb3bjoUc2+I3mrd1NNcQC42ACq/IRGV+pS1ITjALBhaX+GM6uu1FUJNL2KhlG24c6LUI7wFto0hns8q7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:23:47.944583Z"},"content_sha256":"54f33751e918bb9076fd10036e96f0a5475b6b933f7be1b5a2eee5311e888ac4","schema_version":"1.0","event_id":"sha256:54f33751e918bb9076fd10036e96f0a5475b6b933f7be1b5a2eee5311e888ac4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:QR7ZV5PSDMJLFWGCEIQA26PNBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Design of Universal LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Sanaei, Mahdi Ramezani, Masoud Ardakani","submitted_at":"2008-05-30T22:03:00Z","abstract_excerpt":"Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity channels, it would also converge on any convex combination of those channels. Then, it is proved that when the stability condition is satisfied for a number of channels, it is also satisfied for any channel in their convex hull. For the purpose of code design, a method is proposed which can decompose every symmetric channel with capacity C into a set of identical-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0036","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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEVpM1n6YbsHGjXCLELgoffC05Hiw8kpTODa6fdJLHeReDrsJ4xHLjVV1LEk1QHFNVU0sCO20k29GstqMnpdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:23:47.945223Z"},"content_sha256":"b057f6dfb0d11a7492561e6da78ed15a328032626548f13d97beda833d260ae3","schema_version":"1.0","event_id":"sha256:b057f6dfb0d11a7492561e6da78ed15a328032626548f13d97beda833d260ae3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/bundle.json","state_url":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/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-26T03:23:47Z","links":{"resolver":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY","bundle":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/bundle.json","state":"https://pith.science/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QR7ZV5PSDMJLFWGCEIQA26PNBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:QR7ZV5PSDMJLFWGCEIQA26PNBY","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":"820145a9c09ce439595cd38e884ae1de5ff2cf21828b450e4a1c1be4ed87f04f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-30T22:03:00Z","title_canon_sha256":"af0df22498e07f139a79a477061090d926b747cb1761d14a78e9bf1a72a4f443"},"schema_version":"1.0","source":{"id":"0806.0036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.0036","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0806.0036v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0036","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"QR7ZV5PSDMJL","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"QR7ZV5PSDMJLFWGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"QR7ZV5PS","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:b057f6dfb0d11a7492561e6da78ed15a328032626548f13d97beda833d260ae3","target":"graph","created_at":"2026-05-18T00:58:48Z","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) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity channels, it would also converge on any convex combination of those channels. Then, it is proved that when the stability condition is satisfied for a number of channels, it is also satisfied for any channel in their convex hull. For the purpose of code design, a method is proposed which can decompose every symmetric channel with capacity C into a set of identical-","authors_text":"Ali Sanaei, Mahdi Ramezani, Masoud Ardakani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-30T22:03:00Z","title":"On the Design of Universal LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0036","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:54f33751e918bb9076fd10036e96f0a5475b6b933f7be1b5a2eee5311e888ac4","target":"record","created_at":"2026-05-18T00:58:48Z","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":"820145a9c09ce439595cd38e884ae1de5ff2cf21828b450e4a1c1be4ed87f04f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-30T22:03:00Z","title_canon_sha256":"af0df22498e07f139a79a477061090d926b747cb1761d14a78e9bf1a72a4f443"},"schema_version":"1.0","source":{"id":"0806.0036","kind":"arxiv","version":1}},"canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"847f9af5f21b12b2d8c222200d79ed0e34422447375dff688f4a7400ddbcde8d","first_computed_at":"2026-05-18T00:58:48.532537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.532537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rwlEM0CzngR1fZRoMG6LmokJdkbyCXbe3nRII6n1WEu7a/Vu9zgxEVw34GyZzrOX9q+af9ekaZloQtdUgGnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.533247Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.0036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54f33751e918bb9076fd10036e96f0a5475b6b933f7be1b5a2eee5311e888ac4","sha256:b057f6dfb0d11a7492561e6da78ed15a328032626548f13d97beda833d260ae3"],"state_sha256":"4b3135ffb11990039481d47ee6cb67a44bbd8745211b020f90fe6319de085c66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9l1/gupGtmTmtfKtVOZH3aP0O5lGeskjXg/3ch6+rLmgz2Jt1xAulN6AK7XNnSOQUrPbdTqgBtJDvk6kCsEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:23:47.948628Z","bundle_sha256":"131bccbd6850f0e3e36856f3201abdcac126e67683bee461b6189444def4485b"}}