{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004576493,0.0003385196,0.0007271484,0.000895325,0.0006140123,0.001070858,0.001871294,0.0001022163,0.00006030664],"category_scores_gemma":[0.000292769,0.0002072707,0.000133598,0.001605449,0.001413476,0.001056106,0.0004019247,0.000463721,0.00002603707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005498176,"about_ca_system_score_gemma":0.0004978578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001448077,"about_ca_topic_score_gemma":0.000009383799,"domain_scores_codex":[0.9945509,0.00001867591,0.001167755,0.0004940157,0.003166754,0.0006018586],"domain_scores_gemma":[0.9946679,0.002301528,0.001213973,0.0004891214,0.0009173044,0.0004101981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005006738,0.0005327719,0.00008513703,0.0001017344,0.00009956784,0.00005764928,0.005308419,0.006315326,0.002182367,0.8092492,0.0008760407,0.1746911],"study_design_scores_gemma":[0.003171686,0.002334261,0.0002830524,0.0009510574,0.00009542966,0.001078352,0.01297255,0.1120095,0.005180796,0.8583049,0.002855411,0.0007630945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4628912,0.001216013,0.5315281,0.0004315506,0.0001327083,0.0002097708,0.000003754211,0.00001393089,0.003573001],"genre_scores_gemma":[0.3243055,0.0004075346,0.6750795,0.00008077918,0.00009496597,0.000002520238,7.219465e-8,0.00001216989,0.00001690964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.173928,"threshold_uncertainty_score":0.9999661,"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."}}