{"id":"W2513849254","doi":"10.1371/journal.pone.0161474","title":"BRIDES: A New Fast Algorithm and Software for Characterizing Evolving Similarity Networks Using Breakthroughs, Roadblocks, Impasses, Detours, Equals and Shortcuts","year":2016,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Similarity (geometry); Computer science; Software; Algorithm; Computational biology; Biology; Artificial intelligence; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000253028,0.0003093889,0.000596321,0.000079211,0.0002765661,0.0002084614,0.0001565213,0.00008663181,0.0001199553],"category_scores_gemma":[0.00003597119,0.000269766,0.0001021663,0.0001657804,0.00007044914,0.0004273947,0.0002379828,0.0001490026,7.983364e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005924432,"about_ca_system_score_gemma":0.00007305601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005576035,"about_ca_topic_score_gemma":0.00002947599,"domain_scores_codex":[0.9982995,0.00005129211,0.0003917405,0.0005277438,0.000198735,0.0005309716],"domain_scores_gemma":[0.9987274,0.000320349,0.000229241,0.0003321347,0.000168827,0.0002220485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004178637,0.0005650927,0.2052004,0.00008299883,0.001553764,0.000003858892,0.0001913112,0.00001714487,0.02276867,0.0004434969,0.001426103,0.7677053],"study_design_scores_gemma":[0.0078039,0.001022145,0.0883882,0.01069518,0.007162925,0.00003859316,0.0007396428,0.7911676,0.05505265,0.02829392,0.003382878,0.006252305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2026164,0.0007481722,0.7955986,0.0002335863,0.00001550538,0.0004999928,0.00011115,0.0001486038,0.00002795696],"genre_scores_gemma":[0.7948722,0.0001004619,0.2033893,0.00008171024,0.001265716,0.00004607643,0.0000625395,0.0000627893,0.0001192668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7911505,"threshold_uncertainty_score":0.9999754,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04307155289782734,"score_gpt":0.2658913128315057,"score_spread":0.2228197599336784,"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."}}