{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RS4UJ6VBJZ5P4MG32EMONVSPYR","short_pith_number":"pith:RS4UJ6VB","canonical_record":{"source":{"id":"2504.20333","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T00:53:34Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"b5e60cb94e972d20621e0be5f85a3b7884bfa18ed9a13e633d6aac6a5a48d2ec","abstract_canon_sha256":"bbfba5a306cf8cbd3e12269b12d65646ba080405d391f913839265aa9076ae67"},"schema_version":"1.0"},"canonical_sha256":"8cb944faa14e7afe30dbd118e6d64fc44d1ac841ab06b18e50c0991542f28cd5","source":{"kind":"arxiv","id":"2504.20333","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20333","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20333v2","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20333","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"pith_short_12","alias_value":"RS4UJ6VBJZ5P","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"pith_short_16","alias_value":"RS4UJ6VBJZ5P4MG3","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"pith_short_8","alias_value":"RS4UJ6VB","created_at":"2026-07-05T11:38:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RS4UJ6VBJZ5P4MG32EMONVSPYR","target":"record","payload":{"canonical_record":{"source":{"id":"2504.20333","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T00:53:34Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"b5e60cb94e972d20621e0be5f85a3b7884bfa18ed9a13e633d6aac6a5a48d2ec","abstract_canon_sha256":"bbfba5a306cf8cbd3e12269b12d65646ba080405d391f913839265aa9076ae67"},"schema_version":"1.0"},"canonical_sha256":"8cb944faa14e7afe30dbd118e6d64fc44d1ac841ab06b18e50c0991542f28cd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:51.339168Z","signature_b64":"nqYwHeFwSlNPobbo2CKPi5VoX2OrNS5Y1kHoi9mplVtzfKB0HNQ/z7WVVVc3pRkLior4pPYWnbCtY4fFJ1wiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb944faa14e7afe30dbd118e6d64fc44d1ac841ab06b18e50c0991542f28cd5","last_reissued_at":"2026-07-05T11:38:51.338724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:51.338724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.20333","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-05T11:38:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8KNtP6Z6Z6xrNGm7rAEhagV31hqrx1YznnVyj9RGXZHFg18WohZhw7+x7eicudfpaAoYbH5Oj6ZZ5K029JiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:59:18.799630Z"},"content_sha256":"3d683d223439d19f899ef2dad47c87505ccdb88458c956025a98be0fecfd61f7","schema_version":"1.0","event_id":"sha256:3d683d223439d19f899ef2dad47c87505ccdb88458c956025a98be0fecfd61f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RS4UJ6VBJZ5P4MG32EMONVSPYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Decoding Expander-Based Codes up to Capacity in Near-Linear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Madhur Tulsiani, Shashank Srivastava","submitted_at":"2025-04-29T00:53:34Z","abstract_excerpt":"We give a new framework based on graph regularity lemmas, for list decoding and list recovery of codes based on spectral expanders. Using existing algorithms for computing regularity decompositions of sparse graphs in (randomized) near-linear time, and appropriate choices for the constant-sized inner/base codes, we prove the following:\n  - Expander-based codes constructed using the distance amplification technique of Alon, Edmonds and Luby [FOCS 1995] with rate $\\rho$, can be list decoded to a radius $1 - \\rho - \\epsilon$ in near-linear time. By known results, the output list has size $O(1/\\ep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20333","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/2504.20333/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-05T11:38:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iWW5pNtcqQd8DaqOiS6sQKYx7ZIUPD/vlfVjI7Ex9AcMjhMWBjtcaduuyKIU/GFqugR42DH/y+OV4/BBy0vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:59:18.800144Z"},"content_sha256":"5097794a7c46189d871bc52c4697578f12009443dc57ad28ba31eea4fb684c3f","schema_version":"1.0","event_id":"sha256:5097794a7c46189d871bc52c4697578f12009443dc57ad28ba31eea4fb684c3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR/bundle.json","state_url":"https://pith.science/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR/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-15T19:59:18Z","links":{"resolver":"https://pith.science/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR","bundle":"https://pith.science/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR/bundle.json","state":"https://pith.science/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RS4UJ6VBJZ5P4MG32EMONVSPYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RS4UJ6VBJZ5P4MG32EMONVSPYR","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":"bbfba5a306cf8cbd3e12269b12d65646ba080405d391f913839265aa9076ae67","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T00:53:34Z","title_canon_sha256":"b5e60cb94e972d20621e0be5f85a3b7884bfa18ed9a13e633d6aac6a5a48d2ec"},"schema_version":"1.0","source":{"id":"2504.20333","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20333","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20333v2","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20333","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"pith_short_12","alias_value":"RS4UJ6VBJZ5P","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"pith_short_16","alias_value":"RS4UJ6VBJZ5P4MG3","created_at":"2026-07-05T11:38:51Z"},{"alias_kind":"pith_short_8","alias_value":"RS4UJ6VB","created_at":"2026-07-05T11:38:51Z"}],"graph_snapshots":[{"event_id":"sha256:5097794a7c46189d871bc52c4697578f12009443dc57ad28ba31eea4fb684c3f","target":"graph","created_at":"2026-07-05T11:38: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.20333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a new framework based on graph regularity lemmas, for list decoding and list recovery of codes based on spectral expanders. Using existing algorithms for computing regularity decompositions of sparse graphs in (randomized) near-linear time, and appropriate choices for the constant-sized inner/base codes, we prove the following:\n  - Expander-based codes constructed using the distance amplification technique of Alon, Edmonds and Luby [FOCS 1995] with rate $\\rho$, can be list decoded to a radius $1 - \\rho - \\epsilon$ in near-linear time. By known results, the output list has size $O(1/\\ep","authors_text":"Madhur Tulsiani, Shashank Srivastava","cross_cats":["cs.CC","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T00:53:34Z","title":"List Decoding Expander-Based Codes up to Capacity in Near-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20333","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:3d683d223439d19f899ef2dad47c87505ccdb88458c956025a98be0fecfd61f7","target":"record","created_at":"2026-07-05T11:38: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":"bbfba5a306cf8cbd3e12269b12d65646ba080405d391f913839265aa9076ae67","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T00:53:34Z","title_canon_sha256":"b5e60cb94e972d20621e0be5f85a3b7884bfa18ed9a13e633d6aac6a5a48d2ec"},"schema_version":"1.0","source":{"id":"2504.20333","kind":"arxiv","version":2}},"canonical_sha256":"8cb944faa14e7afe30dbd118e6d64fc44d1ac841ab06b18e50c0991542f28cd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cb944faa14e7afe30dbd118e6d64fc44d1ac841ab06b18e50c0991542f28cd5","first_computed_at":"2026-07-05T11:38:51.338724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:51.338724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nqYwHeFwSlNPobbo2CKPi5VoX2OrNS5Y1kHoi9mplVtzfKB0HNQ/z7WVVVc3pRkLior4pPYWnbCtY4fFJ1wiDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:51.339168Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.20333","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d683d223439d19f899ef2dad47c87505ccdb88458c956025a98be0fecfd61f7","sha256:5097794a7c46189d871bc52c4697578f12009443dc57ad28ba31eea4fb684c3f"],"state_sha256":"6e3920f7435e6782a45d00ff5a0192ec7ffae045db2876e3e43c65ec2bb75283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1kMWG3ju1OxG2pNKijZcC/j/SYk0FFm7g8TC3RvaIMhOcgTaxuiGQ9g6jmm0KAmrrGRx6p1UFBqDDZCh8/4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T19:59:18.805002Z","bundle_sha256":"7f0dcc3def5d3c007adc43e6b3e6bf7f5f7bc09a40700f7b9f15edfea78889a1"}}