{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TVZSQ4DUBBAH32I32XAWWJAZ4D","short_pith_number":"pith:TVZSQ4DU","schema_version":"1.0","canonical_sha256":"9d7328707408407de91bd5c16b2419e0ecdf3bb1337fcf5cfee49d23aae62bb9","source":{"kind":"arxiv","id":"1903.04911","version":1},"attestation_state":"computed","paper":{"title":"Construction of Isodual Quasi-cyclic Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aicha Batoul, Fatma-Zahra Benahmed, Kenza Guenda, T. Aaron Gulliver","submitted_at":"2019-03-09T14:43:32Z","abstract_excerpt":"This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of isodual quasi-cyclic codes. Then these conditions are used to obtain isodual quasi-cyclic codes. We also provide a construction for isodual quasi-cyclic codes as the matrix product of isodual 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":"1903.04911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T14:43:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8c4869ed15ab5e709ba6f4bd2cb8388084b2a3faf1844817d98d7a4fc68eaab","abstract_canon_sha256":"007e333569a26150a6043d59c208868d251e9aa3245001c97c3a1580e8f61b43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:28.454632Z","signature_b64":"qjoipSAK1n3OOnXyaBu7RX5uHZmo9ZLLCuBCNmnbYfdgCahYglIflLD5sQkPgbcyniwDoCoyGZ2zkRkmZqwJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7328707408407de91bd5c16b2419e0ecdf3bb1337fcf5cfee49d23aae62bb9","last_reissued_at":"2026-05-17T23:51:28.454226Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:28.454226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Isodual Quasi-cyclic Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aicha Batoul, Fatma-Zahra Benahmed, Kenza Guenda, T. Aaron Gulliver","submitted_at":"2019-03-09T14:43:32Z","abstract_excerpt":"This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of isodual quasi-cyclic codes. Then these conditions are used to obtain isodual quasi-cyclic codes. We also provide a construction for isodual quasi-cyclic codes as the matrix product of isodual codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04911","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":"1903.04911","created_at":"2026-05-17T23:51:28.454280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04911v1","created_at":"2026-05-17T23:51:28.454280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04911","created_at":"2026-05-17T23:51:28.454280+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVZSQ4DUBBAH","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVZSQ4DUBBAH32I3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVZSQ4DU","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/TVZSQ4DUBBAH32I32XAWWJAZ4D","json":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D.json","graph_json":"https://pith.science/api/pith-number/TVZSQ4DUBBAH32I32XAWWJAZ4D/graph.json","events_json":"https://pith.science/api/pith-number/TVZSQ4DUBBAH32I32XAWWJAZ4D/events.json","paper":"https://pith.science/paper/TVZSQ4DU"},"agent_actions":{"view_html":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D","download_json":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D.json","view_paper":"https://pith.science/paper/TVZSQ4DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04911&json=true","fetch_graph":"https://pith.science/api/pith-number/TVZSQ4DUBBAH32I32XAWWJAZ4D/graph.json","fetch_events":"https://pith.science/api/pith-number/TVZSQ4DUBBAH32I32XAWWJAZ4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D/action/storage_attestation","attest_author":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D/action/author_attestation","sign_citation":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D/action/citation_signature","submit_replication":"https://pith.science/pith/TVZSQ4DUBBAH32I32XAWWJAZ4D/action/replication_record"}},"created_at":"2026-05-17T23:51:28.454280+00:00","updated_at":"2026-05-17T23:51:28.454280+00:00"}