{"paper":{"title":"Barbosa, Uniform Polynomial Time Bounds, and Promises","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Kyle Murray, Lane A. Hemaspaandra, Xiaoqing Tang","submitted_at":"2011-06-06T18:59:06Z","abstract_excerpt":"This note is a commentary on, and critique of, Andre Luiz Barbosa's paper entitled \"P != NP Proof.\" Despite its provocative title, what the paper is seeking to do is not to prove P \\neq NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P \\neq NP, and he claims to prove the truth of the statement P \\neq NP in his quite different sense of that statement. However, we note that (1) the paper fails even on its own terms, as due to a uniformity problem, the pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1150","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"}