{"slug":"p-vs-np","name":"P versus NP","statement":"Whether every language decidable in nondeterministic polynomial time is decidable in deterministic polynomial time.","status":"open","node_count":5,"edge_count":4,"paper_edge_count":4,"composed_count":0,"novel_count":0,"sufficient_count":1,"last_run_at":"2026-08-12T13:30:19.187587+00:00","hubs":[],"last_run":{"started_at":"2026-08-12T13:30:19.187587+00:00","finished_at":"2026-08-12T13:30:19.209805+00:00","claims_scanned":0,"edges_added":0,"compositions":0,"novel_found":0}}