{"id":"W3193304059","doi":"10.1145/3468791.3468817","title":"Truss Decomposition on Large Probabilistic Networks using H-Index","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Scalability; Probabilistic logic; Computer science; Computation; Decomposition; Mathematical optimization; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Memory footprint; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Engineering; Structural engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004100713,0.0007543068,0.0007278132,0.001341587,0.0005444459,0.0007782613,0.00102676,0.0006561824,0.003490274],"category_scores_gemma":[0.001880018,0.0004187153,0.0006799547,0.001003937,0.0005952938,0.001345471,0.00146,0.001011995,0.0009814949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008449693,"about_ca_system_score_gemma":0.0008734014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00564939,"about_ca_topic_score_gemma":0.01051277,"domain_scores_codex":[0.9996891,0.00004599637,0.00001408636,0.00006860332,0.0001442523,0.0000380723],"domain_scores_gemma":[0.9992535,0.0002716306,0.0001087828,0.0001394434,0.0001714832,0.00005511395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008110889,0.00006333023,0.001080529,0.0001511124,0.00005270156,0.0001489068,0.0001833007,0.6807003,0.01389769,0.03052621,0.00409872,0.2690161],"study_design_scores_gemma":[0.000005304338,0.00001864225,0.0001378981,0.000007458518,0.000004166377,0.00003885086,0.00002649297,0.9783683,0.002388077,0.01796698,0.001031666,0.000006138312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01012737,0.00007300273,0.9871857,0.00005305306,0.0000102181,0.00003901608,0.00005859599,0.0006424137,0.001810669],"genre_scores_gemma":[0.2152159,0.0001592983,0.7802312,0.00007348203,0.00002786995,0.0001167516,0.0004755536,0.000324651,0.003375258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00564939,"threshold_uncertainty_score":0.01167613,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01321801269526316,"score_gpt":0.2647139710968508,"score_spread":0.2514959584015876,"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."}}