{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005648615,0.00009797129,0.0001477262,0.0002405053,0.00008718004,0.0001926362,0.0002992302,0.00003565594,0.00002912264],"category_scores_gemma":[0.0001407345,0.00008880964,0.00007066441,0.0001408563,0.0001502205,0.0006348199,0.00007123612,0.0001292398,0.000004273917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001091277,"about_ca_system_score_gemma":0.0000179727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009135736,"about_ca_topic_score_gemma":0.000004179994,"domain_scores_codex":[0.9988253,0.0000762721,0.000543118,0.0001531425,0.0002919449,0.0001101973],"domain_scores_gemma":[0.9987866,0.0001605741,0.000428271,0.00008431703,0.0004653238,0.00007489221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002855558,0.0001387899,0.001199399,0.00002225686,0.0000566584,0.00001135208,0.001139656,0.0006629056,0.003208958,0.01373926,0.000006575051,0.9797856],"study_design_scores_gemma":[0.00009796218,0.0001543514,0.0004664966,0.0003987721,0.00001688283,0.0001990879,0.0002052784,0.5372966,0.01415545,0.4467565,0.00007775561,0.0001748382],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3214644,0.00003581451,0.6771761,0.000244022,0.001000414,0.00002775176,0.000009148028,0.000006838745,0.00003540427],"genre_scores_gemma":[0.9539568,0.00002433088,0.0455474,0.0001496395,0.0003104725,0.000001197947,0.000002362116,0.000004813184,0.000003027139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9796108,"threshold_uncertainty_score":0.3621552,"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."}}