{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E2E7TFYF6OJKVPLROZ4A5CL2XG","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":"cbed964a343722d7482933c16f34e8f7e3d12c449f3d0ab16e46c36f2debcfbb","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T14:05:34Z","title_canon_sha256":"02f480e409d6bb6bbd0036f07582be8a5cd1797c3f180511d1d5c07de110f335"},"schema_version":"1.0","source":{"id":"1611.04834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04834","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04834v1","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04834","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"E2E7TFYF6OJK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E2E7TFYF6OJKVPLR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E2E7TFYF","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:8ad5db75959ea572b6ca70ba03c5d2bb4f095d996e93737521119fe91ac227c2","target":"graph","created_at":"2026-05-18T00:34:31Z","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":"Product codes are a concatenated error-correction scheme that has been often considered for applications requiring very low bit-error rates, which demand that the error floor be decreased as much as possible. In this work, we consider product codes constructed from polynomial algebraic codes, and propose a novel low-complexity post-processing technique that is able to improve the error-correction performance by orders of magnitude. We provide lower bounds for the error rate achievable under post processing, and present simulation results indicating that these bounds are tight.","authors_text":"Carlo Condo, Francois Leduc-Primeau, Gabi Sarkis, Pascal Giard, Warren Gross","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T14:05:34Z","title":"Stall Pattern Avoidance in Polynomial Product Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04834","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:000f90e5b40c3f8a2ec9cd7cabf5e7adf7ec5ceac23eed71d4d77dd41d2a1e53","target":"record","created_at":"2026-05-18T00:34:31Z","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":"cbed964a343722d7482933c16f34e8f7e3d12c449f3d0ab16e46c36f2debcfbb","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T14:05:34Z","title_canon_sha256":"02f480e409d6bb6bbd0036f07582be8a5cd1797c3f180511d1d5c07de110f335"},"schema_version":"1.0","source":{"id":"1611.04834","kind":"arxiv","version":1}},"canonical_sha256":"2689f99705f392aabd7176780e897ab9962720f1421b448afc74ab5555d7b2eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2689f99705f392aabd7176780e897ab9962720f1421b448afc74ab5555d7b2eb","first_computed_at":"2026-05-18T00:34:31.436540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:31.436540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2p0nx2E/uTS0t/PkyoqmX8i7BIHaGJRi2YCalyQvMZG/3lI2y7B9xGiJMJPDIlN5s9OgF9xL4NE1qQtZVjZ+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:31.436920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:000f90e5b40c3f8a2ec9cd7cabf5e7adf7ec5ceac23eed71d4d77dd41d2a1e53","sha256:8ad5db75959ea572b6ca70ba03c5d2bb4f095d996e93737521119fe91ac227c2"],"state_sha256":"14090e2adb6d952b5a3aafb291fdcd36da7e4130330710d72eb14bf1a6d815f4"}