{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4KWEXXHAP3X72VHXA3VTH77KLC","short_pith_number":"pith:4KWEXXHA","canonical_record":{"source":{"id":"2005.05172","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-11T15:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"d9ee4a989b3a028539fde9ec69c6fb8218eb527947f172ffc8c8fbe93be0b17d","abstract_canon_sha256":"70a6ecd64ee4bc39800a6059fd2060341a7d6d8f93361d9e15170951d8d76fee"},"schema_version":"1.0"},"canonical_sha256":"e2ac4bdce07eeffd54f706eb33ffea589f169ea239287ddca607f212c8d34b58","source":{"kind":"arxiv","id":"2005.05172","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.05172","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"2005.05172v3","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05172","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"4KWEXXHAP3X7","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KWEXXHAP3X72VHX","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KWEXXHA","created_at":"2026-07-05T03:13:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4KWEXXHAP3X72VHXA3VTH77KLC","target":"record","payload":{"canonical_record":{"source":{"id":"2005.05172","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-11T15:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"d9ee4a989b3a028539fde9ec69c6fb8218eb527947f172ffc8c8fbe93be0b17d","abstract_canon_sha256":"70a6ecd64ee4bc39800a6059fd2060341a7d6d8f93361d9e15170951d8d76fee"},"schema_version":"1.0"},"canonical_sha256":"e2ac4bdce07eeffd54f706eb33ffea589f169ea239287ddca607f212c8d34b58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:00.065912Z","signature_b64":"+rO+9shHKqddMOqtFwkngFju3GoQWE4+n71lum0KYLS1QcI6UHhor035hprV+P0usafp1Zt99Pon8die3vq7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ac4bdce07eeffd54f706eb33ffea589f169ea239287ddca607f212c8d34b58","last_reissued_at":"2026-07-05T03:13:00.065434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:00.065434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.05172","source_version":3,"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-07-05T03:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1hK+ObW2if9G2+lCIijqdLeB4XSvTkL93JRE50cQz7J5DcjT65L6mAq/M4u5nAmhGt3EExSKskDzeTXLBMeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:04:50.098619Z"},"content_sha256":"d7dcbd18dfd75b196df6018506631281d59ccfee71bd80bfbfc2ea703dc667d4","schema_version":"1.0","event_id":"sha256:d7dcbd18dfd75b196df6018506631281d59ccfee71bd80bfbfc2ea703dc667d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4KWEXXHAP3X72VHXA3VTH77KLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measurement cost of metric-aware variational quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"B\\'alint Koczor, Barnaby van Straaten","submitted_at":"2020-05-11T15:06:29Z","abstract_excerpt":"Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits need to be executed for sufficiently reducing shot-noise. We consider metric-aware quantum algorithms: variational algorithms that use a quantum computer to efficiently estimate both a matrix and a vector object. For example, the recently introduced quantum natural gradient approach uses the quantum Fisher information matrix as a metric tensor to correct th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05172","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/2005.05172/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"},"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-07-05T03:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzCibB0SHMEurMQBvHXRMJypQZCGHs1jDow1B06Xa7tikNhVGw95m0BlcUksaCq/roVi4CObjg0s2XUH4b9EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:04:50.099550Z"},"content_sha256":"4cc7e563715f63ef67818aa9873752659d546930c206cd33f2d8419bea32294a","schema_version":"1.0","event_id":"sha256:4cc7e563715f63ef67818aa9873752659d546930c206cd33f2d8419bea32294a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KWEXXHAP3X72VHXA3VTH77KLC/bundle.json","state_url":"https://pith.science/pith/4KWEXXHAP3X72VHXA3VTH77KLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KWEXXHAP3X72VHXA3VTH77KLC/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-16T05:04:50Z","links":{"resolver":"https://pith.science/pith/4KWEXXHAP3X72VHXA3VTH77KLC","bundle":"https://pith.science/pith/4KWEXXHAP3X72VHXA3VTH77KLC/bundle.json","state":"https://pith.science/pith/4KWEXXHAP3X72VHXA3VTH77KLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KWEXXHAP3X72VHXA3VTH77KLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4KWEXXHAP3X72VHXA3VTH77KLC","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":"70a6ecd64ee4bc39800a6059fd2060341a7d6d8f93361d9e15170951d8d76fee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-11T15:06:29Z","title_canon_sha256":"d9ee4a989b3a028539fde9ec69c6fb8218eb527947f172ffc8c8fbe93be0b17d"},"schema_version":"1.0","source":{"id":"2005.05172","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.05172","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"2005.05172v3","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05172","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"4KWEXXHAP3X7","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KWEXXHAP3X72VHX","created_at":"2026-07-05T03:13:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KWEXXHA","created_at":"2026-07-05T03:13:00Z"}],"graph_snapshots":[{"event_id":"sha256:4cc7e563715f63ef67818aa9873752659d546930c206cd33f2d8419bea32294a","target":"graph","created_at":"2026-07-05T03:13:00Z","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/2005.05172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits need to be executed for sufficiently reducing shot-noise. We consider metric-aware quantum algorithms: variational algorithms that use a quantum computer to efficiently estimate both a matrix and a vector object. For example, the recently introduced quantum natural gradient approach uses the quantum Fisher information matrix as a metric tensor to correct th","authors_text":"B\\'alint Koczor, Barnaby van Straaten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-11T15:06:29Z","title":"Measurement cost of metric-aware variational quantum algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05172","kind":"arxiv","version":3},"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:d7dcbd18dfd75b196df6018506631281d59ccfee71bd80bfbfc2ea703dc667d4","target":"record","created_at":"2026-07-05T03:13:00Z","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":"70a6ecd64ee4bc39800a6059fd2060341a7d6d8f93361d9e15170951d8d76fee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-11T15:06:29Z","title_canon_sha256":"d9ee4a989b3a028539fde9ec69c6fb8218eb527947f172ffc8c8fbe93be0b17d"},"schema_version":"1.0","source":{"id":"2005.05172","kind":"arxiv","version":3}},"canonical_sha256":"e2ac4bdce07eeffd54f706eb33ffea589f169ea239287ddca607f212c8d34b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2ac4bdce07eeffd54f706eb33ffea589f169ea239287ddca607f212c8d34b58","first_computed_at":"2026-07-05T03:13:00.065434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:13:00.065434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+rO+9shHKqddMOqtFwkngFju3GoQWE4+n71lum0KYLS1QcI6UHhor035hprV+P0usafp1Zt99Pon8die3vq7CA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:13:00.065912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.05172","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7dcbd18dfd75b196df6018506631281d59ccfee71bd80bfbfc2ea703dc667d4","sha256:4cc7e563715f63ef67818aa9873752659d546930c206cd33f2d8419bea32294a"],"state_sha256":"45c49eda29b754c528a7936830b65a7fcc0191e3c3884857c18aba4ccd2ac77e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCUEhgD73rem4rWsGO5FwTILt1zN0tT6Bw+B9/ayqd/VGlZCGB9vWxrewb72sLw1T6sf4XE/eQbqL3ev1tlvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:04:50.107141Z","bundle_sha256":"d571ff2d46cb9317e51f582b2aecd1db8b03e965104b0fdaf8690ccbca00eb56"}}