{"paper":{"title":"On Positive Computation","arxiv_id":"2611.09622","primary_cat":"cs.CC","submitted_at":"2026-11-06T15:43:30+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.65,"id":"s0","own":true,"role":"contribution","text":"We introduce new notions of reducibility for monotone classes and show that a monotone version of Circuit Satisfiability and the Hamiltonian Cycle Problem are complete for $mNP$, even under positive reductions (which are not the same as monotone reductions).","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.38,"quantitative":false,"quantitative_p":0.2,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.35,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.65,"interpretation":0.0}},{"i":1,"p":0.93,"id":"s1","own":false,"role":"interpretation","text":"If this holds for all (monotone) $mNP$-complete problems - that they are also so complete for $mNP$ -, then $P\\neq NP$.","hedge":{"p":0.57,"label":"hedged_possibility"},"own_p":0.35,"main_claim_p":0.29,"quantitative":true,"quantitative_p":0.5,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.07,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.93}},{"i":2,"p":0.58,"id":"s2","own":true,"role":"contribution","text":"We introduce positive models of relativized computation and show that the separation $posP\\subsetneq mNP$ does not relativize, even when oracles are restricted to monotone sets.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.21,"quantitative":true,"quantitative_p":0.82,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.42,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.58,"interpretation":0.0}},{"i":3,"p":0.83,"id":"s3","own":true,"role":"result","text":"Yet, there is a (weak) diagonalization proof that $posP\\subsetneq mNP$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.72,"main_claim_p":0.18,"quantitative":true,"quantitative_p":0.58,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.83,"background":0.01,"limitation":0.03,"future_work":0.0,"contribution":0.11,"interpretation":0.01}}]},"compiled":{"main_claim":{"p":0.35,"text":"We introduce new notions of reducibility for monotone classes and show that a monotone version of Circuit Satisfiability and the Hamiltonian Cycle Problem are complete for $mNP$, even under positive reductions (which are not the same as monotone reductions).","location":"abstract s0","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":3698,"cost_usd_reported":0.0},"compiled_at":"2026-11-09","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.09,"states_limitation":0.66,"human_participants":0.01,"controlled_comparison":0.03,"randomized_assignment":0.01,"states_quantitative_result":0.06,"compares_with_prior_results":0.68,"mentions_code_or_data_availability":0.01},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.97,"text":"We introduce new notions of reducibility for monotone classes and show that a monotone version of Circuit Satisfiability and the Hamiltonian Cycle Problem are complete for $mNP$, even under positive reductions (which are not the same as monotone reductions).","location":"abstract s0"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":4,"sentences_in_abstract":4},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}