{"id":"W2997995007","doi":"10.48550/arxiv.1912.09232","title":"Improving Clique Decompositions of Semidefinite Relaxations for Optimal\\n Power Flow Problems","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Semidefinite programming; Clique; Mathematics; Chordal graph; Mathematical optimization; Decomposition; Power flow; Clique problem; Extension (predicate logic); Flow (mathematics); Power (physics); Computer science; Combinatorics; Electric power system; Graph","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.0004660521,0.0007594721,0.0009602171,0.0007653924,0.0002799934,0.00008603005,0.0009685578,0.001075609,0.000175626],"category_scores_gemma":[0.0001001886,0.001016269,0.0008794332,0.0007182652,0.0001760953,0.0005199712,0.0005540622,0.001068876,0.00007536662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005330772,"about_ca_system_score_gemma":0.0003214493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001484157,"about_ca_topic_score_gemma":0.00002560833,"domain_scores_codex":[0.9969054,0.000124803,0.0008738196,0.001246157,0.000114866,0.0007348995],"domain_scores_gemma":[0.9963889,0.0005238636,0.0007391155,0.001472712,0.0006323218,0.0002431169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007369065,0.0001908604,0.000535769,0.001362901,0.0004269216,0.00001552075,0.0004736917,0.9602665,0.008938651,0.02695086,0.0003724,0.000392242],"study_design_scores_gemma":[0.001025967,0.0004225622,0.0001593004,0.0009962695,0.0006414061,0.000009574856,0.0001906894,0.9783108,0.007444627,0.008712365,0.000929155,0.001157331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06481231,0.0002016129,0.9259323,0.00002727665,0.0006470539,0.002615553,0.0006998963,0.0005413144,0.00452272],"genre_scores_gemma":[0.949558,0.0008704941,0.04781079,0.00002280108,0.00006683513,0.00002987978,0.000240548,0.0001573832,0.001243253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8847457,"threshold_uncertainty_score":0.9992288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04127062701432777,"score_gpt":0.1787413784370388,"score_spread":0.137470751422711,"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."}}