{"id":"W3116404732","doi":"10.4230/lipics.fsttcs.2020.33","title":"Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Algorithm; Computer science; Amortized analysis; Distributed algorithm; Vertex (graph theory); Sublinear function; Sequence (biology); Deterministic algorithm; Computation; Degree (music); Parallel algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science; Data structure","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003756254,0.0004532769,0.0005305841,0.0001597243,0.000550092,0.0007718033,0.001413892,0.0002044671,0.00001540128],"category_scores_gemma":[0.0001182729,0.0004379658,0.0003224459,0.000467199,0.0002023687,0.001599308,0.0008141624,0.0003669797,0.00003492255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008342119,"about_ca_system_score_gemma":0.00009492796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008850104,"about_ca_topic_score_gemma":0.00001202684,"domain_scores_codex":[0.9972145,0.00003154698,0.0009695127,0.0004832727,0.0004438653,0.0008572795],"domain_scores_gemma":[0.9981601,0.0001760688,0.0003478768,0.0006056027,0.0002853532,0.0004250062],"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.001276405,0.001632218,0.003030281,0.007432093,0.002164749,0.00009879901,0.05384627,0.001577751,0.0009771702,0.3112689,0.04730323,0.5693921],"study_design_scores_gemma":[0.003305072,0.0005489738,0.0002620632,0.00006127882,0.00004550367,0.00007294246,0.0004655221,0.8982809,0.0004196344,0.006309639,0.08959001,0.0006384966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01428366,0.00007226702,0.9771528,0.002740335,0.0008770854,0.001383586,0.00285953,0.0003838939,0.0002468794],"genre_scores_gemma":[0.5416909,0.00009610585,0.449106,0.00522003,0.0005063456,0.0004156827,0.002711695,0.00009540576,0.0001577907],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8967031,"threshold_uncertainty_score":0.9998072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03316991790132955,"score_gpt":0.2747681144222525,"score_spread":0.2415981965209229,"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."}}