{"id":"W2074892433","doi":"10.1016/j.ipl.2007.08.005","title":"Approximation and inapproximability results for maximum clique of disc graphs in high dimensions","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Clique; Mathematics; Approximation algorithm; Set (abstract data type); Euclidean geometry; Euclidean space; Time complexity; Space (punctuation); Independent set; Euclidean distance; Discrete mathematics; Graph; Computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.00246682,0.0001028167,0.0001415619,0.0004707958,0.0001169059,0.00008821108,0.0002714095,0.00005655285,1.811362e-7],"category_scores_gemma":[0.0004178532,0.00009446874,0.00002844074,0.0007222319,0.0001535813,0.003441641,0.00009593443,0.0001357888,7.714761e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165007,"about_ca_system_score_gemma":0.00004143906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001230768,"about_ca_topic_score_gemma":0.000006037292,"domain_scores_codex":[0.9986266,0.00004565737,0.0006266254,0.000181422,0.0002531529,0.0002665689],"domain_scores_gemma":[0.9989404,0.0002811305,0.0002897734,0.0002584551,0.0001764848,0.00005373283],"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.001048374,0.0002025775,0.005016157,0.001679259,0.00001720021,0.000002670882,0.02018859,0.002606928,0.01517418,0.2687197,0.0002049984,0.6851394],"study_design_scores_gemma":[0.006837336,0.0003217754,0.0647092,0.0004552609,0.00001109254,0.00002570337,0.001176307,0.1746024,0.04914262,0.701008,0.0008844571,0.0008258522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3317304,0.00001071916,0.6664199,0.001298894,0.00003418554,0.0003521699,0.000006072377,0.00004313643,0.0001045351],"genre_scores_gemma":[0.874285,0.000002270872,0.1252401,0.0004082924,0.000004887673,0.00003354115,0.00002085492,0.000003515261,0.000001511739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6843135,"threshold_uncertainty_score":0.3852324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01400968390451881,"score_gpt":0.278734077731017,"score_spread":0.2647243938264982,"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."}}