{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:4EEHR7YCAFWTCCGQRBRJVHYN7T","short_pith_number":"pith:4EEHR7YC","schema_version":"1.0","canonical_sha256":"e10878ff02016d3108d088629a9f0dfccd48d29fca0343eb2c7e54caa816c235","source":{"kind":"arxiv","id":"quant-ph/9608049","version":1},"attestation_state":"computed","paper":{"title":"Group Representations, Error Bases and Quantum Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"1996-08-29T19:32:40Z","abstract_excerpt":"This report continues the discussion of unitary error bases and quantum codes begun in \"Non-binary Unitary Error Bases and Quantum Codes\". Nice error bases are characterized in terms of the existence of certain characters in a group. A general construction for error bases which are non-abelian over the center is given. The method for obtaining codes due to Calderbank et al. is generalized and expressed purely in representation theoretic terms. The significance of the inertia subgroup both for constructing codes and obtaining the set of transversally implementable operations is demonstrated."},"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":"quant-ph/9608049","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-08-29T19:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"69be53735330eb70e39239fd0555e82b17ec90f522532a39097fa0094e1f3b81","abstract_canon_sha256":"83beedc8a28bdadc8825dae6dd57ba23e756174f35bbc7d9777bf000796160df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:05.327072Z","signature_b64":"msWbrxynZmIR1cGva7UJ6nAfT3JPb7KdepHKy9A8f2CyesitHLopFFKRqDBWeY0RRTq62JI+GJHaGIK6hzPgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10878ff02016d3108d088629a9f0dfccd48d29fca0343eb2c7e54caa816c235","last_reissued_at":"2026-07-04T14:47:05.326651Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:05.326651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Representations, Error Bases and Quantum Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill","submitted_at":"1996-08-29T19:32:40Z","abstract_excerpt":"This report continues the discussion of unitary error bases and quantum codes begun in \"Non-binary Unitary Error Bases and Quantum Codes\". Nice error bases are characterized in terms of the existence of certain characters in a group. A general construction for error bases which are non-abelian over the center is given. The method for obtaining codes due to Calderbank et al. is generalized and expressed purely in representation theoretic terms. The significance of the inertia subgroup both for constructing codes and obtaining the set of transversally implementable operations is demonstrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9608049","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/quant-ph/9608049/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":"quant-ph/9608049","created_at":"2026-07-04T14:47:05.326707+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9608049v1","created_at":"2026-07-04T14:47:05.326707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9608049","created_at":"2026-07-04T14:47:05.326707+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EEHR7YCAFWT","created_at":"2026-07-04T14:47:05.326707+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EEHR7YCAFWTCCGQ","created_at":"2026-07-04T14:47:05.326707+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EEHR7YC","created_at":"2026-07-04T14:47:05.326707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2607.08133","citing_title":"Communication Advantages from Quantum Dense Network Coding","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02531","citing_title":"Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2410.23997","citing_title":"Mutually Unbiased Bases in Composite Dimensions -- A Review","ref_index":231,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T","json":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T.json","graph_json":"https://pith.science/api/pith-number/4EEHR7YCAFWTCCGQRBRJVHYN7T/graph.json","events_json":"https://pith.science/api/pith-number/4EEHR7YCAFWTCCGQRBRJVHYN7T/events.json","paper":"https://pith.science/paper/4EEHR7YC"},"agent_actions":{"view_html":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T","download_json":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T.json","view_paper":"https://pith.science/paper/4EEHR7YC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9608049&json=true","fetch_graph":"https://pith.science/api/pith-number/4EEHR7YCAFWTCCGQRBRJVHYN7T/graph.json","fetch_events":"https://pith.science/api/pith-number/4EEHR7YCAFWTCCGQRBRJVHYN7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T/action/storage_attestation","attest_author":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T/action/author_attestation","sign_citation":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T/action/citation_signature","submit_replication":"https://pith.science/pith/4EEHR7YCAFWTCCGQRBRJVHYN7T/action/replication_record"}},"created_at":"2026-07-04T14:47:05.326707+00:00","updated_at":"2026-07-04T14:47:05.326707+00:00"}