{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009102818,0.000148378,0.0001398437,0.0002264778,0.001013478,0.0006461007,0.002077452,0.00003099076,0.0002249673],"category_scores_gemma":[0.0001109627,0.0001172236,0.00004735138,0.001664718,0.002324549,0.00089155,0.0007312932,0.0002558403,0.00007595089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003754236,"about_ca_system_score_gemma":0.0001041703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004113401,"about_ca_topic_score_gemma":0.000001483255,"domain_scores_codex":[0.9978224,0.00009368169,0.0001815921,0.0006404961,0.0007677115,0.0004941166],"domain_scores_gemma":[0.99821,0.0006192579,0.00005670196,0.0006952526,0.0001706471,0.0002482142],"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.000002368916,0.00002871744,0.00002087569,0.000001535762,0.000002172324,0.000003895556,0.0001049235,0.0003017379,0.00002002537,0.9466943,0.0003128513,0.0525066],"study_design_scores_gemma":[0.0001360565,0.0002227095,0.002034598,0.00003701948,0.000002186991,0.00008743069,0.000003637482,0.6733585,0.0001780845,0.3216715,0.002083767,0.0001844937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003106681,0.000003021967,0.9825977,0.0009593073,0.0003304175,0.0000669071,0.000005571465,0.0003296,0.01260078],"genre_scores_gemma":[0.5769926,4.877689e-7,0.4223553,0.0004722601,0.0001623953,0.000005062988,0.000001910517,0.000004127885,0.000005812952],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6730568,"threshold_uncertainty_score":0.8564898,"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."}}