{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UDOEIINEMVHD4ME7LVI7HLCDQS","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":"3bdae7431c9a4dab6abf221d108f5b55f9db6f63bf74813bab423083c6d8e4f8","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-18T08:50:52Z","title_canon_sha256":"d92d5b150f7ccaf6f700e9a6298652694e4989fa71034368d7500a940acfdec4"},"schema_version":"1.0","source":{"id":"1906.07446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07446","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07446v1","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07446","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"UDOEIINEMVHD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UDOEIINEMVHD4ME7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UDOEIINE","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:8ea695204dcec9db663794ac90fd5bac2e34413fc3ae03302a7304114b0d0b64","target":"graph","created_at":"2026-05-17T23:43:07Z","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 finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are generalizations of dihedral codes, and can be constructed as quasi-cyclic codes with an extra automorphism. In this paper, we prove that metacyclic codes form an asymptotically good family of codes. Our proof relies on a version of Artin's conjecture for primitive roots in arithmetic progression being true under the Generalized Riemann Hypothesis (GRH).","authors_text":"Martino Borello, Patrick Sol\\'e, Pieter Moree","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-18T08:50:52Z","title":"Asymptotic performance of metacyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07446","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:ba7308511caa36bdee49509c4c25017de7a82abfc0d29fa9268ea33d9326b589","target":"record","created_at":"2026-05-17T23:43:07Z","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":"3bdae7431c9a4dab6abf221d108f5b55f9db6f63bf74813bab423083c6d8e4f8","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-18T08:50:52Z","title_canon_sha256":"d92d5b150f7ccaf6f700e9a6298652694e4989fa71034368d7500a940acfdec4"},"schema_version":"1.0","source":{"id":"1906.07446","kind":"arxiv","version":1}},"canonical_sha256":"a0dc4421a4654e3e309f5d51f3ac4384ac69610cc2050e3058d15ea940506bea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0dc4421a4654e3e309f5d51f3ac4384ac69610cc2050e3058d15ea940506bea","first_computed_at":"2026-05-17T23:43:07.873594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:07.873594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwQPy18hSejcuz+5WMx9eclo0f7pqK/0zpII02zlFsOqzLpAUZjgf/VZyl/ZlPUZ1FM/wuZ5KVh0wDGlC/v1Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:07.874214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.07446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba7308511caa36bdee49509c4c25017de7a82abfc0d29fa9268ea33d9326b589","sha256:8ea695204dcec9db663794ac90fd5bac2e34413fc3ae03302a7304114b0d0b64"],"state_sha256":"2072805d0a31db95953f6e5bdbd0ae101d9a2d684b67d0fcfb243779cdd0df9a"}