{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U7LS752GK4M3TCFS7ELOI3ZRRH","short_pith_number":"pith:U7LS752G","schema_version":"1.0","canonical_sha256":"a7d72ff7465719b988b2f916e46f3189d318f64d0ae051d0844bc501f64befde","source":{"kind":"arxiv","id":"1603.05063","version":1},"attestation_state":"computed","paper":{"title":"Quasi-cyclic subcodes of cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uneri, Jean-Claude Belfiore","submitted_at":"2016-03-16T12:33:01Z","abstract_excerpt":"We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the simplex code and duals of certain BCH codes. Our results are based on the trace representation of cyclic codes."},"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":"1603.05063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-16T12:33:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"17d8a32de283c470ddaaa593149285e4b050a9c970bd81f3ea4df3c9e3274d58","abstract_canon_sha256":"b7d25b4e4bfc394a7975290056547b4c47a82cf57a2534c6d62dd53bbb9d90a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:58.096355Z","signature_b64":"PFjXXQsNzOHH32d1I3sbog5xHOVXkDtKdB6zJpeBoWeVuVTS2WBFVAiUqG24QIexLnaG6yXAgdHs3ZfBL3pTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7d72ff7465719b988b2f916e46f3189d318f64d0ae051d0844bc501f64befde","last_reissued_at":"2026-05-18T01:18:58.095864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:58.095864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-cyclic subcodes of cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uneri, Jean-Claude Belfiore","submitted_at":"2016-03-16T12:33:01Z","abstract_excerpt":"We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the simplex code and duals of certain BCH codes. Our results are based on the trace representation of cyclic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05063","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":"1603.05063","created_at":"2026-05-18T01:18:58.095954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05063v1","created_at":"2026-05-18T01:18:58.095954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05063","created_at":"2026-05-18T01:18:58.095954+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/U7LS752GK4M3TCFS7ELOI3ZRRH","json":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH.json","graph_json":"https://pith.science/api/pith-number/U7LS752GK4M3TCFS7ELOI3ZRRH/graph.json","events_json":"https://pith.science/api/pith-number/U7LS752GK4M3TCFS7ELOI3ZRRH/events.json","paper":"https://pith.science/paper/U7LS752G"},"agent_actions":{"view_html":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH","download_json":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH.json","view_paper":"https://pith.science/paper/U7LS752G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05063&json=true","fetch_graph":"https://pith.science/api/pith-number/U7LS752GK4M3TCFS7ELOI3ZRRH/graph.json","fetch_events":"https://pith.science/api/pith-number/U7LS752GK4M3TCFS7ELOI3ZRRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH/action/storage_attestation","attest_author":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH/action/author_attestation","sign_citation":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH/action/citation_signature","submit_replication":"https://pith.science/pith/U7LS752GK4M3TCFS7ELOI3ZRRH/action/replication_record"}},"created_at":"2026-05-18T01:18:58.095954+00:00","updated_at":"2026-05-18T01:18:58.095954+00:00"}