{"id":"W4409657240","doi":"10.1145/3696410.3714603","title":"SANS: Efficient Densest Subgraph Discovery over Relational Graphs without Materialization","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Theoretical computer science","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.0009583201,0.001478667,0.001091107,0.002706197,0.0008064409,0.001503626,0.002084272,0.001005236,0.003686585],"category_scores_gemma":[0.006479518,0.0007367711,0.001233041,0.002714752,0.000746451,0.004578773,0.002053679,0.001332681,0.001805682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008002308,"about_ca_system_score_gemma":0.001475708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006764024,"about_ca_topic_score_gemma":0.02083824,"domain_scores_codex":[0.9991203,0.000137344,0.00005550006,0.000303021,0.0003214571,0.00006234798],"domain_scores_gemma":[0.9971271,0.001099725,0.0001920547,0.001127725,0.0003542195,0.00009909262],"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.0004042675,0.000195712,0.00622405,0.0008566295,0.0002803076,0.000526529,0.0005309001,0.1341093,0.03133779,0.0418738,0.03627658,0.7473841],"study_design_scores_gemma":[0.00004927062,0.00008357733,0.0008635191,0.00003093934,0.00005670852,0.0004410849,0.0002287021,0.906243,0.01816921,0.06044316,0.01336067,0.00003020159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03115698,0.0007046716,0.9501047,0.0003905991,0.00006382728,0.0001946604,0.002117232,0.01318523,0.002082224],"genre_scores_gemma":[0.1647863,0.000515307,0.8187946,0.0002052486,0.00006179299,0.0001301431,0.01018122,0.0009765717,0.004348751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006764024,"threshold_uncertainty_score":0.01344931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008129785943260292,"score_gpt":0.2452657957842301,"score_spread":0.2371360098409698,"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."}}