{"id":"W2158685441","doi":"10.4230/lipics.stacs.2012.601","title":"The Power of Local Search: Maximum Coverage over a Matroid","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Power (physics); Matroid partitioning; Computer science; Mathematics; Combinatorics; Graphic matroid; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001196946,0.0003269409,0.0003685032,0.0001845614,0.0005419841,0.0003619305,0.001911016,0.0001486186,0.000048586],"category_scores_gemma":[0.000047388,0.0002391565,0.0003567471,0.00045683,0.0003936848,0.002033169,0.0009962582,0.0004477728,0.0001127634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009088132,"about_ca_system_score_gemma":0.00007940408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002148303,"about_ca_topic_score_gemma":0.000007272486,"domain_scores_codex":[0.9968925,0.0000642487,0.0009437615,0.0001958192,0.0007979225,0.001105723],"domain_scores_gemma":[0.9976275,0.0003673622,0.0003220088,0.001184725,0.0002271142,0.0002713026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003530343,0.001557611,0.01231813,0.000844852,0.0006649791,0.000009070648,0.0423865,0.0004385396,0.0001244736,0.7435004,0.02175061,0.1760519],"study_design_scores_gemma":[0.008064141,0.001282153,0.02011866,0.0003509537,0.00008291144,0.0003518624,0.006268849,0.2163185,0.006044049,0.03480598,0.7042157,0.002096216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09642304,0.0002346447,0.8943897,0.0003677043,0.001710736,0.0007519571,0.0002515183,0.0001476547,0.005723061],"genre_scores_gemma":[0.9827399,0.00005466956,0.01608999,0.0006939342,0.000119735,0.00004386248,0.00003968742,0.00002696014,0.0001912298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8863169,"threshold_uncertainty_score":0.9752517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01917763530506628,"score_gpt":0.260322615637854,"score_spread":0.2411449803327877,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}