{"id":"W4411403412","doi":"10.1145/3725404","title":"Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Backtracking; Computer science; Benchmark (surveying); Redundancy (engineering); Graph; Computation; Theoretical computer science; Algorithm","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.002120654,0.001570724,0.00195736,0.003547509,0.001379081,0.001670575,0.004199226,0.002168079,0.00325601],"category_scores_gemma":[0.01018635,0.001004205,0.0021187,0.004058698,0.001664508,0.003910285,0.003335437,0.001960062,0.001299781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001590196,"about_ca_system_score_gemma":0.00387508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007519753,"about_ca_topic_score_gemma":0.01458142,"domain_scores_codex":[0.9971667,0.0007294914,0.0001625584,0.0006636289,0.0009005046,0.0003771628],"domain_scores_gemma":[0.9939954,0.002968369,0.0005198902,0.001660992,0.0006148114,0.0002405213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009612046,0.0008866323,0.004590924,0.0008047934,0.0003628701,0.0007638453,0.001029309,0.4489129,0.03341317,0.04924227,0.01760561,0.4414265],"study_design_scores_gemma":[0.0001126976,0.0001465086,0.0004902415,0.00004744813,0.00008621269,0.0002889663,0.0001496593,0.9520606,0.006815512,0.03647703,0.003293525,0.00003151609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02847587,0.0005215927,0.9637913,0.0004461709,0.00004773442,0.0003351156,0.0003308574,0.003654317,0.00239711],"genre_scores_gemma":[0.1592596,0.0002411288,0.8357441,0.0002480579,0.00005513367,0.000270445,0.001520397,0.0005061312,0.002155001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007519753,"threshold_uncertainty_score":0.01495194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05965004820938316,"score_gpt":0.2988278835663659,"score_spread":0.2391778353569828,"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."}}