{"id":"W2033561606","doi":"10.1145/2601071","title":"Faster Algorithms for Semi-Matching Problems","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Combinatorics; Bipartite graph; Binary logarithm; Matching (statistics); Mathematics; Simple (philosophy); Running time; Time complexity; Scheduling (production processes); Upper and lower bounds; Computer science; Discrete mathematics; Graph; Mathematical optimization","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.0006199311,0.0002563765,0.0002495573,0.000254904,0.0004942336,0.0003332219,0.001255665,0.0001295304,0.00008323667],"category_scores_gemma":[0.00004422604,0.0002372358,0.000179521,0.0004839163,0.00005308773,0.0007200129,0.00002986062,0.0003102403,0.0001243317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005936441,"about_ca_system_score_gemma":0.00005509158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004304574,"about_ca_topic_score_gemma":0.00001797327,"domain_scores_codex":[0.9979129,0.0001114695,0.000373691,0.0006380886,0.0004204541,0.0005433428],"domain_scores_gemma":[0.9980474,0.0003808646,0.00008838898,0.001070559,0.0001888367,0.0002240275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008033939,0.0002604882,0.000002736902,0.00005184314,0.00005470407,0.000001178899,0.001315449,0.09022911,0.0002970005,0.004200479,0.0002500901,0.9033289],"study_design_scores_gemma":[0.001259002,0.0004231374,0.00003240682,0.00005655564,0.00001457909,0.00001861234,0.0000581143,0.9397352,0.001395466,0.02059311,0.03599683,0.0004169994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006897486,0.00001918588,0.9932738,0.003799686,0.000734949,0.000677161,0.00001977749,0.0004618345,0.0009446255],"genre_scores_gemma":[0.03537108,0.00004783649,0.9592478,0.001506159,0.000153935,0.0004217354,0.00001433254,0.00005243271,0.003184638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9029119,"threshold_uncertainty_score":0.9674196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03638762829888929,"score_gpt":0.2850188882668745,"score_spread":0.2486312599679852,"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."}}