{"id":"W2418872760","doi":"10.1016/j.tcs.2016.04.044","title":"Approximating the restricted 1-center in graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Saddle point; Approximation algorithm; Center (category theory); Separable space; Binary logarithm; Vertex (graph theory); Discrete mathematics; Matrix (chemical analysis); Distance matrix; Graph; Mathematical analysis; Geometry","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.001587523,0.001688325,0.002224713,0.002095137,0.001764487,0.003776418,0.004173864,0.002660084,0.008777607],"category_scores_gemma":[0.01354471,0.0009947508,0.001142155,0.00253988,0.002868244,0.007931477,0.004141177,0.003361639,0.001779266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003195008,"about_ca_system_score_gemma":0.001519819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004543398,"about_ca_topic_score_gemma":0.006673842,"domain_scores_codex":[0.998091,0.0006060385,0.0000614801,0.0005199282,0.0003241781,0.0003972909],"domain_scores_gemma":[0.9903232,0.005803543,0.0008799648,0.001663444,0.0006336293,0.0006962116],"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.002239925,0.0006475649,0.006227577,0.0009798787,0.000143351,0.0002793561,0.001231442,0.3115381,0.01137008,0.5312966,0.02857249,0.1054738],"study_design_scores_gemma":[0.0001259803,0.00009017427,0.000592956,0.00005556393,0.00005752745,0.0001520884,0.00024003,0.3988565,0.003825093,0.5926297,0.003346889,0.00002749939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5172235,0.001598132,0.4462451,0.003067892,0.0001917118,0.0001593808,0.001186166,0.002905242,0.02742288],"genre_scores_gemma":[0.8436321,0.0006769841,0.1449451,0.0005890247,0.0001879596,0.0001329003,0.001254964,0.0008852978,0.007695611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008777607,"threshold_uncertainty_score":0.02936405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01411976057326362,"score_gpt":0.2435274311533558,"score_spread":0.2294076705800922,"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."}}