{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OS34CXILJ7AXE2E5EXWMJIXRRH","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":"ad40a3a2e7d61b9242a9f70b6cad7843d694803ad8cc9e2e883ac0ffb867dd9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T01:36:05Z","title_canon_sha256":"42f4f96b2f6f4230bfc773df0136ca2a54c45168d5b4bdefab5b122a187f37f5"},"schema_version":"1.0","source":{"id":"1406.4212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4212","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4212v1","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4212","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"OS34CXILJ7AX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OS34CXILJ7AXE2E5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OS34CXIL","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:ab88fada59d33eecb10206d696b24159163988d0ed0de64285bbfc754fd3ac6c","target":"graph","created_at":"2026-05-18T02:49:38Z","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":"In this article, we count the quantity of minimal cyclic codes of length $n$ and dimension $k$ over a finite field $\\mathbb F_q$, in the case when the prime factors of $n$ satisfy a special condition. This problem is equivalent to count the quantity of irreducible factors of $x^n-1\\in \\mathbb F_q[x]$ of degree $k$.","authors_text":"F.E. Brochero Mart\\'inez","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T01:36:05Z","title":"Number of minimal cyclic codes with given length and dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4212","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:0f2caa2a59c0d7bda6dc5474d232eccde8c0cc29ce764a5d043087043a17856a","target":"record","created_at":"2026-05-18T02:49:38Z","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":"ad40a3a2e7d61b9242a9f70b6cad7843d694803ad8cc9e2e883ac0ffb867dd9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-17T01:36:05Z","title_canon_sha256":"42f4f96b2f6f4230bfc773df0136ca2a54c45168d5b4bdefab5b122a187f37f5"},"schema_version":"1.0","source":{"id":"1406.4212","kind":"arxiv","version":1}},"canonical_sha256":"74b7c15d0b4fc172689d25ecc4a2f189f44eeb96d745efaa0167251d6b2e51c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74b7c15d0b4fc172689d25ecc4a2f189f44eeb96d745efaa0167251d6b2e51c8","first_computed_at":"2026-05-18T02:49:38.149762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:38.149762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYQIPXs96e9po0suRWoOgr3wz+bCpPZ3Nd6p0uLVHpku8DinRL8iax1mWIxjlNeUMEf+4+KDtPx74Boi1OB3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:38.150279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f2caa2a59c0d7bda6dc5474d232eccde8c0cc29ce764a5d043087043a17856a","sha256:ab88fada59d33eecb10206d696b24159163988d0ed0de64285bbfc754fd3ac6c"],"state_sha256":"d438f8df8676ee50837a3ed0f8e388c80c05b36eb525fd36aebd9fe4cc106007"}