{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VYUBIIPNKJSCBI36K6TRTQQJIB","short_pith_number":"pith:VYUBIIPN","schema_version":"1.0","canonical_sha256":"ae281421ed526420a37e57a719c20940465b14aef5355d23e644808eb674c6d8","source":{"kind":"arxiv","id":"2110.05348","version":2},"attestation_state":"computed","paper":{"title":"Planar Floquet Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christophe Vuillot","submitted_at":"2021-10-11T15:21:35Z","abstract_excerpt":"A protocol called the \"honeycomb code\", or generically a \"Floquet code\", was introduced by Hastings and Haah in \\cite{hastings_dynamically_2021}. The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits but such that there exists a schedule for measuring two-body gauge checks leaving enough room at all times for two protected logical qubits. In this work we show a way to introduce boundaries to the system which curiously presents a rotating dynamics but has constant distance and is therefore not fault-tolerant."},"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":"2110.05348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-11T15:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"15a68171a50f1612e81b9441e121b22efcdfd90f4aef60a47dd09d277e4649ff","abstract_canon_sha256":"45bd9c186d98a206a9b3a200c88d3916552281c02d04df38f10e8734d9932ecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:49.766382Z","signature_b64":"Mt83s74jqgkVUdQ/jyEFzo0tuzaAxQsmZweVbx+dat1emzfwUkFhmpKPqYBt6mpGwistj8RnwMyJbkh3i87/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae281421ed526420a37e57a719c20940465b14aef5355d23e644808eb674c6d8","last_reissued_at":"2026-07-05T03:40:49.765876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:49.765876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Floquet Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christophe Vuillot","submitted_at":"2021-10-11T15:21:35Z","abstract_excerpt":"A protocol called the \"honeycomb code\", or generically a \"Floquet code\", was introduced by Hastings and Haah in \\cite{hastings_dynamically_2021}. The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits but such that there exists a schedule for measuring two-body gauge checks leaving enough room at all times for two protected logical qubits. In this work we show a way to introduce boundaries to the system which curiously presents a rotating dynamics but has constant distance and is therefore not fault-tolerant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05348","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/2110.05348/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":"2110.05348","created_at":"2026-07-05T03:40:49.765936+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.05348v2","created_at":"2026-07-05T03:40:49.765936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05348","created_at":"2026-07-05T03:40:49.765936+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYUBIIPNKJSC","created_at":"2026-07-05T03:40:49.765936+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYUBIIPNKJSCBI36","created_at":"2026-07-05T03:40:49.765936+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYUBIIPN","created_at":"2026-07-05T03:40:49.765936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20263","citing_title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","ref_index":100,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21204","citing_title":"PIQC: Scalable Distributed Quantum Computing via Photonic Integration of Designed Molecular Quantum Nodes","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2512.00843","citing_title":"Multiqubit Rydberg Gates for Quantum Error Correction","ref_index":82,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB","json":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB.json","graph_json":"https://pith.science/api/pith-number/VYUBIIPNKJSCBI36K6TRTQQJIB/graph.json","events_json":"https://pith.science/api/pith-number/VYUBIIPNKJSCBI36K6TRTQQJIB/events.json","paper":"https://pith.science/paper/VYUBIIPN"},"agent_actions":{"view_html":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB","download_json":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB.json","view_paper":"https://pith.science/paper/VYUBIIPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.05348&json=true","fetch_graph":"https://pith.science/api/pith-number/VYUBIIPNKJSCBI36K6TRTQQJIB/graph.json","fetch_events":"https://pith.science/api/pith-number/VYUBIIPNKJSCBI36K6TRTQQJIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB/action/storage_attestation","attest_author":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB/action/author_attestation","sign_citation":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB/action/citation_signature","submit_replication":"https://pith.science/pith/VYUBIIPNKJSCBI36K6TRTQQJIB/action/replication_record"}},"created_at":"2026-07-05T03:40:49.765936+00:00","updated_at":"2026-07-05T03:40:49.765936+00:00"}