{"id":"W4287307637","doi":"10.1007/s10619-022-07415-9","title":"Scalable probabilistic truss decomposition using central limit theorem and H-index","year":2022,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Probabilistic logic; Computer science; Scalability; Algorithm; Discrete mathematics; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; 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":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","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.0009613773,0.0006913165,0.001817696,0.001482626,0.0008380573,0.001635729,0.002209426,0.0009503908,0.005468805],"category_scores_gemma":[0.004161977,0.0006647219,0.0008892802,0.001936259,0.0008867917,0.003772615,0.002561056,0.001309898,0.001219343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028136,"about_ca_system_score_gemma":0.001383721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002829303,"about_ca_topic_score_gemma":0.004577346,"domain_scores_codex":[0.9991653,0.0001624207,0.00004071003,0.0001586371,0.0003784722,0.00009438367],"domain_scores_gemma":[0.9979762,0.0006090135,0.000176464,0.0006898076,0.0004135817,0.0001349759],"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.0003462147,0.0002368663,0.000809358,0.0001888717,0.0001128137,0.0001170723,0.00013954,0.5953601,0.009983049,0.1492242,0.01234356,0.2311384],"study_design_scores_gemma":[0.00001181578,0.00001675138,0.00006068347,0.000003713433,0.000007244704,0.00002368487,0.00001213093,0.9549565,0.0008092101,0.04336919,0.0007224414,0.000006628179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01166922,0.0001551098,0.9841917,0.0001177231,0.0000381227,0.00004259247,0.0001202022,0.0008191321,0.00284627],"genre_scores_gemma":[0.3831856,0.0002768739,0.6091279,0.0001425997,0.0001032252,0.0001846016,0.0006213535,0.0004434684,0.005914432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005468805,"threshold_uncertainty_score":0.01829499,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02352944767420543,"score_gpt":0.2592946132143147,"score_spread":0.2357651655401093,"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."}}