{"id":"W2963099470","doi":"10.18653/v1/p19-1632","title":"Matching Article Pairs with Graphical Decomposition and Convolutions","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Sentence; Matching (statistics); Graph; Information retrieval; Theoretical computer science; Natural language processing; Artificial intelligence; 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.0001429069,0.0001398353,0.0001480209,0.0001011605,0.00008257739,0.0002671155,0.0003834936,0.000138744,0.000004764788],"category_scores_gemma":[0.000004861432,0.0001036341,0.00003041473,0.0001242356,0.00005556305,0.0002635219,0.0008499874,0.000438816,0.00000600641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002888206,"about_ca_system_score_gemma":0.00005526506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001483526,"about_ca_topic_score_gemma":0.0000291875,"domain_scores_codex":[0.9990937,0.00004015026,0.0001256461,0.0004142884,0.0001681856,0.0001580854],"domain_scores_gemma":[0.9993144,0.00005239566,0.00007255908,0.0004330457,0.00006897794,0.0000585798],"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.00001423148,0.00007739163,0.00228651,0.0002334412,0.00004866016,0.00003242702,0.001020004,0.000228559,0.003694705,0.9793771,0.0004312014,0.01255579],"study_design_scores_gemma":[0.0002817735,0.0001495437,0.002369005,0.0005506777,0.00003002913,0.0001580284,0.00004898019,0.1107123,0.009718282,0.8753116,0.00005087135,0.0006189477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0823456,0.0006734993,0.9142562,0.001225854,0.0000644867,0.0001916743,0.000001524151,0.0008193691,0.0004218635],"genre_scores_gemma":[0.5380011,0.000007786617,0.4617854,0.000146181,0.0000103212,0.000009991082,0.000002740248,0.00000461559,0.000031833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4556555,"threshold_uncertainty_score":0.4226075,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008370593085022299,"score_gpt":0.2669644977709218,"score_spread":0.2585939046858995,"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."}}