{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O527SMZR5JMGVDL5Q4RXTKASCD","short_pith_number":"pith:O527SMZR","canonical_record":{"source":{"id":"1205.4070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T02:32:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"285a178a66687242a9a7996b7861c1667ff56988ee93424e4ce12e196655a51a","abstract_canon_sha256":"828d0259d6edbb408517b259dd9eea7c3fe9fd886da8b96051ce81b299e3ead0"},"schema_version":"1.0"},"canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","source":{"kind":"arxiv","id":"1205.4070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4070","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4070v1","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4070","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"O527SMZR5JMG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O527SMZR5JMGVDL5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O527SMZR","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O527SMZR5JMGVDL5Q4RXTKASCD","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T02:32:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"285a178a66687242a9a7996b7861c1667ff56988ee93424e4ce12e196655a51a","abstract_canon_sha256":"828d0259d6edbb408517b259dd9eea7c3fe9fd886da8b96051ce81b299e3ead0"},"schema_version":"1.0"},"canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.794526Z","signature_b64":"1tZekB8NQ/av+58JcMRhlpbPRYUGQJ+6Fwo3bcHEFH8nt9TfhwIttTUh5bWWPwueJVPgwxbdWELLmRVKrWkRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","last_reissued_at":"2026-05-18T03:55:22.793664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.793664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4070","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-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6oOwXZNFkQy6c7AO3h0hXGzsVe3vGbCXKxPwFBp61pq1ONb/q1FB93AHhB3+QRtHoB/vYKN29WTg8Quo6XEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:18:31.907036Z"},"content_sha256":"0173c8b595ff7646e1448fdb8d50cde2e02bacfc01382052e5d476ec5a94f791","schema_version":"1.0","event_id":"sha256:0173c8b595ff7646e1448fdb8d50cde2e02bacfc01382052e5d476ec5a94f791"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O527SMZR5JMGVDL5Q4RXTKASCD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Ensemble of Rate-Compatible LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Kai Zhang, Shancheng Zhao, Xiao Ma, Xiaoyi Zhang","submitted_at":"2012-05-18T02:32:03Z","abstract_excerpt":"In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible\n  LDPC codes with code rates varying \"continuously\" from 0.1 to 0.9 for additive white Gaussian noise (AWGN) channels. The new ensemble rate-compatible LDPC codes can be constructed conveniently with an empirical formula. Simulation results show that, when applied to incremental redundancy hybrid automatic repeat request (IR-HARQ) system, the constructed codes (with higher order modulation) perform well in a wide range of signal-to-noise-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4070","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-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilB3oeWa3IlMcy2gKBYaGJ67jwzUFA6DPU4z2B6KikZVukoPWJ9stg96hkq66+cxkIcoOa7Kxmp8XaEhY6AjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:18:31.907709Z"},"content_sha256":"610f017400126f9a97212d42ce7bee52ffdf0a9f6924d60e5c9d849bbf04a24e","schema_version":"1.0","event_id":"sha256:610f017400126f9a97212d42ce7bee52ffdf0a9f6924d60e5c9d849bbf04a24e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/bundle.json","state_url":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O527SMZR5JMGVDL5Q4RXTKASCD/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-30T13:18:31Z","links":{"resolver":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD","bundle":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/bundle.json","state":"https://pith.science/pith/O527SMZR5JMGVDL5Q4RXTKASCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O527SMZR5JMGVDL5Q4RXTKASCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O527SMZR5JMGVDL5Q4RXTKASCD","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":"828d0259d6edbb408517b259dd9eea7c3fe9fd886da8b96051ce81b299e3ead0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T02:32:03Z","title_canon_sha256":"285a178a66687242a9a7996b7861c1667ff56988ee93424e4ce12e196655a51a"},"schema_version":"1.0","source":{"id":"1205.4070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4070","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4070v1","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4070","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"O527SMZR5JMG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O527SMZR5JMGVDL5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O527SMZR","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:610f017400126f9a97212d42ce7bee52ffdf0a9f6924d60e5c9d849bbf04a24e","target":"graph","created_at":"2026-05-18T03:55:22Z","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":"In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible\n  LDPC codes with code rates varying \"continuously\" from 0.1 to 0.9 for additive white Gaussian noise (AWGN) channels. The new ensemble rate-compatible LDPC codes can be constructed conveniently with an empirical formula. Simulation results show that, when applied to incremental redundancy hybrid automatic repeat request (IR-HARQ) system, the constructed codes (with higher order modulation) perform well in a wide range of signal-to-noise-","authors_text":"Baoming Bai, Kai Zhang, Shancheng Zhao, Xiao Ma, Xiaoyi Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T02:32:03Z","title":"A New Ensemble of Rate-Compatible LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4070","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:0173c8b595ff7646e1448fdb8d50cde2e02bacfc01382052e5d476ec5a94f791","target":"record","created_at":"2026-05-18T03:55:22Z","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":"828d0259d6edbb408517b259dd9eea7c3fe9fd886da8b96051ce81b299e3ead0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T02:32:03Z","title_canon_sha256":"285a178a66687242a9a7996b7861c1667ff56988ee93424e4ce12e196655a51a"},"schema_version":"1.0","source":{"id":"1205.4070","kind":"arxiv","version":1}},"canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7775f93331ea586a8d7d872379a81210f5d8f8964bab464dc3204b47491ef2a2","first_computed_at":"2026-05-18T03:55:22.793664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:22.793664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tZekB8NQ/av+58JcMRhlpbPRYUGQJ+6Fwo3bcHEFH8nt9TfhwIttTUh5bWWPwueJVPgwxbdWELLmRVKrWkRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:22.794526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0173c8b595ff7646e1448fdb8d50cde2e02bacfc01382052e5d476ec5a94f791","sha256:610f017400126f9a97212d42ce7bee52ffdf0a9f6924d60e5c9d849bbf04a24e"],"state_sha256":"1cccdbd1efec2eb31793ab254983e9496ed19f143810d2a6dba0fec5349cdb89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDUHliVlQ5jVhlBgqh2GN9D+/xAQrAKe7/f5e4OanQqdta4DVQMRP9my5oVJGIaOCpSrwkX9wxgGrClAo4mdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:18:31.911172Z","bundle_sha256":"9018502953d46a1477117fdc3d4aeddc711d74642490d1d1cb66b9ef475930d4"}}