{"paper":{"title":"How to Defeat a Mafia (of Size 1)","arxiv_id":"2611.16496","primary_cat":"cs.GT","submitted_at":"2026-11-12T09:02:28+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":1.0,"id":"s0","own":false,"role":"background","text":"The game \"Mafia'' is a social deduction game where $n$ players attempt to uncover a covert coalition of $m$ players among the $n$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.39,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":false,"role":"background","text":"Typically, $d=1$ of the non-coalition players are labelled ``Detective'' and have special abilities.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.04,"main_claim_p":0.02,"quantitative":true,"quantitative_p":0.93,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.72,"id":"s2","own":false,"role":"background","text":"Most game-theoretic analysis considers, however, only the variant without a Detective.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.04,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.29,"role_probabilities":{"gap":0.28,"method":0.0,"result":0.0,"background":0.72,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.66,"id":"s3","own":false,"role":"gap","text":"Once the Detective role is introduced, extremely complex strategies can be employed, for which reason only upper and lower bounds for winning have been established, namely by considering specific strategies.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.06,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.44,"role_probabilities":{"gap":0.66,"method":0.0,"result":0.0,"background":0.34,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":4,"p":0.95,"id":"s4","own":true,"role":"contribution","text":"We analyse the case $m=d=1$, providing a first example where an explicit, provably-optimal strategy can be described beyond $d=0$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.91,"quantitative":true,"quantitative_p":0.92,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.05,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.95,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"We analyse the case $m=d=1$, providing a first example where an explicit, provably-optimal strategy can be described beyond $d=0$.","location":"abstract s4","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":4230,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.79,"states_limitation":0.39,"human_participants":0.1,"controlled_comparison":0.12,"randomized_assignment":0.02,"states_quantitative_result":0.3,"compares_with_prior_results":0.83,"mentions_code_or_data_availability":0.02},"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":1.0,"text":"We analyse the case $m=d=1$, providing a first example where an explicit, provably-optimal strategy can be described beyond $d=0$.","location":"abstract s4"}},"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":5,"sentences_in_abstract":5},"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,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}