{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:7WKO7LXTABBPVP5QT7JQ5P7MAM","short_pith_number":"pith:7WKO7LXT","schema_version":"1.0","canonical_sha256":"fd94efaef30042fabfb09fd30ebfec031a633debc1f79571af9ad94d0f42f47e","source":{"kind":"arxiv","id":"quant-ph/0502072","version":2},"attestation_state":"computed","paper":{"title":"NP-complete Problems and Physical Reality","license":"","headline":"","cross_cats":["cs.CC","gr-qc"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2005-02-12T15:14:11Z","abstract_excerpt":"Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and \"anthropic computing.\" The section on soap bubbles even includes some \"experimental\" results. While I do not believe that any of the proposals will let us solve NP-complete problems efficiently, I argue that by studying them, we "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0502072","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-02-12T15:14:11Z","cross_cats_sorted":["cs.CC","gr-qc"],"title_canon_sha256":"7a57505005ce678a89e885e6276935ba2349fc47f8fc22d010ccbddf2bbc8052","abstract_canon_sha256":"c32fd59cec261331421925dae5122900413712f4b03dd2d5d2134e0a64979e0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:55.347546Z","signature_b64":"nWZL81SAbA0Ga9bQlaL9r+HdNiqmK3DyOBxBDwIovs8zqmt1oz2YAWJy1uRtOLrd6win5q7TjWA26t4jltIuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd94efaef30042fabfb09fd30ebfec031a633debc1f79571af9ad94d0f42f47e","last_reissued_at":"2026-07-04T14:46:55.347188Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:55.347188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-complete Problems and Physical Reality","license":"","headline":"","cross_cats":["cs.CC","gr-qc"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2005-02-12T15:14:11Z","abstract_excerpt":"Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and \"anthropic computing.\" The section on soap bubbles even includes some \"experimental\" results. While I do not believe that any of the proposals will let us solve NP-complete problems efficiently, I argue that by studying them, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0502072","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0502072/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0502072","created_at":"2026-07-04T14:46:55.347246+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0502072v2","created_at":"2026-07-04T14:46:55.347246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0502072","created_at":"2026-07-04T14:46:55.347246+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WKO7LXTABBP","created_at":"2026-07-04T14:46:55.347246+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WKO7LXTABBPVP5Q","created_at":"2026-07-04T14:46:55.347246+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WKO7LXT","created_at":"2026-07-04T14:46:55.347246+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.14822","citing_title":"Nonlinear Hamiltonians and Boolean satisfiability","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18428","citing_title":"Quantum algorithm for Valiant-Vazirani reduction","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2410.22032","citing_title":"From spin squeezing to fast state discrimination","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM","json":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM.json","graph_json":"https://pith.science/api/pith-number/7WKO7LXTABBPVP5QT7JQ5P7MAM/graph.json","events_json":"https://pith.science/api/pith-number/7WKO7LXTABBPVP5QT7JQ5P7MAM/events.json","paper":"https://pith.science/paper/7WKO7LXT"},"agent_actions":{"view_html":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM","download_json":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM.json","view_paper":"https://pith.science/paper/7WKO7LXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0502072&json=true","fetch_graph":"https://pith.science/api/pith-number/7WKO7LXTABBPVP5QT7JQ5P7MAM/graph.json","fetch_events":"https://pith.science/api/pith-number/7WKO7LXTABBPVP5QT7JQ5P7MAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM/action/storage_attestation","attest_author":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM/action/author_attestation","sign_citation":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM/action/citation_signature","submit_replication":"https://pith.science/pith/7WKO7LXTABBPVP5QT7JQ5P7MAM/action/replication_record"}},"created_at":"2026-07-04T14:46:55.347246+00:00","updated_at":"2026-07-04T14:46:55.347246+00:00"}