{"id":"W1607308244","doi":"10.1007/978-3-540-27868-9_16","title":"An Optimal Probabilistic Graphical Model for Point Set Matching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Graphical model; Computer science; Probabilistic logic; Algorithm; Graph; Pairwise comparison; Theoretical computer science; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001416867,0.0006175642,0.0005623851,0.0007466593,0.0004480017,0.0007198153,0.004111448,0.0003681048,0.000008170758],"category_scores_gemma":[0.00005559748,0.0005542688,0.0002486936,0.00047491,0.0008512259,0.001013497,0.0007178141,0.0008413267,0.000007381335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002123755,"about_ca_system_score_gemma":0.0006903557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005696343,"about_ca_topic_score_gemma":0.00001655878,"domain_scores_codex":[0.9958228,0.00003799037,0.0005464182,0.001962645,0.0007723281,0.0008577759],"domain_scores_gemma":[0.9973276,0.0003677208,0.0002262083,0.001536877,0.0002392687,0.0003023241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009474412,0.00003331374,6.911873e-7,0.00003576327,0.000005303717,0.00002285901,0.001198089,0.6136825,0.00004296307,0.3334084,0.000001104791,0.05155955],"study_design_scores_gemma":[0.0001746479,0.000166606,0.000002748518,0.0001264602,0.000005266393,0.00003626707,1.375085e-7,0.5035304,0.0001014025,0.4954922,0.000006882415,0.0003569846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003599854,0.0000791409,0.9969568,0.0004925302,0.0008898931,0.0007391159,0.00002640946,0.0002559001,0.0002002626],"genre_scores_gemma":[0.2956897,0.000004637177,0.7031186,0.0008512313,0.0002273851,0.00002696343,0.00001083313,0.00003546538,0.0000352363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2953297,"threshold_uncertainty_score":0.9996909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0190953373134831,"score_gpt":0.2574698345700833,"score_spread":0.2383744972566001,"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."}}