{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:N6C4WEYQTTDVEJV44R3JCEENI3","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":"611966fccab67dedf27a0813ebaeeabf9ef9843744c4e0fe538e5bfce2384736","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-10T17:54:02Z","title_canon_sha256":"c998df8a8508a292cc33f5e5f3ec1b90250ec75308907d764948d57537ece699"},"schema_version":"1.0","source":{"id":"2206.05256","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.05256","created_at":"2026-07-05T09:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"2206.05256v4","created_at":"2026-07-05T09:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05256","created_at":"2026-07-05T09:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"N6C4WEYQTTDV","created_at":"2026-07-05T09:00:20Z"},{"alias_kind":"pith_short_16","alias_value":"N6C4WEYQTTDVEJV4","created_at":"2026-07-05T09:00:20Z"},{"alias_kind":"pith_short_8","alias_value":"N6C4WEYQ","created_at":"2026-07-05T09:00:20Z"}],"graph_snapshots":[{"event_id":"sha256:76e64e94ec35d11859f2aaaa5abfee1f5a40d99772df6ca724a05e314dc69d48","target":"graph","created_at":"2026-07-05T09:00:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.05256/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization of MDS codes. An order-$\\ell$ MDS code, denoted by $\\operatorname{MDS}(\\ell)$, has the property that any $\\ell$ subspaces formed from columns of its generator matrix intersect as minimally as possible. An independent work by Roth defined a different notion of higher order MDS codes as those achieving a generalized singleton bound for list-decoding. In this work, we show that these two notions of higher order MDS codes are (nearly) equivalent.\n  We also show that generic Reed-Solomon codes are $\\","authors_text":"Joshua Brakensiek, Sivakanth Gopi, Visu Makam","cross_cats":["cs.CC","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-10T17:54:02Z","title":"Generic Reed-Solomon Codes Achieve List-decoding Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05256","kind":"arxiv","version":4},"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:9c294ca107b144f3a827469b5956815dcb53a56390490425d473414deaede20f","target":"record","created_at":"2026-07-05T09:00:20Z","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":"611966fccab67dedf27a0813ebaeeabf9ef9843744c4e0fe538e5bfce2384736","cross_cats_sorted":["cs.CC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-06-10T17:54:02Z","title_canon_sha256":"c998df8a8508a292cc33f5e5f3ec1b90250ec75308907d764948d57537ece699"},"schema_version":"1.0","source":{"id":"2206.05256","kind":"arxiv","version":4}},"canonical_sha256":"6f85cb13109cc75226bce47691108d46d7890471db836626a0aae27a8b7181de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f85cb13109cc75226bce47691108d46d7890471db836626a0aae27a8b7181de","first_computed_at":"2026-07-05T09:00:20.616697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:00:20.616697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i16Y1YjXRmQi2ZsYE5uEvi9nsBF4nijZb05JjHBaqytrg+ae4tB0KMI2AcQD2HQd63GeG1Pekf4sFi2nsIJ0AA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:00:20.617263Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.05256","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c294ca107b144f3a827469b5956815dcb53a56390490425d473414deaede20f","sha256:76e64e94ec35d11859f2aaaa5abfee1f5a40d99772df6ca724a05e314dc69d48"],"state_sha256":"a77ec7a756df2d4532d3cccf9653cdc23d0898e8fda9bcbc4172b59e917eba89"}