{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003213962,0.0002042725,0.0002626868,0.0003251414,0.000128348,0.0001135693,0.001030036,0.000135921,0.000002334075],"category_scores_gemma":[0.00003837114,0.0001900462,0.000078588,0.0005922567,0.00008511018,0.0001572856,0.001687567,0.0002483216,0.000009472983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008015303,"about_ca_system_score_gemma":0.00007894035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005460619,"about_ca_topic_score_gemma":0.00001045287,"domain_scores_codex":[0.9988344,0.00004920714,0.0002573333,0.0005592754,0.00009772186,0.0002020456],"domain_scores_gemma":[0.9984962,0.0002149014,0.0003199032,0.0007155722,0.0001703364,0.00008314079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000242377,0.0001043948,0.0003302222,0.0004241658,0.00009374869,0.00007464334,0.00266441,0.2789217,0.0003632495,0.7162528,0.0003805918,0.0003658828],"study_design_scores_gemma":[0.0001566149,0.00005935183,0.0003155274,0.0005003957,0.00005099465,0.00001477271,0.0001256049,0.7299448,0.000900764,0.2676717,0.00001086896,0.0002485497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03775544,0.00001276666,0.9605449,0.000291446,0.0001540825,0.0006355532,0.00001345765,0.0003970752,0.0001952692],"genre_scores_gemma":[0.7262073,0.00005408404,0.2734603,0.00004377188,0.00001681489,0.000005286941,0.00001141258,0.00002289685,0.000178166],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6884519,"threshold_uncertainty_score":0.7749857,"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."}}