{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K3IWD7ATIL4DETHQBI2CIAFW2K","short_pith_number":"pith:K3IWD7AT","canonical_record":{"source":{"id":"1510.02720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-09T16:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"8b10da5b332120651e7bc4decdc84d0d592346b65d108f3815459417938fb296","abstract_canon_sha256":"6b6ea048965fcbc66a24012491cc0ecabbe8f9b89e333c26bfacdfd367cac76c"},"schema_version":"1.0"},"canonical_sha256":"56d161fc1342f8324cf00a342400b6d2ba69da0940603f509b1d0ba843f56a24","source":{"kind":"arxiv","id":"1510.02720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02720","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02720v1","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02720","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"K3IWD7ATIL4D","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K3IWD7ATIL4DETHQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K3IWD7AT","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K3IWD7ATIL4DETHQBI2CIAFW2K","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-09T16:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"8b10da5b332120651e7bc4decdc84d0d592346b65d108f3815459417938fb296","abstract_canon_sha256":"6b6ea048965fcbc66a24012491cc0ecabbe8f9b89e333c26bfacdfd367cac76c"},"schema_version":"1.0"},"canonical_sha256":"56d161fc1342f8324cf00a342400b6d2ba69da0940603f509b1d0ba843f56a24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:29.219963Z","signature_b64":"O/zuV2ZZREZgytXBsqZgciW5SP9iKvcZoZ8KzPySGHARNf6BDqc4C1eIwVKRcLURjt/KIN8CRXauz73786OxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56d161fc1342f8324cf00a342400b6d2ba69da0940603f509b1d0ba843f56a24","last_reissued_at":"2026-05-18T01:14:29.219442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:29.219442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02720","source_version":1,"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-18T01:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBi+bI2JvMVDSqn2OiFyMMVrA2iIp18B/1Btpenqi5gv2dafoN7R1wj0JFLS/I3jUd0hzthqVxnQKosC06nWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:22:10.197545Z"},"content_sha256":"942248e8bee55ca72f6a89b9f86fcc62a7d48d85727a7cec18c516573ac9e367","schema_version":"1.0","event_id":"sha256:942248e8bee55ca72f6a89b9f86fcc62a7d48d85727a7cec18c516573ac9e367"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K3IWD7ATIL4DETHQBI2CIAFW2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable randomized benchmarking of non-Clifford gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Easwar Magesan, Jay M. Gambetta, John A. Smolin, Lev S. Bishop","submitted_at":"2015-10-09T16:06:32Z","abstract_excerpt":"Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over $n$-qubit unitary matrices that correspond to protected non-Clifford gates for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02720","kind":"arxiv","version":1},"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-18T01:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crtvjUWG4goGeZdtr+eq2e0ecUsVWAWOSfDMUKi6ZkzWuwqdzgoamv71nohpT4Y/zj45PzyCEuhRRCVGtTm4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:22:10.198160Z"},"content_sha256":"6e30e97d8b23e84a15e594281bfcb3a6339f65d1f53295b34c5600686f3a2cea","schema_version":"1.0","event_id":"sha256:6e30e97d8b23e84a15e594281bfcb3a6339f65d1f53295b34c5600686f3a2cea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3IWD7ATIL4DETHQBI2CIAFW2K/bundle.json","state_url":"https://pith.science/pith/K3IWD7ATIL4DETHQBI2CIAFW2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3IWD7ATIL4DETHQBI2CIAFW2K/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-05-25T20:22:10Z","links":{"resolver":"https://pith.science/pith/K3IWD7ATIL4DETHQBI2CIAFW2K","bundle":"https://pith.science/pith/K3IWD7ATIL4DETHQBI2CIAFW2K/bundle.json","state":"https://pith.science/pith/K3IWD7ATIL4DETHQBI2CIAFW2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3IWD7ATIL4DETHQBI2CIAFW2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K3IWD7ATIL4DETHQBI2CIAFW2K","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":"6b6ea048965fcbc66a24012491cc0ecabbe8f9b89e333c26bfacdfd367cac76c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-09T16:06:32Z","title_canon_sha256":"8b10da5b332120651e7bc4decdc84d0d592346b65d108f3815459417938fb296"},"schema_version":"1.0","source":{"id":"1510.02720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02720","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02720v1","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02720","created_at":"2026-05-18T01:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"K3IWD7ATIL4D","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K3IWD7ATIL4DETHQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K3IWD7AT","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6e30e97d8b23e84a15e594281bfcb3a6339f65d1f53295b34c5600686f3a2cea","target":"graph","created_at":"2026-05-18T01:14:29Z","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":"Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over $n$-qubit unitary matrices that correspond to protected non-Clifford gates for a","authors_text":"Andrew W. Cross, Easwar Magesan, Jay M. Gambetta, John A. Smolin, Lev S. Bishop","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-09T16:06:32Z","title":"Scalable randomized benchmarking of non-Clifford gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02720","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:942248e8bee55ca72f6a89b9f86fcc62a7d48d85727a7cec18c516573ac9e367","target":"record","created_at":"2026-05-18T01:14:29Z","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":"6b6ea048965fcbc66a24012491cc0ecabbe8f9b89e333c26bfacdfd367cac76c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-09T16:06:32Z","title_canon_sha256":"8b10da5b332120651e7bc4decdc84d0d592346b65d108f3815459417938fb296"},"schema_version":"1.0","source":{"id":"1510.02720","kind":"arxiv","version":1}},"canonical_sha256":"56d161fc1342f8324cf00a342400b6d2ba69da0940603f509b1d0ba843f56a24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56d161fc1342f8324cf00a342400b6d2ba69da0940603f509b1d0ba843f56a24","first_computed_at":"2026-05-18T01:14:29.219442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:29.219442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O/zuV2ZZREZgytXBsqZgciW5SP9iKvcZoZ8KzPySGHARNf6BDqc4C1eIwVKRcLURjt/KIN8CRXauz73786OxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:29.219963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:942248e8bee55ca72f6a89b9f86fcc62a7d48d85727a7cec18c516573ac9e367","sha256:6e30e97d8b23e84a15e594281bfcb3a6339f65d1f53295b34c5600686f3a2cea"],"state_sha256":"f66ea90a73c2950cd0d7020a84005eaba8e98b3a756086bf154854bc221156ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CoNH7VDA+slJ8Vw6pngXIdsXIZL3jVo13oHuNnLaUMZrMlJF5R5a2uWUCfDHVwXPace5Bvv9xff3kuUAa2KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:22:10.201392Z","bundle_sha256":"e0e747ba76c78c7a454983972718b7be3b157a1de42e9bd282cde4f700bb4f3b"}}