{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YQ3IZSGBMKOMOCD52TCWMWT4O3","short_pith_number":"pith:YQ3IZSGB","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"},"canonical_sha256":"c4368cc8c1629cc7087dd4c5665a7c76e47a7874deecc3a33ac75cf3eb13e1a0","source":{"kind":"arxiv","id":"1604.07925","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07925","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07925v4","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07925","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"YQ3IZSGBMKOM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YQ3IZSGBMKOMOCD5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YQ3IZSGB","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YQ3IZSGBMKOMOCD52TCWMWT4O3","target":"record","payload":{"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"},"canonical_sha256":"c4368cc8c1629cc7087dd4c5665a7c76e47a7874deecc3a33ac75cf3eb13e1a0","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"},"source_kind":"arxiv","source_id":"1604.07925","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksGyrziI1fTovyhbpdmvEgln7RlVIrHLFqc8+Me8pBCaxH/lCgCglEBdDQ5M1ITJefGpVTk9G4oWWFnOh5lACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:11:31.766332Z"},"content_sha256":"f13f2887b968b5eff3ebaa0e6ba71b986abc130a20452137802ee61dad03115d","schema_version":"1.0","event_id":"sha256:f13f2887b968b5eff3ebaa0e6ba71b986abc130a20452137802ee61dad03115d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YQ3IZSGBMKOMOCD52TCWMWT4O3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coJaGNJf5QWMba4tSSXdtjTN4Lyig3k2DtRWOx41C0j5lqZdpt5V7l0jGu4ev1aNioNZd0F0AwsVSHaUEDkgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:11:31.767142Z"},"content_sha256":"a832589c51ced4082881522a932d7f769ab672fc1960966a92025e7fb16425cc","schema_version":"1.0","event_id":"sha256:a832589c51ced4082881522a932d7f769ab672fc1960966a92025e7fb16425cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/bundle.json","state_url":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T08:11:31Z","links":{"resolver":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3","bundle":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/bundle.json","state":"https://pith.science/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQ3IZSGBMKOMOCD52TCWMWT4O3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YQ3IZSGBMKOMOCD52TCWMWT4O3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"36b86f49027c756166cc063bea298a066f4d78c1eaea4ee2a6ddc2d24e880d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-27T04:09:01Z","title_canon_sha256":"6b6816e1bc66d855d576b4bb68f4d873f51b0e48c10f506015275035ff5544e5"},"schema_version":"1.0","source":{"id":"1604.07925","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07925","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07925v4","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07925","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"YQ3IZSGBMKOM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YQ3IZSGBMKOMOCD5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YQ3IZSGB","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:a832589c51ced4082881522a932d7f769ab672fc1960966a92025e7fb16425cc","target":"graph","created_at":"2026-05-18T00:41:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Yingkai Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-27T04:09:01Z","title":"Permutation-invariant qudit codes from polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07925","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f13f2887b968b5eff3ebaa0e6ba71b986abc130a20452137802ee61dad03115d","target":"record","created_at":"2026-05-18T00:41:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"36b86f49027c756166cc063bea298a066f4d78c1eaea4ee2a6ddc2d24e880d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-27T04:09:01Z","title_canon_sha256":"6b6816e1bc66d855d576b4bb68f4d873f51b0e48c10f506015275035ff5544e5"},"schema_version":"1.0","source":{"id":"1604.07925","kind":"arxiv","version":4}},"canonical_sha256":"c4368cc8c1629cc7087dd4c5665a7c76e47a7874deecc3a33ac75cf3eb13e1a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4368cc8c1629cc7087dd4c5665a7c76e47a7874deecc3a33ac75cf3eb13e1a0","first_computed_at":"2026-05-18T00:41:08.201446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:08.201446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJVgyD4zWMNLu3Y7D5I9q8oOk+Gqr9UG17VgQs/b9iMToZ68oxn/AaHsDb0HzLuvwiY76WuA/vF/xzAX1zIlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:08.201943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07925","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f13f2887b968b5eff3ebaa0e6ba71b986abc130a20452137802ee61dad03115d","sha256:a832589c51ced4082881522a932d7f769ab672fc1960966a92025e7fb16425cc"],"state_sha256":"371186f5a28c61e755f2972656777cc5bc869178c81fc67e8460a5f71e1cc4ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpp9WS84d5ZnMLEBb9JfanJ9lv1XPmxi+GlHkejPB6WhM65+9LNIBoDDGJfwf+ldUYRlWYPOBMMyc82xCTsaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:11:31.825138Z","bundle_sha256":"b96f7f6bc9a2351974adb201eff2a798254603791be64f39353dc0518295ef28"}}