{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7TW6U7HPSYPOE2YRY5XGBSZI4R","short_pith_number":"pith:7TW6U7HP","canonical_record":{"source":{"id":"1012.3439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-15T19:44:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b88408b2c175790f22772d38ab33154b0d25ee13c12018eb427ad7479390399f","abstract_canon_sha256":"00156d9196af03adcad1c129919a1547fafa29751f7a9accc819d70a42b2011e"},"schema_version":"1.0"},"canonical_sha256":"fcedea7cef961ee26b11c76e60cb28e47f7f63db9e7834e89159446f77f1022f","source":{"kind":"arxiv","id":"1012.3439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3439","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3439v1","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3439","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"7TW6U7HPSYPO","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7TW6U7HPSYPOE2YR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7TW6U7HP","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7TW6U7HPSYPOE2YRY5XGBSZI4R","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-15T19:44:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b88408b2c175790f22772d38ab33154b0d25ee13c12018eb427ad7479390399f","abstract_canon_sha256":"00156d9196af03adcad1c129919a1547fafa29751f7a9accc819d70a42b2011e"},"schema_version":"1.0"},"canonical_sha256":"fcedea7cef961ee26b11c76e60cb28e47f7f63db9e7834e89159446f77f1022f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:06.717127Z","signature_b64":"qud4ulkw91ctaE50NZS3392PsYcAb/IP9y8Gd/7BgqlN3s/X5KYEkOjOQoOmJ20ubGI7+CIgn3UCgoDWXM+qAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcedea7cef961ee26b11c76e60cb28e47f7f63db9e7834e89159446f77f1022f","last_reissued_at":"2026-05-18T04:33:06.716415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:06.716415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3439","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-18T04:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFePFIJydWEywM4xnERFKMd6/bUgVbh3QtNn0AJFrnGF1Pgzh9ItOp7KHlSp1VncvxojIRownt+sZTeCH1PfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:20:35.077599Z"},"content_sha256":"a25b43f4442f843ea9e3096b17407b96dc8aa2cb82b6a7daead0b83fdc1dd1c5","schema_version":"1.0","event_id":"sha256:a25b43f4442f843ea9e3096b17407b96dc8aa2cb82b6a7daead0b83fdc1dd1c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7TW6U7HPSYPOE2YRY5XGBSZI4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List-decoding of binary Goppa codes up to the binary Johnson bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alain Couvreur (IMB), Daniel Augot (INRIA Saclay - Ile de France), Morgan Barbier (INRIA Saclay - Ile de France)","submitted_at":"2010-12-15T19:44:13Z","abstract_excerpt":"We study the list-decoding problem of alternant codes, with the notable case of classical Goppa codes. The major consideration here is to take into account the size of the alphabet, which shows great influence on the list-decoding radius. This amounts to compare the \\emph{generic} Johnson bound to the \\emph{$q$-ary} Johnson bound. This difference is important when $q$ is very small. Essentially, the most favourable case is $q=2$, for which the decoding radius is greatly improved, notably when the relative minimum distance gets close to 1/2. Even though the announced result, which is the list-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3439","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-18T04:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSAuu0Qq/ir7QKl/OtiKxd8tEJDQ83NKiH2dX2PLl8Zc9B4TtxHCbAWa+NS/5OCetjjx3tlbYaFZ3H5dqKykCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:20:35.077936Z"},"content_sha256":"37f1b0dfe8f39b95a6cb920ece023ac49002589d0f37ad588ae6a6ee4967e59a","schema_version":"1.0","event_id":"sha256:37f1b0dfe8f39b95a6cb920ece023ac49002589d0f37ad588ae6a6ee4967e59a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R/bundle.json","state_url":"https://pith.science/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R/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-27T18:20:35Z","links":{"resolver":"https://pith.science/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R","bundle":"https://pith.science/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R/bundle.json","state":"https://pith.science/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TW6U7HPSYPOE2YRY5XGBSZI4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7TW6U7HPSYPOE2YRY5XGBSZI4R","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":"00156d9196af03adcad1c129919a1547fafa29751f7a9accc819d70a42b2011e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-15T19:44:13Z","title_canon_sha256":"b88408b2c175790f22772d38ab33154b0d25ee13c12018eb427ad7479390399f"},"schema_version":"1.0","source":{"id":"1012.3439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3439","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3439v1","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3439","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"7TW6U7HPSYPO","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7TW6U7HPSYPOE2YR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7TW6U7HP","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:37f1b0dfe8f39b95a6cb920ece023ac49002589d0f37ad588ae6a6ee4967e59a","target":"graph","created_at":"2026-05-18T04:33:06Z","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":"We study the list-decoding problem of alternant codes, with the notable case of classical Goppa codes. The major consideration here is to take into account the size of the alphabet, which shows great influence on the list-decoding radius. This amounts to compare the \\emph{generic} Johnson bound to the \\emph{$q$-ary} Johnson bound. This difference is important when $q$ is very small. Essentially, the most favourable case is $q=2$, for which the decoding radius is greatly improved, notably when the relative minimum distance gets close to 1/2. Even though the announced result, which is the list-d","authors_text":"Alain Couvreur (IMB), Daniel Augot (INRIA Saclay - Ile de France), Morgan Barbier (INRIA Saclay - Ile de France)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-15T19:44:13Z","title":"List-decoding of binary Goppa codes up to the binary Johnson bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3439","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:a25b43f4442f843ea9e3096b17407b96dc8aa2cb82b6a7daead0b83fdc1dd1c5","target":"record","created_at":"2026-05-18T04:33:06Z","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":"00156d9196af03adcad1c129919a1547fafa29751f7a9accc819d70a42b2011e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-15T19:44:13Z","title_canon_sha256":"b88408b2c175790f22772d38ab33154b0d25ee13c12018eb427ad7479390399f"},"schema_version":"1.0","source":{"id":"1012.3439","kind":"arxiv","version":1}},"canonical_sha256":"fcedea7cef961ee26b11c76e60cb28e47f7f63db9e7834e89159446f77f1022f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcedea7cef961ee26b11c76e60cb28e47f7f63db9e7834e89159446f77f1022f","first_computed_at":"2026-05-18T04:33:06.716415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:06.716415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qud4ulkw91ctaE50NZS3392PsYcAb/IP9y8Gd/7BgqlN3s/X5KYEkOjOQoOmJ20ubGI7+CIgn3UCgoDWXM+qAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:06.717127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a25b43f4442f843ea9e3096b17407b96dc8aa2cb82b6a7daead0b83fdc1dd1c5","sha256:37f1b0dfe8f39b95a6cb920ece023ac49002589d0f37ad588ae6a6ee4967e59a"],"state_sha256":"bf03b01b8f63cd12f798bd67e2d0fd312b32d66c1858a08cdbe018dc15185f4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jj3Z4xhcCxzPZ9RKldV9Gg8NZkIT67mMssEV/XxZxVVC7sgQpR0ZAIUpwudtbX52jCcCNuDr2D4O69T3YkJVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:20:35.079926Z","bundle_sha256":"227cf2e461e686fd8325ec8c203444dff6be6b3a11595b56ddc39eec07850739"}}