{"id":"W3186166992","doi":"10.1007/s11227-022-04457-9","title":"Efficient parallel graph trimming by arc-consistency","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Trimming; Computer science; Graph; Algorithm; Correctness; Parallel computing; Theoretical computer science","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.003779963,0.0001315798,0.0002218859,0.0001760142,0.001087567,0.00007276908,0.001698705,0.00001781639,0.00001988575],"category_scores_gemma":[0.0000402171,0.00009216228,0.0002025099,0.0006188209,0.00007616921,0.0001232614,0.0005241808,0.0005897331,0.000003745732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004308389,"about_ca_system_score_gemma":0.00006753775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001074258,"about_ca_topic_score_gemma":1.335882e-7,"domain_scores_codex":[0.9978845,0.0005880664,0.0005185795,0.0001438845,0.000543369,0.0003215908],"domain_scores_gemma":[0.9987891,0.0004628974,0.0002669685,0.0003126923,0.0000810022,0.00008733576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001711405,0.001294689,0.001148335,0.00004102652,0.0003621457,0.000339287,0.04295155,0.7031251,0.02300784,0.07813931,0.005760879,0.1436588],"study_design_scores_gemma":[0.005423581,0.001873428,0.001847029,0.0001921057,0.0001918071,0.01067096,0.01873617,0.8751711,0.003184354,0.07527144,0.006145847,0.001292135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6111088,0.001709706,0.3851987,0.0009286041,0.0007288042,0.00006825361,0.000001597778,0.00003090381,0.0002245712],"genre_scores_gemma":[0.9882102,0.00001081292,0.01125176,0.0003935365,0.00009226061,9.640623e-7,3.774899e-7,0.00000866719,0.00003140958],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3771014,"threshold_uncertainty_score":0.83648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01123330658389738,"score_gpt":0.2142469495600161,"score_spread":0.2030136429761187,"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."}}