{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H4BTS4CRZG32JBDPWXOOSNGP6I","short_pith_number":"pith:H4BTS4CR","schema_version":"1.0","canonical_sha256":"3f03397051c9b7a4846fb5dce934cff227bcf77fe17e8b21df6b15630dc71e2c","source":{"kind":"arxiv","id":"1906.09792","version":1},"attestation_state":"computed","paper":{"title":"A novel soft-aided bit-marking decoder for product codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Alvarado, Alireza Sheikh, Gabriele Liga","submitted_at":"2019-06-24T08:53:09Z","abstract_excerpt":"We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via updated reliabilities at each decoding iteration. Gains up to 0.8 dB vs. standard iterative bounded distance decoding and up to 0.3 dB vs. our previously proposed bit-marking decoder are demonstrated."},"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":"1906.09792","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-06-24T08:53:09Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"a25740be141708cb6dcbd7edff48a6839c7b2e20678d33f32c74313db726d240","abstract_canon_sha256":"660914d058bc15dd6d9548fbe87d3ec2ac7e7ab806fbd4ba1c20ed74c571bfdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:36.684674Z","signature_b64":"n6y20+/cKRc8W06JXNTGCC3TLF5ZULEYKlbi3OGdHz8b3kHTJ0r0hqmPmOdPpgTKOVRd/CP/Vb4/4PdVqBw7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f03397051c9b7a4846fb5dce934cff227bcf77fe17e8b21df6b15630dc71e2c","last_reissued_at":"2026-05-17T23:42:36.684047Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:36.684047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A novel soft-aided bit-marking decoder for product codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Alvarado, Alireza Sheikh, Gabriele Liga","submitted_at":"2019-06-24T08:53:09Z","abstract_excerpt":"We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via updated reliabilities at each decoding iteration. Gains up to 0.8 dB vs. standard iterative bounded distance decoding and up to 0.3 dB vs. our previously proposed bit-marking decoder are demonstrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09792","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":"1906.09792","created_at":"2026-05-17T23:42:36.684139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09792v1","created_at":"2026-05-17T23:42:36.684139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09792","created_at":"2026-05-17T23:42:36.684139+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4BTS4CRZG32","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4BTS4CRZG32JBDP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4BTS4CR","created_at":"2026-05-18T12:33:18.533446+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/H4BTS4CRZG32JBDPWXOOSNGP6I","json":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I.json","graph_json":"https://pith.science/api/pith-number/H4BTS4CRZG32JBDPWXOOSNGP6I/graph.json","events_json":"https://pith.science/api/pith-number/H4BTS4CRZG32JBDPWXOOSNGP6I/events.json","paper":"https://pith.science/paper/H4BTS4CR"},"agent_actions":{"view_html":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I","download_json":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I.json","view_paper":"https://pith.science/paper/H4BTS4CR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09792&json=true","fetch_graph":"https://pith.science/api/pith-number/H4BTS4CRZG32JBDPWXOOSNGP6I/graph.json","fetch_events":"https://pith.science/api/pith-number/H4BTS4CRZG32JBDPWXOOSNGP6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I/action/storage_attestation","attest_author":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I/action/author_attestation","sign_citation":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I/action/citation_signature","submit_replication":"https://pith.science/pith/H4BTS4CRZG32JBDPWXOOSNGP6I/action/replication_record"}},"created_at":"2026-05-17T23:42:36.684139+00:00","updated_at":"2026-05-17T23:42:36.684139+00:00"}