{"id":"W2897485334","doi":"10.1016/j.tcs.2018.10.015","title":"On extensions of the deterministic online model for bipartite matching and max-sat","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Deterministic algorithm; Submodular set function; Monotone polygon; Binary logarithm; Matching (statistics); Combinatorics; Approximation algorithm; Simple (philosophy); Online algorithm; Discrete mathematics; Greedy algorithm; Algorithm; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.008635842,0.002453503,0.003711512,0.002229302,0.002839804,0.005904211,0.00849321,0.004413276,0.0196802],"category_scores_gemma":[0.03315513,0.001989365,0.005040175,0.004495654,0.004379003,0.02350097,0.01013772,0.010746,0.001992587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005985463,"about_ca_system_score_gemma":0.005168136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006326356,"about_ca_topic_score_gemma":0.01065655,"domain_scores_codex":[0.99138,0.004507052,0.0003521878,0.001489027,0.001060587,0.001211171],"domain_scores_gemma":[0.961237,0.02654492,0.001937192,0.007046883,0.001468194,0.001765661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004940207,0.0003935412,0.0007708264,0.0002218899,0.00008185294,0.0001291642,0.0002460603,0.09698513,0.0004700156,0.8763553,0.008294996,0.01555724],"study_design_scores_gemma":[0.00005285073,0.00003558864,0.0001232857,0.00003131248,0.00003029346,0.00005233676,0.00004792639,0.2341816,0.0001343265,0.7630229,0.002265926,0.00002170808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07048134,0.00228423,0.8538713,0.006755353,0.0006258209,0.0003631956,0.001568322,0.0009879998,0.06306238],"genre_scores_gemma":[0.7081681,0.003140101,0.2366038,0.003623922,0.002101915,0.000933998,0.003197598,0.001215421,0.04101526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0196802,"threshold_uncertainty_score":0.06583685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02794348708303992,"score_gpt":0.290670138379534,"score_spread":0.2627266512964941,"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."}}