{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YQ3IZSGBMKOMOCD52TCWMWT4O3","short_pith_number":"pith:YQ3IZSGB","schema_version":"1.0","canonical_sha256":"c4368cc8c1629cc7087dd4c5665a7c76e47a7874deecc3a33ac75cf3eb13e1a0","source":{"kind":"arxiv","id":"1604.07925","version":4},"attestation_state":"computed","paper":{"title":"Permutation-invariant qudit codes from polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yingkai Ouyang","submitted_at":"2016-04-27T04:09:01Z","abstract_excerpt":"A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex Euclidean space of dimension $q \\ge 2$, any permutation-invariant code is a subspace of the symmetric subspace of $(\\mathbb C^q)^N.$ We give an algebraic construction of new families of of $d$-dimensional permutation-invariant codes on at least $(2t+1)^2(d-1)$ qudits that can also correct $t$ errors for $d \\ge 2$. The construction of our codes relies on a real "},"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":"1604.07925","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-27T04:09:01Z","cross_cats_sorted":[],"title_canon_sha256":"6b6816e1bc66d855d576b4bb68f4d873f51b0e48c10f506015275035ff5544e5","abstract_canon_sha256":"36b86f49027c756166cc063bea298a066f4d78c1eaea4ee2a6ddc2d24e880d57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:08.201943Z","signature_b64":"XJVgyD4zWMNLu3Y7D5I9q8oOk+Gqr9UG17VgQs/b9iMToZ68oxn/AaHsDb0HzLuvwiY76WuA/vF/xzAX1zIlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4368cc8c1629cc7087dd4c5665a7c76e47a7874deecc3a33ac75cf3eb13e1a0","last_reissued_at":"2026-05-18T00:41:08.201446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:08.201446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutation-invariant qudit codes from polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yingkai Ouyang","submitted_at":"2016-04-27T04:09:01Z","abstract_excerpt":"A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex Euclidean space of dimension $q \\ge 2$, any permutation-invariant code is a subspace of the symmetric subspace of $(\\mathbb C^q)^N.$ We give an algebraic construction of new families of of $d$-dimensional permutation-invariant codes on at least $(2t+1)^2(d-1)$ qudits that can also correct $t$ errors for $d \\ge 2$. The construction of our codes relies on a real "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07925","kind":"arxiv","version":4},"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":"1604.07925","created_at":"2026-05-18T00:41:08.201529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07925v4","created_at":"2026-05-18T00:41:08.201529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07925","created_at":"2026-05-18T00:41:08.201529+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQ3IZSGBMKOM","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQ3IZSGBMKOMOCD5","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQ3IZSGB","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03413","citing_title":"An angular momentum approach to quantum insertion errors","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3","json":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3.json","graph_json":"https://pith.science/api/pith-number/YQ3IZSGBMKOMOCD52TCWMWT4O3/graph.json","events_json":"https://pith.science/api/pith-number/YQ3IZSGBMKOMOCD52TCWMWT4O3/events.json","paper":"https://pith.science/paper/YQ3IZSGB"},"agent_actions":{"view_html":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3","download_json":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3.json","view_paper":"https://pith.science/paper/YQ3IZSGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07925&json=true","fetch_graph":"https://pith.science/api/pith-number/YQ3IZSGBMKOMOCD52TCWMWT4O3/graph.json","fetch_events":"https://pith.science/api/pith-number/YQ3IZSGBMKOMOCD52TCWMWT4O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/action/storage_attestation","attest_author":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/action/author_attestation","sign_citation":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/action/citation_signature","submit_replication":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/action/replication_record"}},"created_at":"2026-05-18T00:41:08.201529+00:00","updated_at":"2026-05-18T00:41:08.201529+00:00"}