{"id":"W2406451447","doi":"10.1007/978-3-319-26626-8_47","title":"Approximating the Restricted 1-Center in Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Saddle point; Center (category theory); Approximation algorithm; Separable space; Vertex (graph theory); Binary logarithm; Mathematics; Matrix (chemical analysis); Scaling; Distance matrix; Shortest path problem; Discrete mathematics; Graph; Geometry; Mathematical analysis","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001668838,0.0005446798,0.0005433346,0.00123613,0.0003156789,0.0006912557,0.005901822,0.0002786557,0.00001235627],"category_scores_gemma":[0.000196452,0.0004075969,0.0001569059,0.001972019,0.001026864,0.0005975107,0.002396175,0.001522012,0.0000264798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002793081,"about_ca_system_score_gemma":0.0005077887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006154587,"about_ca_topic_score_gemma":0.0002078922,"domain_scores_codex":[0.995488,0.00009322067,0.0007547145,0.001466273,0.001360241,0.0008375391],"domain_scores_gemma":[0.9967307,0.0006262966,0.000339096,0.001878443,0.0002589046,0.0001665297],"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.000007202352,0.00008100631,0.0002577539,0.00003484757,0.00001247063,0.000161887,0.001883313,0.01110893,0.00001830881,0.1811392,0.0001399472,0.8051551],"study_design_scores_gemma":[0.0003428333,0.0000796564,0.0002256317,0.0003023866,0.000002766973,0.00007944445,4.39028e-7,0.4228304,0.00003758879,0.5734531,0.002189136,0.0004566727],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001373963,0.0006713757,0.9883506,0.001297881,0.001771133,0.0005149841,0.000006041703,0.0001658717,0.007084734],"genre_scores_gemma":[0.1409389,0.000107511,0.8545823,0.003025187,0.0007500203,0.0000496003,0.00001629846,0.00008268438,0.0004474787],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8046984,"threshold_uncertainty_score":0.9998376,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03875089561815854,"score_gpt":0.2610966215960094,"score_spread":0.2223457259778509,"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."}}