{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:A2IC4H5LPLBOFUCY3ATD4HC3XA","short_pith_number":"pith:A2IC4H5L","canonical_record":{"source":{"id":"2308.13424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-25T15:09:28Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"9c344b8abed3f859e867067d0502e8e0b36a0c7fedd6d03f8948e27db82a7094","abstract_canon_sha256":"ff6436b55b34427176875e588a22e97bffc6ceaec5d1bc7756c5eb1e65015dff"},"schema_version":"1.0"},"canonical_sha256":"06902e1fab7ac2e2d058d8263e1c5bb80a0707272915352937b62516968f71ca","source":{"kind":"arxiv","id":"2308.13424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13424","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13424v2","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13424","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"pith_short_12","alias_value":"A2IC4H5LPLBO","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"pith_short_16","alias_value":"A2IC4H5LPLBOFUCY","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"pith_short_8","alias_value":"A2IC4H5L","created_at":"2026-07-05T07:50:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:A2IC4H5LPLBOFUCY3ATD4HC3XA","target":"record","payload":{"canonical_record":{"source":{"id":"2308.13424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-25T15:09:28Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"9c344b8abed3f859e867067d0502e8e0b36a0c7fedd6d03f8948e27db82a7094","abstract_canon_sha256":"ff6436b55b34427176875e588a22e97bffc6ceaec5d1bc7756c5eb1e65015dff"},"schema_version":"1.0"},"canonical_sha256":"06902e1fab7ac2e2d058d8263e1c5bb80a0707272915352937b62516968f71ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:20.172303Z","signature_b64":"J88QPhF0yUush4avqeN3wt3KoC+3kcuPM8VB0hHURPc3W9UAw2/hFGVGOfk1E30jmqyMZ95/NWOYuulzlYNXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06902e1fab7ac2e2d058d8263e1c5bb80a0707272915352937b62516968f71ca","last_reissued_at":"2026-07-05T07:50:20.171898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:20.171898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.13424","source_version":2,"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-05T07:50:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xmxbi1b5WGNLuxXZAMXEHn3EnaxIgel7CztvFuN7u2iQABEUQReew7G2YtqSkD+kUjZBXmj4ZyljWN7Hz5PyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:05:53.514938Z"},"content_sha256":"1dd6efbe0304b304c032ee26e6d3afd10a298190b8ae3aead87fdde4da8898ff","schema_version":"1.0","event_id":"sha256:1dd6efbe0304b304c032ee26e6d3afd10a298190b8ae3aead87fdde4da8898ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:A2IC4H5LPLBOFUCY3ATD4HC3XA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Omar Alrabiah, Ray Li, Venkatesan Guruswami","submitted_at":"2023-08-25T15:09:28Z","abstract_excerpt":"A simple, recently observed generalization of the classical Singleton bound to list-decoding asserts that rate $R$ codes are not list-decodable using list-size $L$ beyond an error fraction $\\frac{L}{L+1} (1-R)$ (the Singleton bound being the case of $L=1$, i.e., unique decoding). We prove that in order to approach this bound for any fixed $L >1$, one needs exponential alphabets. Specifically, for every $L>1$ and $R\\in(0,1)$, if a rate $R$ code can be list-of-$L$ decoded up to error fraction $\\frac{L}{L+1} (1-R -\\varepsilon)$, then its alphabet must have size at least $\\exp(\\Omega_{L,R}(1/\\vare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13424","kind":"arxiv","version":2},"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/2308.13424/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-05T07:50:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3U0OGnmuIUmAg4/IikqKmc49QrsUn0+uB7+pNyrgt07PKJrbN9ffhkM6lGg+jfdJCCzNFJPpIsBUMIeW7u8/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:05:53.515476Z"},"content_sha256":"0161f29abd2dda65bb654516119de4c67e3a4415b4fc14a6d2e6656d0ca4142e","schema_version":"1.0","event_id":"sha256:0161f29abd2dda65bb654516119de4c67e3a4415b4fc14a6d2e6656d0ca4142e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA/bundle.json","state_url":"https://pith.science/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA/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-05T07:05:53Z","links":{"resolver":"https://pith.science/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA","bundle":"https://pith.science/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA/bundle.json","state":"https://pith.science/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2IC4H5LPLBOFUCY3ATD4HC3XA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:A2IC4H5LPLBOFUCY3ATD4HC3XA","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":"ff6436b55b34427176875e588a22e97bffc6ceaec5d1bc7756c5eb1e65015dff","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-25T15:09:28Z","title_canon_sha256":"9c344b8abed3f859e867067d0502e8e0b36a0c7fedd6d03f8948e27db82a7094"},"schema_version":"1.0","source":{"id":"2308.13424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13424","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13424v2","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13424","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"pith_short_12","alias_value":"A2IC4H5LPLBO","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"pith_short_16","alias_value":"A2IC4H5LPLBOFUCY","created_at":"2026-07-05T07:50:20Z"},{"alias_kind":"pith_short_8","alias_value":"A2IC4H5L","created_at":"2026-07-05T07:50:20Z"}],"graph_snapshots":[{"event_id":"sha256:0161f29abd2dda65bb654516119de4c67e3a4415b4fc14a6d2e6656d0ca4142e","target":"graph","created_at":"2026-07-05T07:50: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/2308.13424/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A simple, recently observed generalization of the classical Singleton bound to list-decoding asserts that rate $R$ codes are not list-decodable using list-size $L$ beyond an error fraction $\\frac{L}{L+1} (1-R)$ (the Singleton bound being the case of $L=1$, i.e., unique decoding). We prove that in order to approach this bound for any fixed $L >1$, one needs exponential alphabets. Specifically, for every $L>1$ and $R\\in(0,1)$, if a rate $R$ code can be list-of-$L$ decoded up to error fraction $\\frac{L}{L+1} (1-R -\\varepsilon)$, then its alphabet must have size at least $\\exp(\\Omega_{L,R}(1/\\vare","authors_text":"Omar Alrabiah, Ray Li, Venkatesan Guruswami","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-25T15:09:28Z","title":"AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13424","kind":"arxiv","version":2},"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:1dd6efbe0304b304c032ee26e6d3afd10a298190b8ae3aead87fdde4da8898ff","target":"record","created_at":"2026-07-05T07:50: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":"ff6436b55b34427176875e588a22e97bffc6ceaec5d1bc7756c5eb1e65015dff","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-25T15:09:28Z","title_canon_sha256":"9c344b8abed3f859e867067d0502e8e0b36a0c7fedd6d03f8948e27db82a7094"},"schema_version":"1.0","source":{"id":"2308.13424","kind":"arxiv","version":2}},"canonical_sha256":"06902e1fab7ac2e2d058d8263e1c5bb80a0707272915352937b62516968f71ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06902e1fab7ac2e2d058d8263e1c5bb80a0707272915352937b62516968f71ca","first_computed_at":"2026-07-05T07:50:20.171898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:20.171898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J88QPhF0yUush4avqeN3wt3KoC+3kcuPM8VB0hHURPc3W9UAw2/hFGVGOfk1E30jmqyMZ95/NWOYuulzlYNXDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:20.172303Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dd6efbe0304b304c032ee26e6d3afd10a298190b8ae3aead87fdde4da8898ff","sha256:0161f29abd2dda65bb654516119de4c67e3a4415b4fc14a6d2e6656d0ca4142e"],"state_sha256":"aeda4dce1b561c1851154d57063cae05a3e5d5bce05fe4886469f311cb7adfff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UxsyIlMajWRKuIiGGj6WoSSF+F9gYPNHy4W8im5bdPg2Yq6s2JxHR7CeUH6RpY4KvNFjIQkclJ9TPAQcJ8YNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:05:53.520433Z","bundle_sha256":"bd4f1b51887cdda0126ea52cb2ac1795ac687d5f71655cc46d5b9131af151689"}}