{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009136013,0.005957948,0.006631098,0.005781055,0.004499454,0.01104353,0.01406077,0.00643522,0.01382233],"category_scores_gemma":[0.0543543,0.003079986,0.004496695,0.00948178,0.006761577,0.02090231,0.009021281,0.01390593,0.002387447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008481152,"about_ca_system_score_gemma":0.004486593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006454252,"about_ca_topic_score_gemma":0.007487541,"domain_scores_codex":[0.9916806,0.002868744,0.0003065739,0.001560178,0.001756411,0.001827645],"domain_scores_gemma":[0.9305681,0.05533617,0.002868089,0.005969026,0.002100591,0.003157992],"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.006013601,0.002581799,0.01016636,0.003347413,0.0008061339,0.0004624832,0.002473106,0.3919572,0.006755308,0.4093305,0.07686062,0.08924552],"study_design_scores_gemma":[0.0003430034,0.00016293,0.0009693173,0.000129033,0.0002212024,0.0002281479,0.0003963767,0.6060913,0.001900804,0.3855767,0.003919283,0.00006189099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2943048,0.01634714,0.5678044,0.03017278,0.001172613,0.000834918,0.006685615,0.003104023,0.0795737],"genre_scores_gemma":[0.7758729,0.006788012,0.1880936,0.003439083,0.002488592,0.001123348,0.00578039,0.001208001,0.01520607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01406077,"threshold_uncertainty_score":0.06153542,"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."}}