{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VGUCALC6IRP4HJZ5WVQMMZSDV5","short_pith_number":"pith:VGUCALC6","canonical_record":{"source":{"id":"1805.01498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T18:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90184b85dd745be47e2225a109590941d2fc42c18547f33320b6a24f64263017","abstract_canon_sha256":"d0202811c4e1fefd119f7aee4e7c43e9b900390e555a2fcc8c6088301b455d4e"},"schema_version":"1.0"},"canonical_sha256":"a9a8202c5e445fc3a73db560c66643af53d46e637afb71a17b2cf0aeb604a244","source":{"kind":"arxiv","id":"1805.01498","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01498","created_at":"2026-05-18T00:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01498v1","created_at":"2026-05-18T00:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01498","created_at":"2026-05-18T00:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"VGUCALC6IRP4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGUCALC6IRP4HJZ5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGUCALC6","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VGUCALC6IRP4HJZ5WVQMMZSDV5","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T18:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90184b85dd745be47e2225a109590941d2fc42c18547f33320b6a24f64263017","abstract_canon_sha256":"d0202811c4e1fefd119f7aee4e7c43e9b900390e555a2fcc8c6088301b455d4e"},"schema_version":"1.0"},"canonical_sha256":"a9a8202c5e445fc3a73db560c66643af53d46e637afb71a17b2cf0aeb604a244","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:51.177535Z","signature_b64":"S5NfjQv/RxlJa6nLjWV1TP+C76Em7e4/JoLo0EXLSQV3fc5vrTYDtEUxtFBZarxSeY2ScoCzf4GE4xvWbD62BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a8202c5e445fc3a73db560c66643af53d46e637afb71a17b2cf0aeb604a244","last_reissued_at":"2026-05-18T00:16:51.176721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:51.176721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01498","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-18T00:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tetYVRYG38tMml0yZvLXUvV9XzYxG0KnjMHeYXlJUldsBj4sK8aeawrjCltmrFZCmbUvuh7fI2M49W1f0AlnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:14:48.709901Z"},"content_sha256":"fd405a5c32d0dde2fc4af0b5d0c30ae9bfd4327a04baed2e4ff5026004a1a371","schema_version":"1.0","event_id":"sha256:fd405a5c32d0dde2fc4af0b5d0c30ae9bfd4327a04baed2e4ff5026004a1a371"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VGUCALC6IRP4HJZ5WVQMMZSDV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters, Noga Ron-Zewi, Shubhangi Saraf, Swastik Kopparty","submitted_at":"2018-05-03T18:29:18Z","abstract_excerpt":"In this work, we show new and improved error-correcting properties of folded Reed-Solomon codes and multiplicity codes. Both of these families of codes are based on polynomials over finite fields, and both have been the sources of recent advances in coding theory. Folded Reed-Solomon codes were the first explicit constructions of codes known to achieve list-decoding capacity; multivariate multiplicity codes were the first constructions of high-rate locally correctable codes; and univariate multiplicity codes are also known to achieve list-decoding capacity.\n  However, previous analyses of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01498","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-18T00:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LegaNv8yqM2E12mj9k2hYa7nv1Q+YZV+XtFUMeYgIwCzG/faf15ww+xBDaVteuN4pXtapGGFSJ4p6HjhEfMdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:14:48.710248Z"},"content_sha256":"653112147f4369a54c6a72be0ea276fd54ab27cce066288d0625d0b0d8ff55e6","schema_version":"1.0","event_id":"sha256:653112147f4369a54c6a72be0ea276fd54ab27cce066288d0625d0b0d8ff55e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5/bundle.json","state_url":"https://pith.science/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5/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-07T05:14:48Z","links":{"resolver":"https://pith.science/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5","bundle":"https://pith.science/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5/bundle.json","state":"https://pith.science/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGUCALC6IRP4HJZ5WVQMMZSDV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VGUCALC6IRP4HJZ5WVQMMZSDV5","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":"d0202811c4e1fefd119f7aee4e7c43e9b900390e555a2fcc8c6088301b455d4e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T18:29:18Z","title_canon_sha256":"90184b85dd745be47e2225a109590941d2fc42c18547f33320b6a24f64263017"},"schema_version":"1.0","source":{"id":"1805.01498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01498","created_at":"2026-05-18T00:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01498v1","created_at":"2026-05-18T00:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01498","created_at":"2026-05-18T00:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"VGUCALC6IRP4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGUCALC6IRP4HJZ5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGUCALC6","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:653112147f4369a54c6a72be0ea276fd54ab27cce066288d0625d0b0d8ff55e6","target":"graph","created_at":"2026-05-18T00:16:51Z","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":"In this work, we show new and improved error-correcting properties of folded Reed-Solomon codes and multiplicity codes. Both of these families of codes are based on polynomials over finite fields, and both have been the sources of recent advances in coding theory. Folded Reed-Solomon codes were the first explicit constructions of codes known to achieve list-decoding capacity; multivariate multiplicity codes were the first constructions of high-rate locally correctable codes; and univariate multiplicity codes are also known to achieve list-decoding capacity.\n  However, previous analyses of the ","authors_text":"Mary Wootters, Noga Ron-Zewi, Shubhangi Saraf, Swastik Kopparty","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T18:29:18Z","title":"Improved decoding of Folded Reed-Solomon and Multiplicity Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01498","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:fd405a5c32d0dde2fc4af0b5d0c30ae9bfd4327a04baed2e4ff5026004a1a371","target":"record","created_at":"2026-05-18T00:16:51Z","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":"d0202811c4e1fefd119f7aee4e7c43e9b900390e555a2fcc8c6088301b455d4e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-03T18:29:18Z","title_canon_sha256":"90184b85dd745be47e2225a109590941d2fc42c18547f33320b6a24f64263017"},"schema_version":"1.0","source":{"id":"1805.01498","kind":"arxiv","version":1}},"canonical_sha256":"a9a8202c5e445fc3a73db560c66643af53d46e637afb71a17b2cf0aeb604a244","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9a8202c5e445fc3a73db560c66643af53d46e637afb71a17b2cf0aeb604a244","first_computed_at":"2026-05-18T00:16:51.176721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:51.176721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S5NfjQv/RxlJa6nLjWV1TP+C76Em7e4/JoLo0EXLSQV3fc5vrTYDtEUxtFBZarxSeY2ScoCzf4GE4xvWbD62BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:51.177535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd405a5c32d0dde2fc4af0b5d0c30ae9bfd4327a04baed2e4ff5026004a1a371","sha256:653112147f4369a54c6a72be0ea276fd54ab27cce066288d0625d0b0d8ff55e6"],"state_sha256":"64853c0217dac58bd93709f1d9656cb0bd0a71b4c251588d77846c6de877e1d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWvq341sW2sgz2rX4J5lNYU3A0FvuD7y5qqd7C90Km/nEQp7hXt/5vQFyGRP61731nz0ve5ntfTqavGt6rMuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:14:48.712266Z","bundle_sha256":"939dc6b1ffff8f80d62501e3305879f6f0235b697c66a6c560254f8687c70fca"}}