{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048937,0.001099633,0.001042547,0.005611276,0.0005649832,0.001786781,0.001463541,0.001556632,0.004415273],"category_scores_gemma":[0.006061336,0.0006029256,0.002066988,0.004063508,0.0006624221,0.00300651,0.002183157,0.001338483,0.002919191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000976363,"about_ca_system_score_gemma":0.001111437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005375181,"about_ca_topic_score_gemma":0.007811679,"domain_scores_codex":[0.9985408,0.0002481501,0.0001177179,0.0005143734,0.000402727,0.0001763256],"domain_scores_gemma":[0.9979505,0.0006395796,0.0003217836,0.0005354192,0.0004359225,0.0001168303],"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.000746566,0.0003432019,0.006444194,0.0003949629,0.0002792404,0.0005433271,0.0003311674,0.09891803,0.04464582,0.03350797,0.01979632,0.7940492],"study_design_scores_gemma":[0.00003125734,0.00006348077,0.001400406,0.00001744032,0.00005128171,0.0002399482,0.00007066632,0.9460449,0.0117606,0.03519455,0.005100388,0.00002498878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0455908,0.0005241025,0.9426352,0.0003004895,0.0001263078,0.0001480921,0.001313496,0.006930612,0.002430887],"genre_scores_gemma":[0.3673307,0.0004816391,0.6157625,0.0003418155,0.0001843826,0.0002349312,0.008096151,0.000840512,0.00672739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005611276,"threshold_uncertainty_score":0.01477057,"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."}}