{"id":"W1974306683","doi":"10.1145/335191.335495","title":"An approximate search engine for structural databases","year":2000,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Parsing; Database; Information retrieval; XML; Set (abstract data type); Subgraph isomorphism problem; Graph database; Graph; Search engine; Heuristic; Data structure; XML database; Data mining; Theoretical computer science; World Wide Web; Programming language; Artificial intelligence","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.0001417562,0.0001333773,0.000118322,0.0000204244,0.00009940639,0.00003142512,0.0003518902,0.00008455183,0.0001901565],"category_scores_gemma":[0.00001953291,0.0001169852,0.00006335578,0.00004274863,0.00003909939,0.000009282304,0.00007025463,0.0000731979,0.00001111509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000621971,"about_ca_system_score_gemma":0.00003049376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003117456,"about_ca_topic_score_gemma":0.00003669292,"domain_scores_codex":[0.9991969,0.00001809846,0.0001784519,0.0002436625,0.00006540068,0.0002974462],"domain_scores_gemma":[0.9991282,0.0000164185,0.0000297384,0.0006935118,0.00003727384,0.00009487552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003488479,0.00003904158,0.0005537418,0.00005376433,0.00006862509,0.000001154669,0.0001162029,0.00125727,0.03807658,0.0001286172,0.007464588,0.9518915],"study_design_scores_gemma":[0.003903743,0.002591054,0.001834695,0.0000456989,0.00009029431,0.00008480745,0.0002464546,0.2603467,0.1165166,0.003930528,0.6087737,0.001635742],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9830652,0.0002548303,0.01544637,0.00009073723,0.0001665619,0.0003249246,0.0001649092,0.00002237736,0.000464121],"genre_scores_gemma":[0.9422075,0.0002511277,0.05355887,0.0003221637,0.0007385396,0.00003631278,0.001686299,0.00003274597,0.001166432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9502558,"threshold_uncertainty_score":0.4770517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02029490765508899,"score_gpt":0.2866351295362456,"score_spread":0.2663402218811566,"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."}}