{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008084517,0.001882228,0.003349577,0.003463201,0.002008002,0.002179359,0.005000538,0.004369372,0.005228998],"category_scores_gemma":[0.05004639,0.001145424,0.001912557,0.005401313,0.005028271,0.008235175,0.005285537,0.004141411,0.001296286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002701758,"about_ca_system_score_gemma":0.0030475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003403455,"about_ca_topic_score_gemma":0.002874348,"domain_scores_codex":[0.9946123,0.002991842,0.0001837592,0.001070118,0.0008405813,0.0003012956],"domain_scores_gemma":[0.9702286,0.0241341,0.001624639,0.002417007,0.001039436,0.0005562514],"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.0002564844,0.0002064953,0.001554792,0.0002760194,0.0001367529,0.0002265227,0.0002629764,0.3950551,0.001305515,0.5285511,0.007182078,0.06498615],"study_design_scores_gemma":[0.00003653034,0.00004194492,0.0001657793,0.00002980376,0.00001458523,0.00006753983,0.00002908308,0.6054608,0.0004183444,0.39267,0.001046483,0.0000189868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01067034,0.0003634866,0.9858844,0.0006595709,0.00004015462,0.000109552,0.0001735827,0.0002010021,0.001898004],"genre_scores_gemma":[0.3419149,0.001108935,0.6477395,0.0009546832,0.000439857,0.0008844234,0.001448629,0.0003871964,0.005121839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008084517,"threshold_uncertainty_score":0.04275554,"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."}}