{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002759548,0.002568154,0.00258401,0.002636589,0.001393226,0.002828437,0.004597022,0.002825234,0.02128747],"category_scores_gemma":[0.0119005,0.00126612,0.002891454,0.00457029,0.001114877,0.0110858,0.004650252,0.00336108,0.006209476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00183691,"about_ca_system_score_gemma":0.001996926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001758084,"about_ca_topic_score_gemma":0.002809112,"domain_scores_codex":[0.9961194,0.0008734002,0.0002643878,0.0009184372,0.001245702,0.0005788424],"domain_scores_gemma":[0.993202,0.003309041,0.000447641,0.00196926,0.0007963779,0.0002757076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001162111,0.0008988485,0.001329976,0.001635092,0.0002732373,0.0002175417,0.0005075381,0.1640734,0.01409106,0.128946,0.03125887,0.6556064],"study_design_scores_gemma":[0.0004003518,0.0002006124,0.0004085843,0.00008215508,0.00007934552,0.0003233069,0.0001491753,0.6477161,0.005648249,0.3248878,0.02005768,0.00004659872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01365443,0.001255588,0.9710916,0.0008560336,0.0002067988,0.0002581979,0.0003567584,0.004624142,0.007696423],"genre_scores_gemma":[0.1110331,0.0009783983,0.8779424,0.0005368931,0.0003036155,0.0005661649,0.001783226,0.001143751,0.005712593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02128747,"threshold_uncertainty_score":0.07121366,"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."}}