{"id":"W2023710022","doi":"10.1016/s0166-218x(01)00352-3","title":"Semidefinite programming for discrete optimization and matrix completion problems","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Lagrangian relaxation; Matrix completion; Relaxation (psychology); Mathematical optimization; Euclidean geometry; Matrix (chemical analysis); Euclidean distance matrix; Maximum cut; Optimization problem; Positive-definite matrix; Combinatorics; Eigenvalues and eigenvectors","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050154,0.0003700555,0.0005216927,0.0001851871,0.000354875,0.0002065543,0.0002403447,0.0001628355,0.0001659586],"category_scores_gemma":[0.0004069795,0.0003383166,0.00009759882,0.0003898762,0.0001686608,0.0002308179,0.0001494197,0.0002150943,0.00002406171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007629517,"about_ca_system_score_gemma":0.00001197994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.140472e-7,"about_ca_topic_score_gemma":0.000001829663,"domain_scores_codex":[0.9976338,0.00002699543,0.0007385729,0.0004922881,0.0005257184,0.0005826533],"domain_scores_gemma":[0.9980171,0.0007199008,0.0003882677,0.0004951188,0.0001990569,0.0001805571],"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.00005535764,0.0006518131,0.00002218477,0.005451203,0.0002321043,0.000004201024,0.007655764,0.1040962,0.001367801,0.8631219,0.001694798,0.01564665],"study_design_scores_gemma":[0.001268079,0.00008580046,0.00000125712,0.0001270225,0.00008981437,0.00001701349,0.0006415314,0.9032109,0.0002398486,0.09176645,0.002083725,0.0004685933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003623954,0.000128113,0.992438,0.000247757,0.00003810917,0.00297172,0.00005948303,0.0003480302,0.003406418],"genre_scores_gemma":[0.007719981,0.0001795032,0.989552,0.0000331164,0.00007970706,0.0009740138,0.0001317494,0.0001532563,0.001176654],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7991146,"threshold_uncertainty_score":0.9999069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06678160909610262,"score_gpt":0.3380575190064754,"score_spread":0.2712759099103728,"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."}}