{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HCFJWIBLLNPZAS4BX5TO6B3YHE","short_pith_number":"pith:HCFJWIBL","schema_version":"1.0","canonical_sha256":"388a9b202b5b5f904b81bf66ef0778390cdc159183bfbe998002525aa16d75ce","source":{"kind":"arxiv","id":"2211.02623","version":3},"attestation_state":"computed","paper":{"title":"Efficiently computing the Uhlmann fidelity for density matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Baldwin, Jonathan A. Jones","submitted_at":"2022-11-04T17:40:43Z","abstract_excerpt":"We consider the problem of efficiently computing the Uhlmann fidelity in the case when explicit density matrix descriptions are available. We derive an alternative formula which is simpler to evaluate numerically, saving a factor of 10 in time for large matrices."},"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":"2211.02623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-04T17:40:43Z","cross_cats_sorted":[],"title_canon_sha256":"bc633cccb20cbee3760400cfc8635788083b4508aed4e0862e001a6cf242894a","abstract_canon_sha256":"5aa8cc7fbd0ecac1c0cc0b84768996ae45012069e314d8792d2060903f62ce53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:05.499183Z","signature_b64":"4cidCMlz2/hXPYC/2odsImWrJLL+T1m7/vdIveUWt3EqFJ+GpOwCrCvJMd3fgpMJ5J26vAwFG/arFE3gXdZyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"388a9b202b5b5f904b81bf66ef0778390cdc159183bfbe998002525aa16d75ce","last_reissued_at":"2026-07-05T05:36:05.498605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:05.498605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently computing the Uhlmann fidelity for density matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Baldwin, Jonathan A. Jones","submitted_at":"2022-11-04T17:40:43Z","abstract_excerpt":"We consider the problem of efficiently computing the Uhlmann fidelity in the case when explicit density matrix descriptions are available. We derive an alternative formula which is simpler to evaluate numerically, saving a factor of 10 in time for large matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02623","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.02623/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.02623","created_at":"2026-07-05T05:36:05.498663+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.02623v3","created_at":"2026-07-05T05:36:05.498663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02623","created_at":"2026-07-05T05:36:05.498663+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCFJWIBLLNPZ","created_at":"2026-07-05T05:36:05.498663+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCFJWIBLLNPZAS4B","created_at":"2026-07-05T05:36:05.498663+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCFJWIBL","created_at":"2026-07-05T05:36:05.498663+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.09417","citing_title":"Efficient computation of average subsystem Bures distance between fermionic Gaussian states","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE","json":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE.json","graph_json":"https://pith.science/api/pith-number/HCFJWIBLLNPZAS4BX5TO6B3YHE/graph.json","events_json":"https://pith.science/api/pith-number/HCFJWIBLLNPZAS4BX5TO6B3YHE/events.json","paper":"https://pith.science/paper/HCFJWIBL"},"agent_actions":{"view_html":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE","download_json":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE.json","view_paper":"https://pith.science/paper/HCFJWIBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.02623&json=true","fetch_graph":"https://pith.science/api/pith-number/HCFJWIBLLNPZAS4BX5TO6B3YHE/graph.json","fetch_events":"https://pith.science/api/pith-number/HCFJWIBLLNPZAS4BX5TO6B3YHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE/action/storage_attestation","attest_author":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE/action/author_attestation","sign_citation":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE/action/citation_signature","submit_replication":"https://pith.science/pith/HCFJWIBLLNPZAS4BX5TO6B3YHE/action/replication_record"}},"created_at":"2026-07-05T05:36:05.498663+00:00","updated_at":"2026-07-05T05:36:05.498663+00:00"}