{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VHYGS2Q7C6AECSCL4ITBTB5CC4","short_pith_number":"pith:VHYGS2Q7","schema_version":"1.0","canonical_sha256":"a9f0696a1f178041484be2261987a217245073aec466178d0af29b23df0e4535","source":{"kind":"arxiv","id":"2010.06628","version":1},"attestation_state":"computed","paper":{"title":"The surface code on the rhombic dodecahedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl","submitted_at":"2020-10-13T18:38:46Z","abstract_excerpt":"I present a jaunty little $[[14, 3, 3]]$ non-CSS surface code that can be described using a rhombic dodecahedron. Do with it what you will."},"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":"2010.06628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-10-13T18:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"cfffdb63581ee029e1c6e9ff7c50c5b0a0d886a47b0c54747d09246f64911170","abstract_canon_sha256":"9b03a5aa6526c3fe535a2e7bd6146455f5d1a417805802310fa3a0c292e0fbdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:57.792824Z","signature_b64":"erblB7h3W6cvIMPrf/qbmuBX/bwyuuZqlO0id4cgIrMKmYVEQIf5jVOOPTrAU5wo4sGQ/zslN+LCMz5vZCNuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f0696a1f178041484be2261987a217245073aec466178d0af29b23df0e4535","last_reissued_at":"2026-07-05T01:42:57.792401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:57.792401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The surface code on the rhombic dodecahedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl","submitted_at":"2020-10-13T18:38:46Z","abstract_excerpt":"I present a jaunty little $[[14, 3, 3]]$ non-CSS surface code that can be described using a rhombic dodecahedron. Do with it what you will."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06628","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/2010.06628/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":"2010.06628","created_at":"2026-07-05T01:42:57.792463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.06628v1","created_at":"2026-07-05T01:42:57.792463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06628","created_at":"2026-07-05T01:42:57.792463+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHYGS2Q7C6AE","created_at":"2026-07-05T01:42:57.792463+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHYGS2Q7C6AECSCL","created_at":"2026-07-05T01:42:57.792463+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHYGS2Q7","created_at":"2026-07-05T01:42:57.792463+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20387","citing_title":"A small and interesting architecture for early fault-tolerant quantum computers","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4","json":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4.json","graph_json":"https://pith.science/api/pith-number/VHYGS2Q7C6AECSCL4ITBTB5CC4/graph.json","events_json":"https://pith.science/api/pith-number/VHYGS2Q7C6AECSCL4ITBTB5CC4/events.json","paper":"https://pith.science/paper/VHYGS2Q7"},"agent_actions":{"view_html":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4","download_json":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4.json","view_paper":"https://pith.science/paper/VHYGS2Q7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.06628&json=true","fetch_graph":"https://pith.science/api/pith-number/VHYGS2Q7C6AECSCL4ITBTB5CC4/graph.json","fetch_events":"https://pith.science/api/pith-number/VHYGS2Q7C6AECSCL4ITBTB5CC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4/action/storage_attestation","attest_author":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4/action/author_attestation","sign_citation":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4/action/citation_signature","submit_replication":"https://pith.science/pith/VHYGS2Q7C6AECSCL4ITBTB5CC4/action/replication_record"}},"created_at":"2026-07-05T01:42:57.792463+00:00","updated_at":"2026-07-05T01:42:57.792463+00:00"}