{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:STMTLFEJCPWNKSDJYZJLCWXIVX","short_pith_number":"pith:STMTLFEJ","canonical_record":{"source":{"id":"1201.1812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T16:00:45Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"1f7e66eb4c51f97074dc667385c168160537e77a7d5998af403a52b4a8eabd3d","abstract_canon_sha256":"e4c7d5d609cdf0c6b7a6b01e08cefb37c1b4c9642ef450a80f78a5455bc7c053"},"schema_version":"1.0"},"canonical_sha256":"94d935948913ecd54869c652b15ae8adfa70a9dffdc42fe320ca93a4369252af","source":{"kind":"arxiv","id":"1201.1812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1812","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1812v1","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1812","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"STMTLFEJCPWN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"STMTLFEJCPWNKSDJ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"STMTLFEJ","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:STMTLFEJCPWNKSDJYZJLCWXIVX","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T16:00:45Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"1f7e66eb4c51f97074dc667385c168160537e77a7d5998af403a52b4a8eabd3d","abstract_canon_sha256":"e4c7d5d609cdf0c6b7a6b01e08cefb37c1b4c9642ef450a80f78a5455bc7c053"},"schema_version":"1.0"},"canonical_sha256":"94d935948913ecd54869c652b15ae8adfa70a9dffdc42fe320ca93a4369252af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:55.697648Z","signature_b64":"2/yLbGx6N/exw0bGvPwSs5Ueogf1fHH3gJ+UFMROy4NqmcmrrfGNwtfEooXkSw5HGPoT15VH3wwMCIGSuwTnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94d935948913ecd54869c652b15ae8adfa70a9dffdc42fe320ca93a4369252af","last_reissued_at":"2026-05-18T04:04:55.697004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:55.697004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1812","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:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/GNrbb6V9BIOUTD1/PDjwLecB20vwnR5Mdnr2SZo38dRY9lxrYT8CxdzTXr9yqaSSMxPzXv+a2R2UCdBxkBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:12:25.495650Z"},"content_sha256":"8bdb0b3bd9bb43cd5af63beaff4cad683af9de60229856d6fb7c8797754a95b9","schema_version":"1.0","event_id":"sha256:8bdb0b3bd9bb43cd5af63beaff4cad683af9de60229856d6fb7c8797754a95b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:STMTLFEJCPWNKSDJYZJLCWXIVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On 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":"Hans-Andrea Loeliger, Jiun-Hung Yu","submitted_at":"2012-01-09T16:00:45Z","abstract_excerpt":"Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance.\n  Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1812","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:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvUElUk6f/GZcCVYcAIQ9COJCOZEsN4tsgMktoS3yMPmpdL84YMvdyAW01lCPx1Nh+ClAMIEUw9Dm8ntNMmvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:12:25.496287Z"},"content_sha256":"39e68c8ee368bd5f85705e6710128c04e7d1c38bfa2576bff6d84f389b806d02","schema_version":"1.0","event_id":"sha256:39e68c8ee368bd5f85705e6710128c04e7d1c38bfa2576bff6d84f389b806d02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STMTLFEJCPWNKSDJYZJLCWXIVX/bundle.json","state_url":"https://pith.science/pith/STMTLFEJCPWNKSDJYZJLCWXIVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STMTLFEJCPWNKSDJYZJLCWXIVX/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-08T16:12:25Z","links":{"resolver":"https://pith.science/pith/STMTLFEJCPWNKSDJYZJLCWXIVX","bundle":"https://pith.science/pith/STMTLFEJCPWNKSDJYZJLCWXIVX/bundle.json","state":"https://pith.science/pith/STMTLFEJCPWNKSDJYZJLCWXIVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STMTLFEJCPWNKSDJYZJLCWXIVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:STMTLFEJCPWNKSDJYZJLCWXIVX","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":"e4c7d5d609cdf0c6b7a6b01e08cefb37c1b4c9642ef450a80f78a5455bc7c053","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T16:00:45Z","title_canon_sha256":"1f7e66eb4c51f97074dc667385c168160537e77a7d5998af403a52b4a8eabd3d"},"schema_version":"1.0","source":{"id":"1201.1812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1812","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1812v1","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1812","created_at":"2026-05-18T04:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"STMTLFEJCPWN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"STMTLFEJCPWNKSDJ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"STMTLFEJ","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:39e68c8ee368bd5f85705e6710128c04e7d1c38bfa2576bff6d84f389b806d02","target":"graph","created_at":"2026-05-18T04:04:55Z","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":"Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance.\n  Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithm","authors_text":"Hans-Andrea Loeliger, 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-01-09T16:00:45Z","title":"On Polynomial Remainder Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1812","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:8bdb0b3bd9bb43cd5af63beaff4cad683af9de60229856d6fb7c8797754a95b9","target":"record","created_at":"2026-05-18T04:04:55Z","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":"e4c7d5d609cdf0c6b7a6b01e08cefb37c1b4c9642ef450a80f78a5455bc7c053","cross_cats_sorted":["math.IT","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-09T16:00:45Z","title_canon_sha256":"1f7e66eb4c51f97074dc667385c168160537e77a7d5998af403a52b4a8eabd3d"},"schema_version":"1.0","source":{"id":"1201.1812","kind":"arxiv","version":1}},"canonical_sha256":"94d935948913ecd54869c652b15ae8adfa70a9dffdc42fe320ca93a4369252af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94d935948913ecd54869c652b15ae8adfa70a9dffdc42fe320ca93a4369252af","first_computed_at":"2026-05-18T04:04:55.697004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:55.697004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2/yLbGx6N/exw0bGvPwSs5Ueogf1fHH3gJ+UFMROy4NqmcmrrfGNwtfEooXkSw5HGPoT15VH3wwMCIGSuwTnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:55.697648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bdb0b3bd9bb43cd5af63beaff4cad683af9de60229856d6fb7c8797754a95b9","sha256:39e68c8ee368bd5f85705e6710128c04e7d1c38bfa2576bff6d84f389b806d02"],"state_sha256":"6653bc06961e91d3067fe92eda5e664cd123678bccfed868d5dd73de481d09aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZBcDtA8etkMHRPseT6+sWy9x9o/2X9ny9f0xrn3lUkS9ytrYiw6yUrJB+UpwVpQrtTE6ryXd56iIXt+om6EDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:12:25.500573Z","bundle_sha256":"af3bca62878b354de73bebe2cf4492d999970424b3b304fe58970920555a75f6"}}