{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OQVMXKLRHIDXPPS5ZCUBCRFSDZ","short_pith_number":"pith:OQVMXKLR","canonical_record":{"source":{"id":"1403.3594","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-03-14T14:51:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d50bae7c2f633d1bee4dda74844d66e7a8c01d986d1d342fe00a96c78fddd5a9","abstract_canon_sha256":"31538b75e7a208b0058b5936f68aa49a32d0bfe63b133a198c583a3f293253f4"},"schema_version":"1.0"},"canonical_sha256":"742acba9713a0777be5dc8a81144b21e6575570e21be5bfdf9d100c2326078c9","source":{"kind":"arxiv","id":"1403.3594","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3594","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3594v3","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3594","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"OQVMXKLRHIDX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQVMXKLRHIDXPPS5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQVMXKLR","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OQVMXKLRHIDXPPS5ZCUBCRFSDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3594","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-03-14T14:51:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d50bae7c2f633d1bee4dda74844d66e7a8c01d986d1d342fe00a96c78fddd5a9","abstract_canon_sha256":"31538b75e7a208b0058b5936f68aa49a32d0bfe63b133a198c583a3f293253f4"},"schema_version":"1.0"},"canonical_sha256":"742acba9713a0777be5dc8a81144b21e6575570e21be5bfdf9d100c2326078c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.389059Z","signature_b64":"iXyDVtwRWLlZyCFNSXviAiJXZHSRTPft0vg51b8zOB0jJI4+28UdbnsrBemBVSvt6VEaxOD9d70jMI7iV1j0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"742acba9713a0777be5dc8a81144b21e6575570e21be5bfdf9d100c2326078c9","last_reissued_at":"2026-05-18T02:49:30.388552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.388552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3594","source_version":3,"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-18T02:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBSuj6BDQTjwAQytOqZjrVU2qoNp4/+z59PGGWww87P6vNAEHKSrleeORO+ua23FsQXjOyDAIcIUoQJbeUSeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:41:44.782706Z"},"content_sha256":"cc6932ee231aea316fd7d8ec2ac2772fe456401e357691b49f64ee429f1bafa1","schema_version":"1.0","event_id":"sha256:cc6932ee231aea316fd7d8ec2ac2772fe456401e357691b49f64ee429f1bafa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OQVMXKLRHIDXPPS5ZCUBCRFSDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SC","authors_text":"Cl\\'ement Pernet, Erich L. Kaltofen","submitted_at":"2014-03-14T14:51:53Z","abstract_excerpt":"We present algorithms performing sparse univariate polynomial interpolation with errors in the evaluations of the polynomial. Based on the initial work by Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial interpolation codes and state that their minimal distance is precisely the length divided by twice the sparsity. At ISSAC 2012, we have given a decoding algorithm for as much as half the minimal distance and a list decoding algorithm up to the minimal distance. Our new polynomial-time list decoding algorithm uses sub-sequences of the received evaluations indexed b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3594","kind":"arxiv","version":3},"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-18T02:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Tg1cW3CSJ5auLjqZm4wwGOJ4pNSoqEzoDFXj/naJh+SVxcwvb+r62Tu2kmP/GSG+AU3Kt6baLLNHkY85soPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:41:44.783308Z"},"content_sha256":"28933966df1fdae72dffba5b69a46e67237e95ab5317fcef15b9de040119b4ef","schema_version":"1.0","event_id":"sha256:28933966df1fdae72dffba5b69a46e67237e95ab5317fcef15b9de040119b4ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ/bundle.json","state_url":"https://pith.science/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ/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-05-31T00:41:44Z","links":{"resolver":"https://pith.science/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ","bundle":"https://pith.science/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ/bundle.json","state":"https://pith.science/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQVMXKLRHIDXPPS5ZCUBCRFSDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OQVMXKLRHIDXPPS5ZCUBCRFSDZ","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":"31538b75e7a208b0058b5936f68aa49a32d0bfe63b133a198c583a3f293253f4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-03-14T14:51:53Z","title_canon_sha256":"d50bae7c2f633d1bee4dda74844d66e7a8c01d986d1d342fe00a96c78fddd5a9"},"schema_version":"1.0","source":{"id":"1403.3594","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3594","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3594v3","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3594","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"OQVMXKLRHIDX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQVMXKLRHIDXPPS5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQVMXKLR","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:28933966df1fdae72dffba5b69a46e67237e95ab5317fcef15b9de040119b4ef","target":"graph","created_at":"2026-05-18T02:49:30Z","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":"We present algorithms performing sparse univariate polynomial interpolation with errors in the evaluations of the polynomial. Based on the initial work by Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial interpolation codes and state that their minimal distance is precisely the length divided by twice the sparsity. At ISSAC 2012, we have given a decoding algorithm for as much as half the minimal distance and a list decoding algorithm up to the minimal distance. Our new polynomial-time list decoding algorithm uses sub-sequences of the received evaluations indexed b","authors_text":"Cl\\'ement Pernet, Erich L. Kaltofen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-03-14T14:51:53Z","title":"Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3594","kind":"arxiv","version":3},"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:cc6932ee231aea316fd7d8ec2ac2772fe456401e357691b49f64ee429f1bafa1","target":"record","created_at":"2026-05-18T02:49:30Z","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":"31538b75e7a208b0058b5936f68aa49a32d0bfe63b133a198c583a3f293253f4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-03-14T14:51:53Z","title_canon_sha256":"d50bae7c2f633d1bee4dda74844d66e7a8c01d986d1d342fe00a96c78fddd5a9"},"schema_version":"1.0","source":{"id":"1403.3594","kind":"arxiv","version":3}},"canonical_sha256":"742acba9713a0777be5dc8a81144b21e6575570e21be5bfdf9d100c2326078c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"742acba9713a0777be5dc8a81144b21e6575570e21be5bfdf9d100c2326078c9","first_computed_at":"2026-05-18T02:49:30.388552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:30.388552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iXyDVtwRWLlZyCFNSXviAiJXZHSRTPft0vg51b8zOB0jJI4+28UdbnsrBemBVSvt6VEaxOD9d70jMI7iV1j0CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:30.389059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3594","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc6932ee231aea316fd7d8ec2ac2772fe456401e357691b49f64ee429f1bafa1","sha256:28933966df1fdae72dffba5b69a46e67237e95ab5317fcef15b9de040119b4ef"],"state_sha256":"5c335ed65f599c34e3e4d053e49c3f0b08609aebe1bf9ab32f7723ebd7e30389"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prb5MBbjKGhcLdTDIiK0V5dkQ29E+CUOtAzcMr8hgxT3vYWj+Ah5AhA96tAu3pZZTfNulDi+Nd3d7OLpqTaiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:41:44.786758Z","bundle_sha256":"37161e302d6fe7ef04accb35f552d2f908bffd51d089d8e3b8dd3b809fe8bcdd"}}