{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006608687,0.0001286545,0.0001617953,0.0001014996,0.0006376195,0.0001464031,0.001742294,0.00003025562,0.000003355783],"category_scores_gemma":[0.0001298885,0.00008328736,0.00006674298,0.0005450423,0.004611971,0.0001962363,0.001249959,0.0001161812,0.000003509751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000012925,"about_ca_system_score_gemma":0.00007743221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001288261,"about_ca_topic_score_gemma":0.000002495661,"domain_scores_codex":[0.9985152,0.00004588771,0.0002222118,0.0004853365,0.0003854202,0.0003458745],"domain_scores_gemma":[0.9983593,0.000484219,0.00006999472,0.0007753994,0.0001843628,0.000126672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007377145,0.00005126924,0.000006563368,0.000006316211,0.000001594445,5.123833e-7,0.0004589111,0.00046386,0.0005104323,0.9821997,0.00001204009,0.01628137],"study_design_scores_gemma":[0.00008041484,0.0001485525,0.0003981829,0.00003518811,0.000002695215,0.000009280998,0.000001836252,0.5357492,0.0006010286,0.4629062,0.000005258852,0.00006220143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2263499,0.00000528246,0.7722778,0.0007100421,0.0003660621,0.0001409497,0.000009292081,0.00003955497,0.0001010862],"genre_scores_gemma":[0.7328291,8.836562e-7,0.2663528,0.0007456337,0.00005805608,0.000002822985,2.03396e-7,0.00000379796,0.000006688324],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5352854,"threshold_uncertainty_score":0.9980969,"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."}}