{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YZDGVDTXZTPVNWLO3AT2QS635R","short_pith_number":"pith:YZDGVDTX","canonical_record":{"source":{"id":"1707.01025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-04T14:58:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9250adca8bdfa755d25a8aa525844bd5b321a6bded5a8f7928ed4308cb18bdd7","abstract_canon_sha256":"3ebe51ef7e37f8f74f8c8cfbb2ad8f8a3a56b16339cadd8965f7309209993bb9"},"schema_version":"1.0"},"canonical_sha256":"c6466a8e77ccdf56d96ed827a84bdbec499735f3a1a7efe4b60dc5db31d94ef3","source":{"kind":"arxiv","id":"1707.01025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01025","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01025v1","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01025","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"YZDGVDTXZTPV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YZDGVDTXZTPVNWLO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YZDGVDTX","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YZDGVDTXZTPVNWLO3AT2QS635R","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-04T14:58:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9250adca8bdfa755d25a8aa525844bd5b321a6bded5a8f7928ed4308cb18bdd7","abstract_canon_sha256":"3ebe51ef7e37f8f74f8c8cfbb2ad8f8a3a56b16339cadd8965f7309209993bb9"},"schema_version":"1.0"},"canonical_sha256":"c6466a8e77ccdf56d96ed827a84bdbec499735f3a1a7efe4b60dc5db31d94ef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:56.392131Z","signature_b64":"SRi8keaBnFjZTmKtLP+7LlZy8mVLZbO+jKO9Dm+563v5moa3bH1FRRrII7CPpwaNOjiGxhJyKfhg7nzou0KmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6466a8e77ccdf56d96ed827a84bdbec499735f3a1a7efe4b60dc5db31d94ef3","last_reissued_at":"2026-05-18T00:40:56.391664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:56.391664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01025","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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utjd2moHLAL3eSJbQSaAb85YAsjY2ACqJoX6+hf6XXHrieU48dv8DmcbrcUliP0ParEGKXPXmziTpfWNsw1lCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:00:28.545345Z"},"content_sha256":"6ca6a75458c04a9f134ae1d53d42d38247dcdd6c1b2b546e7d5bb6dab1215d96","schema_version":"1.0","event_id":"sha256:6ca6a75458c04a9f134ae1d53d42d38247dcdd6c1b2b546e7d5bb6dab1215d96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YZDGVDTXZTPVNWLO3AT2QS635R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D. Kudryashov, Irina E. Bocharova, Vitaly Skachek, Yauhen Yakimenka","submitted_at":"2017-07-04T14:58:01Z","abstract_excerpt":"Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied. Both random and structured LDPC codes are considered. In particular, the BP decoding is applied to the code parity-check matrices with an increasing number of redundant rows, and the convergence of the performance to that of the ML decoding is analyzed. A comparison of the simulated BP, ML, and near-ML performance with the improved theoretical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01025","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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mi+FwoBqX1FwnzPR3L9jGMGFK1KY9/7hv2FrAvBGRE/O/I0QTyR3ShKurs2vUdpOdsgumyT4YcTdQ9+czPcoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:00:28.545693Z"},"content_sha256":"ee4a4d83cacab37ed06c5e23229ad8dc7479b2332da22da4d3a5ba5432cdca8e","schema_version":"1.0","event_id":"sha256:ee4a4d83cacab37ed06c5e23229ad8dc7479b2332da22da4d3a5ba5432cdca8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZDGVDTXZTPVNWLO3AT2QS635R/bundle.json","state_url":"https://pith.science/pith/YZDGVDTXZTPVNWLO3AT2QS635R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZDGVDTXZTPVNWLO3AT2QS635R/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-21T09:00:28Z","links":{"resolver":"https://pith.science/pith/YZDGVDTXZTPVNWLO3AT2QS635R","bundle":"https://pith.science/pith/YZDGVDTXZTPVNWLO3AT2QS635R/bundle.json","state":"https://pith.science/pith/YZDGVDTXZTPVNWLO3AT2QS635R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZDGVDTXZTPVNWLO3AT2QS635R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YZDGVDTXZTPVNWLO3AT2QS635R","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":"3ebe51ef7e37f8f74f8c8cfbb2ad8f8a3a56b16339cadd8965f7309209993bb9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-04T14:58:01Z","title_canon_sha256":"9250adca8bdfa755d25a8aa525844bd5b321a6bded5a8f7928ed4308cb18bdd7"},"schema_version":"1.0","source":{"id":"1707.01025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01025","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01025v1","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01025","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"YZDGVDTXZTPV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YZDGVDTXZTPVNWLO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YZDGVDTX","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:ee4a4d83cacab37ed06c5e23229ad8dc7479b2332da22da4d3a5ba5432cdca8e","target":"graph","created_at":"2026-05-18T00:40:56Z","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":"Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied. Both random and structured LDPC codes are considered. In particular, the BP decoding is applied to the code parity-check matrices with an increasing number of redundant rows, and the convergence of the performance to that of the ML decoding is analyzed. A comparison of the simulated BP, ML, and near-ML performance with the improved theoretical ","authors_text":"Boris D. Kudryashov, Irina E. Bocharova, Vitaly Skachek, Yauhen Yakimenka","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-04T14:58:01Z","title":"Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01025","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:6ca6a75458c04a9f134ae1d53d42d38247dcdd6c1b2b546e7d5bb6dab1215d96","target":"record","created_at":"2026-05-18T00:40:56Z","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":"3ebe51ef7e37f8f74f8c8cfbb2ad8f8a3a56b16339cadd8965f7309209993bb9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-04T14:58:01Z","title_canon_sha256":"9250adca8bdfa755d25a8aa525844bd5b321a6bded5a8f7928ed4308cb18bdd7"},"schema_version":"1.0","source":{"id":"1707.01025","kind":"arxiv","version":1}},"canonical_sha256":"c6466a8e77ccdf56d96ed827a84bdbec499735f3a1a7efe4b60dc5db31d94ef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6466a8e77ccdf56d96ed827a84bdbec499735f3a1a7efe4b60dc5db31d94ef3","first_computed_at":"2026-05-18T00:40:56.391664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:56.391664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SRi8keaBnFjZTmKtLP+7LlZy8mVLZbO+jKO9Dm+563v5moa3bH1FRRrII7CPpwaNOjiGxhJyKfhg7nzou0KmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:56.392131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ca6a75458c04a9f134ae1d53d42d38247dcdd6c1b2b546e7d5bb6dab1215d96","sha256:ee4a4d83cacab37ed06c5e23229ad8dc7479b2332da22da4d3a5ba5432cdca8e"],"state_sha256":"eb9341c71a6e58dc10352aedd347e0aa71ea2664fc2faeb07f5c752b3989b785"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nld1LmBnc+LI+e8uK7AM7DdpyPoc7Z2v2FGc0DhVPPh8MZroTbG0ydBErAHyUrMDPgcHu84+wTmndhsN/PZqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:00:28.547693Z","bundle_sha256":"d456179b525ccfc8bb952a84d9a717fab4ed9cd1793fb7cc309b5f1a1d236b9c"}}