{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZSXWBV655V7ARAIDF5T2WSXJSZ","short_pith_number":"pith:ZSXWBV65","schema_version":"1.0","canonical_sha256":"ccaf60d7dded7e0881032f67ab4ae99640ccde5fd4c13253b59b07b687f4eba8","source":{"kind":"arxiv","id":"1506.01971","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Cyclic Complementary Dual Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uner\\.i, Patrick Sol\\'e","submitted_at":"2015-06-05T17:00:17Z","abstract_excerpt":"LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given."},"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":"1506.01971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T17:00:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00feefd1eecfecdca2c199da882a5091c71c00be460092a2a1cf177151eeed57","abstract_canon_sha256":"0179ac6c3be64b423fe290199933680f6e2fb9be0164d1aef9ab967e18dc78b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.710811Z","signature_b64":"Zn1Of2T2msdQHOqbKWAHEmy0b0F8W5P1qh7PJIc7k1cC15McLTIOZB43a9yUuCm7QDMn9O0AjZu82PZMds/CDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccaf60d7dded7e0881032f67ab4ae99640ccde5fd4c13253b59b07b687f4eba8","last_reissued_at":"2026-05-18T01:09:46.710252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.710252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Cyclic Complementary Dual Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Buket \\\"Ozkaya, Cem G\\\"uner\\.i, Patrick Sol\\'e","submitted_at":"2015-06-05T17:00:17Z","abstract_excerpt":"LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01971","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":"1506.01971","created_at":"2026-05-18T01:09:46.710344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01971v1","created_at":"2026-05-18T01:09:46.710344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01971","created_at":"2026-05-18T01:09:46.710344+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSXWBV655V7A","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSXWBV655V7ARAID","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSXWBV65","created_at":"2026-05-18T12:29:52.810259+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/ZSXWBV655V7ARAIDF5T2WSXJSZ","json":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ.json","graph_json":"https://pith.science/api/pith-number/ZSXWBV655V7ARAIDF5T2WSXJSZ/graph.json","events_json":"https://pith.science/api/pith-number/ZSXWBV655V7ARAIDF5T2WSXJSZ/events.json","paper":"https://pith.science/paper/ZSXWBV65"},"agent_actions":{"view_html":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ","download_json":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ.json","view_paper":"https://pith.science/paper/ZSXWBV65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01971&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSXWBV655V7ARAIDF5T2WSXJSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSXWBV655V7ARAIDF5T2WSXJSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZSXWBV655V7ARAIDF5T2WSXJSZ/action/replication_record"}},"created_at":"2026-05-18T01:09:46.710344+00:00","updated_at":"2026-05-18T01:09:46.710344+00:00"}