{"id":"W4408229973","doi":"10.1101/2025.02.28.640915","title":"FASTiso: Fast Algorithm on Search state Tree for subgraph ISOmorphism in graphs of any size and density","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Isomorphism (crystallography); Tree (set theory); Combinatorics; Mathematics; Algorithm; State (computer science); Computer science; Graph; Line graph; Chemistry","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001456516,0.0006118509,0.000879207,0.0009373818,0.0001788636,0.0002135036,0.001626686,0.0003891473,0.000002836998],"category_scores_gemma":[0.0002254085,0.0006613979,0.000246464,0.00140799,0.0003025256,0.0002383221,0.001346286,0.0008269509,0.000002728624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009092035,"about_ca_system_score_gemma":0.0004570583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009988418,"about_ca_topic_score_gemma":0.00001112054,"domain_scores_codex":[0.9963174,0.0003038282,0.0006897777,0.00148069,0.0004611471,0.0007471606],"domain_scores_gemma":[0.9965865,0.0005880435,0.00033125,0.00170226,0.0005307621,0.0002611669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.001213295,0.005536849,0.07843552,0.00969296,0.002512796,0.001151289,0.001713383,0.001778893,0.545149,0.3411591,0.0007621765,0.01089474],"study_design_scores_gemma":[0.004220406,0.0006737518,0.547408,0.002268414,0.0001296657,1.250604e-7,0.00002016856,0.0512729,0.3862301,0.005089135,0.0002694164,0.002417846],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.738955,0.0005237348,0.2566996,0.0002489965,0.001064988,0.001360526,0.0008905965,0.0002484955,0.000008027324],"genre_scores_gemma":[0.9002351,0.000280018,0.09906084,0.0001609224,0.00005103578,0.0001588275,3.113746e-7,0.00004169503,0.00001127854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4689725,"threshold_uncertainty_score":0.9995837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01094072056169564,"score_gpt":0.2206855174911498,"score_spread":0.2097447969294541,"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."}}