{"id":"W1999881791","doi":"10.1016/j.dam.2009.11.003","title":"Parallel cleaning of a network with brushes","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bipartite graph; Mathematics; Process (computing); Combinatorics; Brush; Algorithm; Computer science; Graph; Materials science; Composite material","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.0004049811,0.0005117289,0.001459589,0.0007890663,0.001679751,0.001413179,0.00116474,0.0009724873,0.009882257],"category_scores_gemma":[0.001816434,0.0006765997,0.0008235811,0.0008112771,0.0008888973,0.002127952,0.002573754,0.001193523,0.001449105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006489475,"about_ca_system_score_gemma":0.0005076617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180681,"about_ca_topic_score_gemma":0.001487719,"domain_scores_codex":[0.9995844,0.00004514313,0.00002200877,0.0001320734,0.0001448719,0.00007148967],"domain_scores_gemma":[0.99914,0.0001605636,0.00006224317,0.0004039582,0.0001360608,0.0000971426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001242404,0.0003594534,0.002632197,0.0004803091,0.0002155932,0.0009113484,0.0008650703,0.2852305,0.3102081,0.1344321,0.008836975,0.2545859],"study_design_scores_gemma":[0.00009943989,0.0003178837,0.001166987,0.00004839968,0.00006358336,0.0003619612,0.0002856899,0.7986337,0.07418742,0.1007344,0.02403867,0.00006183084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1737607,0.0007799868,0.8040464,0.0005084252,0.0005385349,0.000111481,0.0001412469,0.001859562,0.01825364],"genre_scores_gemma":[0.7747161,0.000611989,0.1958412,0.00016784,0.0001018351,0.0001520748,0.0002157535,0.000551098,0.02764211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009882257,"threshold_uncertainty_score":0.03305948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01152214133440148,"score_gpt":0.2189692042722768,"score_spread":0.2074470629378754,"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."}}