{"id":"W4281779720","doi":"10.1145/3514221.3517837","title":"A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 International Conference on Management of Data","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"University of Hong Kong","keywords":"Scalability; Parameterized complexity; Computer science; Bipartite graph; Approximation algorithm; Linear programming; Matching (statistics); Theoretical computer science; Induced subgraph isomorphism problem; Directed graph; Graph; Mathematical optimization; Algorithm; Mathematics; Line 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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004804088,0.0001492091,0.0001796403,0.0001709663,0.0001786705,0.0001287972,0.006392463,0.00001693516,0.00001406432],"category_scores_gemma":[0.00003509528,0.0001248652,0.00009866092,0.0006215093,0.00009523641,0.0005453807,0.00543437,0.0001812067,2.752435e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004515264,"about_ca_system_score_gemma":0.00001774023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004721988,"about_ca_topic_score_gemma":3.405726e-7,"domain_scores_codex":[0.9979525,0.00001376933,0.0003336172,0.0006005149,0.000890944,0.0002086267],"domain_scores_gemma":[0.9986861,0.00005334781,0.0004652582,0.0005456965,0.0002208708,0.00002876585],"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.0001217979,0.0003679331,0.0005195693,0.0001290247,0.0001977185,7.890182e-7,0.00007999368,0.001752818,0.0008750056,0.9828885,0.001835809,0.01123107],"study_design_scores_gemma":[0.001013209,0.0002631854,0.001231529,0.0001321304,0.00007331053,0.000007701024,0.001117279,0.9761641,0.001347363,0.01290027,0.005416006,0.0003338885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1088692,0.0003040541,0.833984,0.008358441,0.003830393,0.006517866,0.001975733,0.0005720554,0.03558838],"genre_scores_gemma":[0.9272701,0.00003768687,0.0715167,0.0001041052,0.00002427725,0.0002141792,0.0001243355,0.00001284323,0.0006957473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9744113,"threshold_uncertainty_score":0.9989834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06422309090837273,"score_gpt":0.2962473222413728,"score_spread":0.232024231333,"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."}}