{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WZTJXGQRVB5ALO6FJT7TB5WGWW","short_pith_number":"pith:WZTJXGQR","canonical_record":{"source":{"id":"1106.0436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-02T14:18:27Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"87f282707eb2fb5f9a68c33fc1cebe0791d94f3916531b5722d0f23ef8a63cd4","abstract_canon_sha256":"dcaaf897cf29c9cbaaed983112c741cb934c0ae7b3f892f7e7f6ec4ef3b15756"},"schema_version":"1.0"},"canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","source":{"kind":"arxiv","id":"1106.0436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0436","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0436v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0436","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"WZTJXGQRVB5A","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WZTJXGQRVB5ALO6F","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WZTJXGQR","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WZTJXGQRVB5ALO6FJT7TB5WGWW","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-02T14:18:27Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"87f282707eb2fb5f9a68c33fc1cebe0791d94f3916531b5722d0f23ef8a63cd4","abstract_canon_sha256":"dcaaf897cf29c9cbaaed983112c741cb934c0ae7b3f892f7e7f6ec4ef3b15756"},"schema_version":"1.0"},"canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.447715Z","signature_b64":"tjiSsMTmsX9gQVaRYCIOJ5Oy5NOnHXYQJb+AZiWh50WY3lV4+KGk5TWLC186w8RBIF4A6I29he870tZsJAEEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","last_reissued_at":"2026-05-18T00:58:43.447206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.447206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0436","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-05-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHVp5JW9HwbkEdureGB1Vd5cSQqvAT2UGMPPMqGu3mrR8b3ywFFIOoBvWKNO2rsKkoC2DpUBQV7kY/tUTqHUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:12:45.731693Z"},"content_sha256":"6d2fef5ccf1cb22c4d0041ef4178c66865241edd53e0fb37a1bccc003a3a2fa1","schema_version":"1.0","event_id":"sha256:6d2fef5ccf1cb22c4d0041ef4178c66865241edd53e0fb37a1bccc003a3a2fa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WZTJXGQRVB5ALO6FJT7TB5WGWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-algebraic list decoding of folded Reed-Solomon codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Venkatesan Guruswami","submitted_at":"2011-06-02T14:18:27Z","abstract_excerpt":"Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $1-R-\\eps$ of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices if one settles for a smaller decoding radius (but still enough for a statement of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0436","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":""},"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-05-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"72gce+OM2HiQYWByFX9JB5JR/RIMSaZ4u5AuFsJ6bWTKIdOAAePSe0zM9VxVhfPedsQnxFkxDzmEIohWcMJ3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:12:45.732408Z"},"content_sha256":"d48af323c447a3bd5a632f7ea3dd3c96eca563cd5aa2390b83b4fe9e0a252afc","schema_version":"1.0","event_id":"sha256:d48af323c447a3bd5a632f7ea3dd3c96eca563cd5aa2390b83b4fe9e0a252afc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/bundle.json","state_url":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/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-06-09T09:12:45Z","links":{"resolver":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW","bundle":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/bundle.json","state":"https://pith.science/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZTJXGQRVB5ALO6FJT7TB5WGWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WZTJXGQRVB5ALO6FJT7TB5WGWW","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":"dcaaf897cf29c9cbaaed983112c741cb934c0ae7b3f892f7e7f6ec4ef3b15756","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-02T14:18:27Z","title_canon_sha256":"87f282707eb2fb5f9a68c33fc1cebe0791d94f3916531b5722d0f23ef8a63cd4"},"schema_version":"1.0","source":{"id":"1106.0436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0436","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0436v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0436","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"WZTJXGQRVB5A","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WZTJXGQRVB5ALO6F","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WZTJXGQR","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:d48af323c447a3bd5a632f7ea3dd3c96eca563cd5aa2390b83b4fe9e0a252afc","target":"graph","created_at":"2026-05-18T00:58:43Z","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"},"paper":{"abstract_excerpt":"Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $1-R-\\eps$ of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices if one settles for a smaller decoding radius (but still enough for a statement of th","authors_text":"Venkatesan Guruswami","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-02T14:18:27Z","title":"Linear-algebraic list decoding of folded Reed-Solomon codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0436","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:6d2fef5ccf1cb22c4d0041ef4178c66865241edd53e0fb37a1bccc003a3a2fa1","target":"record","created_at":"2026-05-18T00:58:43Z","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":"dcaaf897cf29c9cbaaed983112c741cb934c0ae7b3f892f7e7f6ec4ef3b15756","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-02T14:18:27Z","title_canon_sha256":"87f282707eb2fb5f9a68c33fc1cebe0791d94f3916531b5722d0f23ef8a63cd4"},"schema_version":"1.0","source":{"id":"1106.0436","kind":"arxiv","version":1}},"canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6669b9a11a87a05bbc54cff30f6c6b595551469725d0ca9bcf405769af716de","first_computed_at":"2026-05-18T00:58:43.447206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.447206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tjiSsMTmsX9gQVaRYCIOJ5Oy5NOnHXYQJb+AZiWh50WY3lV4+KGk5TWLC186w8RBIF4A6I29he870tZsJAEEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.447715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d2fef5ccf1cb22c4d0041ef4178c66865241edd53e0fb37a1bccc003a3a2fa1","sha256:d48af323c447a3bd5a632f7ea3dd3c96eca563cd5aa2390b83b4fe9e0a252afc"],"state_sha256":"6228a8f6982e63f1922f09ee9ad8880652f8230d7394e344f22ba55e9d1c6d06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVm1LRDAlSIyc7H+Lk/GH4yyj/E2BQQJ8zgFqFoSKjOwNpNvgu3qsQhnLK12JaWkoD4HAb5W5nY6XcxiSWwwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:12:45.736494Z","bundle_sha256":"72cebfd30271813e1c249508f31014bbe38738d09bb8985eb56adf9668d39080"}}