{"paper":{"title":"When Elements Fail: Weighted Fault-Tolerant Matroid Bases","arxiv_id":"2611.16333","primary_cat":"cs.DS","submitted_at":"2026-11-12T05:56: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":0.99,"id":"s0","own":false,"role":"background","text":"Given a rank-\\(r\\) matroid on \\(n\\) elements with nonnegative costs and a partition into safe and vulnerable elements, we seek a minimum-cost set that spans after every deletion of at most \\(k\\) selected vulnerable elements.","hedge":{"p":0.88,"label":"asserted"},"own_p":0.22,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.44,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.99,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":1,"p":0.64,"id":"s1","own":true,"role":"contribution","text":"We resolve several open questions posed by Bentert, Fomin, Golovach, and Morelle (ESA 2025) concerning weighted costs, nonuniform failures, and explicitly specified failure scenarios.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.19,"quantitative":false,"quantitative_p":0.21,"role_probabilities":{"gap":0.29,"method":0.0,"result":0.06,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.64,"interpretation":0.0}},{"i":2,"p":0.59,"id":"s2","own":true,"role":"method","text":"To this end, we develop two compression methods.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.91,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.0,"method":0.59,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.41,"interpretation":0.0}},{"i":3,"p":0.47,"id":"s3","own":true,"role":"method","text":"For matroids given by an independence oracle, weighted flat-avoidance representatives yield a bounded subset of the ground set containing an optimal solution and a \\(2^{\\mathcal{O}((r+k)^4)}n^{\\mathcal{O}(1)}\\)-time algorithm.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.2,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.47,"result":0.29,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.24,"interpretation":0.0}},{"i":4,"p":0.63,"id":"s4","own":true,"role":"interpretation","text":"This establishes fixed-parameter tractability for weighted costs and nonuniform failures simultaneously.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.31,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.36,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.63}},{"i":5,"p":0.91,"id":"s5","own":true,"role":"method","text":"For explicitly represented linear matroids, polynomial certificates allow us to compress families of partial solutions while preserving successful completions under all allowed failures.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.91,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.09,"interpretation":0.0}},{"i":6,"p":0.78,"id":"s6","own":true,"role":"result","text":"This yields a deterministic algorithm using \\(2^{\\mathcal{O}(kr(r+k)\\log(r+1))}n^{\\mathcal{O}(1)}\\) field operations over arbitrary fields.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.12,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.0,"method":0.1,"result":0.78,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.12,"interpretation":0.0}},{"i":7,"p":0.84,"id":"s7","own":true,"role":"method","text":"Over fixed finite fields, a simpler reduction uses parallel classes.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.83,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.84,"result":0.01,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.15,"interpretation":0.0}},{"i":8,"p":0.85,"id":"s8","own":true,"role":"result","text":"For explicitly listed failure scenarios, we obtain fixed-parameter algorithms parameterized by rank and the number of scenarios.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.12,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.85,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.15,"interpretation":0.0}},{"i":9,"p":0.57,"id":"s9","own":true,"role":"result","text":"In contrast, the size-budget decision version is W[1]-hard parameterized by rank and maximum scenario size, even on uniform matroids with two-element scenarios.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.83,"main_claim_p":0.1,"quantitative":true,"quantitative_p":0.87,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.57,"background":0.0,"limitation":0.42,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":10,"p":0.77,"id":"s10","own":false,"role":"background","text":"\\keywords{Matroids \\and Fault tolerance \\and Fixed-parameter algorithms \\and Representative families}","hedge":{"p":0.99,"label":"unclear"},"own_p":0.11,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.02,"background":0.77,"limitation":0.0,"future_work":0.01,"contribution":0.18,"interpretation":0.01}}]},"compiled":{"main_claim":{"p":0.56,"text":"This establishes fixed-parameter tractability for weighted costs and nonuniform failures simultaneously.","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":8299,"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.09,"states_limitation":0.9,"human_participants":0.01,"controlled_comparison":0.02,"randomized_assignment":0.02,"states_quantitative_result":0.97,"compares_with_prior_results":0.65,"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":0.55,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.45,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.55,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.47,"text":"To this end, we develop two compression methods.","location":"abstract s2"}},"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":11,"sentences_in_abstract":11},"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"}}}