{"id":"W1868020197","doi":"10.1111/coin.12009","title":"EXPLORING A SUBGRAPH MATCHING APPROACH FOR EXTRACTING BIOLOGICAL EVENTS FROM LITERATURE","year":2013,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Parsing; Subgraph isomorphism problem; Event (particle physics); Task (project management); Matching (statistics); Artificial intelligence; Natural language processing; Data mining; Graph; Machine learning; Information retrieval; Theoretical computer science","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.000120845,0.0001259974,0.0001126367,0.00003510817,0.00009777305,0.00004216895,0.0002052081,0.0001217549,0.00001505376],"category_scores_gemma":[0.0002009818,0.0001025534,0.00008958922,0.00009395738,0.00006557399,0.0000112176,0.00007436032,0.0001145175,0.00001273076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007123395,"about_ca_system_score_gemma":0.00001858676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000228285,"about_ca_topic_score_gemma":5.068264e-7,"domain_scores_codex":[0.9991126,0.00003825231,0.0002027296,0.0003512473,0.0001035586,0.000191606],"domain_scores_gemma":[0.9994603,0.0001735581,0.00006643014,0.0001104295,0.0001223621,0.00006685231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002391906,0.0005358139,0.008348287,0.0001223258,0.0003365699,0.000006001108,0.002280363,0.04581142,0.09347689,0.002671958,0.002030959,0.8441402],"study_design_scores_gemma":[0.00168541,0.002113289,0.1805189,0.000861767,0.00008351717,0.0001575301,0.009851526,0.2148938,0.1208486,0.4514121,0.01416292,0.003410701],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4146431,0.000906896,0.5840287,0.0000729796,0.0001113522,0.0001297297,0.00001782421,0.00002261293,0.00006687193],"genre_scores_gemma":[0.7841993,0.00009845512,0.2146361,0.0001481011,0.0002156741,0.0001463098,0.0005151656,0.000008324544,0.00003254071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8407295,"threshold_uncertainty_score":0.4182005,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1513965231349128,"score_gpt":0.3182117274519525,"score_spread":0.1668152043170398,"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."}}