{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UW7RN2DDFHDGC3ZCBJXUMYEE4R","short_pith_number":"pith:UW7RN2DD","schema_version":"1.0","canonical_sha256":"a5bf16e86329c6616f220a6f466084e452b1cf0106920b4eac17235f1d2bcabe","source":{"kind":"arxiv","id":"1805.05270","version":1},"attestation_state":"computed","paper":{"title":"Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","submitted_at":"2018-05-14T16:35:05Z","abstract_excerpt":"We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.05270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T16:35:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b3e729e792a59006e7dcf3553c860bba2b4137fa0960170eeaa3336e9a95388c","abstract_canon_sha256":"7749fc4afbae4ac53a5a11ce4dd3c43982e9445ab80cc962267c48bd184f2757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.567502Z","signature_b64":"mPy9p/RQif9WgvmzpL7RAAY86Rf1a/B8+k56jGMOYgETYx1nNKpNkUlJFeTBfKSNyWWmvA093VQOFQinaQFDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5bf16e86329c6616f220a6f466084e452b1cf0106920b4eac17235f1d2bcabe","last_reissued_at":"2026-05-18T00:16:03.567094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.567094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","submitted_at":"2018-05-14T16:35:05Z","abstract_excerpt":"We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05270","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.05270","created_at":"2026-05-18T00:16:03.567156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05270v1","created_at":"2026-05-18T00:16:03.567156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05270","created_at":"2026-05-18T00:16:03.567156+00:00"},{"alias_kind":"pith_short_12","alias_value":"UW7RN2DDFHDG","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UW7RN2DDFHDGC3ZC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UW7RN2DD","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R","json":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R.json","graph_json":"https://pith.science/api/pith-number/UW7RN2DDFHDGC3ZCBJXUMYEE4R/graph.json","events_json":"https://pith.science/api/pith-number/UW7RN2DDFHDGC3ZCBJXUMYEE4R/events.json","paper":"https://pith.science/paper/UW7RN2DD"},"agent_actions":{"view_html":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R","download_json":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R.json","view_paper":"https://pith.science/paper/UW7RN2DD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05270&json=true","fetch_graph":"https://pith.science/api/pith-number/UW7RN2DDFHDGC3ZCBJXUMYEE4R/graph.json","fetch_events":"https://pith.science/api/pith-number/UW7RN2DDFHDGC3ZCBJXUMYEE4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R/action/storage_attestation","attest_author":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R/action/author_attestation","sign_citation":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R/action/citation_signature","submit_replication":"https://pith.science/pith/UW7RN2DDFHDGC3ZCBJXUMYEE4R/action/replication_record"}},"created_at":"2026-05-18T00:16:03.567156+00:00","updated_at":"2026-05-18T00:16:03.567156+00:00"}