{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U6IR4L7BMNYRNKH3OECCHDRU33","short_pith_number":"pith:U6IR4L7B","canonical_record":{"source":{"id":"1504.07999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-29T20:01:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ecc18b6adea83121d8d3c43ce036dedff3f3b432d9814438dcd1382a3bf12618","abstract_canon_sha256":"77648d3a156e422d9717b402216040d0f05abe36ec1900b59925426c69680d0a"},"schema_version":"1.0"},"canonical_sha256":"a7911e2fe1637116a8fb7104238e34dece83344d8fb3d667a863dcff97b9f57a","source":{"kind":"arxiv","id":"1504.07999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07999","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07999v2","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07999","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"U6IR4L7BMNYR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U6IR4L7BMNYRNKH3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U6IR4L7B","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U6IR4L7BMNYRNKH3OECCHDRU33","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-29T20:01:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ecc18b6adea83121d8d3c43ce036dedff3f3b432d9814438dcd1382a3bf12618","abstract_canon_sha256":"77648d3a156e422d9717b402216040d0f05abe36ec1900b59925426c69680d0a"},"schema_version":"1.0"},"canonical_sha256":"a7911e2fe1637116a8fb7104238e34dece83344d8fb3d667a863dcff97b9f57a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:13.359134Z","signature_b64":"Y0p+ry9cM9ONzx+9Pz4lricFqOYzNOOGcFgqWSW8Qkm8SP8Fi51bx6sCCVpHZC2GFPoDDbq5gWD8ICU73tSYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7911e2fe1637116a8fb7104238e34dece83344d8fb3d667a863dcff97b9f57a","last_reissued_at":"2026-05-18T01:08:13.358564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:13.358564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07999","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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2aUHacOnssiFv2jrrWD4r89zS1we0oyEw0rfW8g4/bd+yYCRPGCDwvyLR3Dp9AbFtKD1j6TqEbUtq6EEMSiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:21:40.526879Z"},"content_sha256":"babcc6001ed7affa5d1eacaba2bd2251a1a45ba71e27a19f40a3311c8e327ce0","schema_version":"1.0","event_id":"sha256:babcc6001ed7affa5d1eacaba2bd2251a1a45ba71e27a19f40a3311c8e327ce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U6IR4L7BMNYRNKH3OECCHDRU33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-case complexity versus approximate simulation of commuting quantum computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Dan J. Shepherd, Michael J. Bremner","submitted_at":"2015-04-29T20:01:21Z","abstract_excerpt":"We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show that, if either of two plausible average-case hardness conjectures holds, then IQP computations are hard to simulate classically up to constant additive error. One conjecture relates to the hardness of estimating the complex-temperature partition function for random instances of the Ising model; the other concerns approximating the number of zeroes of random low-degree polynomials. We observe that b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07999","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-18T01:08:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iRrKvfoNk/ENE7lVrwHNbOi+vGu2CBm6t3jMoXaqrfCZHA+K9WtAGF5R/4u3wYx/amIBAWXToMKf2D3tQc5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:21:40.527545Z"},"content_sha256":"cd867e725f32d673c9fce6a344aea62ccbc85c2a2d7daad2911cd2de9632d7b3","schema_version":"1.0","event_id":"sha256:cd867e725f32d673c9fce6a344aea62ccbc85c2a2d7daad2911cd2de9632d7b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6IR4L7BMNYRNKH3OECCHDRU33/bundle.json","state_url":"https://pith.science/pith/U6IR4L7BMNYRNKH3OECCHDRU33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6IR4L7BMNYRNKH3OECCHDRU33/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-26T23:21:40Z","links":{"resolver":"https://pith.science/pith/U6IR4L7BMNYRNKH3OECCHDRU33","bundle":"https://pith.science/pith/U6IR4L7BMNYRNKH3OECCHDRU33/bundle.json","state":"https://pith.science/pith/U6IR4L7BMNYRNKH3OECCHDRU33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6IR4L7BMNYRNKH3OECCHDRU33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U6IR4L7BMNYRNKH3OECCHDRU33","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":"77648d3a156e422d9717b402216040d0f05abe36ec1900b59925426c69680d0a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-29T20:01:21Z","title_canon_sha256":"ecc18b6adea83121d8d3c43ce036dedff3f3b432d9814438dcd1382a3bf12618"},"schema_version":"1.0","source":{"id":"1504.07999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07999","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07999v2","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07999","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"U6IR4L7BMNYR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U6IR4L7BMNYRNKH3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U6IR4L7B","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:cd867e725f32d673c9fce6a344aea62ccbc85c2a2d7daad2911cd2de9632d7b3","target":"graph","created_at":"2026-05-18T01:08:13Z","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":"We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show that, if either of two plausible average-case hardness conjectures holds, then IQP computations are hard to simulate classically up to constant additive error. One conjecture relates to the hardness of estimating the complex-temperature partition function for random instances of the Ising model; the other concerns approximating the number of zeroes of random low-degree polynomials. We observe that b","authors_text":"Ashley Montanaro, Dan J. Shepherd, Michael J. Bremner","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-29T20:01:21Z","title":"Average-case complexity versus approximate simulation of commuting quantum computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07999","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:babcc6001ed7affa5d1eacaba2bd2251a1a45ba71e27a19f40a3311c8e327ce0","target":"record","created_at":"2026-05-18T01:08:13Z","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":"77648d3a156e422d9717b402216040d0f05abe36ec1900b59925426c69680d0a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-29T20:01:21Z","title_canon_sha256":"ecc18b6adea83121d8d3c43ce036dedff3f3b432d9814438dcd1382a3bf12618"},"schema_version":"1.0","source":{"id":"1504.07999","kind":"arxiv","version":2}},"canonical_sha256":"a7911e2fe1637116a8fb7104238e34dece83344d8fb3d667a863dcff97b9f57a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7911e2fe1637116a8fb7104238e34dece83344d8fb3d667a863dcff97b9f57a","first_computed_at":"2026-05-18T01:08:13.358564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.358564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0p+ry9cM9ONzx+9Pz4lricFqOYzNOOGcFgqWSW8Qkm8SP8Fi51bx6sCCVpHZC2GFPoDDbq5gWD8ICU73tSYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.359134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:babcc6001ed7affa5d1eacaba2bd2251a1a45ba71e27a19f40a3311c8e327ce0","sha256:cd867e725f32d673c9fce6a344aea62ccbc85c2a2d7daad2911cd2de9632d7b3"],"state_sha256":"3951f606640eef1983245cbb861b31d7c84075d4e816b26e02cc49be27c4ebb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uvCzo7nXf5ybynuooX1+ZzLP5r8xGjfNCY92s08O6T4STbu7S+eeYpAvYhyofWUwxB8CTIZvUUFS/2pKPzyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:21:40.531085Z","bundle_sha256":"361895fa152e790d18a80aea5078be11c3feb418cd8462b70b02b319487f5971"}}