{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LDDP5N6N53P55TG4L2Q7OUGTIA","short_pith_number":"pith:LDDP5N6N","schema_version":"1.0","canonical_sha256":"58c6feb7cdeedfdeccdc5ea1f750d34004b4c68f225752f8d334f9b5ba208b79","source":{"kind":"arxiv","id":"1502.02927","version":3},"attestation_state":"computed","paper":{"title":"On the shape of the general error locator polynomial for cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claudia Tinnirello, Emmanuela Orsini, Fabrizio Caruso, Massimiliano Sala","submitted_at":"2015-02-10T14:54:15Z","abstract_excerpt":"A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several results for infinite classes of cyclic codes with $t=2$ and $t=3$. From these, a theoretically justification of the sparsity of the general error locator polynomial is obtained for all cyclic codes with $t\\leq 3$ and $n<63$, except for three cases where the sparsity is proved by a computer check. Moreover, we discuss some consequences of our results to the understanding of the complexity of bounded-distance decoding of cyclic codes."},"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":"1502.02927","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T14:54:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bea2bcc03110831cf24449a237a37a3dba8290c4ec4a707ed61975b7114e4570","abstract_canon_sha256":"b0c7216232ef9c7834c3cfc3a6fcf72d5e44ef3a82c6d4399d2d31fc035fb38d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:48.341721Z","signature_b64":"0igaocc/Uf3hxlSoJvqbDskTcNzLtgan6INj6tyLRmB2WBAmaADYVUv01rSzpwIgg6mjlsDuhJdAqz/Tb6S9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c6feb7cdeedfdeccdc5ea1f750d34004b4c68f225752f8d334f9b5ba208b79","last_reissued_at":"2026-05-18T01:23:48.341003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:48.341003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the shape of the general error locator polynomial for cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claudia Tinnirello, Emmanuela Orsini, Fabrizio Caruso, Massimiliano Sala","submitted_at":"2015-02-10T14:54:15Z","abstract_excerpt":"A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several results for infinite classes of cyclic codes with $t=2$ and $t=3$. From these, a theoretically justification of the sparsity of the general error locator polynomial is obtained for all cyclic codes with $t\\leq 3$ and $n<63$, except for three cases where the sparsity is proved by a computer check. Moreover, we discuss some consequences of our results to the understanding of the complexity of bounded-distance decoding of cyclic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02927","kind":"arxiv","version":3},"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":"1502.02927","created_at":"2026-05-18T01:23:48.341109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02927v3","created_at":"2026-05-18T01:23:48.341109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02927","created_at":"2026-05-18T01:23:48.341109+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDDP5N6N53P5","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDDP5N6N53P55TG4","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDDP5N6N","created_at":"2026-05-18T12:29:29.992203+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/LDDP5N6N53P55TG4L2Q7OUGTIA","json":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA.json","graph_json":"https://pith.science/api/pith-number/LDDP5N6N53P55TG4L2Q7OUGTIA/graph.json","events_json":"https://pith.science/api/pith-number/LDDP5N6N53P55TG4L2Q7OUGTIA/events.json","paper":"https://pith.science/paper/LDDP5N6N"},"agent_actions":{"view_html":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA","download_json":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA.json","view_paper":"https://pith.science/paper/LDDP5N6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02927&json=true","fetch_graph":"https://pith.science/api/pith-number/LDDP5N6N53P55TG4L2Q7OUGTIA/graph.json","fetch_events":"https://pith.science/api/pith-number/LDDP5N6N53P55TG4L2Q7OUGTIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/action/storage_attestation","attest_author":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/action/author_attestation","sign_citation":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/action/citation_signature","submit_replication":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/action/replication_record"}},"created_at":"2026-05-18T01:23:48.341109+00:00","updated_at":"2026-05-18T01:23:48.341109+00:00"}