{"id":"W4413013076","doi":"10.1080/10618600.2025.2544182","title":"On Seeded Subgraph-to-Subgraph Matching: The ssSGM Algorithm and Matchability Information Theory","year":2025,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Matching (statistics); Seeding; Algorithm; Computer science; Mathematics; Artificial intelligence; Combinatorics; Graph; Statistics; Line graph; Biology","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.00129801,0.0001556942,0.0002263712,0.000396395,0.000348724,0.0002754731,0.0003560255,0.0000577695,0.000004149757],"category_scores_gemma":[0.0001695849,0.0001017107,0.00007834539,0.0006873997,0.0002397742,0.0003680522,0.0001133135,0.000345394,0.000001929585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001412691,"about_ca_system_score_gemma":0.00007482942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004492289,"about_ca_topic_score_gemma":8.822472e-7,"domain_scores_codex":[0.9985031,0.0002153106,0.0005345449,0.0001482088,0.0004291266,0.000169698],"domain_scores_gemma":[0.9968513,0.002276757,0.0002266644,0.0001375425,0.0003563891,0.0001513346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006125453,0.00004322506,0.0001460861,0.00001952031,0.00005470223,0.000005141376,0.0004828975,0.002269907,0.000002296417,0.8897445,0.0003673069,0.1068032],"study_design_scores_gemma":[0.0004168111,0.0002296186,0.05673231,0.00004171232,0.00002124248,0.00005336179,0.00007854487,0.02234782,0.000006492847,0.919656,0.0003141074,0.0001020059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0491773,0.00008914741,0.9474313,0.002745306,0.0002850578,0.0001290577,0.00005569461,0.00001704137,0.00007011907],"genre_scores_gemma":[0.8200285,0.00004375456,0.1764842,0.003378341,0.0000369997,0.000004129619,0.00000674148,0.000004048391,0.00001330452],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7709471,"threshold_uncertainty_score":0.4147643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003457809734509369,"score_gpt":0.2285714381247206,"score_spread":0.2251136283902112,"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."}}