{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6Q42TQRXBYVHDKCCLUSCX3DDUC","short_pith_number":"pith:6Q42TQRX","canonical_record":{"source":{"id":"1204.4659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T15:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"309a9f9ae46785e94d666148db36199d12a87d4a9fa91045c734f6ea15e60aa8","abstract_canon_sha256":"c6b09cba3e5a3eec033c0f3a53116c9eec87ada608e9ca395e1b2e82a2d1d6dc"},"schema_version":"1.0"},"canonical_sha256":"f439a9c2370e2a71a8425d242bec63a085cd23d4a3855ad16f7f964977d7130a","source":{"kind":"arxiv","id":"1204.4659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4659","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4659v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4659","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"6Q42TQRXBYVH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6Q42TQRXBYVHDKCC","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6Q42TQRX","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6Q42TQRXBYVHDKCCLUSCX3DDUC","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T15:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"309a9f9ae46785e94d666148db36199d12a87d4a9fa91045c734f6ea15e60aa8","abstract_canon_sha256":"c6b09cba3e5a3eec033c0f3a53116c9eec87ada608e9ca395e1b2e82a2d1d6dc"},"schema_version":"1.0"},"canonical_sha256":"f439a9c2370e2a71a8425d242bec63a085cd23d4a3855ad16f7f964977d7130a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:25.785361Z","signature_b64":"TyFKC4jmSVynHaHqxhdWACsEA+EmanxFxOnbRbDBZ2niFmzcXzQoooPvSQg0xAuzRY1cOL/9M4ZBly4noJ12DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f439a9c2370e2a71a8425d242bec63a085cd23d4a3855ad16f7f964977d7130a","last_reissued_at":"2026-05-18T03:57:25.784561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:25.784561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4659","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-18T03:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZ/NiLRefRR6x1CxM2xwcK56oKxq6fw/40n38yfMQE/+IXobHuahejOeMXPuLUeSivF6WJWyrzZ5fnryCBSmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:43:10.448592Z"},"content_sha256":"cc8b556c5613de037eabf44ec5debbed0ce5b110a560732f90b0c0916347543f","schema_version":"1.0","event_id":"sha256:cc8b556c5613de037eabf44ec5debbed0ce5b110a560732f90b0c0916347543f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6Q42TQRXBYVHDKCCLUSCX3DDUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The computational complexity of Minesweeper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Michiel de Bondt","submitted_at":"2012-04-20T15:57:40Z","abstract_excerpt":"We show that the Minesweeper game is PP-hard, when the object is to locate all mines with the highest probability. When the probability of locating all mines may be infinitesimal, the Minesweeper game is even PSPACE-complete. In our construction, the player can reveal a boolean circuit in polynomial time, after guessing an initial square with no surrounding mines, a guess that has 99 percent probability of success. Subsequently, the mines must be located with a maximum probability of success.\n  Furthermore, we show that determining the solvability of a partially uncovered Minesweeper board is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4659","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-18T03:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KStCvPJ7BeEM3tzqWVufEqQ1/2+A8X1qJvMiFev1bkj1mQqqkRrLPVE/sJdJkAS9PwllPPhfIN4Tx/wIsdeFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:43:10.449255Z"},"content_sha256":"da7a387df6de215525de2a6b64a9445f0f0d3b5af50748209e398a4f922d4345","schema_version":"1.0","event_id":"sha256:da7a387df6de215525de2a6b64a9445f0f0d3b5af50748209e398a4f922d4345"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC/bundle.json","state_url":"https://pith.science/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC/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-06-05T01:43:10Z","links":{"resolver":"https://pith.science/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC","bundle":"https://pith.science/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC/bundle.json","state":"https://pith.science/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Q42TQRXBYVHDKCCLUSCX3DDUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6Q42TQRXBYVHDKCCLUSCX3DDUC","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":"c6b09cba3e5a3eec033c0f3a53116c9eec87ada608e9ca395e1b2e82a2d1d6dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T15:57:40Z","title_canon_sha256":"309a9f9ae46785e94d666148db36199d12a87d4a9fa91045c734f6ea15e60aa8"},"schema_version":"1.0","source":{"id":"1204.4659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4659","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4659v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4659","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"6Q42TQRXBYVH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6Q42TQRXBYVHDKCC","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6Q42TQRX","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:da7a387df6de215525de2a6b64a9445f0f0d3b5af50748209e398a4f922d4345","target":"graph","created_at":"2026-05-18T03:57:25Z","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 show that the Minesweeper game is PP-hard, when the object is to locate all mines with the highest probability. When the probability of locating all mines may be infinitesimal, the Minesweeper game is even PSPACE-complete. In our construction, the player can reveal a boolean circuit in polynomial time, after guessing an initial square with no surrounding mines, a guess that has 99 percent probability of success. Subsequently, the mines must be located with a maximum probability of success.\n  Furthermore, we show that determining the solvability of a partially uncovered Minesweeper board is ","authors_text":"Michiel de Bondt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T15:57:40Z","title":"The computational complexity of Minesweeper"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4659","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:cc8b556c5613de037eabf44ec5debbed0ce5b110a560732f90b0c0916347543f","target":"record","created_at":"2026-05-18T03:57:25Z","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":"c6b09cba3e5a3eec033c0f3a53116c9eec87ada608e9ca395e1b2e82a2d1d6dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-20T15:57:40Z","title_canon_sha256":"309a9f9ae46785e94d666148db36199d12a87d4a9fa91045c734f6ea15e60aa8"},"schema_version":"1.0","source":{"id":"1204.4659","kind":"arxiv","version":1}},"canonical_sha256":"f439a9c2370e2a71a8425d242bec63a085cd23d4a3855ad16f7f964977d7130a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f439a9c2370e2a71a8425d242bec63a085cd23d4a3855ad16f7f964977d7130a","first_computed_at":"2026-05-18T03:57:25.784561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:25.784561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TyFKC4jmSVynHaHqxhdWACsEA+EmanxFxOnbRbDBZ2niFmzcXzQoooPvSQg0xAuzRY1cOL/9M4ZBly4noJ12DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:25.785361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc8b556c5613de037eabf44ec5debbed0ce5b110a560732f90b0c0916347543f","sha256:da7a387df6de215525de2a6b64a9445f0f0d3b5af50748209e398a4f922d4345"],"state_sha256":"1f74e6dfc027f55590ed0208a7a4b54a8ea8e943f6632ff9a9a0f6f5229b42ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5Pa+q/AMch/6k3t3Ks+RIujQms+M3XF1FdK4/YJthNyCsoSz+MVJFngQjfz64Jl5Cd0wkJXAkD5pjVP5VvaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:43:10.452558Z","bundle_sha256":"9b8a13867012a71e7f843165826d0d1dcd018f748a3ba19839c2a37b2f4bdab6"}}