{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5AT2CVNBLCDZOOWROUTZITHSEU","short_pith_number":"pith:5AT2CVNB","schema_version":"1.0","canonical_sha256":"e827a155a15887973ad17527944cf225084b0b0ccffd32aa4b4ec63d6cd9b20a","source":{"kind":"arxiv","id":"2412.08586","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically good CSS-T codes and a new construction of triorthogonal codes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Elena Berardini, Josu Etxezarreta Martinez, Olatz Sanz Larrarte, Reza Dastbasteh, Shreyas Jain","submitted_at":"2024-12-11T18:03:58Z","abstract_excerpt":"We propose a new systematic construction of CSS-T codes from any given CSS code using a map $\\phi$. When $\\phi$ is the identity map $I$, we retrieve the construction of [1] and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes. We analyze the structure of the logical operators corresponding to certain non-Clifford gates supported by the quantum codes obtained from this construction ($\\phi = I$), concluding that they always result in the logical identity. An immediat"},"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":"2412.08586","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-11T18:03:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c2556d78a2912eb7421c5148d8af56d040b5cf9b14ce08a77c610bc24096cc08","abstract_canon_sha256":"876eb7bda2bda407dd6e475a4d988ea9ae08a9b3340867fa4c83d9abba0972ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:10.170016Z","signature_b64":"SLWHEt8heBvUTWrIhvDujPjViRxeaXrsyOwFleDPt5fXn5axsaGy6ZG0Ce4fRx/9Wtw1KJQdCkoOm2NjCNZkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e827a155a15887973ad17527944cf225084b0b0ccffd32aa4b4ec63d6cd9b20a","last_reissued_at":"2026-07-05T11:24:10.169415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:10.169415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically good CSS-T codes and a new construction of triorthogonal codes","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Elena Berardini, Josu Etxezarreta Martinez, Olatz Sanz Larrarte, Reza Dastbasteh, Shreyas Jain","submitted_at":"2024-12-11T18:03:58Z","abstract_excerpt":"We propose a new systematic construction of CSS-T codes from any given CSS code using a map $\\phi$. When $\\phi$ is the identity map $I$, we retrieve the construction of [1] and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes. We analyze the structure of the logical operators corresponding to certain non-Clifford gates supported by the quantum codes obtained from this construction ($\\phi = I$), concluding that they always result in the logical identity. An immediat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08586","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.08586/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.08586","created_at":"2026-07-05T11:24:10.169490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08586v2","created_at":"2026-07-05T11:24:10.169490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08586","created_at":"2026-07-05T11:24:10.169490+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AT2CVNBLCDZ","created_at":"2026-07-05T11:24:10.169490+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AT2CVNBLCDZOOWR","created_at":"2026-07-05T11:24:10.169490+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AT2CVNB","created_at":"2026-07-05T11:24:10.169490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17611","citing_title":"CSS-$T$ codes over Binary Extension Fields and their Physical Foundations","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU","json":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU.json","graph_json":"https://pith.science/api/pith-number/5AT2CVNBLCDZOOWROUTZITHSEU/graph.json","events_json":"https://pith.science/api/pith-number/5AT2CVNBLCDZOOWROUTZITHSEU/events.json","paper":"https://pith.science/paper/5AT2CVNB"},"agent_actions":{"view_html":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU","download_json":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU.json","view_paper":"https://pith.science/paper/5AT2CVNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08586&json=true","fetch_graph":"https://pith.science/api/pith-number/5AT2CVNBLCDZOOWROUTZITHSEU/graph.json","fetch_events":"https://pith.science/api/pith-number/5AT2CVNBLCDZOOWROUTZITHSEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU/action/storage_attestation","attest_author":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU/action/author_attestation","sign_citation":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU/action/citation_signature","submit_replication":"https://pith.science/pith/5AT2CVNBLCDZOOWROUTZITHSEU/action/replication_record"}},"created_at":"2026-07-05T11:24:10.169490+00:00","updated_at":"2026-07-05T11:24:10.169490+00:00"}