{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LDDP5N6N53P55TG4L2Q7OUGTIA","short_pith_number":"pith:LDDP5N6N","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"},"canonical_sha256":"58c6feb7cdeedfdeccdc5ea1f750d34004b4c68f225752f8d334f9b5ba208b79","source":{"kind":"arxiv","id":"1502.02927","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02927","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02927v3","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02927","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"LDDP5N6N53P5","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDDP5N6N53P55TG4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDDP5N6N","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LDDP5N6N53P55TG4L2Q7OUGTIA","target":"record","payload":{"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"},"canonical_sha256":"58c6feb7cdeedfdeccdc5ea1f750d34004b4c68f225752f8d334f9b5ba208b79","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"},"source_kind":"arxiv","source_id":"1502.02927","source_version":3,"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-18T01:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQwSvsCY8oku3SNrgnmtOHYHoA3raBAfM6QzJzoXhQEuTEfTmw/IxkXbq0lPFM8ra8unmyXw8aJuRQgDJld5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:17:22.480562Z"},"content_sha256":"e6ec66fcd87386290148f5652854d189eff61f35ac3162f22be4223ce3b7850a","schema_version":"1.0","event_id":"sha256:e6ec66fcd87386290148f5652854d189eff61f35ac3162f22be4223ce3b7850a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LDDP5N6N53P55TG4L2Q7OUGTIA","target":"graph","payload":{"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"},"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-18T01:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaBldKOy+1nuNraeT09RFxuCgogzRqpgwY35Wc953/uq4tgb3ewFze9QsgWW320v8QuU5loII8yszDxFiKppAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:17:22.480921Z"},"content_sha256":"4f12d548d7c7a9d0ee47f5e4b8619a3822c43497382ee9d925e787bd75a518bd","schema_version":"1.0","event_id":"sha256:4f12d548d7c7a9d0ee47f5e4b8619a3822c43497382ee9d925e787bd75a518bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/bundle.json","state_url":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/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-01T22:17:22Z","links":{"resolver":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA","bundle":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/bundle.json","state":"https://pith.science/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDDP5N6N53P55TG4L2Q7OUGTIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LDDP5N6N53P55TG4L2Q7OUGTIA","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":"b0c7216232ef9c7834c3cfc3a6fcf72d5e44ef3a82c6d4399d2d31fc035fb38d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T14:54:15Z","title_canon_sha256":"bea2bcc03110831cf24449a237a37a3dba8290c4ec4a707ed61975b7114e4570"},"schema_version":"1.0","source":{"id":"1502.02927","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02927","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02927v3","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02927","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"LDDP5N6N53P5","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDDP5N6N53P55TG4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDDP5N6N","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:4f12d548d7c7a9d0ee47f5e4b8619a3822c43497382ee9d925e787bd75a518bd","target":"graph","created_at":"2026-05-18T01:23:48Z","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":"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.","authors_text":"Claudia Tinnirello, Emmanuela Orsini, Fabrizio Caruso, Massimiliano Sala","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T14:54:15Z","title":"On the shape of the general error locator polynomial for cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02927","kind":"arxiv","version":3},"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:e6ec66fcd87386290148f5652854d189eff61f35ac3162f22be4223ce3b7850a","target":"record","created_at":"2026-05-18T01:23:48Z","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":"b0c7216232ef9c7834c3cfc3a6fcf72d5e44ef3a82c6d4399d2d31fc035fb38d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T14:54:15Z","title_canon_sha256":"bea2bcc03110831cf24449a237a37a3dba8290c4ec4a707ed61975b7114e4570"},"schema_version":"1.0","source":{"id":"1502.02927","kind":"arxiv","version":3}},"canonical_sha256":"58c6feb7cdeedfdeccdc5ea1f750d34004b4c68f225752f8d334f9b5ba208b79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c6feb7cdeedfdeccdc5ea1f750d34004b4c68f225752f8d334f9b5ba208b79","first_computed_at":"2026-05-18T01:23:48.341003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:48.341003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0igaocc/Uf3hxlSoJvqbDskTcNzLtgan6INj6tyLRmB2WBAmaADYVUv01rSzpwIgg6mjlsDuhJdAqz/Tb6S9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:48.341721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02927","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6ec66fcd87386290148f5652854d189eff61f35ac3162f22be4223ce3b7850a","sha256:4f12d548d7c7a9d0ee47f5e4b8619a3822c43497382ee9d925e787bd75a518bd"],"state_sha256":"fa5e2c0bb08ae789b579760d2c33ea85c04f04dec495f5feef2125b17f079fd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdD7i/CGcgAUzaS1zDIbcrRW7uKZcJbAv9qqyf4SK2zxrOhf6JKmbY4C+VUSUEoN+eoHnncNIhlZP8Ujo27mDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:17:22.482785Z","bundle_sha256":"b6d9de0442baffd4c414f8ff8222a225618155930c8f94a90707cde97d93c1d3"}}