{"id":"W4414646315","doi":"10.1007/978-3-032-06706-7_14","title":"Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Competitive analysis; Bipartite graph; Vertex (graph theory); Hopcroft–Karp algorithm; Degree (music); Cardinality (data modeling); Online algorithm; Graph","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.00160467,0.001046577,0.00213194,0.001171613,0.001799849,0.002712531,0.004395443,0.002780345,0.01592973],"category_scores_gemma":[0.006393177,0.0007659606,0.001314113,0.002164188,0.0009957283,0.004887638,0.003027288,0.002031511,0.002263191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002151886,"about_ca_system_score_gemma":0.003256497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003406013,"about_ca_topic_score_gemma":0.004015307,"domain_scores_codex":[0.9988291,0.0002101401,0.00007276017,0.0003230236,0.0002092504,0.0003558608],"domain_scores_gemma":[0.996465,0.002054648,0.0002515781,0.0006953338,0.0002645855,0.0002688342],"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.002486582,0.00138014,0.001428545,0.0006578584,0.0001449781,0.0002338803,0.0004814903,0.2945737,0.009851028,0.1077435,0.0230164,0.5580019],"study_design_scores_gemma":[0.0002513591,0.000162398,0.000196301,0.00003525718,0.00004018398,0.0001003452,0.0001193984,0.9071576,0.00248445,0.08636349,0.003067876,0.00002125756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07075316,0.0003847892,0.9101089,0.0008199654,0.0002368994,0.000359318,0.0005111267,0.003660849,0.01316489],"genre_scores_gemma":[0.3178569,0.0001696804,0.6708971,0.000249108,0.0001101739,0.000364969,0.0008684275,0.000398945,0.009084714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01592973,"threshold_uncertainty_score":0.05329025,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02830691949131343,"score_gpt":0.2735100315596817,"score_spread":0.2452031120683683,"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."}}