{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RDBKMNKWYXTF5BH4SQGRLA4KQK","short_pith_number":"pith:RDBKMNKW","canonical_record":{"source":{"id":"2408.15925","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-28T16:39:58Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"9d091ec7566238af51e171898170fe5e3f0e7c35d95f228164c426c60d0fbd79","abstract_canon_sha256":"9ed98eb625482779d77c84b880f5a7ac9c551e57633b0f154e449f82b55777b6"},"schema_version":"1.0"},"canonical_sha256":"88c2a63556c5e65e84fc940d15838a828dc79f7559aa5319ffef17404bfdb1d3","source":{"kind":"arxiv","id":"2408.15925","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15925","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15925v3","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15925","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"RDBKMNKWYXTF","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"pith_short_16","alias_value":"RDBKMNKWYXTF5BH4","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"pith_short_8","alias_value":"RDBKMNKW","created_at":"2026-07-05T10:48:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RDBKMNKWYXTF5BH4SQGRLA4KQK","target":"record","payload":{"canonical_record":{"source":{"id":"2408.15925","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-28T16:39:58Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"9d091ec7566238af51e171898170fe5e3f0e7c35d95f228164c426c60d0fbd79","abstract_canon_sha256":"9ed98eb625482779d77c84b880f5a7ac9c551e57633b0f154e449f82b55777b6"},"schema_version":"1.0"},"canonical_sha256":"88c2a63556c5e65e84fc940d15838a828dc79f7559aa5319ffef17404bfdb1d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:18.906251Z","signature_b64":"SZarFvvhg8g6NKgojuIsdXpa+NMTczvESyrhmEB2iSAeqOGbbj2WiS9JhoSrmEzEQ22qxZXvROaC4beSwpMbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88c2a63556c5e65e84fc940d15838a828dc79f7559aa5319ffef17404bfdb1d3","last_reissued_at":"2026-07-05T10:48:18.905806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:18.905806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.15925","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-07-05T10:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nbs1fUm5oRhr7x13wQ9WJHI5FluBeriwciAfsBsLtXXzVOvq12qR1siFmv3X1rXRTZR+aLfkkyJ5fS7eA2h3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:15:57.267396Z"},"content_sha256":"150adb8c47df3a2381b2c639c43bcc0cc3939e98fbb9896708b479502f5636c7","schema_version":"1.0","event_id":"sha256:150adb8c47df3a2381b2c639c43bcc0cc3939e98fbb9896708b479502f5636c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RDBKMNKWYXTF5BH4SQGRLA4KQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Yeyuan Chen, Zihan Zhang","submitted_at":"2024-08-28T16:39:58Z","abstract_excerpt":"In this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed generalized Singleton bounds for list size $L\\ge1.$ Specifically, we show the following: (1) FRS code of length $n$ and rate $R$ over the alphabet $\\mathbb{F}_q^s$ with distinct evaluation points is $\\left(\\frac{L}{L+1}\\left(1-\\frac{sR}{s-L+1}\\right),L\\right)$ list-decodable (LD) for list size $L\\in[s]$. (2) Multiplicity code of length $n$ and rate $R$ over the alphabet $\\mathbb{F}_p^s$ with distinct evaluation points is $\\left(\\frac{L}{L+1}\\left(1-\\frac{sR}{s-L+1}\\right),L\\right)$ LD for list size $L\\in[s]$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15925","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.15925/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVlD/QOEiEymkC2bxAdVhKV92Z3SxwaYucKSOuwERPugxsxhR4yfp8fU9+nS9lejpUSXhNf3CX1NL6AOSXzPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:15:57.267995Z"},"content_sha256":"a3aa0ce291b7159e28ff75fbdd7bbb028ad5889049d5d76e64629db06da08d04","schema_version":"1.0","event_id":"sha256:a3aa0ce291b7159e28ff75fbdd7bbb028ad5889049d5d76e64629db06da08d04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK/bundle.json","state_url":"https://pith.science/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK/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-08-14T16:15:57Z","links":{"resolver":"https://pith.science/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK","bundle":"https://pith.science/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK/bundle.json","state":"https://pith.science/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDBKMNKWYXTF5BH4SQGRLA4KQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RDBKMNKWYXTF5BH4SQGRLA4KQK","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":"9ed98eb625482779d77c84b880f5a7ac9c551e57633b0f154e449f82b55777b6","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-28T16:39:58Z","title_canon_sha256":"9d091ec7566238af51e171898170fe5e3f0e7c35d95f228164c426c60d0fbd79"},"schema_version":"1.0","source":{"id":"2408.15925","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15925","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15925v3","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15925","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"RDBKMNKWYXTF","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"pith_short_16","alias_value":"RDBKMNKWYXTF5BH4","created_at":"2026-07-05T10:48:18Z"},{"alias_kind":"pith_short_8","alias_value":"RDBKMNKW","created_at":"2026-07-05T10:48:18Z"}],"graph_snapshots":[{"event_id":"sha256:a3aa0ce291b7159e28ff75fbdd7bbb028ad5889049d5d76e64629db06da08d04","target":"graph","created_at":"2026-07-05T10:48:18Z","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/2408.15925/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed generalized Singleton bounds for list size $L\\ge1.$ Specifically, we show the following: (1) FRS code of length $n$ and rate $R$ over the alphabet $\\mathbb{F}_q^s$ with distinct evaluation points is $\\left(\\frac{L}{L+1}\\left(1-\\frac{sR}{s-L+1}\\right),L\\right)$ list-decodable (LD) for list size $L\\in[s]$. (2) Multiplicity code of length $n$ and rate $R$ over the alphabet $\\mathbb{F}_p^s$ with distinct evaluation points is $\\left(\\frac{L}{L+1}\\left(1-\\frac{sR}{s-L+1}\\right),L\\right)$ LD for list size $L\\in[s]$","authors_text":"Yeyuan Chen, Zihan Zhang","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-28T16:39:58Z","title":"Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15925","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:150adb8c47df3a2381b2c639c43bcc0cc3939e98fbb9896708b479502f5636c7","target":"record","created_at":"2026-07-05T10:48:18Z","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":"9ed98eb625482779d77c84b880f5a7ac9c551e57633b0f154e449f82b55777b6","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-28T16:39:58Z","title_canon_sha256":"9d091ec7566238af51e171898170fe5e3f0e7c35d95f228164c426c60d0fbd79"},"schema_version":"1.0","source":{"id":"2408.15925","kind":"arxiv","version":3}},"canonical_sha256":"88c2a63556c5e65e84fc940d15838a828dc79f7559aa5319ffef17404bfdb1d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88c2a63556c5e65e84fc940d15838a828dc79f7559aa5319ffef17404bfdb1d3","first_computed_at":"2026-07-05T10:48:18.905806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:48:18.905806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SZarFvvhg8g6NKgojuIsdXpa+NMTczvESyrhmEB2iSAeqOGbbj2WiS9JhoSrmEzEQ22qxZXvROaC4beSwpMbCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:48:18.906251Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.15925","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:150adb8c47df3a2381b2c639c43bcc0cc3939e98fbb9896708b479502f5636c7","sha256:a3aa0ce291b7159e28ff75fbdd7bbb028ad5889049d5d76e64629db06da08d04"],"state_sha256":"b8abde7cdce1c5fe514b7a067b39b05ec2514fe66dd849445302d51ff7fa7f03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3wcstej9sGOVMFDTJlUEpgP3Dtr9MhwoaQPeIgs1qjpSYU2WauQx0ldNeZVUhmL8Krho+taGvZAP7Rx7f/8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T16:15:57.291065Z","bundle_sha256":"aa55ad1a4538d26159f364b78d039f17e0664cabdfd5c3fc158daff2905d8656"}}