{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S4Q2VM7FIA2MTVHALLFEKMJBKS","short_pith_number":"pith:S4Q2VM7F","schema_version":"1.0","canonical_sha256":"9721aab3e54034c9d4e05aca45312154be83ba992df99593fe32810959045074","source":{"kind":"arxiv","id":"1902.03575","version":2},"attestation_state":"computed","paper":{"title":"Binary Message Passing Decoding of Product-like Codes","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":"2019-02-10T11:20:41Z","abstract_excerpt":"We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the"},"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":"1902.03575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-10T11:20:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be3f2a6810069b887d630970a7771c0ea0eb563f5322df46c0bd9a661430f81e","abstract_canon_sha256":"7faff4c7893db92c49b710fdba62f9fd1b7ce18bef5b18858ff3c3a36907c85c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:05:33.516585Z","signature_b64":"5vJHAy5spuXXaPMrmZ60bC+8QES4PJruZJoTJGDzO30DGUfquT/EJgHFjHZd+gjE3BkNbLAzQEvsQp++PjpRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9721aab3e54034c9d4e05aca45312154be83ba992df99593fe32810959045074","last_reissued_at":"2026-07-05T00:05:33.516166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:05:33.516166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Message Passing Decoding of Product-like Codes","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":"2019-02-10T11:20:41Z","abstract_excerpt":"We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03575","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.03575/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.03575","created_at":"2026-07-05T00:05:33.516222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03575v2","created_at":"2026-07-05T00:05:33.516222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03575","created_at":"2026-07-05T00:05:33.516222+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4Q2VM7FIA2M","created_at":"2026-07-05T00:05:33.516222+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4Q2VM7FIA2MTVHA","created_at":"2026-07-05T00:05:33.516222+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4Q2VM7F","created_at":"2026-07-05T00:05:33.516222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09502","citing_title":"On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS","json":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS.json","graph_json":"https://pith.science/api/pith-number/S4Q2VM7FIA2MTVHALLFEKMJBKS/graph.json","events_json":"https://pith.science/api/pith-number/S4Q2VM7FIA2MTVHALLFEKMJBKS/events.json","paper":"https://pith.science/paper/S4Q2VM7F"},"agent_actions":{"view_html":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS","download_json":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS.json","view_paper":"https://pith.science/paper/S4Q2VM7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03575&json=true","fetch_graph":"https://pith.science/api/pith-number/S4Q2VM7FIA2MTVHALLFEKMJBKS/graph.json","fetch_events":"https://pith.science/api/pith-number/S4Q2VM7FIA2MTVHALLFEKMJBKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS/action/storage_attestation","attest_author":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS/action/author_attestation","sign_citation":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS/action/citation_signature","submit_replication":"https://pith.science/pith/S4Q2VM7FIA2MTVHALLFEKMJBKS/action/replication_record"}},"created_at":"2026-07-05T00:05:33.516222+00:00","updated_at":"2026-07-05T00:05:33.516222+00:00"}