{"id":"W3176616156","doi":"10.1609/aaai.v35i16.17722","title":"Neural Sentence Ordering Based on Constraint Graphs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Sentence; Computer science; Constraint (computer-aided design); Graph; Artificial intelligence; Benchmark (surveying); Natural language processing; Code (set theory); Theoretical computer science; Mathematics; Programming language","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.0003764378,0.0002440434,0.0002584365,0.0001231221,0.0002045265,0.0003133841,0.001720414,0.00008098056,0.00007377887],"category_scores_gemma":[0.0005651658,0.0001967616,0.0001596188,0.0007656903,0.0002428714,0.0002837845,0.0003689066,0.0003965439,0.00003729182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004159734,"about_ca_system_score_gemma":0.0001972136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002373619,"about_ca_topic_score_gemma":0.000008925923,"domain_scores_codex":[0.9977286,0.00002665954,0.0005185683,0.0006925143,0.0006273536,0.0004062777],"domain_scores_gemma":[0.9982283,0.0001347919,0.0002607214,0.0005079177,0.0007579887,0.0001102972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002037909,0.0001219803,0.0002968908,0.00003360733,0.000007417039,0.000004867053,0.0003759103,0.00253091,0.0357566,0.8870895,0.00002518697,0.07373674],"study_design_scores_gemma":[0.00002547879,0.00007715449,0.00008319969,0.000198485,0.000004845687,0.00000887938,0.0002996737,0.5990647,0.3366467,0.06339496,0.0000275409,0.0001683755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4706202,0.00004714664,0.4662575,0.02415526,0.002177689,0.0007209244,0.000009848091,0.0004066797,0.03560476],"genre_scores_gemma":[0.9883451,0.000009838811,0.01051909,0.0009701639,0.00004079501,0.00001547527,3.360501e-7,0.00001098782,0.00008822363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8236945,"threshold_uncertainty_score":0.8023706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08688291472376188,"score_gpt":0.2864605725247814,"score_spread":0.1995776578010195,"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."}}