{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F4T27KHFIUFMOQJBQJSLQXJMIP","short_pith_number":"pith:F4T27KHF","canonical_record":{"source":{"id":"1206.4370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-20T02:25:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"826f146c2c6ccce243f08986177ddc24f882c300ca0aa4d3b962235f0308c799","abstract_canon_sha256":"1fe958c043ce858533912dda73172acef262d8dff25ddf72789dc967d7a8e26d"},"schema_version":"1.0"},"canonical_sha256":"2f27afa8e5450ac741218264b85d2c43cb2e7c299a334ca85a754cbc4b6c198d","source":{"kind":"arxiv","id":"1206.4370","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4370","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4370v2","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4370","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"F4T27KHFIUFM","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F4T27KHFIUFMOQJB","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F4T27KHF","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F4T27KHFIUFMOQJBQJSLQXJMIP","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-20T02:25:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"826f146c2c6ccce243f08986177ddc24f882c300ca0aa4d3b962235f0308c799","abstract_canon_sha256":"1fe958c043ce858533912dda73172acef262d8dff25ddf72789dc967d7a8e26d"},"schema_version":"1.0"},"canonical_sha256":"2f27afa8e5450ac741218264b85d2c43cb2e7c299a334ca85a754cbc4b6c198d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:04.790793Z","signature_b64":"WwD3qWd+yY5ceHC/msH3pycnQRdhjYivgzsCS4WqqylLHx5v4+6Ri+pIM91GYZvoVMkw91SmHQxPspo9W/qeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f27afa8e5450ac741218264b85d2c43cb2e7c299a334ca85a754cbc4b6c198d","last_reissued_at":"2026-05-18T00:58:04.790429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:04.790429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4370","source_version":2,"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:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAGfHTMT7uqrd0xrNgxFWMhyci7FNEiXyDKGThNsDX5Y2Dttw3OMGI8C1koqLlF6hv+P2Z/ZgFARVMDFpY30Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:46:48.225918Z"},"content_sha256":"f19cd17b1c64bdf8b225257ba6dc74ea813f64e215be46166c57882c422f10c8","schema_version":"1.0","event_id":"sha256:f19cd17b1c64bdf8b225257ba6dc74ea813f64e215be46166c57882c422f10c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F4T27KHFIUFMOQJBQJSLQXJMIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cyclic Codes from Dickson Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding","submitted_at":"2012-06-20T02:25:11Z","abstract_excerpt":"Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first and second kind over finite fields are employed to construct a number of classes of cyclic codes. Lower bounds on the minimum weight of some classes of the cyclic codes are developed. The minimum weights of some other classes of the codes constructed in this paper are determined. The dimensions of the codes obtained in this paper are flexible. Most of the code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4370","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"},"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:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFGUPpwqZYbhdEJeMh0hCnd46NFgSBws1a5ZsJjIGC16N8kPksCFWdR8oK9/Aq5EV2gB8vjbzpv7/d4NkyFQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:46:48.226266Z"},"content_sha256":"20d83ee45a5025f45719e547fd6392ed9e793567287ac7a0be217341f26c46d9","schema_version":"1.0","event_id":"sha256:20d83ee45a5025f45719e547fd6392ed9e793567287ac7a0be217341f26c46d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4T27KHFIUFMOQJBQJSLQXJMIP/bundle.json","state_url":"https://pith.science/pith/F4T27KHFIUFMOQJBQJSLQXJMIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4T27KHFIUFMOQJBQJSLQXJMIP/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-08T23:46:48Z","links":{"resolver":"https://pith.science/pith/F4T27KHFIUFMOQJBQJSLQXJMIP","bundle":"https://pith.science/pith/F4T27KHFIUFMOQJBQJSLQXJMIP/bundle.json","state":"https://pith.science/pith/F4T27KHFIUFMOQJBQJSLQXJMIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4T27KHFIUFMOQJBQJSLQXJMIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F4T27KHFIUFMOQJBQJSLQXJMIP","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":"1fe958c043ce858533912dda73172acef262d8dff25ddf72789dc967d7a8e26d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-20T02:25:11Z","title_canon_sha256":"826f146c2c6ccce243f08986177ddc24f882c300ca0aa4d3b962235f0308c799"},"schema_version":"1.0","source":{"id":"1206.4370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4370","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4370v2","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4370","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"F4T27KHFIUFM","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F4T27KHFIUFMOQJB","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F4T27KHF","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:20d83ee45a5025f45719e547fd6392ed9e793567287ac7a0be217341f26c46d9","target":"graph","created_at":"2026-05-18T00:58:04Z","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":"Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first and second kind over finite fields are employed to construct a number of classes of cyclic codes. Lower bounds on the minimum weight of some classes of the cyclic codes are developed. The minimum weights of some other classes of the codes constructed in this paper are determined. The dimensions of the codes obtained in this paper are flexible. Most of the code","authors_text":"Cunsheng Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-20T02:25:11Z","title":"Cyclic Codes from Dickson Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4370","kind":"arxiv","version":2},"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:f19cd17b1c64bdf8b225257ba6dc74ea813f64e215be46166c57882c422f10c8","target":"record","created_at":"2026-05-18T00:58:04Z","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":"1fe958c043ce858533912dda73172acef262d8dff25ddf72789dc967d7a8e26d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-20T02:25:11Z","title_canon_sha256":"826f146c2c6ccce243f08986177ddc24f882c300ca0aa4d3b962235f0308c799"},"schema_version":"1.0","source":{"id":"1206.4370","kind":"arxiv","version":2}},"canonical_sha256":"2f27afa8e5450ac741218264b85d2c43cb2e7c299a334ca85a754cbc4b6c198d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f27afa8e5450ac741218264b85d2c43cb2e7c299a334ca85a754cbc4b6c198d","first_computed_at":"2026-05-18T00:58:04.790429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:04.790429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WwD3qWd+yY5ceHC/msH3pycnQRdhjYivgzsCS4WqqylLHx5v4+6Ri+pIM91GYZvoVMkw91SmHQxPspo9W/qeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:04.790793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f19cd17b1c64bdf8b225257ba6dc74ea813f64e215be46166c57882c422f10c8","sha256:20d83ee45a5025f45719e547fd6392ed9e793567287ac7a0be217341f26c46d9"],"state_sha256":"1f914cc3036f14bc23e7a41075be023658207957bce77d83413a1846a38a6566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUo047OpqRLMFmynN7pgRZ+G242OjZrjMT3UKskfiBinHw6przkwNpYqHms0rPTlyAzavHr4PVPdA+TsKgBcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:46:48.228180Z","bundle_sha256":"3fc64f937621767c4b23c6cfabd83a28346c9b48f1dae1b5bbeec7f431abb9f5"}}