{"id":"W4384807922","doi":"10.48550/arxiv.2307.09022","title":"Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Organization for Women in Science for the Developing World; University of Waterloo; Styrelsen för Internationellt Utvecklingssamarbete","keywords":"Adjacency matrix; Mathematics; Clique; Matrix (chemical analysis); Mathematical optimization; Uniqueness; Clique problem; Maximum cut; Graph; Combinatorics; Discrete mathematics; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407824,0.001056437,0.0009163285,0.0008615194,0.0004663944,0.0008911687,0.0008782992,0.001243597,0.001819465],"category_scores_gemma":[0.004228293,0.0004359205,0.001047444,0.00110183,0.001391925,0.001970479,0.001790863,0.002313283,0.0003477267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007942307,"about_ca_system_score_gemma":0.001019188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002331362,"about_ca_topic_score_gemma":0.002593652,"domain_scores_codex":[0.9993019,0.0003293046,0.00002443897,0.0001038931,0.0001712806,0.00006914868],"domain_scores_gemma":[0.9983068,0.001055165,0.0002081366,0.0001592947,0.0001866132,0.00008404451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002611362,0.00003495902,0.0003051549,0.0001188918,0.00003432158,0.0001138958,0.00008602867,0.7919419,0.003448682,0.1856376,0.001423829,0.01682864],"study_design_scores_gemma":[0.000004253302,0.00002083979,0.00003995064,0.000006714363,0.000002952116,0.00002648594,0.00001542511,0.9434695,0.0004289795,0.05514356,0.00083541,0.000006034988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003099824,0.00007791495,0.995536,0.0001153734,0.00001964335,0.00001200068,0.00001467475,0.0000394798,0.001085174],"genre_scores_gemma":[0.261427,0.0006831705,0.7332766,0.0002346162,0.0001296153,0.0001846124,0.0002169179,0.0001625218,0.003684792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002331362,"threshold_uncertainty_score":0.007445335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06260207752066671,"score_gpt":0.231643058431272,"score_spread":0.1690409809106053,"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."}}