{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3RLIOXCCUO2BMZDUPNEHXPSHP2","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4da2dc6bc41ca42ea9c57544efd2d96a77cfa6bf5f2cb7c9f19bf3ec60d65d55","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-11T08:55:41Z","title_canon_sha256":"e1a7c9bdae54bc02fa4b02501a989498a87d31c7ae623147055a3211c2c137dc"},"schema_version":"1.0","source":{"id":"2608.10674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10674","created_at":"2026-08-12T01:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10674v1","created_at":"2026-08-12T01:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10674","created_at":"2026-08-12T01:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"3RLIOXCCUO2B","created_at":"2026-08-12T01:22:59Z"},{"alias_kind":"pith_short_16","alias_value":"3RLIOXCCUO2BMZDU","created_at":"2026-08-12T01:22:59Z"},{"alias_kind":"pith_short_8","alias_value":"3RLIOXCC","created_at":"2026-08-12T01:22:59Z"}],"graph_snapshots":[{"event_id":"sha256:fbab74d233edc0da9eae33035c153a8b51286c6b7ef156b423f119d1d0dbd4f4","target":"graph","created_at":"2026-08-12T01:22:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.10674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Uhlmann fidelity ${\\rm F}(\\rho_0,\\rho_1) = {\\rm tr}|\\sqrt{\\rho_0}\\sqrt{\\rho_1}|$ is one of the most fundamental quantities in quantum information theory for quantifying the closeness between two quantum states. Estimating the Uhlmann fidelity to within additive error $\\varepsilon$ requires a number of copies of the states, or queries to their state-preparation circuits, that depends at least linearly on the smaller of the ranks of $\\rho_0$ and $\\rho_1$. Consequently, this rank dependence disappears when either state is pure, in which case the query and sample complexities depend only polyn","authors_text":"Qisheng Wang, Yupan Liu","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-11T08:55:41Z","title":"Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10674","kind":"arxiv","version":1},"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:3d16b56c897b782fa42e1fbe48decec8729d93327e15cc89322dd4518e578381","target":"record","created_at":"2026-08-12T01:22:59Z","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":"4da2dc6bc41ca42ea9c57544efd2d96a77cfa6bf5f2cb7c9f19bf3ec60d65d55","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-11T08:55:41Z","title_canon_sha256":"e1a7c9bdae54bc02fa4b02501a989498a87d31c7ae623147055a3211c2c137dc"},"schema_version":"1.0","source":{"id":"2608.10674","kind":"arxiv","version":1}},"canonical_sha256":"dc56875c42a3b41664747b487bbe477e95c4ebe86e94333fb91e7a7545b99861","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc56875c42a3b41664747b487bbe477e95c4ebe86e94333fb91e7a7545b99861","first_computed_at":"2026-08-12T01:22:59.741092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:22:59.741092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WhwIQI0+rwVq98evD8N8u9v6aMBpRiNz854ofmr0KsbEroOoB/i2weeZruNRkR2z57eAeGiysW7kDTup/KDiBw==","signature_status":"signed_v1","signed_at":"2026-08-12T01:22:59.742688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.10674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d16b56c897b782fa42e1fbe48decec8729d93327e15cc89322dd4518e578381","sha256:fbab74d233edc0da9eae33035c153a8b51286c6b7ef156b423f119d1d0dbd4f4","sha256:4b2f15e9f9053f1e101a26c5bfaee1f705ca08702001a819234e76785823026a"],"state_sha256":"f44dd1e9f24b9fdec9d048f329ff486c6dbc38e0fcfaee758f784ef26e8100fa"}