{"id":"W2040080630","doi":"10.1142/s0218001415500111","title":"Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations","year":2014,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computation; Bipartite graph; Edit distance; Matching (statistics); Upper and lower bounds; Graph; Mathematics; Exponential function; Exponential growth; Computer science; Algorithm; Discrete mathematics","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.004644559,0.001277575,0.001910795,0.003853668,0.0007495385,0.003112445,0.00263275,0.002419086,0.001724363],"category_scores_gemma":[0.06124416,0.0008319994,0.001217882,0.003053588,0.001429961,0.005821033,0.00244913,0.003359932,0.001101635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002077096,"about_ca_system_score_gemma":0.001071393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004620516,"about_ca_topic_score_gemma":0.004652157,"domain_scores_codex":[0.9941162,0.002016249,0.0003186029,0.001460447,0.001779356,0.0003092128],"domain_scores_gemma":[0.9573442,0.03256607,0.00207842,0.005501535,0.001998336,0.00051146],"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.0002088823,0.0001692752,0.00405548,0.0001860517,0.0001199149,0.0001412332,0.0002131822,0.8637146,0.004287823,0.03973977,0.001383613,0.08578021],"study_design_scores_gemma":[0.000003821294,0.0000197039,0.0003302609,0.000009885137,0.000006816125,0.00004369562,0.00001621704,0.9831246,0.0009455738,0.01510889,0.0003818664,0.000008674003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02642955,0.0004795213,0.9707855,0.0001297406,0.00002877106,0.00003833755,0.0001571477,0.0008408196,0.0011105],"genre_scores_gemma":[0.4475228,0.0005792635,0.5478004,0.0001639721,0.00009626507,0.0002149159,0.00141478,0.0004006831,0.001806957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004644559,"threshold_uncertainty_score":0.02456307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05183151763930641,"score_gpt":0.2969443134733721,"score_spread":0.2451127958340657,"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."}}