{"id":"W1991263747","doi":"10.1016/j.tcs.2014.09.005","title":"Brushing with additional cleaning restrictions","year":2014,"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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Ryerson University","keywords":"Brush; Traverse; Graph; Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Engineering; Cartography; Mechanical engineering; Geography","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.001209534,0.001136666,0.002115195,0.001665316,0.001930941,0.002795444,0.002517683,0.002423001,0.04868684],"category_scores_gemma":[0.01071452,0.001050876,0.001915887,0.001739646,0.001662659,0.005865825,0.004546519,0.003905756,0.007475541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004477529,"about_ca_system_score_gemma":0.0007899612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00126632,"about_ca_topic_score_gemma":0.00240536,"domain_scores_codex":[0.9983628,0.0001804905,0.00013592,0.0004596727,0.0006032616,0.0002577534],"domain_scores_gemma":[0.9921086,0.001597307,0.0002091072,0.004966298,0.0006948352,0.0004238196],"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.0009460297,0.0007181718,0.001717368,0.0009656531,0.0001366585,0.0006887779,0.0006294547,0.04022776,0.07662404,0.3305041,0.03602755,0.5108145],"study_design_scores_gemma":[0.00015754,0.000262439,0.001425913,0.0002166112,0.0001298297,0.0008468615,0.0003814251,0.3117502,0.04926893,0.5388453,0.09659059,0.000124301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03820766,0.000445454,0.9136978,0.00063485,0.0007682964,0.0001892131,0.0005711988,0.005084455,0.04040118],"genre_scores_gemma":[0.393693,0.0006052743,0.5229452,0.0007881387,0.0003442191,0.000377486,0.001877818,0.005182262,0.07418665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04868684,"threshold_uncertainty_score":0.1628737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00951835568800899,"score_gpt":0.2215320800433167,"score_spread":0.2120137243553077,"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."}}