{"id":"W1538503321","doi":"10.1007/978-1-4757-3145-3_25","title":"Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Clique; Quadratic programming; Computer science; Quadratic equation; Theoretical computer science; Clique problem; Graph; Mathematics; Mathematical optimization; Combinatorics; Line graph; Pathwidth","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.0001204464,0.0003525938,0.0003545952,0.0002898613,0.0003576714,0.0002084377,0.0003594116,0.0002256438,0.00002691155],"category_scores_gemma":[0.000003190371,0.0003316874,0.00006063674,0.0001798004,0.0001064525,0.0001752665,0.00006933584,0.0001466295,0.00002000211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002033149,"about_ca_system_score_gemma":0.00006109219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001161451,"about_ca_topic_score_gemma":0.000003436382,"domain_scores_codex":[0.998403,0.00001746057,0.0003615058,0.0008166881,0.0001969755,0.0002044357],"domain_scores_gemma":[0.9985197,0.0001736021,0.0002312509,0.0005312808,0.000314882,0.0002292476],"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.00004997706,0.0000746636,0.000002203488,0.00006835811,0.00003637488,9.575942e-7,0.00008776788,0.02966568,0.00002040644,0.8157183,0.0006569796,0.1536183],"study_design_scores_gemma":[0.0009676127,0.0005321595,0.00001310285,0.00008999679,0.00007883769,0.00001549502,0.000003345646,0.7919625,0.00004887458,0.02374096,0.1819619,0.0005852024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003720334,0.0002462667,0.9875162,0.0009716154,0.00003921485,0.002413414,0.0001293115,0.0001810416,0.008499267],"genre_scores_gemma":[0.004475737,0.001018343,0.9716192,0.003579461,0.0003511205,0.001834798,0.0009608885,0.0001452349,0.01601518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7919773,"threshold_uncertainty_score":0.9999135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006590814491085934,"score_gpt":0.2189472659255289,"score_spread":0.212356451434443,"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."}}