{"id":"W2408452789","doi":"10.1080/03155986.2005.11732724","title":"Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Block (permutation group theory); Integer programming; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Induced subgraph isomorphism problem; Linear programming; Induced subgraph; Discrete mathematics; Mathematical optimization; Computer science; Line graph; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002920347,0.0001293108,0.0001380375,0.0004141842,0.001657329,0.001717712,0.0006564413,0.00006829091,0.000007548929],"category_scores_gemma":[0.0002910734,0.00008255113,0.00005804894,0.0005548469,0.0001433844,0.005387349,0.0002753678,0.0002833947,0.00005783344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022141,"about_ca_system_score_gemma":0.0001893127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003465809,"about_ca_topic_score_gemma":0.00002891687,"domain_scores_codex":[0.9976159,0.00009417452,0.0005721748,0.0001648926,0.001080131,0.0004726749],"domain_scores_gemma":[0.9970654,0.0009990021,0.00008731939,0.0003897235,0.001323785,0.0001347781],"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.00001578827,0.00001218677,0.0001977186,0.00005378092,0.00001322483,6.049198e-8,0.001752117,0.004312347,0.00006727562,0.9676752,0.00216738,0.0237329],"study_design_scores_gemma":[0.000726146,0.0001507977,0.001509672,0.00005540666,0.00000194337,0.00002700928,0.0006729536,0.5474412,0.0003087056,0.01330868,0.4356023,0.0001952017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01420571,0.0004406318,0.9652456,0.00812597,0.0001837307,0.003694293,0.00005778277,0.0001142855,0.007931997],"genre_scores_gemma":[0.986094,0.00006754172,0.01096602,0.0003520864,0.0001793408,0.001449628,0.00005737051,0.000007757424,0.0008262765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718882,"threshold_uncertainty_score":0.9996424,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06202741432814226,"score_gpt":0.3603149411181166,"score_spread":0.2982875267899744,"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."}}