{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N4LGPR7A2HYQ5TIBV7R74HQCE5","short_pith_number":"pith:N4LGPR7A","canonical_record":{"source":{"id":"1009.1635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-09-08T20:09:59Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"87b4e62c14ba392e37bc0077a68340e7d0faf3f7aa188e83e109e0bdaad907ec","abstract_canon_sha256":"f10cbd7c9c00fc91150f5af85ad23a3a37fb22671042692dfa74b724bb10afa7"},"schema_version":"1.0"},"canonical_sha256":"6f1667c7e0d1f10ecd01afe3fe1e022745a96c601f574a3f5ee31f0589a7529c","source":{"kind":"arxiv","id":"1009.1635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1635","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1635v1","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1635","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"N4LGPR7A2HYQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N4LGPR7A2HYQ5TIB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N4LGPR7A","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N4LGPR7A2HYQ5TIBV7R74HQCE5","target":"record","payload":{"canonical_record":{"source":{"id":"1009.1635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-09-08T20:09:59Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"87b4e62c14ba392e37bc0077a68340e7d0faf3f7aa188e83e109e0bdaad907ec","abstract_canon_sha256":"f10cbd7c9c00fc91150f5af85ad23a3a37fb22671042692dfa74b724bb10afa7"},"schema_version":"1.0"},"canonical_sha256":"6f1667c7e0d1f10ecd01afe3fe1e022745a96c601f574a3f5ee31f0589a7529c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:13.838760Z","signature_b64":"yxUhqNpuFSHuxWOzg7g5YyAIR3O9VxgaPKqiAJx78BK48043brE1FEL5uxbrGBkU/R7JPdEYfE7V3Ul4UXV8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1667c7e0d1f10ecd01afe3fe1e022745a96c601f574a3f5ee31f0589a7529c","last_reissued_at":"2026-05-18T04:41:13.838273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:13.838273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.1635","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-18T04:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxo5Pp+3H1FC2cTF1ZjMgu6TmgqpoijuauMi2BkBmamT/XwTcrDLQORJJ4lirbsenTfTklE7ZFFfMnHCBp+1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:52:55.031301Z"},"content_sha256":"829ae7e7ed74a970f3087c480bb0c533176ad916ddcc7496ec5d94027e066056","schema_version":"1.0","event_id":"sha256:829ae7e7ed74a970f3087c480bb0c533176ad916ddcc7496ec5d94027e066056"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N4LGPR7A2HYQ5TIBV7R74HQCE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical mechanics of classical and quantum computational complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"A. Scardicchio, C. R. Laumann, R. Moessner, S. L. Sondhi","submitted_at":"2010-09-08T20:09:59Z","abstract_excerpt":"The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous framework for classifying the hardness of problems according to the computational resources, most notably time, needed to solve them. Its extension to quantum computers allows the relative power of quantum computers to be analyzed. This framework identifies families of problems which are likely hard for classical computers (``NP-complete'') and those which are likel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1635","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-18T04:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Trwk7kEOCWKH5I1fCaWkQo5J6jHSIB5Z2nMmZFGjZxFCTNPlpYJdM4//YEkP47YQnJQZ3uc5Pqlx/F+eKx1VCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:52:55.031962Z"},"content_sha256":"77966b7df0c97c3a3bb34191a8078bff6960fce68b9d1e5b94ddcc7b883f6b3b","schema_version":"1.0","event_id":"sha256:77966b7df0c97c3a3bb34191a8078bff6960fce68b9d1e5b94ddcc7b883f6b3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5/bundle.json","state_url":"https://pith.science/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5/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-31T17:52:55Z","links":{"resolver":"https://pith.science/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5","bundle":"https://pith.science/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5/bundle.json","state":"https://pith.science/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4LGPR7A2HYQ5TIBV7R74HQCE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N4LGPR7A2HYQ5TIBV7R74HQCE5","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":"f10cbd7c9c00fc91150f5af85ad23a3a37fb22671042692dfa74b724bb10afa7","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-09-08T20:09:59Z","title_canon_sha256":"87b4e62c14ba392e37bc0077a68340e7d0faf3f7aa188e83e109e0bdaad907ec"},"schema_version":"1.0","source":{"id":"1009.1635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1635","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1635v1","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1635","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"N4LGPR7A2HYQ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N4LGPR7A2HYQ5TIB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N4LGPR7A","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:77966b7df0c97c3a3bb34191a8078bff6960fce68b9d1e5b94ddcc7b883f6b3b","target":"graph","created_at":"2026-05-18T04:41: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":"The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous framework for classifying the hardness of problems according to the computational resources, most notably time, needed to solve them. Its extension to quantum computers allows the relative power of quantum computers to be analyzed. This framework identifies families of problems which are likely hard for classical computers (``NP-complete'') and those which are likel","authors_text":"A. Scardicchio, C. R. Laumann, R. Moessner, S. L. Sondhi","cross_cats":["cs.CC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-09-08T20:09:59Z","title":"Statistical mechanics of classical and quantum computational complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1635","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:829ae7e7ed74a970f3087c480bb0c533176ad916ddcc7496ec5d94027e066056","target":"record","created_at":"2026-05-18T04:41: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":"f10cbd7c9c00fc91150f5af85ad23a3a37fb22671042692dfa74b724bb10afa7","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-09-08T20:09:59Z","title_canon_sha256":"87b4e62c14ba392e37bc0077a68340e7d0faf3f7aa188e83e109e0bdaad907ec"},"schema_version":"1.0","source":{"id":"1009.1635","kind":"arxiv","version":1}},"canonical_sha256":"6f1667c7e0d1f10ecd01afe3fe1e022745a96c601f574a3f5ee31f0589a7529c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f1667c7e0d1f10ecd01afe3fe1e022745a96c601f574a3f5ee31f0589a7529c","first_computed_at":"2026-05-18T04:41:13.838273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:13.838273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yxUhqNpuFSHuxWOzg7g5YyAIR3O9VxgaPKqiAJx78BK48043brE1FEL5uxbrGBkU/R7JPdEYfE7V3Ul4UXV8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:13.838760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:829ae7e7ed74a970f3087c480bb0c533176ad916ddcc7496ec5d94027e066056","sha256:77966b7df0c97c3a3bb34191a8078bff6960fce68b9d1e5b94ddcc7b883f6b3b"],"state_sha256":"58722f4e9a81b16273325a5500322f0770b47a32a2ace502b742ab1205577622"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+M5v8yLtA06dzV9U92kk2n4pz/MY5e63BZvudB4f0HIBfrpm1xwhUt44aGA/rk5WmYIt+ZXDQRh5h0gBa/D8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:52:55.035819Z","bundle_sha256":"313b1c0b064a05cbbf7b14c7346ea6ca3aea3eb66d006962c462d383addff2d8"}}