{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WPJLURW4ZH2R6KN44CJWT32QRP","short_pith_number":"pith:WPJLURW4","canonical_record":{"source":{"id":"2112.15083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-30T14:51:39Z","cross_cats_sorted":[],"title_canon_sha256":"b7233ef64fd126476c86b9dbf5e18877304bcc51f181fd6f04c02e32f8a165ad","abstract_canon_sha256":"7b5c2be98330b032e07220b9ae944582717c88010a57174fb36f19f3252bd022"},"schema_version":"1.0"},"canonical_sha256":"b3d2ba46dcc9f51f29bce09369ef508be959bac6df43237225fb1707973e69c7","source":{"kind":"arxiv","id":"2112.15083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.15083","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"2112.15083v1","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.15083","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"WPJLURW4ZH2R","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"pith_short_16","alias_value":"WPJLURW4ZH2R6KN4","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"pith_short_8","alias_value":"WPJLURW4","created_at":"2026-07-05T03:44:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WPJLURW4ZH2R6KN44CJWT32QRP","target":"record","payload":{"canonical_record":{"source":{"id":"2112.15083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-30T14:51:39Z","cross_cats_sorted":[],"title_canon_sha256":"b7233ef64fd126476c86b9dbf5e18877304bcc51f181fd6f04c02e32f8a165ad","abstract_canon_sha256":"7b5c2be98330b032e07220b9ae944582717c88010a57174fb36f19f3252bd022"},"schema_version":"1.0"},"canonical_sha256":"b3d2ba46dcc9f51f29bce09369ef508be959bac6df43237225fb1707973e69c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:36.638574Z","signature_b64":"YYoiHXi4EGgiUI5lIQjjmhdSOkcYrD3TaBADDQ2EcgWPhB4jeFMRexioHr57OBYYXI6LXQB4wroOJXWunMH+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d2ba46dcc9f51f29bce09369ef508be959bac6df43237225fb1707973e69c7","last_reissued_at":"2026-07-05T03:44:36.638063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:36.638063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.15083","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-07-05T03:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFojGRXBQBd5qkIso/thw/YQszhRZAOsQSVv4BaHdOmT1gy8ugpcihSxJ4jAnytOt43LN4nQtfyGY0G//KooDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T23:10:52.366717Z"},"content_sha256":"4ac0c1d6c3dfe0532feb7c61650a2a847b212400418f6431b1a50ad7044c20a5","schema_version":"1.0","event_id":"sha256:4ac0c1d6c3dfe0532feb7c61650a2a847b212400418f6431b1a50ad7044c20a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WPJLURW4ZH2R6KN44CJWT32QRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical Sampling of Random Quantum Circuits with Bounded Fidelity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gleb Kalachev, Man-Hong Yung, Pavel Panteleev, Pengfei Zhou","submitted_at":"2021-12-30T14:51:39Z","abstract_excerpt":"Random circuit sampling has become a popular means for demonstrating the superiority of quantum computers over classical supercomputers. While quantum chips are evolving rapidly, classical sampling algorithms are also getting better and better. The major challenge is to generate bitstrings exhibiting an XEB fidelity above that of the quantum chips. Here we present a classical sampling algorithm for producing the probability distribution of any given random quantum circuit, where the fidelity can be rigorously bounded. Specifically, our algorithm performs rejection sampling after the introduced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.15083","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.15083/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:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jE495oKaMA6VKULquAQA89azqmBGO2QEPio2RL8He5ext3t6Jh6eYLaWytfZAZQvKQIv7kYAznrj2qwQ3611Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T23:10:52.367243Z"},"content_sha256":"ffa523f6fa01149fd4c5e0fe5e84207706acaeafcdf2a70650389a43e90fc499","schema_version":"1.0","event_id":"sha256:ffa523f6fa01149fd4c5e0fe5e84207706acaeafcdf2a70650389a43e90fc499"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPJLURW4ZH2R6KN44CJWT32QRP/bundle.json","state_url":"https://pith.science/pith/WPJLURW4ZH2R6KN44CJWT32QRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPJLURW4ZH2R6KN44CJWT32QRP/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-18T23:10:52Z","links":{"resolver":"https://pith.science/pith/WPJLURW4ZH2R6KN44CJWT32QRP","bundle":"https://pith.science/pith/WPJLURW4ZH2R6KN44CJWT32QRP/bundle.json","state":"https://pith.science/pith/WPJLURW4ZH2R6KN44CJWT32QRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPJLURW4ZH2R6KN44CJWT32QRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WPJLURW4ZH2R6KN44CJWT32QRP","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":"7b5c2be98330b032e07220b9ae944582717c88010a57174fb36f19f3252bd022","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-30T14:51:39Z","title_canon_sha256":"b7233ef64fd126476c86b9dbf5e18877304bcc51f181fd6f04c02e32f8a165ad"},"schema_version":"1.0","source":{"id":"2112.15083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.15083","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"2112.15083v1","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.15083","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"WPJLURW4ZH2R","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"pith_short_16","alias_value":"WPJLURW4ZH2R6KN4","created_at":"2026-07-05T03:44:36Z"},{"alias_kind":"pith_short_8","alias_value":"WPJLURW4","created_at":"2026-07-05T03:44:36Z"}],"graph_snapshots":[{"event_id":"sha256:ffa523f6fa01149fd4c5e0fe5e84207706acaeafcdf2a70650389a43e90fc499","target":"graph","created_at":"2026-07-05T03:44:36Z","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/2112.15083/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random circuit sampling has become a popular means for demonstrating the superiority of quantum computers over classical supercomputers. While quantum chips are evolving rapidly, classical sampling algorithms are also getting better and better. The major challenge is to generate bitstrings exhibiting an XEB fidelity above that of the quantum chips. Here we present a classical sampling algorithm for producing the probability distribution of any given random quantum circuit, where the fidelity can be rigorously bounded. Specifically, our algorithm performs rejection sampling after the introduced","authors_text":"Gleb Kalachev, Man-Hong Yung, Pavel Panteleev, Pengfei Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-30T14:51:39Z","title":"Classical Sampling of Random Quantum Circuits with Bounded Fidelity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.15083","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:4ac0c1d6c3dfe0532feb7c61650a2a847b212400418f6431b1a50ad7044c20a5","target":"record","created_at":"2026-07-05T03:44:36Z","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":"7b5c2be98330b032e07220b9ae944582717c88010a57174fb36f19f3252bd022","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-30T14:51:39Z","title_canon_sha256":"b7233ef64fd126476c86b9dbf5e18877304bcc51f181fd6f04c02e32f8a165ad"},"schema_version":"1.0","source":{"id":"2112.15083","kind":"arxiv","version":1}},"canonical_sha256":"b3d2ba46dcc9f51f29bce09369ef508be959bac6df43237225fb1707973e69c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3d2ba46dcc9f51f29bce09369ef508be959bac6df43237225fb1707973e69c7","first_computed_at":"2026-07-05T03:44:36.638063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:36.638063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYoiHXi4EGgiUI5lIQjjmhdSOkcYrD3TaBADDQ2EcgWPhB4jeFMRexioHr57OBYYXI6LXQB4wroOJXWunMH+AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:36.638574Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.15083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ac0c1d6c3dfe0532feb7c61650a2a847b212400418f6431b1a50ad7044c20a5","sha256:ffa523f6fa01149fd4c5e0fe5e84207706acaeafcdf2a70650389a43e90fc499"],"state_sha256":"a94fb28fb4a11d9d232343942d7f0377836304c60a757799348afb6f18a9da0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNzKCEQKJ2+9aG1tPmh+1jbWHRgjr5WkFd24bTWRRwvBn9zDnUTT9zqffJMTmnRqO7JhtZNt5yjGX6yw69vkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T23:10:52.371891Z","bundle_sha256":"c30204f296d2a2adf0259ceb83f04e2c132e71f27c0cab4210e5f04c0b271be1"}}