{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002029739,0.0000895742,0.00009455025,0.00004062686,0.0001673539,0.0001341263,0.0002391015,0.00004574762,0.00006599491],"category_scores_gemma":[0.00001354485,0.00007916729,0.00005969702,0.0003669583,0.00001507286,0.0001956053,0.0001124408,0.0001042042,0.00002025568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002356916,"about_ca_system_score_gemma":0.00003077772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001972622,"about_ca_topic_score_gemma":0.00000459577,"domain_scores_codex":[0.9991215,0.0001021165,0.0001200319,0.000292216,0.000126091,0.0002380622],"domain_scores_gemma":[0.9994309,0.00007418512,0.0000298418,0.0003474381,0.00005340634,0.00006420571],"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.000005411334,0.0001803898,0.0002216349,0.000005856982,0.0000111597,0.00007447624,0.00007462306,0.02994365,0.0002507598,0.9608226,0.00006090081,0.008348578],"study_design_scores_gemma":[0.000216163,0.00003118524,0.000750477,0.0000214344,0.000003414599,0.00003895625,0.00001309088,0.9456092,0.001042516,0.05198085,0.0001731495,0.0001195439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04230526,0.00003238541,0.9539273,0.0001528019,0.0004238063,0.00006175954,7.9104e-7,0.0001171213,0.002978756],"genre_scores_gemma":[0.9758069,0.000001736506,0.0231992,0.0007315763,0.00007706658,0.000003027864,0.000003606033,0.000005173745,0.0001717091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9335017,"threshold_uncertainty_score":0.3228348,"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."}}