{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IE3CHZZ2SZKNWKUM55Q2KCK2T5","short_pith_number":"pith:IE3CHZZ2","canonical_record":{"source":{"id":"1106.3951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-20T15:51:22Z","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"title_canon_sha256":"df6b33e1eee42ac06301a4029e57876af18e2ab8e60c4c8224b4bb9efc0a06b2","abstract_canon_sha256":"3837a61b469c67ca96656acb186fa7f250ed9c021478637866d8614c3ea00ebf"},"schema_version":"1.0"},"canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","source":{"kind":"arxiv","id":"1106.3951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3951","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3951v1","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3951","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"IE3CHZZ2SZKN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IE3CHZZ2SZKNWKUM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IE3CHZZ2","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IE3CHZZ2SZKNWKUM55Q2KCK2T5","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-20T15:51:22Z","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"title_canon_sha256":"df6b33e1eee42ac06301a4029e57876af18e2ab8e60c4c8224b4bb9efc0a06b2","abstract_canon_sha256":"3837a61b469c67ca96656acb186fa7f250ed9c021478637866d8614c3ea00ebf"},"schema_version":"1.0"},"canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.726255Z","signature_b64":"vzJqGuzjN0dR4uI3rmENx4bG/qOWg0XMiL9P6d+7hHlfUmVTeY2RgnwTiX2ocNqL5K9WgbnWnZ/5H7OnjPVsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","last_reissued_at":"2026-05-18T02:21:43.725847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.725847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3951","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-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjQz61qzRd5FK3mk9UlpY5sfaL6Mz5A68uCnJ/W+EkTTejvLvKMeixJ+VByYHwD51mVrlKZNRRPUGkB2P7DqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:02:25.116562Z"},"content_sha256":"b8cfcc26db946bc9c6cf2af12a4e7508ac497d0b29bb52f740a26ecac5692ff8","schema_version":"1.0","event_id":"sha256:b8cfcc26db946bc9c6cf2af12a4e7508ac497d0b29bb52f740a26ecac5692ff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IE3CHZZ2SZKNWKUM55Q2KCK2T5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal rate list decoding via derivative codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Venkatesan Guruswami","submitted_at":"2011-06-20T15:51:22Z","abstract_excerpt":"The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\\F_q$ consist of the evaluations of polynomials $f \\in \\F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $m$) {\\em derivative codes} and defined over fields of large characteristic, which consist of the evaluations of $f$ as well as its first $m-1$ formal derivatives at $n$ distinct field elements. For large enough $m$, we show that these codes can be list-decoded in polynomial time from an error fraction approaching $1-R$, where $R=k/(nm)$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3951","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-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rjF0y6UfWyx8YUCZKzU1NdUzkhLkxIO9h4TqePZuKeYZjUsjyUB0EoqiCgOe32BYmnFfh4BZxUMqmc5UZ7EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:02:25.117239Z"},"content_sha256":"25c166499a570e4c837e1fc38e19ecc38699af449137642e8815cebf2da25d6d","schema_version":"1.0","event_id":"sha256:25c166499a570e4c837e1fc38e19ecc38699af449137642e8815cebf2da25d6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/bundle.json","state_url":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/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-29T15:02:25Z","links":{"resolver":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5","bundle":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/bundle.json","state":"https://pith.science/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IE3CHZZ2SZKNWKUM55Q2KCK2T5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IE3CHZZ2SZKNWKUM55Q2KCK2T5","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":"3837a61b469c67ca96656acb186fa7f250ed9c021478637866d8614c3ea00ebf","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-20T15:51:22Z","title_canon_sha256":"df6b33e1eee42ac06301a4029e57876af18e2ab8e60c4c8224b4bb9efc0a06b2"},"schema_version":"1.0","source":{"id":"1106.3951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3951","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3951v1","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3951","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"IE3CHZZ2SZKN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IE3CHZZ2SZKNWKUM","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IE3CHZZ2","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:25c166499a570e4c837e1fc38e19ecc38699af449137642e8815cebf2da25d6d","target":"graph","created_at":"2026-05-18T02:21:43Z","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":"The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\\F_q$ consist of the evaluations of polynomials $f \\in \\F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $m$) {\\em derivative codes} and defined over fields of large characteristic, which consist of the evaluations of $f$ as well as its first $m-1$ formal derivatives at $n$ distinct field elements. For large enough $m$, we show that these codes can be list-decoded in polynomial time from an error fraction approaching $1-R$, where $R=k/(nm)$ is the","authors_text":"Carol Wang, Venkatesan Guruswami","cross_cats":["cs.CC","cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-20T15:51:22Z","title":"Optimal rate list decoding via derivative codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3951","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:b8cfcc26db946bc9c6cf2af12a4e7508ac497d0b29bb52f740a26ecac5692ff8","target":"record","created_at":"2026-05-18T02:21:43Z","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":"3837a61b469c67ca96656acb186fa7f250ed9c021478637866d8614c3ea00ebf","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-20T15:51:22Z","title_canon_sha256":"df6b33e1eee42ac06301a4029e57876af18e2ab8e60c4c8224b4bb9efc0a06b2"},"schema_version":"1.0","source":{"id":"1106.3951","kind":"arxiv","version":1}},"canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"413623e73a9654db2a8cef61a5095a9f53a7864df8c3e23b8e9c252e3de909d2","first_computed_at":"2026-05-18T02:21:43.725847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:43.725847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzJqGuzjN0dR4uI3rmENx4bG/qOWg0XMiL9P6d+7hHlfUmVTeY2RgnwTiX2ocNqL5K9WgbnWnZ/5H7OnjPVsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:43.726255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8cfcc26db946bc9c6cf2af12a4e7508ac497d0b29bb52f740a26ecac5692ff8","sha256:25c166499a570e4c837e1fc38e19ecc38699af449137642e8815cebf2da25d6d"],"state_sha256":"86d7800cd7424abf6307ce6c512085f14ec70fbd45dba169eea8035bdfd096aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9c4h3GfCG+76jDfsX44Byfhz4nViYnKJ/mbIXxc6qx/gKJSCx6m2WdO5dcT3DZWVjuPKd7c6T7Zxwi2hwofBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:02:25.120736Z","bundle_sha256":"ede48f85812d1b9507c9c5a9f9f4dce77c48dc6cd7155044c286ee53aaabab86"}}