{"id":"W2898304968","doi":"10.1109/asonam.2018.8508642","title":"K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Computer science; Asynchronous communication; Focus (optics); Computation; Theoretical computer science; Graph; Parallel computing; Algorithm; Engineering; Structural engineering; Computer network","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.0001338644,0.0003543392,0.0003038209,0.0004816812,0.0003344016,0.0002999954,0.0006334477,0.0003179022,0.002886157],"category_scores_gemma":[0.0007732618,0.0002096151,0.0003244306,0.0005645023,0.0003448872,0.0008751917,0.0004498406,0.0004711002,0.0005533836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005506686,"about_ca_system_score_gemma":0.000447856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003624171,"about_ca_topic_score_gemma":0.008638908,"domain_scores_codex":[0.9998837,0.00001616896,0.000005645531,0.00002430111,0.00004831106,0.0000219494],"domain_scores_gemma":[0.9996899,0.00009227938,0.00003988991,0.00007717669,0.00007871583,0.00002193111],"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.0001464812,0.00009420641,0.001727984,0.0001322887,0.0000253668,0.0002758521,0.0001466146,0.8094789,0.03310653,0.02974424,0.004485304,0.1206362],"study_design_scores_gemma":[0.00001262514,0.00003951052,0.0003936732,0.000004001072,0.000004645354,0.00004879606,0.00003582267,0.9789886,0.007833065,0.011211,0.001422747,0.000005499077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2673814,0.0001002518,0.7194062,0.0002102472,0.00003361081,0.00006070868,0.0001572155,0.002132993,0.01051743],"genre_scores_gemma":[0.67295,0.0001027822,0.3214845,0.00004766289,0.00001177327,0.00007691186,0.0003021638,0.0001739447,0.004850313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003624171,"threshold_uncertainty_score":0.009655118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01127455158807124,"score_gpt":0.2631326818739465,"score_spread":0.2518581302858752,"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."}}