{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:G2UQOKJGEBMYEXQUUI2BMQM6BP","short_pith_number":"pith:G2UQOKJG","schema_version":"1.0","canonical_sha256":"36a90729262059825e14a23416419e0bfc663c60f5c216c8f04bd543af690702","source":{"kind":"arxiv","id":"1103.3296","version":2},"attestation_state":"computed","paper":{"title":"Decoding square-free Goppa codes over $\\F_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Paulo S. L. M. Barreto, Rafael Misoczki, Richard Lindner","submitted_at":"2011-03-16T21:02:53Z","abstract_excerpt":"We propose a new, efficient non-deterministic decoding algorithm for square-free Goppa codes over $\\F_p$ for any prime $p$. If the code in question has degree $t$ and the average distance to the closest codeword is at least $(4/p)t + 1$, the proposed decoder can uniquely correct up to $(2/p)t$ errors with high probability. The correction capability is higher if the distribution of error magnitudes is not uniform, approaching or reaching $t$ errors when any particular error value occurs much more often than others or exclusively. This makes the method interesting for (semantically secure) crypt"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.3296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-03-16T21:02:53Z","cross_cats_sorted":[],"title_canon_sha256":"2e4c538725b1747ace4d96c6860f57146c776afe20bcfc78b9d7f989112e2037","abstract_canon_sha256":"3f6a560aca1a859ff70686b70b955efcd9224aba5275c3718b753a2a693980d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:14.538775Z","signature_b64":"f5kJA9OZeBhQ2FPImGSATzVYLxMQrrGGFKCQ8rSEBt4yOarHq6TK6kLd2avS9FKf1FBaXUgRGWzUENRt4S1WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a90729262059825e14a23416419e0bfc663c60f5c216c8f04bd543af690702","last_reissued_at":"2026-05-18T03:38:14.538280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:14.538280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding square-free Goppa codes over $\\F_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Paulo S. L. M. Barreto, Rafael Misoczki, Richard Lindner","submitted_at":"2011-03-16T21:02:53Z","abstract_excerpt":"We propose a new, efficient non-deterministic decoding algorithm for square-free Goppa codes over $\\F_p$ for any prime $p$. If the code in question has degree $t$ and the average distance to the closest codeword is at least $(4/p)t + 1$, the proposed decoder can uniquely correct up to $(2/p)t$ errors with high probability. The correction capability is higher if the distribution of error magnitudes is not uniform, approaching or reaching $t$ errors when any particular error value occurs much more often than others or exclusively. This makes the method interesting for (semantically secure) crypt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3296","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.3296","created_at":"2026-05-18T03:38:14.538355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3296v2","created_at":"2026-05-18T03:38:14.538355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3296","created_at":"2026-05-18T03:38:14.538355+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2UQOKJGEBMY","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2UQOKJGEBMYEXQU","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2UQOKJG","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP","json":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP.json","graph_json":"https://pith.science/api/pith-number/G2UQOKJGEBMYEXQUUI2BMQM6BP/graph.json","events_json":"https://pith.science/api/pith-number/G2UQOKJGEBMYEXQUUI2BMQM6BP/events.json","paper":"https://pith.science/paper/G2UQOKJG"},"agent_actions":{"view_html":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP","download_json":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP.json","view_paper":"https://pith.science/paper/G2UQOKJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3296&json=true","fetch_graph":"https://pith.science/api/pith-number/G2UQOKJGEBMYEXQUUI2BMQM6BP/graph.json","fetch_events":"https://pith.science/api/pith-number/G2UQOKJGEBMYEXQUUI2BMQM6BP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP/action/storage_attestation","attest_author":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP/action/author_attestation","sign_citation":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP/action/citation_signature","submit_replication":"https://pith.science/pith/G2UQOKJGEBMYEXQUUI2BMQM6BP/action/replication_record"}},"created_at":"2026-05-18T03:38:14.538355+00:00","updated_at":"2026-05-18T03:38:14.538355+00:00"}