{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5OPKJTXD7XY32U7YOFPDOM4PGF","short_pith_number":"pith:5OPKJTXD","canonical_record":{"source":{"id":"2604.26927","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"9aa36883cb4d790f7d3eac76c9e11fbc2ace639053fc3c2237c5467a19a164b1","abstract_canon_sha256":"53e30d48e01b8370c833700c916cda7dca4ed25e04fbb7457f27cf397b106b80"},"schema_version":"1.0"},"canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","source":{"kind":"arxiv","id":"2604.26927","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26927","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26927v2","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26927","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"pith_short_12","alias_value":"5OPKJTXD7XY3","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"pith_short_16","alias_value":"5OPKJTXD7XY32U7Y","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"pith_short_8","alias_value":"5OPKJTXD","created_at":"2026-06-24T00:14:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5OPKJTXD7XY32U7YOFPDOM4PGF","target":"record","payload":{"canonical_record":{"source":{"id":"2604.26927","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"9aa36883cb4d790f7d3eac76c9e11fbc2ace639053fc3c2237c5467a19a164b1","abstract_canon_sha256":"53e30d48e01b8370c833700c916cda7dca4ed25e04fbb7457f27cf397b106b80"},"schema_version":"1.0"},"canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:22.949515Z","signature_b64":"b2qr1XuNVplFADT2T0T7VlRGygREC1q8JCRRZKVEuLc5w5JcFzIlW4/wHDJYlGbJiEZWHS3Ia4bh7xSINTHpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","last_reissued_at":"2026-06-24T00:14:22.949106Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:22.949106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.26927","source_version":2,"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-06-24T00:14:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wiUNS5f2UBt8Vi1aOQsTmdKkAbM9MckOS5cZEjx2RwAWlws3KF1/jTwcV7NTGw7iC08c4nvJLwdxQI221fZtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:04:54.448239Z"},"content_sha256":"f9bbfe90ad624776e1869c636c0e569b2984b1771aaf8f0c3edf98f2b70f5c01","schema_version":"1.0","event_id":"sha256:f9bbfe90ad624776e1869c636c0e569b2984b1771aaf8f0c3edf98f2b70f5c01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5OPKJTXD7XY32U7YOFPDOM4PGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The most discriminable quantum states in the multicopy regime","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas B. Vieira, Lucas E. A. Porto, Marco T\\'ulio Quintino, Maria Kvashchuk, Polina Chernyshova, Ties-A. Ohst","submitted_at":"2026-04-29T17:41:12Z","abstract_excerpt":"This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form $\\left\\{\\frac{1}{N},\\rho_i^{\\otimes k}\\right\\}_{i=1}^N$, where $N$ states in dimension $d$ are provided in $k$ identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally disc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the ensemble is uniformly distributed and that k-designs exist with the required symmetry properties for the given dimension d and copy number k.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1619049d142661892788809358752ea5b23866ef3bef26888b7abf0381222f9a"},"source":{"id":"2604.26927","kind":"arxiv","version":2},"verdict":{"id":"e3a7f136-7918-4cee-917b-21ac04cb31cd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T09:58:03.684083Z","strongest_claim":"For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets.","one_line_summary":"k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the ensemble is uniformly distributed and that k-designs exist with the required symmetry properties for the given dimension d and copy number k.","pith_extraction_headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26927/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T23:37:01.566458Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:42:27.447411Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c36f4f84568f8a043a43f2b494fd8e97c93d32dd286c828f0da7f44ad7374e97"},"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":"e3a7f136-7918-4cee-917b-21ac04cb31cd"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T00:14:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJKnKhF34mAnUoZU3kVMEn7/3W09hJYijYgiuxjE94158xSvUZqj9WsMsDpGb9iLOXk9jTvCgi4pXMgf11TSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:04:54.448754Z"},"content_sha256":"5693b103a4204ba53aa47c38d03fe95a0fc789139e980f4f9a134c47a49722d6","schema_version":"1.0","event_id":"sha256:5693b103a4204ba53aa47c38d03fe95a0fc789139e980f4f9a134c47a49722d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/bundle.json","state_url":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/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-07-02T23:04:54Z","links":{"resolver":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF","bundle":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/bundle.json","state":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5OPKJTXD7XY32U7YOFPDOM4PGF","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":"53e30d48e01b8370c833700c916cda7dca4ed25e04fbb7457f27cf397b106b80","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:41:12Z","title_canon_sha256":"9aa36883cb4d790f7d3eac76c9e11fbc2ace639053fc3c2237c5467a19a164b1"},"schema_version":"1.0","source":{"id":"2604.26927","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26927","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26927v2","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26927","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"pith_short_12","alias_value":"5OPKJTXD7XY3","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"pith_short_16","alias_value":"5OPKJTXD7XY32U7Y","created_at":"2026-06-24T00:14:22Z"},{"alias_kind":"pith_short_8","alias_value":"5OPKJTXD","created_at":"2026-06-24T00:14:22Z"}],"graph_snapshots":[{"event_id":"sha256:5693b103a4204ba53aa47c38d03fe95a0fc789139e980f4f9a134c47a49722d6","target":"graph","created_at":"2026-06-24T00:14:22Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the ensemble is uniformly distributed and that k-designs exist with the required symmetry properties for the given dimension d and copy number k."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination."}],"snapshot_sha256":"1619049d142661892788809358752ea5b23866ef3bef26888b7abf0381222f9a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T23:37:01.566458Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:42:27.447411Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.26927/integrity.json","findings":[],"snapshot_sha256":"c36f4f84568f8a043a43f2b494fd8e97c93d32dd286c828f0da7f44ad7374e97","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form $\\left\\{\\frac{1}{N},\\rho_i^{\\otimes k}\\right\\}_{i=1}^N$, where $N$ states in dimension $d$ are provided in $k$ identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally disc","authors_text":"Lucas B. Vieira, Lucas E. A. Porto, Marco T\\'ulio Quintino, Maria Kvashchuk, Polina Chernyshova, Ties-A. Ohst","cross_cats":[],"headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:41:12Z","title":"The most discriminable quantum states in the multicopy regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.26927","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T09:58:03.684083Z","id":"e3a7f136-7918-4cee-917b-21ac04cb31cd","model_set":{"reader":"grok-4.3"},"one_line_summary":"k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","strongest_claim":"For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets.","weakest_assumption":"The assumption that the ensemble is uniformly distributed and that k-designs exist with the required symmetry properties for the given dimension d and copy number k."}},"verdict_id":"e3a7f136-7918-4cee-917b-21ac04cb31cd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f9bbfe90ad624776e1869c636c0e569b2984b1771aaf8f0c3edf98f2b70f5c01","target":"record","created_at":"2026-06-24T00:14:22Z","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":"53e30d48e01b8370c833700c916cda7dca4ed25e04fbb7457f27cf397b106b80","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:41:12Z","title_canon_sha256":"9aa36883cb4d790f7d3eac76c9e11fbc2ace639053fc3c2237c5467a19a164b1"},"schema_version":"1.0","source":{"id":"2604.26927","kind":"arxiv","version":2}},"canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","first_computed_at":"2026-06-24T00:14:22.949106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T00:14:22.949106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b2qr1XuNVplFADT2T0T7VlRGygREC1q8JCRRZKVEuLc5w5JcFzIlW4/wHDJYlGbJiEZWHS3Ia4bh7xSINTHpDw==","signature_status":"signed_v1","signed_at":"2026-06-24T00:14:22.949515Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26927","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9bbfe90ad624776e1869c636c0e569b2984b1771aaf8f0c3edf98f2b70f5c01","sha256:5693b103a4204ba53aa47c38d03fe95a0fc789139e980f4f9a134c47a49722d6"],"state_sha256":"1b15465aa0cfadb83334a58ff609aea889acd071fc70e06988ec8186efe4227f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMs+yS4mup30P47zjj2eOWhW7x8WAlOLE4Ey2Yml52L/o4upY/FlBb1gqzniauMdbFZK+PogBHa+HNTq4ruyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:04:54.451129Z","bundle_sha256":"115b834e7789a942cdb054b0466965824e7e1dde4bea52894663b8b53a4ef79e"}}