{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463957,0.000803374,0.001289213,0.001000303,0.0006751566,0.0012627,0.002242638,0.001150333,0.003288206],"category_scores_gemma":[0.007537836,0.0005965135,0.001223724,0.001571554,0.001244883,0.003036536,0.002047714,0.001568717,0.0007729079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001467302,"about_ca_system_score_gemma":0.001222685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003450392,"about_ca_topic_score_gemma":0.003917459,"domain_scores_codex":[0.9983799,0.0006528524,0.00004786616,0.0002490282,0.0004684216,0.0002019092],"domain_scores_gemma":[0.9967973,0.002059275,0.0002334072,0.0006322456,0.0001717376,0.0001062132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003812808,0.0002367727,0.001601604,0.000270906,0.00008035745,0.0002006986,0.0003204261,0.7586009,0.01090388,0.04586931,0.004959963,0.176574],"study_design_scores_gemma":[0.00003692352,0.0000774161,0.0001327583,0.00001458228,0.00001576095,0.00008660358,0.00002495206,0.9810929,0.002912942,0.01452027,0.001075907,0.000008869407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04202479,0.0004290287,0.9492443,0.0004756393,0.00001256074,0.00008904185,0.00007873353,0.001266803,0.006379072],"genre_scores_gemma":[0.4938725,0.0003152997,0.501862,0.0002062379,0.00004122263,0.000284479,0.0002369918,0.0003263934,0.002854956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003450392,"threshold_uncertainty_score":0.01100016,"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."}}