{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VOO2CFPQ33VGIPCGI27Y47ZJK3","short_pith_number":"pith:VOO2CFPQ","schema_version":"1.0","canonical_sha256":"ab9da115f0deea643c4646bf8e7f2956e3f0cd617b6774f3b1ce107583542896","source":{"kind":"arxiv","id":"1202.5413","version":1},"attestation_state":"computed","paper":{"title":"On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Jiun-Hung Yu","submitted_at":"2012-02-24T10:29:48Z","abstract_excerpt":"A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case.\n  As an extension of previous work, two joint error-and-erasure decoding approaches are proposed. In particular, both the decoding approaches by means of a fixed transform are treated in a way compatible with the error-only decoding. In the end, a collection of gcd-based decoding algorithm is obtained, some of which appear to be new even when specialized to Reed-Solomon codes."},"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":"1202.5413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T10:29:48Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"73a0087f4cf487e2099cfe67da310a4ccf53cec72f5670a65859eaa5a405d151","abstract_canon_sha256":"14ff189994bc3c8e12ae319d48078f4d81e885d4e342999fc987569c581f0faf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:37.247782Z","signature_b64":"zO7mIeI8HjKG4U0N7kSYfnf0+wXeQrqXgMhkTw6t53Ms9aQ9LKz1vKZSHqyGKFUMB5ZDD3EOJCil9UCFIE2+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9da115f0deea643c4646bf8e7f2956e3f0cd617b6774f3b1ce107583542896","last_reissued_at":"2026-05-18T04:01:37.247109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:37.247109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Jiun-Hung Yu","submitted_at":"2012-02-24T10:29:48Z","abstract_excerpt":"A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case.\n  As an extension of previous work, two joint error-and-erasure decoding approaches are proposed. In particular, both the decoding approaches by means of a fixed transform are treated in a way compatible with the error-only decoding. In the end, a collection of gcd-based decoding algorithm is obtained, some of which appear to be new even when specialized to Reed-Solomon codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5413","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":"1202.5413","created_at":"2026-05-18T04:01:37.247207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5413v1","created_at":"2026-05-18T04:01:37.247207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5413","created_at":"2026-05-18T04:01:37.247207+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOO2CFPQ33VG","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOO2CFPQ33VGIPCG","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOO2CFPQ","created_at":"2026-05-18T12:27:25.539911+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/VOO2CFPQ33VGIPCGI27Y47ZJK3","json":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3.json","graph_json":"https://pith.science/api/pith-number/VOO2CFPQ33VGIPCGI27Y47ZJK3/graph.json","events_json":"https://pith.science/api/pith-number/VOO2CFPQ33VGIPCGI27Y47ZJK3/events.json","paper":"https://pith.science/paper/VOO2CFPQ"},"agent_actions":{"view_html":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3","download_json":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3.json","view_paper":"https://pith.science/paper/VOO2CFPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5413&json=true","fetch_graph":"https://pith.science/api/pith-number/VOO2CFPQ33VGIPCGI27Y47ZJK3/graph.json","fetch_events":"https://pith.science/api/pith-number/VOO2CFPQ33VGIPCGI27Y47ZJK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/action/storage_attestation","attest_author":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/action/author_attestation","sign_citation":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/action/citation_signature","submit_replication":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/action/replication_record"}},"created_at":"2026-05-18T04:01:37.247207+00:00","updated_at":"2026-05-18T04:01:37.247207+00:00"}