{"id":"W2963874686","doi":"","title":"Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Combinatorics; Neighbourhood (mathematics); Approximation algorithm; Feedback vertex set; Mathematics; Vertex cover; Graph; Binary logarithm; Discrete mathematics","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.0002642488,0.0001348489,0.0001259579,0.0002015526,0.0002353005,0.00007239038,0.0005535198,0.00008380294,0.00001748662],"category_scores_gemma":[0.00002512176,0.0001435258,0.00009164602,0.00078223,0.00003814787,0.001527671,0.0001328647,0.0001004326,0.0000620849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007781377,"about_ca_system_score_gemma":0.0000346963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001672544,"about_ca_topic_score_gemma":0.000001020707,"domain_scores_codex":[0.9989398,0.00006031038,0.0001328866,0.0003479222,0.0000902063,0.0004288368],"domain_scores_gemma":[0.9990939,0.00008977063,0.00008005337,0.0003685614,0.000165443,0.0002021988],"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.00002565404,0.0003505107,0.01893134,0.00005779073,0.0000609653,0.0000120924,0.001265503,0.009016944,0.0003503539,0.9561776,0.0004120514,0.01333918],"study_design_scores_gemma":[0.0007777895,0.00007925559,0.00162983,0.0000218517,0.00001718562,0.000002133532,0.00008759828,0.9644359,0.0008856546,0.03082205,0.000975989,0.0002647051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05786976,0.00005257639,0.9392928,0.00007878746,0.0005959393,0.000339313,0.00000322595,0.0002203327,0.00154724],"genre_scores_gemma":[0.9567203,0.00007118187,0.04208424,0.00002958384,0.00005304978,0.00000310678,0.000008350135,0.00001108676,0.00101912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.955419,"threshold_uncertainty_score":0.5852811,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.091024929247383,"score_gpt":0.2135351025754776,"score_spread":0.1225101733280946,"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."}}