{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DIEKWVLIKRYMR3RBMFDK2PA5BT","short_pith_number":"pith:DIEKWVLI","canonical_record":{"source":{"id":"2408.14652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-26T21:33:34Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"d3c9b38bcd77414b761106635cdc22531e6203d72622acd4afc899a951cf5272","abstract_canon_sha256":"6a48f0f78b44cc426c7882d22c91320196b7629f3e44e8befd1b8517383552f9"},"schema_version":"1.0"},"canonical_sha256":"1a08ab55685470c8ee216146ad3c1d0ccbd240913020bd957899d1f6a8ca126d","source":{"kind":"arxiv","id":"2408.14652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.14652","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"2408.14652v1","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14652","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"DIEKWVLIKRYM","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"pith_short_16","alias_value":"DIEKWVLIKRYMR3RB","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"pith_short_8","alias_value":"DIEKWVLI","created_at":"2026-07-05T08:59:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DIEKWVLIKRYMR3RBMFDK2PA5BT","target":"record","payload":{"canonical_record":{"source":{"id":"2408.14652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-26T21:33:34Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"d3c9b38bcd77414b761106635cdc22531e6203d72622acd4afc899a951cf5272","abstract_canon_sha256":"6a48f0f78b44cc426c7882d22c91320196b7629f3e44e8befd1b8517383552f9"},"schema_version":"1.0"},"canonical_sha256":"1a08ab55685470c8ee216146ad3c1d0ccbd240913020bd957899d1f6a8ca126d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:37.045308Z","signature_b64":"UlmFq5bXKtjpyA3Z3IePXAAJliyYvgrzZEWn7ScdatwJZw34Q9WeFNp8iCexYP47b0Q/OtCWvyWr/VIkcnnDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a08ab55685470c8ee216146ad3c1d0ccbd240913020bd957899d1f6a8ca126d","last_reissued_at":"2026-07-05T08:59:37.044966Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:37.044966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.14652","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-07-05T08:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ptwvIXts/pegKq/ODM8kzQb3bM8SwMtLYL3lN4lNezLYkNSU48W23qOn5U7csLWERqqva7pZgAbuFrv/CVZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:03:35.642812Z"},"content_sha256":"d1c4e92b907eafc367d34492f30304c71a23a1c3165dceda18d6e37bc666f7c3","schema_version":"1.0","event_id":"sha256:d1c4e92b907eafc367d34492f30304c71a23a1c3165dceda18d6e37bc666f7c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DIEKWVLIKRYMR3RBMFDK2PA5BT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous Optimization for Decoding Errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Shashank Srivastava","submitted_at":"2024-08-26T21:33:34Z","abstract_excerpt":"Error-correcting codes are one of the most fundamental objects in pseudorandomness, with applications in communication, complexity theory, and beyond. Codes are useful because of their ability to support decoding, which is the task of recovering a codeword from its noisy copy. List decoding is a relaxation where the decoder is allowed to output a list of codewords, and has seen tremendous progress over the last 25 years. In this thesis, we prove new algorithmic and combinatorial results about list decoding.\n  We describe a list decoding framework that reduces the task of efficient decoding to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14652","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.14652/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-05T08:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iieqwHz/wlSn7vpb6bJTJVLKjwzfuZJzDtpUSo7c8/MHL9PME7nuz9x0RsP1/ijqkonGTXR0eiEkNXPBWaaKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:03:35.644014Z"},"content_sha256":"8171db3c156a19df07bb43b50760559a147d4757eb8f974b412fb231f3611943","schema_version":"1.0","event_id":"sha256:8171db3c156a19df07bb43b50760559a147d4757eb8f974b412fb231f3611943"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT/bundle.json","state_url":"https://pith.science/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT/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-14T11:03:35Z","links":{"resolver":"https://pith.science/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT","bundle":"https://pith.science/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT/bundle.json","state":"https://pith.science/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIEKWVLIKRYMR3RBMFDK2PA5BT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DIEKWVLIKRYMR3RBMFDK2PA5BT","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":"6a48f0f78b44cc426c7882d22c91320196b7629f3e44e8befd1b8517383552f9","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-26T21:33:34Z","title_canon_sha256":"d3c9b38bcd77414b761106635cdc22531e6203d72622acd4afc899a951cf5272"},"schema_version":"1.0","source":{"id":"2408.14652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.14652","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"2408.14652v1","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14652","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"DIEKWVLIKRYM","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"pith_short_16","alias_value":"DIEKWVLIKRYMR3RB","created_at":"2026-07-05T08:59:37Z"},{"alias_kind":"pith_short_8","alias_value":"DIEKWVLI","created_at":"2026-07-05T08:59:37Z"}],"graph_snapshots":[{"event_id":"sha256:8171db3c156a19df07bb43b50760559a147d4757eb8f974b412fb231f3611943","target":"graph","created_at":"2026-07-05T08:59:37Z","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.14652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Error-correcting codes are one of the most fundamental objects in pseudorandomness, with applications in communication, complexity theory, and beyond. Codes are useful because of their ability to support decoding, which is the task of recovering a codeword from its noisy copy. List decoding is a relaxation where the decoder is allowed to output a list of codewords, and has seen tremendous progress over the last 25 years. In this thesis, we prove new algorithmic and combinatorial results about list decoding.\n  We describe a list decoding framework that reduces the task of efficient decoding to ","authors_text":"Shashank Srivastava","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-26T21:33:34Z","title":"Continuous Optimization for Decoding Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14652","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:d1c4e92b907eafc367d34492f30304c71a23a1c3165dceda18d6e37bc666f7c3","target":"record","created_at":"2026-07-05T08:59:37Z","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":"6a48f0f78b44cc426c7882d22c91320196b7629f3e44e8befd1b8517383552f9","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-26T21:33:34Z","title_canon_sha256":"d3c9b38bcd77414b761106635cdc22531e6203d72622acd4afc899a951cf5272"},"schema_version":"1.0","source":{"id":"2408.14652","kind":"arxiv","version":1}},"canonical_sha256":"1a08ab55685470c8ee216146ad3c1d0ccbd240913020bd957899d1f6a8ca126d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a08ab55685470c8ee216146ad3c1d0ccbd240913020bd957899d1f6a8ca126d","first_computed_at":"2026-07-05T08:59:37.044966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:59:37.044966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlmFq5bXKtjpyA3Z3IePXAAJliyYvgrzZEWn7ScdatwJZw34Q9WeFNp8iCexYP47b0Q/OtCWvyWr/VIkcnnDCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:59:37.045308Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.14652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1c4e92b907eafc367d34492f30304c71a23a1c3165dceda18d6e37bc666f7c3","sha256:8171db3c156a19df07bb43b50760559a147d4757eb8f974b412fb231f3611943"],"state_sha256":"29167e031952e30fde04cba31de2bbc5afd97fe3c73bd3dc2bb3e002c1babb5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCCWfRsImJgPKaOj/VEBm51J43SoLm9wpZ+iFCHQR0BC+kefmN6jk7GlhfaSBgFqYricm9kyjB51R0lqbnB6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T11:03:35.650630Z","bundle_sha256":"a74a5aa17ebbff91904c59971efdfaa742c1b4830b73ce9a3ef01d4ede3286d8"}}