{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002229943,0.0000882747,0.0001112289,0.00007302848,0.0001051169,0.00003394927,0.0003573941,0.00004176743,0.00007483521],"category_scores_gemma":[0.00000661324,0.00007068949,0.00005354808,0.000265731,0.00007608792,0.0001422435,0.00009350281,0.00007101434,0.00004386901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007601883,"about_ca_system_score_gemma":0.000006525575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009151231,"about_ca_topic_score_gemma":0.00001312954,"domain_scores_codex":[0.9992628,0.00007062493,0.00014677,0.0002015224,0.0001164075,0.000201841],"domain_scores_gemma":[0.9994298,0.00007715066,0.00006080364,0.0003304839,0.00004500873,0.00005672862],"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.00003099794,0.0006552041,0.0006098923,0.000006780329,0.00003176653,0.00000777592,0.0003020577,0.00009708669,0.0036315,0.9651337,0.0008579001,0.02863533],"study_design_scores_gemma":[0.001408108,0.001656805,0.003060913,0.00007927984,0.00001527604,0.00003732484,0.00002558197,0.8203102,0.1109698,0.05774827,0.004269771,0.0004186813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06261828,0.00006313762,0.9302547,0.000237147,0.0004002401,0.00007600124,0.000003594499,0.0001138541,0.006233054],"genre_scores_gemma":[0.9812502,0.000003067828,0.01793104,0.0006330272,0.00006301944,0.000002020058,0.000003372301,0.000004525567,0.0001096847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.918632,"threshold_uncertainty_score":0.2882634,"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."}}