{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VOO2CFPQ33VGIPCGI27Y47ZJK3","short_pith_number":"pith:VOO2CFPQ","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"},"canonical_sha256":"ab9da115f0deea643c4646bf8e7f2956e3f0cd617b6774f3b1ce107583542896","source":{"kind":"arxiv","id":"1202.5413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5413","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5413v1","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5413","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"VOO2CFPQ33VG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VOO2CFPQ33VGIPCG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VOO2CFPQ","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VOO2CFPQ33VGIPCGI27Y47ZJK3","target":"record","payload":{"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"},"canonical_sha256":"ab9da115f0deea643c4646bf8e7f2956e3f0cd617b6774f3b1ce107583542896","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"},"source_kind":"arxiv","source_id":"1202.5413","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bA6jqucrajMbKiGjMTm9DOgHWrWSzumb0+NS4kn/WcRezS4XLXwssPkMgLmSijJigk/uvoWgWJbd4l4nu35HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:25:26.018205Z"},"content_sha256":"5429b759a2f27fab0f75e224419733aab03a9a1bcbd19492aa19f6a50b3219f5","schema_version":"1.0","event_id":"sha256:5429b759a2f27fab0f75e224419733aab03a9a1bcbd19492aa19f6a50b3219f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VOO2CFPQ33VGIPCGI27Y47ZJK3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoueThDG8ILOWhjtGJtTQL80JCqnpjPJxfj69BMiTtPBMatgHeRxypx2i3pltcOzdp/RGus7ztHiZODuqEJBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:25:26.018927Z"},"content_sha256":"3f56479b0456da7b40f168d21da3d8dd420eb51b9d24c4e6b9741b3b025d1fa6","schema_version":"1.0","event_id":"sha256:3f56479b0456da7b40f168d21da3d8dd420eb51b9d24c4e6b9741b3b025d1fa6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/bundle.json","state_url":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T20:25:26Z","links":{"resolver":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3","bundle":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/bundle.json","state":"https://pith.science/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOO2CFPQ33VGIPCGI27Y47ZJK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VOO2CFPQ33VGIPCGI27Y47ZJK3","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":"14ff189994bc3c8e12ae319d48078f4d81e885d4e342999fc987569c581f0faf","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T10:29:48Z","title_canon_sha256":"73a0087f4cf487e2099cfe67da310a4ccf53cec72f5670a65859eaa5a405d151"},"schema_version":"1.0","source":{"id":"1202.5413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5413","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5413v1","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5413","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"VOO2CFPQ33VG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VOO2CFPQ33VGIPCG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VOO2CFPQ","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:3f56479b0456da7b40f168d21da3d8dd420eb51b9d24c4e6b9741b3b025d1fa6","target":"graph","created_at":"2026-05-18T04:01:37Z","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":"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.","authors_text":"Jiun-Hung Yu","cross_cats":["math.IT","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T10:29:48Z","title":"On the Joint Error-and-Erasure Decoding for Irreducible Polynomial Remainder Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5413","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:5429b759a2f27fab0f75e224419733aab03a9a1bcbd19492aa19f6a50b3219f5","target":"record","created_at":"2026-05-18T04:01:37Z","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":"14ff189994bc3c8e12ae319d48078f4d81e885d4e342999fc987569c581f0faf","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T10:29:48Z","title_canon_sha256":"73a0087f4cf487e2099cfe67da310a4ccf53cec72f5670a65859eaa5a405d151"},"schema_version":"1.0","source":{"id":"1202.5413","kind":"arxiv","version":1}},"canonical_sha256":"ab9da115f0deea643c4646bf8e7f2956e3f0cd617b6774f3b1ce107583542896","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab9da115f0deea643c4646bf8e7f2956e3f0cd617b6774f3b1ce107583542896","first_computed_at":"2026-05-18T04:01:37.247109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:37.247109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zO7mIeI8HjKG4U0N7kSYfnf0+wXeQrqXgMhkTw6t53Ms9aQ9LKz1vKZSHqyGKFUMB5ZDD3EOJCil9UCFIE2+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:37.247782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5429b759a2f27fab0f75e224419733aab03a9a1bcbd19492aa19f6a50b3219f5","sha256:3f56479b0456da7b40f168d21da3d8dd420eb51b9d24c4e6b9741b3b025d1fa6"],"state_sha256":"47519c4c1b58a8116d9983a9e13404f7f9d0807f65634d0f6ab44b22aaa65033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qjHcoh8kOlZhm55UJkD+3QRYZi/+FfViUvgrhghGsulut5gOW/20NL9a83qw1QnTAVkbc5oTU9VIE8efF8fBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:25:26.022685Z","bundle_sha256":"041185e054a346cc416a0b4f5725e27c1e27a4dc7271c4c85b3cf0c99f377cc9"}}