{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DB6DZVW5MAWGHT6LUNABPUIRUK","short_pith_number":"pith:DB6DZVW5","canonical_record":{"source":{"id":"1502.06871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T16:45:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f046351ce99c9d6abf3375315a8525c7f864585d21c321cfff9b2fdee506ee56","abstract_canon_sha256":"54aab9dcda9068a5ceab0f14432931fe2ee6a24f54c1b8e0b334da79e956881a"},"schema_version":"1.0"},"canonical_sha256":"187c3cd6dd602c63cfcba34017d111a2a5a85da736999a459b00a524ecee9ef3","source":{"kind":"arxiv","id":"1502.06871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06871","created_at":"2026-05-18T02:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06871v1","created_at":"2026-05-18T02:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06871","created_at":"2026-05-18T02:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"DB6DZVW5MAWG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DB6DZVW5MAWGHT6L","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DB6DZVW5","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DB6DZVW5MAWGHT6LUNABPUIRUK","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T16:45:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f046351ce99c9d6abf3375315a8525c7f864585d21c321cfff9b2fdee506ee56","abstract_canon_sha256":"54aab9dcda9068a5ceab0f14432931fe2ee6a24f54c1b8e0b334da79e956881a"},"schema_version":"1.0"},"canonical_sha256":"187c3cd6dd602c63cfcba34017d111a2a5a85da736999a459b00a524ecee9ef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:24.328255Z","signature_b64":"uMPjVygO/dCVWEzjlc5/kQecMxHgMiEqfAGkFfWmGtpylF+R6jalrFAYHlN3sUSF7LZ9LSGjJqsBzMdB0TUCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187c3cd6dd602c63cfcba34017d111a2a5a85da736999a459b00a524ecee9ef3","last_reissued_at":"2026-05-18T02:26:24.327276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:24.327276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06871","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-18T02:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBXHAyVM4MW4ecXYHk2aorJv1GUNI8VhwxvOCYuarW9H4PRM+9hMNl5rUvjV/+BRUVKcv9VfWafOr8PKFKddCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:47:57.994863Z"},"content_sha256":"cd97f1e4af38a38fd9835315b75fa272653c765abb549d3b648b5ba12033b343","schema_version":"1.0","event_id":"sha256:cd97f1e4af38a38fd9835315b75fa272653c765abb549d3b648b5ba12033b343"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DB6DZVW5MAWGHT6LUNABPUIRUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Multiple Threshold Decoding of LDPC codes over GF(q)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Victor Zyablov","submitted_at":"2015-02-24T16:45:53Z","abstract_excerpt":"We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new algorithm is derived. The estimate is shown to be better than the estimate for a single threshold majority decoder. At the same time the transition to multiple thresholds does not affect the order of complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06871","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-18T02:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/yChRJF/mMTAEFKVOAjPw91in3oK0n27HosiNxAOu+MUtVmuVmz9uE+Q/EixqbE/KMl757j95OcGG50zSyTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:47:57.995202Z"},"content_sha256":"22a298c4ee0a2cd08f4b3251c921f0595e3bac7bfd78511ea34a22bad1eb312c","schema_version":"1.0","event_id":"sha256:22a298c4ee0a2cd08f4b3251c921f0595e3bac7bfd78511ea34a22bad1eb312c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DB6DZVW5MAWGHT6LUNABPUIRUK/bundle.json","state_url":"https://pith.science/pith/DB6DZVW5MAWGHT6LUNABPUIRUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DB6DZVW5MAWGHT6LUNABPUIRUK/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-28T08:47:57Z","links":{"resolver":"https://pith.science/pith/DB6DZVW5MAWGHT6LUNABPUIRUK","bundle":"https://pith.science/pith/DB6DZVW5MAWGHT6LUNABPUIRUK/bundle.json","state":"https://pith.science/pith/DB6DZVW5MAWGHT6LUNABPUIRUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DB6DZVW5MAWGHT6LUNABPUIRUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DB6DZVW5MAWGHT6LUNABPUIRUK","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":"54aab9dcda9068a5ceab0f14432931fe2ee6a24f54c1b8e0b334da79e956881a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T16:45:53Z","title_canon_sha256":"f046351ce99c9d6abf3375315a8525c7f864585d21c321cfff9b2fdee506ee56"},"schema_version":"1.0","source":{"id":"1502.06871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06871","created_at":"2026-05-18T02:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06871v1","created_at":"2026-05-18T02:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06871","created_at":"2026-05-18T02:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"DB6DZVW5MAWG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DB6DZVW5MAWGHT6L","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DB6DZVW5","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:22a298c4ee0a2cd08f4b3251c921f0595e3bac7bfd78511ea34a22bad1eb312c","target":"graph","created_at":"2026-05-18T02:26:24Z","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 consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new algorithm is derived. The estimate is shown to be better than the estimate for a single threshold majority decoder. At the same time the transition to multiple thresholds does not affect the order of complexity.","authors_text":"Alexey Frolov, Victor Zyablov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T16:45:53Z","title":"On the Multiple Threshold Decoding of LDPC codes over GF(q)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06871","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:cd97f1e4af38a38fd9835315b75fa272653c765abb549d3b648b5ba12033b343","target":"record","created_at":"2026-05-18T02:26:24Z","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":"54aab9dcda9068a5ceab0f14432931fe2ee6a24f54c1b8e0b334da79e956881a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T16:45:53Z","title_canon_sha256":"f046351ce99c9d6abf3375315a8525c7f864585d21c321cfff9b2fdee506ee56"},"schema_version":"1.0","source":{"id":"1502.06871","kind":"arxiv","version":1}},"canonical_sha256":"187c3cd6dd602c63cfcba34017d111a2a5a85da736999a459b00a524ecee9ef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"187c3cd6dd602c63cfcba34017d111a2a5a85da736999a459b00a524ecee9ef3","first_computed_at":"2026-05-18T02:26:24.327276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:24.327276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uMPjVygO/dCVWEzjlc5/kQecMxHgMiEqfAGkFfWmGtpylF+R6jalrFAYHlN3sUSF7LZ9LSGjJqsBzMdB0TUCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:24.328255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd97f1e4af38a38fd9835315b75fa272653c765abb549d3b648b5ba12033b343","sha256:22a298c4ee0a2cd08f4b3251c921f0595e3bac7bfd78511ea34a22bad1eb312c"],"state_sha256":"1a2077dc2a01926ced32f3674f8a040060ca4725917e014315a00a36dbdf5109"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0grJ/FgDGj2pAXIVEAaY658D+DN/jtf+ugPpYRFBAryv4BT6wmk+clQdgOtnjXZLdYibrC5EAPdemjYnHu/QCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:47:57.997140Z","bundle_sha256":"eec4aa6c44b77e225a73f6dd56a68f30c3db3a009fb5c8eddb17fc05712346b7"}}