{"id":"W2021090044","doi":"10.1155/jamds.2005.107","title":"Minmax strongly connected subgraphs with node penalties","year":2005,"lang":"lv","type":"article","venue":"Journal of Applied Mathematics and Decision Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Computer science","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.002379418,0.0021861,0.001994104,0.001286422,0.001265995,0.002407762,0.004118057,0.002061143,0.02068381],"category_scores_gemma":[0.009800521,0.001084859,0.001762504,0.002374589,0.001181126,0.006985788,0.003661928,0.00266118,0.005126075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001813422,"about_ca_system_score_gemma":0.002695902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002520911,"about_ca_topic_score_gemma":0.007849603,"domain_scores_codex":[0.9978787,0.0007251711,0.00008959737,0.0007146382,0.0003587612,0.0002331736],"domain_scores_gemma":[0.9954455,0.001994027,0.0002777071,0.001369357,0.0005193865,0.0003941263],"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.001245994,0.0006898126,0.00269479,0.001143333,0.0002712939,0.0002682131,0.0003510547,0.2650543,0.005497287,0.2540818,0.1021194,0.3665827],"study_design_scores_gemma":[0.0001080357,0.0002327114,0.0005631813,0.00007569696,0.00008983786,0.0001807588,0.0001027106,0.6186019,0.004294472,0.35072,0.0249973,0.00003335547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03520566,0.0008926327,0.9280032,0.003060851,0.0003575823,0.0004735425,0.004299155,0.004974721,0.0227327],"genre_scores_gemma":[0.3012668,0.0008739308,0.6436055,0.001478588,0.0004322248,0.000963614,0.009797502,0.002085388,0.03949644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02068381,"threshold_uncertainty_score":0.0691942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03769871982691585,"score_gpt":0.3193389399781503,"score_spread":0.2816402201512344,"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."}}