{"id":"W4385408288","doi":"10.1007/s00778-023-00805-0","title":"Accelerating directed densest subgraph queries with software and hardware approaches","year":2023,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Shenzhen Science and Technology Innovation Program; National Natural Science Foundation of China; Chinese University of Hong Kong, Shenzhen","keywords":"Computer science; Speedup; Scalability; Parameterized complexity; Bipartite graph; Computation; Matching (statistics); Approximation algorithm; Linear programming; Theoretical computer science; Graph; Algorithm; Parallel computing; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.000495258,0.000136648,0.0001418671,0.0001435666,0.001114943,0.0007688688,0.0006612409,0.00003015482,0.000009422633],"category_scores_gemma":[0.00006854496,0.00008034425,0.0000501115,0.0008812029,0.000186294,0.0004303765,0.0002569608,0.0003590515,0.000007068521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001029965,"about_ca_system_score_gemma":0.00005885605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001364575,"about_ca_topic_score_gemma":0.00003929716,"domain_scores_codex":[0.998932,0.0001136824,0.0001626574,0.0001986564,0.0002927123,0.0003002995],"domain_scores_gemma":[0.9992285,0.000219018,0.0001015655,0.0002805281,0.00007561862,0.00009478425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00009692661,0.0001352123,0.06555642,0.0001240995,0.0004514947,0.0007117876,0.02582942,0.001502855,0.0003583169,0.05760957,0.008624384,0.8389995],"study_design_scores_gemma":[0.002751908,0.0009700579,0.5868365,0.000708388,0.0001248291,0.01241859,0.006119307,0.2089982,0.002691992,0.161187,0.01522886,0.001964359],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7074201,0.001056824,0.2834009,0.005551496,0.0005760097,0.0002341129,0.000007988479,0.001215369,0.000537197],"genre_scores_gemma":[0.8193328,0.0002916522,0.179204,0.0002875054,0.0004074233,0.00001922772,0.000003691547,0.00003011346,0.0004235345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8370352,"threshold_uncertainty_score":0.8575353,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08005984562599212,"score_gpt":0.2340146645626377,"score_spread":0.1539548189366456,"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."}}