{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OSN3ZKZSW3ATGMNJCVIFRXWPFZ","short_pith_number":"pith:OSN3ZKZS","schema_version":"1.0","canonical_sha256":"749bbcab32b6c13331a9155058decf2e40e67a34f80552f9933a01a3a5f11b99","source":{"kind":"arxiv","id":"1301.1166","version":1},"attestation_state":"computed","paper":{"title":"Quantum channels from association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Simone Severini, Tao Feng","submitted_at":"2013-01-07T12:24:27Z","abstract_excerpt":"We propose in this note the study of quantum channels from association schemes. This is done by interpreting the $(0,1)$-matrices of a scheme as the Kraus operators of a channel. Working in the framework of one-shot zero-error information theory, we give bounds and closed formulas for various independence numbers of the relative non-commutative (confusability) graphs, or, equivalently, graphical operator systems. We use pseudocyclic association schemes as an example. In this case, we show that the unitary entanglement-assisted independence number grows at least quadratically faster, with respe"},"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":"1301.1166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-07T12:24:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b53a669f9c5f81b90d847ab7b54552287550d04d2d9e1921ecb75029fa4217c2","abstract_canon_sha256":"59a11ba5b8c00eb095f0aec86cb335bda85fcbe74483bf785e14119c256e3d7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:06.614221Z","signature_b64":"DtAcQFXJGl19RRbJ2WWZjQp3hC6Crs29yw5a/TbBvAJDiUQp5zhkfbpseMN6U2RL3jG3lfXbqMbNfHdRlH8uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"749bbcab32b6c13331a9155058decf2e40e67a34f80552f9933a01a3a5f11b99","last_reissued_at":"2026-05-18T03:37:06.613522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:06.613522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum channels from association schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Simone Severini, Tao Feng","submitted_at":"2013-01-07T12:24:27Z","abstract_excerpt":"We propose in this note the study of quantum channels from association schemes. This is done by interpreting the $(0,1)$-matrices of a scheme as the Kraus operators of a channel. Working in the framework of one-shot zero-error information theory, we give bounds and closed formulas for various independence numbers of the relative non-commutative (confusability) graphs, or, equivalently, graphical operator systems. We use pseudocyclic association schemes as an example. In this case, we show that the unitary entanglement-assisted independence number grows at least quadratically faster, with respe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1166","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":""},"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":"1301.1166","created_at":"2026-05-18T03:37:06.613638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1166v1","created_at":"2026-05-18T03:37:06.613638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1166","created_at":"2026-05-18T03:37:06.613638+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSN3ZKZSW3AT","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSN3ZKZSW3ATGMNJ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSN3ZKZS","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ","json":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ.json","graph_json":"https://pith.science/api/pith-number/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/graph.json","events_json":"https://pith.science/api/pith-number/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/events.json","paper":"https://pith.science/paper/OSN3ZKZS"},"agent_actions":{"view_html":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ","download_json":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ.json","view_paper":"https://pith.science/paper/OSN3ZKZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1166&json=true","fetch_graph":"https://pith.science/api/pith-number/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/action/storage_attestation","attest_author":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/action/author_attestation","sign_citation":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/action/citation_signature","submit_replication":"https://pith.science/pith/OSN3ZKZSW3ATGMNJCVIFRXWPFZ/action/replication_record"}},"created_at":"2026-05-18T03:37:06.613638+00:00","updated_at":"2026-05-18T03:37:06.613638+00:00"}