{"id":"W2730004797","doi":"","title":"Sequential Graph Matching with Sequential Monte Carlo.","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Monte Carlo method; Matching (statistics); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Statistics","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003145093,0.0002069788,0.000172894,0.0001345179,0.0006381568,0.001599238,0.001239151,0.00006012418,0.0001067989],"category_scores_gemma":[0.00009753989,0.0001786121,0.00004162448,0.00005635897,0.0003909785,0.0006186413,0.0002248015,0.0002343585,0.0000581145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002234498,"about_ca_system_score_gemma":0.000082502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002292656,"about_ca_topic_score_gemma":0.0002765054,"domain_scores_codex":[0.9984604,0.00006884446,0.0003011399,0.0004578646,0.0004480131,0.0002638089],"domain_scores_gemma":[0.9987346,0.0001115351,0.0002306724,0.0004781707,0.0003184131,0.0001266091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007276364,0.00004680643,0.00004560454,0.00000418568,0.00003990624,0.0001064708,0.0005743417,0.0004728353,0.000432299,0.9019616,0.0000252911,0.09621789],"study_design_scores_gemma":[0.00006947079,0.0002215921,0.0002885546,0.00007006201,0.00001196488,0.00004337401,0.0003098028,0.1322122,0.002969941,0.8634265,0.00008821336,0.0002882771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01335224,0.000007311546,0.9792838,0.00116271,0.001096079,0.0001111809,0.0001307542,0.00005668253,0.004799245],"genre_scores_gemma":[0.9538495,0.00005833352,0.04551148,0.0001627209,0.0001384494,0.00001112677,0.000008991617,0.000009683926,0.0002497246],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9404973,"threshold_uncertainty_score":0.9994372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1043554736704169,"score_gpt":0.3406869152600024,"score_spread":0.2363314415895856,"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."}}