{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008544116,0.001241475,0.001043776,0.001936379,0.0008161243,0.002622954,0.002646494,0.001299907,0.007845215],"category_scores_gemma":[0.00731454,0.0006017605,0.001106372,0.003240645,0.001065993,0.006005454,0.002742193,0.001487235,0.001648336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001841696,"about_ca_system_score_gemma":0.00296667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007010965,"about_ca_topic_score_gemma":0.01849857,"domain_scores_codex":[0.9974148,0.0004848933,0.0001470231,0.0005161988,0.00100393,0.00043308],"domain_scores_gemma":[0.9941327,0.002613923,0.0002986289,0.002129719,0.000632718,0.0001923289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001550609,0.0008144849,0.00670225,0.0007172442,0.00022285,0.000262134,0.0003503669,0.1717995,0.04822946,0.06952446,0.04710183,0.6527249],"study_design_scores_gemma":[0.0001855237,0.0002760362,0.0007450313,0.00002584014,0.00008156097,0.0001818778,0.0001840125,0.9073796,0.01393001,0.0703106,0.006667481,0.00003243486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320519,0.001753127,0.820596,0.00239528,0.0005577668,0.000300017,0.0009638707,0.02270293,0.01867904],"genre_scores_gemma":[0.5452585,0.0004325418,0.4461052,0.0005482458,0.0002422913,0.0001860886,0.001579368,0.001001853,0.004645848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007845215,"threshold_uncertainty_score":0.02624488,"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."}}