{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2JLEVKP5W45RZVJ6NIRHCKVHXI","short_pith_number":"pith:2JLEVKP5","schema_version":"1.0","canonical_sha256":"d2564aa9fdb73b1cd53e6a22712aa7ba36b699066605e15aba6e5a9bdfa13fe3","source":{"kind":"arxiv","id":"2506.00130","version":1},"attestation_state":"computed","paper":{"title":"Romanesco codes: Bias-tailored qLDPC codes from fractal codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Catherine Leroux, Joseph K. Iverson","submitted_at":"2025-05-30T18:06:24Z","abstract_excerpt":"We introduce and analyze a family of Clifford-deformed bivariate bicycle codes that are tailored for biased noise. Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers. The code is non-CSS, featuring stabilizer generators that are each half X and half Z. We find small examples with high encoding rate that perform well for a large range of bias. In the limit of large noise bias, the code reduces to two independent classical cellular automaton codes, giving a distance scaling better than is possible with 2D topological quantum codes. Ou"},"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":"2506.00130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:06:24Z","cross_cats_sorted":[],"title_canon_sha256":"efdb6381ae3ac1c30581cef9fb710acde0eedc630f75de378971f6f6ce56b21f","abstract_canon_sha256":"ca2dc34a2306a762d31a901d8f9be43c48e5eeeb7626150aaa7788083177ce95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:29.444850Z","signature_b64":"1ifcQg5AYZ3rbnF1zJZKJ3SQcmVrPCsah4Y3KuMtVoRZE3TCUQLOWjexBV+Q2U5+SJ0H2fJdLCmIXUdeawDMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2564aa9fdb73b1cd53e6a22712aa7ba36b699066605e15aba6e5a9bdfa13fe3","last_reissued_at":"2026-07-05T11:13:29.444443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:29.444443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Romanesco codes: Bias-tailored qLDPC codes from fractal codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Catherine Leroux, Joseph K. Iverson","submitted_at":"2025-05-30T18:06:24Z","abstract_excerpt":"We introduce and analyze a family of Clifford-deformed bivariate bicycle codes that are tailored for biased noise. Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers. The code is non-CSS, featuring stabilizer generators that are each half X and half Z. We find small examples with high encoding rate that perform well for a large range of bias. In the limit of large noise bias, the code reduces to two independent classical cellular automaton codes, giving a distance scaling better than is possible with 2D topological quantum codes. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00130","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.00130/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":"2506.00130","created_at":"2026-07-05T11:13:29.444498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00130v1","created_at":"2026-07-05T11:13:29.444498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00130","created_at":"2026-07-05T11:13:29.444498+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JLEVKP5W45R","created_at":"2026-07-05T11:13:29.444498+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JLEVKP5W45RZVJ6","created_at":"2026-07-05T11:13:29.444498+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JLEVKP5","created_at":"2026-07-05T11:13:29.444498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15348","citing_title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15436","citing_title":"Parity-unfolded distillation architecture for noise-biased platforms","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI","json":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI.json","graph_json":"https://pith.science/api/pith-number/2JLEVKP5W45RZVJ6NIRHCKVHXI/graph.json","events_json":"https://pith.science/api/pith-number/2JLEVKP5W45RZVJ6NIRHCKVHXI/events.json","paper":"https://pith.science/paper/2JLEVKP5"},"agent_actions":{"view_html":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI","download_json":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI.json","view_paper":"https://pith.science/paper/2JLEVKP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00130&json=true","fetch_graph":"https://pith.science/api/pith-number/2JLEVKP5W45RZVJ6NIRHCKVHXI/graph.json","fetch_events":"https://pith.science/api/pith-number/2JLEVKP5W45RZVJ6NIRHCKVHXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI/action/storage_attestation","attest_author":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI/action/author_attestation","sign_citation":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI/action/citation_signature","submit_replication":"https://pith.science/pith/2JLEVKP5W45RZVJ6NIRHCKVHXI/action/replication_record"}},"created_at":"2026-07-05T11:13:29.444498+00:00","updated_at":"2026-07-05T11:13:29.444498+00:00"}