{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I7FOEUL7M6JUQ3COMPSMXVQO6K","short_pith_number":"pith:I7FOEUL7","schema_version":"1.0","canonical_sha256":"47cae2517f6793486c4e63e4cbd60ef28d2b8f733dfc85b1a370dc00990cf952","source":{"kind":"arxiv","id":"2605.18981","version":1},"attestation_state":"computed","paper":{"title":"A Review of Galois Qudits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills","submitted_at":"2026-05-18T18:03:27Z","abstract_excerpt":"Galois qudits are $q$-dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field $\\mathbb{F}_q$. They differ from the more familiar modular qudit, which are the same quantum system but whose choice of Pauli group are the clock and shift operators, which encode the arithmetic of integer addition and multiplication modulo $q$. Galois qudits are a useful mathematical construct that allow us to leverage the mathematical tools that are native to the larger qudit while only physically building smaller qudits. In particular, a Galois qudit of dimension $q = 2^"},"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":"2605.18981","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-18T18:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"7889a4dda2503bd3997e81fd79a1fc0142087afcbeb3cac3073bc4b4a29c5e41","abstract_canon_sha256":"3465748c6294a6e5d10f66694c82d2148d4cba517cf6040e96adbbd59cece0db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:40.915718Z","signature_b64":"R62iJ6l8BnGYMlgmdo8dBQN/ocbYOrmC1vFnaT89iFHQVwj8IGrDKISH1tpAkQfhP6mYCjYsAA8Cg3xhJ3HHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47cae2517f6793486c4e63e4cbd60ef28d2b8f733dfc85b1a370dc00990cf952","last_reissued_at":"2026-05-20T00:06:40.914911Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:40.914911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Review of Galois Qudits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills","submitted_at":"2026-05-18T18:03:27Z","abstract_excerpt":"Galois qudits are $q$-dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field $\\mathbb{F}_q$. They differ from the more familiar modular qudit, which are the same quantum system but whose choice of Pauli group are the clock and shift operators, which encode the arithmetic of integer addition and multiplication modulo $q$. Galois qudits are a useful mathematical construct that allow us to leverage the mathematical tools that are native to the larger qudit while only physically building smaller qudits. In particular, a Galois qudit of dimension $q = 2^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18981","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/2605.18981/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":"2605.18981","created_at":"2026-05-20T00:06:40.915047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18981v1","created_at":"2026-05-20T00:06:40.915047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18981","created_at":"2026-05-20T00:06:40.915047+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7FOEUL7M6JU","created_at":"2026-05-20T00:06:40.915047+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7FOEUL7M6JUQ3CO","created_at":"2026-05-20T00:06:40.915047+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7FOEUL7","created_at":"2026-05-20T00:06:40.915047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21898","citing_title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K","json":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K.json","graph_json":"https://pith.science/api/pith-number/I7FOEUL7M6JUQ3COMPSMXVQO6K/graph.json","events_json":"https://pith.science/api/pith-number/I7FOEUL7M6JUQ3COMPSMXVQO6K/events.json","paper":"https://pith.science/paper/I7FOEUL7"},"agent_actions":{"view_html":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K","download_json":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K.json","view_paper":"https://pith.science/paper/I7FOEUL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18981&json=true","fetch_graph":"https://pith.science/api/pith-number/I7FOEUL7M6JUQ3COMPSMXVQO6K/graph.json","fetch_events":"https://pith.science/api/pith-number/I7FOEUL7M6JUQ3COMPSMXVQO6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K/action/storage_attestation","attest_author":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K/action/author_attestation","sign_citation":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K/action/citation_signature","submit_replication":"https://pith.science/pith/I7FOEUL7M6JUQ3COMPSMXVQO6K/action/replication_record"}},"created_at":"2026-05-20T00:06:40.915047+00:00","updated_at":"2026-05-20T00:06:40.915047+00:00"}