{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002409466,0.0001369474,0.0002797382,0.00003222661,0.00007805109,0.00007381788,0.0004212539,0.00004901332,0.000006842797],"category_scores_gemma":[0.000004439053,0.0000983093,0.00005239173,0.0002580037,0.00002681186,0.0001040122,0.00004913543,0.00008936079,0.00001339082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001116876,"about_ca_system_score_gemma":0.00001671753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002282083,"about_ca_topic_score_gemma":0.000003575266,"domain_scores_codex":[0.9989937,0.00001047009,0.0003298126,0.0001964126,0.0002234084,0.0002462261],"domain_scores_gemma":[0.9991624,0.00006962383,0.0002154688,0.0004597417,0.00004143714,0.00005133361],"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.000009665377,0.00003318774,0.000009909572,0.00003160179,0.00002099705,0.000002394165,0.001501104,0.008164874,0.0001812424,0.9865325,0.000886928,0.002625587],"study_design_scores_gemma":[0.001516692,0.0007810554,0.0005564193,0.0007185569,0.00005776029,0.0001130205,0.001637929,0.6303051,0.001438742,0.3592729,0.002631485,0.0009704034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004726002,0.00003652782,0.9435397,0.0001096258,0.00006119013,0.0001988684,3.572302e-7,0.0001080785,0.05121964],"genre_scores_gemma":[0.7094845,0.000003689801,0.2902048,0.0001307913,0.00007990482,0.000009347101,9.01163e-7,0.000007523947,0.00007859762],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7047585,"threshold_uncertainty_score":0.4008937,"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."}}