{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QWXFZ6IKHG7PXFZ6F3PO75ESTW","short_pith_number":"pith:QWXFZ6IK","schema_version":"1.0","canonical_sha256":"85ae5cf90a39befb973e2edeeff4929dae28ea6f8de4183dd78bab43dcf5b5a4","source":{"kind":"arxiv","id":"1702.00549","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of complementary-dual cyclic $\\mathbb{F}_{q}$-linear $\\mathbb{F}_{q^t}$-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anuradha Sharma, Taranjot Kaur","submitted_at":"2017-02-02T06:24:26Z","abstract_excerpt":"Let $\\mathbb{F}_q$ denote the finite field of order $q,$ $n$ be a positive integer coprime to $q$ and $t \\geq 2$ be an integer. In this paper, we enumerate all the complementary-dual cyclic $\\mathbb{F}_q$-linear $\\mathbb{F}_{q^t}$-codes of length $n$ by placing $\\ast$, ordinary and Hermitian trace bilinear forms on $\\mathbb{F}_{q^t}^n.$"},"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":"1702.00549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T06:24:26Z","cross_cats_sorted":[],"title_canon_sha256":"573da94eee7c6b8dc4136e8ae80f32dd618990ce958ff9e80747d4edf8dbb618","abstract_canon_sha256":"2c6f7dcc7ad95089dc649b92cc19f46222989d9a30a19ff0d1fc29422836573e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:33.276254Z","signature_b64":"SOeUiUL/o6iwEG4cQK32XJcphypwnNlldhc2IyNjeW7Ec1XGYIxFzMYb4y/1Vji345yv/kqj+9uQwUAn45WnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85ae5cf90a39befb973e2edeeff4929dae28ea6f8de4183dd78bab43dcf5b5a4","last_reissued_at":"2026-05-18T00:51:33.275809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:33.275809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of complementary-dual cyclic $\\mathbb{F}_{q}$-linear $\\mathbb{F}_{q^t}$-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anuradha Sharma, Taranjot Kaur","submitted_at":"2017-02-02T06:24:26Z","abstract_excerpt":"Let $\\mathbb{F}_q$ denote the finite field of order $q,$ $n$ be a positive integer coprime to $q$ and $t \\geq 2$ be an integer. In this paper, we enumerate all the complementary-dual cyclic $\\mathbb{F}_q$-linear $\\mathbb{F}_{q^t}$-codes of length $n$ by placing $\\ast$, ordinary and Hermitian trace bilinear forms on $\\mathbb{F}_{q^t}^n.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00549","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":"1702.00549","created_at":"2026-05-18T00:51:33.275872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00549v1","created_at":"2026-05-18T00:51:33.275872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00549","created_at":"2026-05-18T00:51:33.275872+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWXFZ6IKHG7P","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWXFZ6IKHG7PXFZ6","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWXFZ6IK","created_at":"2026-05-18T12:31:39.905425+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/QWXFZ6IKHG7PXFZ6F3PO75ESTW","json":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW.json","graph_json":"https://pith.science/api/pith-number/QWXFZ6IKHG7PXFZ6F3PO75ESTW/graph.json","events_json":"https://pith.science/api/pith-number/QWXFZ6IKHG7PXFZ6F3PO75ESTW/events.json","paper":"https://pith.science/paper/QWXFZ6IK"},"agent_actions":{"view_html":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW","download_json":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW.json","view_paper":"https://pith.science/paper/QWXFZ6IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00549&json=true","fetch_graph":"https://pith.science/api/pith-number/QWXFZ6IKHG7PXFZ6F3PO75ESTW/graph.json","fetch_events":"https://pith.science/api/pith-number/QWXFZ6IKHG7PXFZ6F3PO75ESTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW/action/storage_attestation","attest_author":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW/action/author_attestation","sign_citation":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW/action/citation_signature","submit_replication":"https://pith.science/pith/QWXFZ6IKHG7PXFZ6F3PO75ESTW/action/replication_record"}},"created_at":"2026-05-18T00:51:33.275872+00:00","updated_at":"2026-05-18T00:51:33.275872+00:00"}