{"id":"W4394591182","doi":"10.4230/lipics.socg.2025.63","title":"The Maximum Clique Problem in a Disk Graph Made Easy","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Clique graph; Graph; Combinatorics; Block graph; Computer science; Clique problem; Simplex graph; Split graph; Mathematics; Line graph; Pathwidth; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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.0004066291,0.0003056237,0.0002479349,0.000263538,0.0002080415,0.0003965411,0.002908756,0.0002529292,0.000007179649],"category_scores_gemma":[0.00001398302,0.0002429734,0.0001947852,0.0008487727,0.0001190658,0.0002790697,0.007575562,0.00114396,0.0001203571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001512607,"about_ca_system_score_gemma":0.0002268296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004472278,"about_ca_topic_score_gemma":0.0001745334,"domain_scores_codex":[0.9978543,0.0001716342,0.0002384277,0.001183588,0.0001221492,0.0004298807],"domain_scores_gemma":[0.9979689,0.0001323603,0.0001445734,0.001561061,0.00006148134,0.0001316996],"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.0000437162,0.0001398726,0.001228835,0.0001962064,0.00009167116,0.001379331,0.0003911506,0.03998917,0.00003005232,0.9405706,0.002338936,0.01360045],"study_design_scores_gemma":[0.0001920758,0.00002630577,0.0007942839,0.0002574449,0.00001872117,0.000005848588,0.00003861595,0.3212254,0.00002261169,0.6710938,0.006008578,0.0003163438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05284898,0.001176775,0.9299838,0.001141999,0.002142723,0.001009304,0.00007232511,0.0006359836,0.01098811],"genre_scores_gemma":[0.9900479,0.001145257,0.005127968,0.00009593615,0.0001063004,0.000006536614,0.00002158055,0.00002823467,0.00342025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9371989,"threshold_uncertainty_score":0.990817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03848027746986057,"score_gpt":0.1872659795534309,"score_spread":0.1487857020835704,"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."}}