{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WSZIWOZMNN2RSYCBAL3YSNUBZY","short_pith_number":"pith:WSZIWOZM","canonical_record":{"source":{"id":"2008.06011","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-13T16:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"126ed8514af4b9098eb6210dde7f5481285a260d1b5aa7fb185627240bff3ef1","abstract_canon_sha256":"2052c818c6f1a619f389d729d110b009bde9e14d6717035c97a0ae9c595131c1"},"schema_version":"1.0"},"canonical_sha256":"b4b28b3b2c6b7519604102f7893681ce02dd15d81479deda96cd9f985f2f3f8c","source":{"kind":"arxiv","id":"2008.06011","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.06011","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"2008.06011v4","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06011","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"WSZIWOZMNN2R","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"pith_short_16","alias_value":"WSZIWOZMNN2RSYCB","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"pith_short_8","alias_value":"WSZIWOZM","created_at":"2026-07-05T03:06:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WSZIWOZMNN2RSYCBAL3YSNUBZY","target":"record","payload":{"canonical_record":{"source":{"id":"2008.06011","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-13T16:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"126ed8514af4b9098eb6210dde7f5481285a260d1b5aa7fb185627240bff3ef1","abstract_canon_sha256":"2052c818c6f1a619f389d729d110b009bde9e14d6717035c97a0ae9c595131c1"},"schema_version":"1.0"},"canonical_sha256":"b4b28b3b2c6b7519604102f7893681ce02dd15d81479deda96cd9f985f2f3f8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:06:12.753522Z","signature_b64":"CVkmOq8Y4dHN/FaS+DSLHr1dWRj4LR3/zW3uhR1FMaMl42z/EbPrL+CnjrgQht01TTSL5i7h3YOWqSAOMBOeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4b28b3b2c6b7519604102f7893681ce02dd15d81479deda96cd9f985f2f3f8c","last_reissued_at":"2026-07-05T03:06:12.752958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:06:12.752958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.06011","source_version":4,"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:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABCHSwGg23WYqZbDc3fhmMqfL1R9+tk3kRe1wMSdmnFnxKK+ZLEHv0W7psbfPRiy/vjw2WR/R0ASCs0NeOgiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:03:16.839105Z"},"content_sha256":"0f1419d181e86e8ea7cc8a80d233129cf3b33c1a36f415bbf03b2def072c2808","schema_version":"1.0","event_id":"sha256:0f1419d181e86e8ea7cc8a80d233129cf3b33c1a36f415bbf03b2def072c2808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WSZIWOZMNN2RSYCBAL3YSNUBZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple method for sampling random Clifford operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ewout van den Berg","submitted_at":"2020-08-13T16:56:42Z","abstract_excerpt":"We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of $\\mathcal{O}(n\\log n)$ on fully connected topologies. The circuit can be output in a streaming fashion as the algorithm proceeds, and different parts of the circuit can be generated in parallel. The algorithm has an $\\mathcal{O}(n^2)$ time complexity, which matches the current state of the art. The main advantage of the proposed algorithm, however, lies in its s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06011","kind":"arxiv","version":4},"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/2008.06011/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:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szW66NHkFPnLNgOvNfFOi28cOF+GSfNXm+/wWpsTCpZkOxEpq2w4o0tbq9iEi4Rn1DgBeDsUdU4ugPXYA3crBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:03:16.839608Z"},"content_sha256":"5d6938367352883fdb6734a3875c8cea8fc7b7abfe76957b1d2cc5f874d4cd58","schema_version":"1.0","event_id":"sha256:5d6938367352883fdb6734a3875c8cea8fc7b7abfe76957b1d2cc5f874d4cd58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY/bundle.json","state_url":"https://pith.science/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY/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-15T13:03:16Z","links":{"resolver":"https://pith.science/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY","bundle":"https://pith.science/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY/bundle.json","state":"https://pith.science/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSZIWOZMNN2RSYCBAL3YSNUBZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WSZIWOZMNN2RSYCBAL3YSNUBZY","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":"2052c818c6f1a619f389d729d110b009bde9e14d6717035c97a0ae9c595131c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-13T16:56:42Z","title_canon_sha256":"126ed8514af4b9098eb6210dde7f5481285a260d1b5aa7fb185627240bff3ef1"},"schema_version":"1.0","source":{"id":"2008.06011","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.06011","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"2008.06011v4","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06011","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"WSZIWOZMNN2R","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"pith_short_16","alias_value":"WSZIWOZMNN2RSYCB","created_at":"2026-07-05T03:06:12Z"},{"alias_kind":"pith_short_8","alias_value":"WSZIWOZM","created_at":"2026-07-05T03:06:12Z"}],"graph_snapshots":[{"event_id":"sha256:5d6938367352883fdb6734a3875c8cea8fc7b7abfe76957b1d2cc5f874d4cd58","target":"graph","created_at":"2026-07-05T03:06:12Z","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/2008.06011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of $\\mathcal{O}(n\\log n)$ on fully connected topologies. The circuit can be output in a streaming fashion as the algorithm proceeds, and different parts of the circuit can be generated in parallel. The algorithm has an $\\mathcal{O}(n^2)$ time complexity, which matches the current state of the art. The main advantage of the proposed algorithm, however, lies in its s","authors_text":"Ewout van den Berg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-13T16:56:42Z","title":"A simple method for sampling random Clifford operators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06011","kind":"arxiv","version":4},"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:0f1419d181e86e8ea7cc8a80d233129cf3b33c1a36f415bbf03b2def072c2808","target":"record","created_at":"2026-07-05T03:06:12Z","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":"2052c818c6f1a619f389d729d110b009bde9e14d6717035c97a0ae9c595131c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-13T16:56:42Z","title_canon_sha256":"126ed8514af4b9098eb6210dde7f5481285a260d1b5aa7fb185627240bff3ef1"},"schema_version":"1.0","source":{"id":"2008.06011","kind":"arxiv","version":4}},"canonical_sha256":"b4b28b3b2c6b7519604102f7893681ce02dd15d81479deda96cd9f985f2f3f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4b28b3b2c6b7519604102f7893681ce02dd15d81479deda96cd9f985f2f3f8c","first_computed_at":"2026-07-05T03:06:12.752958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:06:12.752958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CVkmOq8Y4dHN/FaS+DSLHr1dWRj4LR3/zW3uhR1FMaMl42z/EbPrL+CnjrgQht01TTSL5i7h3YOWqSAOMBOeDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:06:12.753522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.06011","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f1419d181e86e8ea7cc8a80d233129cf3b33c1a36f415bbf03b2def072c2808","sha256:5d6938367352883fdb6734a3875c8cea8fc7b7abfe76957b1d2cc5f874d4cd58"],"state_sha256":"098651579bc3c0a97a6b9d8575511c58a21e3833166400ee37fb18314093b7b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiBAeaVg3MaWo9mStjbU/bi1AYpjqJkhtr73dfYaBPc/d3CpFtzDDXMKHTRsPR/pAEMHOr5e/sbnGs9Vu4pkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:03:16.844778Z","bundle_sha256":"088054f131d29f83724a08b8f848c492e5fcaaa515a79b02532e676a25e527e8"}}