{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:K4PMHDKJVXZ5FHGB676UHPV4FY","short_pith_number":"pith:K4PMHDKJ","canonical_record":{"source":{"id":"2311.02263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T23:02:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2ab63a442e9fe8d3d13221b41b5034c9f6c90b0f13e3d672fda4d2860f14e576","abstract_canon_sha256":"2dfa805db8e97e7fe7222f62c0c6b275999474a9070ba8f1493c3157518f62d6"},"schema_version":"1.0"},"canonical_sha256":"571ec38d49adf3d29cc1f7fd43bebc2e2b49c7ebb3b1454f0efde9255f648aa3","source":{"kind":"arxiv","id":"2311.02263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.02263","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"2311.02263v1","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02263","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"K4PMHDKJVXZ5","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"pith_short_16","alias_value":"K4PMHDKJVXZ5FHGB","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"pith_short_8","alias_value":"K4PMHDKJ","created_at":"2026-07-05T07:09:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:K4PMHDKJVXZ5FHGB676UHPV4FY","target":"record","payload":{"canonical_record":{"source":{"id":"2311.02263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T23:02:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2ab63a442e9fe8d3d13221b41b5034c9f6c90b0f13e3d672fda4d2860f14e576","abstract_canon_sha256":"2dfa805db8e97e7fe7222f62c0c6b275999474a9070ba8f1493c3157518f62d6"},"schema_version":"1.0"},"canonical_sha256":"571ec38d49adf3d29cc1f7fd43bebc2e2b49c7ebb3b1454f0efde9255f648aa3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:08.509557Z","signature_b64":"Njw/06LSaU82VcEVCM888Wi/5Tj0SXiV+aYMdfZrWmO/YKsoUxHbxtmSZ+qaKdGkNUZHsv0BDdC1qGYTsIydCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"571ec38d49adf3d29cc1f7fd43bebc2e2b49c7ebb3b1454f0efde9255f648aa3","last_reissued_at":"2026-07-05T07:09:08.509111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:08.509111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.02263","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-05T07:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiJXBcz25alFT1rN++ViVRGJ/cMuhWTm+X7XF9qoZdAZBRM/4KfEerX4M6MisupkohIzJ5ZYzynyUpiKCBfHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:26:41.908807Z"},"content_sha256":"d823e64d07bef1b9ba025e3c95cf21d3674be79d489bfa7bea6344d5d96b7132","schema_version":"1.0","event_id":"sha256:d823e64d07bef1b9ba025e3c95cf21d3674be79d489bfa7bea6344d5d96b7132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:K4PMHDKJVXZ5FHGB676UHPV4FY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Decoding of Tanner and Expander Amplified Codes from Distance Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Fernando Granha Jeronimo, Madhur Tulsiani, Shashank Srivastava","submitted_at":"2023-11-03T23:02:32Z","abstract_excerpt":"We develop new list decoding algorithms for Tanner codes and distance-amplified codes based on bipartite spectral expanders. We show that proofs exhibiting lower bounds on the minimum distance of these codes can be used as certificates discoverable by relaxations in the Sum-of-Squares (SoS) semidefinite programming hierarchy. Combining these certificates with certain entropic proxies to ensure that the solutions to the relaxations cover the entire list, then leads to algorithms for list decoding several families of codes up to the Johnson bound.\n  We prove the following:\n  - We show that the L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02263","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/2311.02263/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:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4SJqugpbbuwVVJxIZd1Zi+MpSSI0kRjCLCCEamA5rfDCgI3xW8Y9kO1u9bcnaMYN1utUK+24UeKk4Cs6d6sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:26:41.909312Z"},"content_sha256":"440c175e544d762ac1228bcb90b6684e2218550a285a581fcb320addc200d347","schema_version":"1.0","event_id":"sha256:440c175e544d762ac1228bcb90b6684e2218550a285a581fcb320addc200d347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4PMHDKJVXZ5FHGB676UHPV4FY/bundle.json","state_url":"https://pith.science/pith/K4PMHDKJVXZ5FHGB676UHPV4FY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4PMHDKJVXZ5FHGB676UHPV4FY/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-20T11:26:41Z","links":{"resolver":"https://pith.science/pith/K4PMHDKJVXZ5FHGB676UHPV4FY","bundle":"https://pith.science/pith/K4PMHDKJVXZ5FHGB676UHPV4FY/bundle.json","state":"https://pith.science/pith/K4PMHDKJVXZ5FHGB676UHPV4FY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4PMHDKJVXZ5FHGB676UHPV4FY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:K4PMHDKJVXZ5FHGB676UHPV4FY","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":"2dfa805db8e97e7fe7222f62c0c6b275999474a9070ba8f1493c3157518f62d6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T23:02:32Z","title_canon_sha256":"2ab63a442e9fe8d3d13221b41b5034c9f6c90b0f13e3d672fda4d2860f14e576"},"schema_version":"1.0","source":{"id":"2311.02263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.02263","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"2311.02263v1","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02263","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"K4PMHDKJVXZ5","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"pith_short_16","alias_value":"K4PMHDKJVXZ5FHGB","created_at":"2026-07-05T07:09:08Z"},{"alias_kind":"pith_short_8","alias_value":"K4PMHDKJ","created_at":"2026-07-05T07:09:08Z"}],"graph_snapshots":[{"event_id":"sha256:440c175e544d762ac1228bcb90b6684e2218550a285a581fcb320addc200d347","target":"graph","created_at":"2026-07-05T07:09:08Z","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/2311.02263/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop new list decoding algorithms for Tanner codes and distance-amplified codes based on bipartite spectral expanders. We show that proofs exhibiting lower bounds on the minimum distance of these codes can be used as certificates discoverable by relaxations in the Sum-of-Squares (SoS) semidefinite programming hierarchy. Combining these certificates with certain entropic proxies to ensure that the solutions to the relaxations cover the entire list, then leads to algorithms for list decoding several families of codes up to the Johnson bound.\n  We prove the following:\n  - We show that the L","authors_text":"Fernando Granha Jeronimo, Madhur Tulsiani, Shashank Srivastava","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T23:02:32Z","title":"List Decoding of Tanner and Expander Amplified Codes from Distance Certificates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02263","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:d823e64d07bef1b9ba025e3c95cf21d3674be79d489bfa7bea6344d5d96b7132","target":"record","created_at":"2026-07-05T07:09:08Z","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":"2dfa805db8e97e7fe7222f62c0c6b275999474a9070ba8f1493c3157518f62d6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-03T23:02:32Z","title_canon_sha256":"2ab63a442e9fe8d3d13221b41b5034c9f6c90b0f13e3d672fda4d2860f14e576"},"schema_version":"1.0","source":{"id":"2311.02263","kind":"arxiv","version":1}},"canonical_sha256":"571ec38d49adf3d29cc1f7fd43bebc2e2b49c7ebb3b1454f0efde9255f648aa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"571ec38d49adf3d29cc1f7fd43bebc2e2b49c7ebb3b1454f0efde9255f648aa3","first_computed_at":"2026-07-05T07:09:08.509111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:09:08.509111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Njw/06LSaU82VcEVCM888Wi/5Tj0SXiV+aYMdfZrWmO/YKsoUxHbxtmSZ+qaKdGkNUZHsv0BDdC1qGYTsIydCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:09:08.509557Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.02263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d823e64d07bef1b9ba025e3c95cf21d3674be79d489bfa7bea6344d5d96b7132","sha256:440c175e544d762ac1228bcb90b6684e2218550a285a581fcb320addc200d347"],"state_sha256":"3fc57f552f72b26e46a05ad86582047f61876687058851ff8a4acae92f3157b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE1DYkdWqdlK/jdSuEzFrLqJh8fzEZy3TFIxQxAOH8MQFxCIK8g74K5t1Hm1cwy6p46/kakh7bQdakSSD9tjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T11:26:41.912836Z","bundle_sha256":"1ee7d81d6398cadef86b2d02d92179fc39b2bc2db7fd218e57f1e28876c5de08"}}