{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WGEA6ZFDECOD7RT2XRU4ZWJ4JA","short_pith_number":"pith:WGEA6ZFD","schema_version":"1.0","canonical_sha256":"b1880f64a3209c3fc67abc69ccd93c480e206657f359d8b28995a0df6d73441b","source":{"kind":"arxiv","id":"1705.00239","version":1},"attestation_state":"computed","paper":{"title":"Quantum codes derived from cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Giuliano G. La Guardia","submitted_at":"2017-04-29T21:12:42Z","abstract_excerpt":"In this note, we present a construction of new nonbinary quantum codes with good parameters. These codes are obtained by applying the Calderbank-Shor-Steane (CSS) construction. In order to do this, we show the existence of (classical) cyclic codes whose defining set consists of only one cyclotomic coset containing at least two consecutive integers."},"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":"1705.00239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-29T21:12:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b31ff378342e14c0de93b6904dfa02651ba1a675aa0b04615b34dc97d8cf0892","abstract_canon_sha256":"deb81802a894072034638194abfc71d9e129167084ab70cf7d4df5b9883dfcc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:50.124092Z","signature_b64":"+lfeMG9A6+al4FZekOQ+ZM2Uvp4FJyZ3bkru0HZb8sH7MhQMy2QdDNOKAPOLa09wZuw4HIhtwAVyfQtPIBnDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1880f64a3209c3fc67abc69ccd93c480e206657f359d8b28995a0df6d73441b","last_reissued_at":"2026-05-18T00:43:50.123367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:50.123367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum codes derived from cyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Giuliano G. La Guardia","submitted_at":"2017-04-29T21:12:42Z","abstract_excerpt":"In this note, we present a construction of new nonbinary quantum codes with good parameters. These codes are obtained by applying the Calderbank-Shor-Steane (CSS) construction. In order to do this, we show the existence of (classical) cyclic codes whose defining set consists of only one cyclotomic coset containing at least two consecutive integers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00239","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":"1705.00239","created_at":"2026-05-18T00:43:50.123486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00239v1","created_at":"2026-05-18T00:43:50.123486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00239","created_at":"2026-05-18T00:43:50.123486+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGEA6ZFDECOD","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGEA6ZFDECOD7RT2","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGEA6ZFD","created_at":"2026-05-18T12:31:53.515858+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/WGEA6ZFDECOD7RT2XRU4ZWJ4JA","json":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA.json","graph_json":"https://pith.science/api/pith-number/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/graph.json","events_json":"https://pith.science/api/pith-number/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/events.json","paper":"https://pith.science/paper/WGEA6ZFD"},"agent_actions":{"view_html":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA","download_json":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA.json","view_paper":"https://pith.science/paper/WGEA6ZFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00239&json=true","fetch_graph":"https://pith.science/api/pith-number/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/graph.json","fetch_events":"https://pith.science/api/pith-number/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/action/storage_attestation","attest_author":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/action/author_attestation","sign_citation":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/action/citation_signature","submit_replication":"https://pith.science/pith/WGEA6ZFDECOD7RT2XRU4ZWJ4JA/action/replication_record"}},"created_at":"2026-05-18T00:43:50.123486+00:00","updated_at":"2026-05-18T00:43:50.123486+00:00"}