{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001604985,0.0001644267,0.0001654577,0.0002797515,0.0004247387,0.0003541069,0.004052106,0.00003786244,0.00002393912],"category_scores_gemma":[0.0001801781,0.00008204833,0.00007085907,0.002563758,0.003450372,0.0007019644,0.001549086,0.0002018154,0.00004577482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005027515,"about_ca_system_score_gemma":0.00007363737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004365083,"about_ca_topic_score_gemma":0.000001782633,"domain_scores_codex":[0.9974508,0.0001810775,0.0003508459,0.0006674148,0.000676618,0.000673238],"domain_scores_gemma":[0.9979615,0.0006625332,0.00007232518,0.001053518,0.0001026181,0.0001474815],"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.000002655602,0.00004658872,0.0003717644,0.000001621307,0.000001270471,0.00000789866,0.0002149494,0.000005091446,0.0003084403,0.8801236,0.00002585596,0.1188902],"study_design_scores_gemma":[0.0004205279,0.00008614879,0.007051143,0.00007299861,0.000001004791,0.00004578011,0.000005386055,0.2228661,0.0009608141,0.7681163,0.000176859,0.0001968851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04564873,0.0000151945,0.9460687,0.004922172,0.0005149934,0.0001730956,0.00000127101,0.000167854,0.002487986],"genre_scores_gemma":[0.8852195,0.000005592333,0.1141466,0.0005528351,0.00005445664,0.00001066303,1.144932e-7,0.00000467225,0.000005660986],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8395707,"threshold_uncertainty_score":0.9992617,"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."}}