{"id":"W231720905","doi":"10.1016/j.knosys.2015.05.012","title":"Approximating the maximum common subgraph isomorphism problem with a weighted graph","year":2015,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Graph isomorphism; Mathematics; Combinatorics; Graph homomorphism; Distance-hereditary graph; Isomorphism (crystallography); Discrete mathematics; Induced subgraph; Graph factorization; Factor-critical graph; Graph; Cograph; Line graph; Pathwidth; Voltage graph","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.002393627,0.0004067523,0.0004875635,0.0003241425,0.0004944883,0.0005064986,0.001765876,0.0001266805,0.000002849571],"category_scores_gemma":[0.0000181909,0.0002439977,0.0001576652,0.002020753,0.000281422,0.000386963,0.0001610831,0.0003845085,0.000128765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006715245,"about_ca_system_score_gemma":0.0002752998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001154601,"about_ca_topic_score_gemma":0.00004948546,"domain_scores_codex":[0.9966859,0.000883703,0.0005935483,0.0006358697,0.0005649189,0.0006360397],"domain_scores_gemma":[0.9972348,0.0003211964,0.0003616076,0.001335661,0.0004277636,0.0003189999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003337688,0.002260258,0.01537978,0.001411959,0.0006180828,0.0003212146,0.02691755,0.003848065,0.0009456945,0.8953719,0.01233186,0.04025983],"study_design_scores_gemma":[0.006485092,0.001490236,0.0002796022,0.001401057,0.0001219742,0.0004239118,0.002484558,0.8538526,0.002954274,0.1052983,0.02332995,0.001878351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02810832,0.002961484,0.9481011,0.0007498618,0.001539231,0.001748089,0.00001302493,0.0009461558,0.01583272],"genre_scores_gemma":[0.9859299,0.000001397241,0.0131009,0.0001152652,0.0001731497,0.000347246,0.00001212225,0.00004071629,0.0002792778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9578216,"threshold_uncertainty_score":0.9949938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02209990361606246,"score_gpt":0.229079896000099,"score_spread":0.2069799923840366,"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."}}