{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UDOEIINEMVHD4ME7LVI7HLCDQS","short_pith_number":"pith:UDOEIINE","schema_version":"1.0","canonical_sha256":"a0dc4421a4654e3e309f5d51f3ac4384ac69610cc2050e3058d15ea940506bea","source":{"kind":"arxiv","id":"1906.07446","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic performance of metacyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Martino Borello, Patrick Sol\\'e, Pieter Moree","submitted_at":"2019-06-18T08:50:52Z","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)."},"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":"1906.07446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-18T08:50:52Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"d92d5b150f7ccaf6f700e9a6298652694e4989fa71034368d7500a940acfdec4","abstract_canon_sha256":"3bdae7431c9a4dab6abf221d108f5b55f9db6f63bf74813bab423083c6d8e4f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:07.874214Z","signature_b64":"lwQPy18hSejcuz+5WMx9eclo0f7pqK/0zpII02zlFsOqzLpAUZjgf/VZyl/ZlPUZ1FM/wuZ5KVh0wDGlC/v1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0dc4421a4654e3e309f5d51f3ac4384ac69610cc2050e3058d15ea940506bea","last_reissued_at":"2026-05-17T23:43:07.873594Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:07.873594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic performance of metacyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Martino Borello, Patrick Sol\\'e, Pieter Moree","submitted_at":"2019-06-18T08:50:52Z","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)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07446","kind":"arxiv","version":1},"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":"1906.07446","created_at":"2026-05-17T23:43:07.873678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07446v1","created_at":"2026-05-17T23:43:07.873678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07446","created_at":"2026-05-17T23:43:07.873678+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDOEIINEMVHD","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDOEIINEMVHD4ME7","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDOEIINE","created_at":"2026-05-18T12:33:30.264802+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/UDOEIINEMVHD4ME7LVI7HLCDQS","json":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS.json","graph_json":"https://pith.science/api/pith-number/UDOEIINEMVHD4ME7LVI7HLCDQS/graph.json","events_json":"https://pith.science/api/pith-number/UDOEIINEMVHD4ME7LVI7HLCDQS/events.json","paper":"https://pith.science/paper/UDOEIINE"},"agent_actions":{"view_html":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS","download_json":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS.json","view_paper":"https://pith.science/paper/UDOEIINE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07446&json=true","fetch_graph":"https://pith.science/api/pith-number/UDOEIINEMVHD4ME7LVI7HLCDQS/graph.json","fetch_events":"https://pith.science/api/pith-number/UDOEIINEMVHD4ME7LVI7HLCDQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS/action/storage_attestation","attest_author":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS/action/author_attestation","sign_citation":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS/action/citation_signature","submit_replication":"https://pith.science/pith/UDOEIINEMVHD4ME7LVI7HLCDQS/action/replication_record"}},"created_at":"2026-05-17T23:43:07.873678+00:00","updated_at":"2026-05-17T23:43:07.873678+00:00"}