{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XTWKD5QGCGVMKDXKOZQONBSCCT","short_pith_number":"pith:XTWKD5QG","canonical_record":{"source":{"id":"1712.05384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-14T18:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"05d6170e7f425ef7d369a3b263d6d824af2db1616f3618f4e3885966d2ebc119","abstract_canon_sha256":"5f88ac0d13760c91c7a71ed04d36baa05b46b6ac39d39bdb246f42ce71dd0974"},"schema_version":"1.0"},"canonical_sha256":"bceca1f60611aac50eea7660e6864214facdec6eaddd3f73480d80f76e8f9704","source":{"kind":"arxiv","id":"1712.05384","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05384","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05384v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05384","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"XTWKD5QGCGVM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XTWKD5QGCGVMKDXK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XTWKD5QG","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XTWKD5QGCGVMKDXKOZQONBSCCT","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-14T18:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"05d6170e7f425ef7d369a3b263d6d824af2db1616f3618f4e3885966d2ebc119","abstract_canon_sha256":"5f88ac0d13760c91c7a71ed04d36baa05b46b6ac39d39bdb246f42ce71dd0974"},"schema_version":"1.0"},"canonical_sha256":"bceca1f60611aac50eea7660e6864214facdec6eaddd3f73480d80f76e8f9704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:28.601436Z","signature_b64":"CyEKvjHEtJUJAxHC/6BGO6CAtG/El3/IaYI1ko2DwTPinffEXF5x7U/OS8UNHfgRW8JHcZjBoZuwdnZHi3eNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bceca1f60611aac50eea7660e6864214facdec6eaddd3f73480d80f76e8f9704","last_reissued_at":"2026-05-18T00:25:28.600767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:28.600767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05384","source_version":2,"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-18T00:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5kb6PrnFUHaj5F8Fy1R0VH+zb7/zb0G4I7X4IV4QugTLHJH0OENGNaf3tCdo08QCS3Dz1PbOgy59Tay26WFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:08:54.161712Z"},"content_sha256":"6f5994056e49e10af9e9e97155d3ddd7a12c39bbfb618cfbb4dc30bdb61a0f74","schema_version":"1.0","event_id":"sha256:6f5994056e49e10af9e9e97155d3ddd7a12c39bbfb618cfbb4dc30bdb61a0f74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XTWKD5QGCGVMKDXKOZQONBSCCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulation of low-depth quantum circuits as complex undirected graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hartmut Neven, Sergei V. Isakov, Sergio Boixo, Vadim N. Smelyanskiy","submitted_at":"2017-12-14T18:35:09Z","abstract_excerpt":"Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical algorithms on state-of-the-art computers, achieving the first milestone of so-called quantum supremacy. This has stimulated recent progress in classical algorithms to simulate quantum circuits. Classical simulations are also necessary to approximate the fidelity of multiqubit quantum computers using cross entropy benchmarking. Here we present numerical results of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05384","kind":"arxiv","version":2},"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-18T00:25:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/jLnYXIkbHlTUaWcHZQn/HKpUro4Wl+PmoD0bYG+uSDxlneE6I2xJF01R4ZlnBf7W3H7j1b+271DsvKLJNUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:08:54.162057Z"},"content_sha256":"6d612d3957a379484f9e0efa15d6f332b060cd7878e5b5cc51773fb3a5bc6095","schema_version":"1.0","event_id":"sha256:6d612d3957a379484f9e0efa15d6f332b060cd7878e5b5cc51773fb3a5bc6095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTWKD5QGCGVMKDXKOZQONBSCCT/bundle.json","state_url":"https://pith.science/pith/XTWKD5QGCGVMKDXKOZQONBSCCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTWKD5QGCGVMKDXKOZQONBSCCT/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-21T18:08:54Z","links":{"resolver":"https://pith.science/pith/XTWKD5QGCGVMKDXKOZQONBSCCT","bundle":"https://pith.science/pith/XTWKD5QGCGVMKDXKOZQONBSCCT/bundle.json","state":"https://pith.science/pith/XTWKD5QGCGVMKDXKOZQONBSCCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTWKD5QGCGVMKDXKOZQONBSCCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XTWKD5QGCGVMKDXKOZQONBSCCT","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":"5f88ac0d13760c91c7a71ed04d36baa05b46b6ac39d39bdb246f42ce71dd0974","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-14T18:35:09Z","title_canon_sha256":"05d6170e7f425ef7d369a3b263d6d824af2db1616f3618f4e3885966d2ebc119"},"schema_version":"1.0","source":{"id":"1712.05384","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05384","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05384v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05384","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"XTWKD5QGCGVM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XTWKD5QGCGVMKDXK","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XTWKD5QG","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:6d612d3957a379484f9e0efa15d6f332b060cd7878e5b5cc51773fb3a5bc6095","target":"graph","created_at":"2026-05-18T00:25:28Z","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":"Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical algorithms on state-of-the-art computers, achieving the first milestone of so-called quantum supremacy. This has stimulated recent progress in classical algorithms to simulate quantum circuits. Classical simulations are also necessary to approximate the fidelity of multiqubit quantum computers using cross entropy benchmarking. Here we present numerical results of","authors_text":"Hartmut Neven, Sergei V. Isakov, Sergio Boixo, Vadim N. Smelyanskiy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-14T18:35:09Z","title":"Simulation of low-depth quantum circuits as complex undirected graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05384","kind":"arxiv","version":2},"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:6f5994056e49e10af9e9e97155d3ddd7a12c39bbfb618cfbb4dc30bdb61a0f74","target":"record","created_at":"2026-05-18T00:25:28Z","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":"5f88ac0d13760c91c7a71ed04d36baa05b46b6ac39d39bdb246f42ce71dd0974","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-14T18:35:09Z","title_canon_sha256":"05d6170e7f425ef7d369a3b263d6d824af2db1616f3618f4e3885966d2ebc119"},"schema_version":"1.0","source":{"id":"1712.05384","kind":"arxiv","version":2}},"canonical_sha256":"bceca1f60611aac50eea7660e6864214facdec6eaddd3f73480d80f76e8f9704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bceca1f60611aac50eea7660e6864214facdec6eaddd3f73480d80f76e8f9704","first_computed_at":"2026-05-18T00:25:28.600767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:28.600767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CyEKvjHEtJUJAxHC/6BGO6CAtG/El3/IaYI1ko2DwTPinffEXF5x7U/OS8UNHfgRW8JHcZjBoZuwdnZHi3eNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:28.601436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05384","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f5994056e49e10af9e9e97155d3ddd7a12c39bbfb618cfbb4dc30bdb61a0f74","sha256:6d612d3957a379484f9e0efa15d6f332b060cd7878e5b5cc51773fb3a5bc6095"],"state_sha256":"2e150356b109b1d351685a4a1d47c798f073342d46cf6c0ae0661808cafcddaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDaRwA7I9Hc5fGcuyHEDksfsytBrBlZaUTRhlsRmkZ+XT9QFkAn8+w3F9L8+ECgHd2MS4SSrHhyY+GKmnJcbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:08:54.164157Z","bundle_sha256":"7f039ee85f42d524c51e1701f26b58e0f7ac24eeb66407c80d9d78efab3bfb61"}}