{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":31,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":31,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9cf1555b9aa1","filters":{"venue":"Constraints"}},"results":[{"id":"W2035237530","doi":"10.1007/s10601-006-9003-7","title":"A Cost-Regular Based Hybrid Column Generation Approach","year":2006,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Constraint programming; Embedding; Mathematical optimization; Constraint (computer-aided design); Combinatorial optimization; Computation; Benchmark (surveying); Column (typography); Algorithm; Mathematics; Artificial intelligence; Stochastic programming","authors":[{"name":"Sophie Demassey","is_ca":false},{"name":"Gilles Pesant","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2085565399469041,"gpt":0.3669972140349245,"spread":0.1584406740880204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008998698,0.0008008861,0.001321909,0.001517284,0.000527588,0.0009626743,0.001884982,0.0009974398,0.00696132],"category_scores_gemma":[0.00190555,0.0007075806,0.000982058,0.001901144,0.0004087032,0.0009803299,0.0006993315,0.0008824369,0.0006994595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007994153,"about_ca_system_score_gemma":0.001274748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006799911,"about_ca_topic_score_gemma":0.008158528,"domain_scores_codex":[0.9992971,0.0002287771,0.00002964335,0.000103581,0.0002691369,0.00007172327],"domain_scores_gemma":[0.9987168,0.0007130128,0.00008583241,0.0001426526,0.0002932249,0.00004848805],"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.0001205314,0.0001502041,0.0002280238,0.0001410603,0.00006411992,0.00008075743,0.00003522353,0.8458958,0.003811407,0.008583693,0.002615359,0.1382739],"study_design_scores_gemma":[0.00001181965,0.00001817764,0.00003787603,0.000003033805,0.00001010141,0.00001077184,0.000003424751,0.9972187,0.0004615025,0.001897556,0.0003226742,0.000004312417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01235004,0.0001584634,0.9836438,0.0001168632,0.00003574589,0.0001022259,0.000130155,0.0006464638,0.002816174],"genre_scores_gemma":[0.2719486,0.00018239,0.7221777,0.0002045205,0.00006245386,0.0003313164,0.0004798455,0.0002675654,0.004345572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00696132,"threshold_uncertainty_score":0.02328789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4293107948","doi":"10.1007/s10601-022-09327-y","title":"Learning the travelling salesperson problem requires rethinking generalization","year":2022,"lang":"en","type":"article","venue":"Constraints","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Generalization; Computer science; Pipeline (software); Artificial intelligence; Artificial neural network; Machine learning; Deep learning; Graph; Theoretical computer science; Mathematics","authors":[{"name":"Chaitanya K. Joshi","is_ca":false},{"name":"Quentin Cappart","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Thomas Laurent","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02172918509130155,"gpt":0.2412136384714505,"spread":0.2194844533801489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161669,0.0009149158,0.001074955,0.000361873,0.0006081102,0.001609124,0.002444411,0.00188596,0.005455721],"category_scores_gemma":[0.0181876,0.0007050463,0.0007391069,0.0004294356,0.001968115,0.006057152,0.002458219,0.005218004,0.001016561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433886,"about_ca_system_score_gemma":0.001589289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003873352,"about_ca_topic_score_gemma":0.0048879,"domain_scores_codex":[0.9987317,0.0004745028,0.00006382701,0.0003957163,0.0001998165,0.0001344708],"domain_scores_gemma":[0.9941613,0.003795448,0.0002411683,0.001213561,0.000436755,0.0001518183],"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.0001809957,0.000228522,0.001835355,0.000195886,0.00005881908,0.0001039981,0.0001790506,0.8089631,0.003989261,0.05745021,0.006558352,0.1202564],"study_design_scores_gemma":[0.000007418979,0.00003158063,0.00008318968,0.00001186282,0.000004331965,0.00001152189,0.00001653583,0.9715469,0.0008675291,0.02692081,0.0004939653,0.000004336752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1410348,0.0005079271,0.8406554,0.003050142,0.0001664731,0.0002049768,0.0002844478,0.002494242,0.01160166],"genre_scores_gemma":[0.8084562,0.0003115102,0.1847567,0.0009626477,0.00007126242,0.0002448974,0.0004851093,0.0005180589,0.004193615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005455721,"threshold_uncertainty_score":0.01825124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151266168","doi":"10.1023/a:1011402324562","title":"Random Constraint Satisfaction: A More Accurate Picture","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Complement (music); Constraint (computer-aided design); Mathematics; Applied mathematics; Point (geometry); Constraint satisfaction problem; Mathematical optimization; Statistics; Geometry","authors":[{"name":"Dimitris Achlioptas","is_ca":true},{"name":"Michael Molloy","is_ca":true},{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Yannis C. Stamatiou","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01599495645134832,"gpt":0.257697762280475,"spread":0.2417028058291266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006009879,0.002033324,0.002801638,0.00362067,0.001549086,0.008718511,0.005028345,0.005002607,0.01260654],"category_scores_gemma":[0.02010613,0.00121909,0.00143944,0.003679507,0.01088816,0.02868351,0.003545386,0.01059884,0.002372294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002287357,"about_ca_system_score_gemma":0.001656693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003463832,"about_ca_topic_score_gemma":0.002754769,"domain_scores_codex":[0.9952304,0.001779839,0.0002453367,0.0007270986,0.001805991,0.0002113273],"domain_scores_gemma":[0.9912621,0.004714045,0.000417743,0.002203066,0.001141378,0.0002617172],"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.00001961124,0.00001839897,0.0001167308,0.0001693447,0.00002381868,0.00003446912,0.0000953218,0.004316008,0.0002000583,0.9724305,0.00923128,0.0133445],"study_design_scores_gemma":[0.00001295996,0.00001141599,0.0000839208,0.00005454241,0.000009843937,0.00005917165,0.00005599,0.01494709,0.00010689,0.9641216,0.02051883,0.00001771491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004010992,0.02868126,0.8691533,0.0489149,0.002106366,0.00005562537,0.0008041807,0.0003948259,0.04587843],"genre_scores_gemma":[0.3673832,0.07763115,0.4599689,0.02566852,0.01972809,0.0006581625,0.002677981,0.001656561,0.0446274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01260654,"threshold_uncertainty_score":0.04217303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111805524","doi":"10.1007/s10601-009-9083-2","title":"Formal languages for integer programming modeling of shift scheduling problems","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Constraint programming; Integer programming; Computer science; Constraint (computer-aided design); Exploit; Mathematical optimization; Theoretical computer science; Scheduling (production processes); Context (archaeology); Programming language; Mathematics; Algorithm; Stochastic programming","authors":[{"name":"Marie-Claude Côté","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1219977689067701,"gpt":0.3955546711748169,"spread":0.2735569022680469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004118864,0.001401204,0.0009867549,0.00113286,0.0009016349,0.004307068,0.00300688,0.001352356,0.004936437],"category_scores_gemma":[0.008660791,0.001107414,0.0025982,0.001545644,0.002159287,0.004837456,0.001856772,0.004676519,0.001227638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002179425,"about_ca_system_score_gemma":0.003592842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004854583,"about_ca_topic_score_gemma":0.006389765,"domain_scores_codex":[0.9967932,0.001486195,0.0003652737,0.0003046895,0.0007180312,0.0003325655],"domain_scores_gemma":[0.9943335,0.003795256,0.0006498917,0.0005547605,0.0005332629,0.0001332449],"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.00004410158,0.00008465497,0.0001388441,0.0001806577,0.00002897841,0.00008923935,0.0003408337,0.09137534,0.000974496,0.8874373,0.00207151,0.01723399],"study_design_scores_gemma":[0.00006554051,0.00002507767,0.00003786912,0.0001172608,0.00003874384,0.00005403986,0.0001367077,0.2891312,0.001239725,0.6913625,0.0177635,0.00002791391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002465029,0.0002504,0.9932186,0.0005320198,0.00005172354,0.00007778913,0.0002425898,0.000420578,0.002741296],"genre_scores_gemma":[0.1414586,0.001271112,0.8491073,0.0005013482,0.0002165374,0.0008927666,0.001106326,0.0003934967,0.005052533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004936437,"threshold_uncertainty_score":0.02178288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005924051","doi":"10.1007/s10601-005-0552-y","title":"An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint","year":2005,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; Cardinality (data modeling); Constraint programming; Consistency (knowledge bases); Constraint (computer-aided design); Benchmark (surveying); Computer science; Mathematical optimization; Constraint logic programming; Constraint satisfaction; Algorithm; Mathematics; Stochastic programming; Artificial intelligence; Probabilistic logic; Data mining","authors":[{"name":"Claude-Guy Quimper","is_ca":true},{"name":"Alexander Golynski","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01721744243950913,"gpt":0.2827290062673527,"spread":0.2655115638278436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003097228,0.001538277,0.002206949,0.002442113,0.001448332,0.004037075,0.004023822,0.002119887,0.0103164],"category_scores_gemma":[0.01530627,0.001279268,0.001647459,0.004039602,0.001195185,0.006062706,0.004556483,0.00467304,0.002250353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001638005,"about_ca_system_score_gemma":0.003404181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004866068,"about_ca_topic_score_gemma":0.005549349,"domain_scores_codex":[0.9959837,0.000942833,0.0002395382,0.0008532901,0.00161402,0.0003666359],"domain_scores_gemma":[0.9925565,0.003826666,0.0003806697,0.001779817,0.00127472,0.0001817273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005105662,0.0002884278,0.00085097,0.0003474012,0.0001526964,0.000149247,0.000279656,0.2005251,0.008608475,0.1233691,0.02447748,0.6404409],"study_design_scores_gemma":[0.0001522919,0.00005854148,0.0002651512,0.0000535785,0.00006012508,0.0001160349,0.00007825428,0.8925508,0.0078585,0.08881631,0.00995415,0.00003632144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003021688,0.0001959743,0.9927511,0.0001728335,0.00006068773,0.00009533944,0.0001748801,0.001027093,0.002500277],"genre_scores_gemma":[0.06718592,0.0002206573,0.9277301,0.0001544574,0.00008964194,0.0002486471,0.000838777,0.0006533,0.002878557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0103164,"threshold_uncertainty_score":0.0345118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082779900","doi":"10.1007/s10601-012-9119-x","title":"Improved filtering for weighted circuit constraints","year":2012,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Relaxation (psychology); Constraint satisfaction problem; Computer science; Travelling salesman problem; Search tree; Linear programming relaxation; Bounding overwatch; Domain (mathematical analysis); Context (archaeology); Mathematical optimization; Solver; Tree (set theory); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Constraint logic programming; Routing (electronic design automation); Lagrangian relaxation; Integer programming; Mathematics; Probabilistic logic; Search algorithm; Artificial intelligence; Stochastic programming","authors":[{"name":"Pascal Benchimol","is_ca":false},{"name":"Willem‐Jan van Hoeve","is_ca":false},{"name":"Jean-Charles Régin","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Michel Rueher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02837333951332646,"gpt":0.2540666528241169,"spread":0.2256933133107905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570898,0.001606526,0.001861391,0.00193459,0.0007111144,0.002106848,0.001980869,0.001478569,0.01108877],"category_scores_gemma":[0.006990215,0.0009042085,0.001558447,0.002774412,0.0005760251,0.003037594,0.001223164,0.002080337,0.001450775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001192046,"about_ca_system_score_gemma":0.001258346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01051463,"about_ca_topic_score_gemma":0.01402047,"domain_scores_codex":[0.9982433,0.0003625315,0.0001046954,0.0003346562,0.0007842915,0.0001703904],"domain_scores_gemma":[0.996935,0.001737925,0.0001548863,0.0004669855,0.0006406085,0.00006471064],"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.000293977,0.0001605329,0.0006131402,0.0004599822,0.0001727783,0.0002494917,0.0001152189,0.4493287,0.01789666,0.109303,0.01355567,0.4078509],"study_design_scores_gemma":[0.00001598269,0.00002471212,0.000128475,0.00002038329,0.00002706674,0.00004894768,0.00001111579,0.9687421,0.002772518,0.02468115,0.003512344,0.00001522246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003549403,0.0002053257,0.9940462,0.00006593329,0.00006521781,0.00002598798,0.000120731,0.0002237954,0.001697371],"genre_scores_gemma":[0.1708998,0.0008513922,0.8124434,0.0002920566,0.0002257874,0.0001804496,0.001681609,0.000510406,0.01291516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01108877,"threshold_uncertainty_score":0.03709561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099452584","doi":"10.1007/s10601-015-9193-y","title":"Lagrangian bounds from decision diagrams","year":2015,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Lagrangian relaxation; Influence diagram; Travelling salesman problem; Diagram; Constraint (computer-aided design); Relaxation (psychology); Mathematical optimization; Representation (politics); Constraint programming; Computer science; Lagrangian; Combinatorial optimization; Mathematics; Applied mathematics; Decision tree; Artificial intelligence; Stochastic programming","authors":[{"name":"David Bergman","is_ca":false},{"name":"André A. Ciré","is_ca":true},{"name":"Willem‐Jan van Hoeve","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02494302236139297,"gpt":0.2540006297738513,"spread":0.2290576074124584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388477,0.001586941,0.001700576,0.003153712,0.0009300015,0.004001889,0.00200966,0.001521403,0.01564239],"category_scores_gemma":[0.02338769,0.001369122,0.001528619,0.003442871,0.001796808,0.005180447,0.002796215,0.003848776,0.002023345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002774238,"about_ca_system_score_gemma":0.001544645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00379362,"about_ca_topic_score_gemma":0.004620505,"domain_scores_codex":[0.9957794,0.001799498,0.0001913431,0.0004843668,0.001466577,0.0002787104],"domain_scores_gemma":[0.9870685,0.01059794,0.0005681893,0.0007046071,0.0008214419,0.0002393066],"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.00006750882,0.00005308964,0.000191292,0.0002466804,0.00003666136,0.00005945321,0.000122481,0.2198568,0.0004549235,0.7064212,0.007104359,0.06538555],"study_design_scores_gemma":[0.00001257342,0.00001166381,0.00005876904,0.00008526188,0.00001281075,0.00001699037,0.00001664081,0.2404255,0.0004391472,0.7518225,0.007087941,0.00001012724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003309871,0.0005017402,0.9805136,0.0004014354,0.00005826872,0.00004677413,0.0003689514,0.0002051818,0.01459412],"genre_scores_gemma":[0.3104687,0.002410209,0.6603965,0.000475624,0.000262979,0.000636862,0.002522239,0.0008047469,0.02202216],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01564239,"threshold_uncertainty_score":0.05232894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1859892029","doi":"10.1023/a:1011409029226","title":"Keep–Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Kwantlen Polytechnic University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Selection (genetic algorithm); Fitness proportionate selection; Population; Offspring; Computer science; Operator (biology); Genetic algorithm; Mathematical optimization; Evolutionary biology; Biology; Machine learning; Mathematics; Genetics; Demography; Sociology","authors":[{"name":"Kay C. Wiese","is_ca":true},{"name":"Scott D. Goodwin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02908793086542556,"gpt":0.2622588816988172,"spread":0.2331709508333917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043318,0.000404067,0.0005944882,0.0004903472,0.00106454,0.00103723,0.001805318,0.001175887,0.003759182],"category_scores_gemma":[0.004699931,0.0002257284,0.0004599706,0.0007772009,0.001008212,0.00179015,0.001171199,0.0008436,0.0003765803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005185026,"about_ca_system_score_gemma":0.0006255922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197814,"about_ca_topic_score_gemma":0.00403807,"domain_scores_codex":[0.9996376,0.0001734739,0.000008463734,0.00004585017,0.00007806439,0.00005651443],"domain_scores_gemma":[0.9988638,0.0006047562,0.0001296916,0.0001422892,0.0001382703,0.0001212602],"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.0003400307,0.0001893098,0.004642822,0.0001492176,0.0002587685,0.0007963852,0.0009969745,0.6257175,0.01237184,0.1812584,0.01020529,0.1630734],"study_design_scores_gemma":[0.00005013443,0.0001834513,0.0009188433,0.00002049587,0.00006996714,0.0002955293,0.0002884877,0.9516412,0.002915741,0.0380718,0.00551015,0.00003422789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2115175,0.0006591404,0.7680619,0.0009667762,0.00007699509,0.0000932238,0.00006511869,0.0002254316,0.01833384],"genre_scores_gemma":[0.8746089,0.0002218991,0.1165507,0.0001963738,0.00004420802,0.0001002061,0.00007513916,0.0001963727,0.008006203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003759182,"threshold_uncertainty_score":0.01257569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072384654","doi":"10.1007/s10601-007-9026-8","title":"A Constraint-Based Autonomous 3D Camera System","year":2007,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Exploit; Computer science; Constraint (computer-aided design); Cinematography; Solver; Constraint satisfaction problem; Digital camera; Constraint satisfaction; Smart camera; Simple (philosophy); Computer vision; Artificial intelligence; Computer graphics (images); Real-time computing; Engineering; Programming language; Computer security","authors":[{"name":"Owen Bourne","is_ca":false},{"name":"Abdul Sattar","is_ca":false},{"name":"Scott D. Goodwin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0113468522162647,"gpt":0.2340477895777617,"spread":0.222700937361497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003887668,0.0007951554,0.0009940042,0.0005024358,0.0008655649,0.001367786,0.002100355,0.001101789,0.007810234],"category_scores_gemma":[0.001142878,0.0007160952,0.0006077627,0.0008015419,0.000618218,0.001083251,0.001831503,0.000822415,0.001871098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007702385,"about_ca_system_score_gemma":0.001801776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01217836,"about_ca_topic_score_gemma":0.01554776,"domain_scores_codex":[0.9992854,0.00008045978,0.00003397511,0.0002118351,0.0003437599,0.00004455054],"domain_scores_gemma":[0.9994716,0.0001130882,0.00004855738,0.0001135407,0.0001867914,0.00006636437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006926353,0.0002007545,0.001236178,0.0004442267,0.0001681489,0.0007627352,0.000352045,0.3506737,0.214156,0.03447261,0.01771889,0.3791221],"study_design_scores_gemma":[0.00007668801,0.00009696529,0.0005168087,0.00001329132,0.00003445958,0.0001936636,0.00003148323,0.9537491,0.02572045,0.004277163,0.01523396,0.00005588789],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008305703,0.00009924806,0.9844351,0.0001046226,0.00003510814,0.000107043,0.0002788749,0.002851681,0.003782603],"genre_scores_gemma":[0.1980211,0.0002066639,0.7943969,0.0001481283,0.00002620802,0.0003078224,0.0007180511,0.0003952291,0.005779905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01217836,"threshold_uncertainty_score":0.02612782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137578750","doi":"10.1007/s10601-008-9067-7","title":"New filtering algorithms for combinations of among constraints","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Subsequence; Sequence (biology); Consistency (knowledge bases); Constraint (computer-aided design); Algorithm; Constraint programming; Domain (mathematical analysis); Computer science; Longest common subsequence problem; Local consistency; Time complexity; Mathematics; Constraint satisfaction; Mathematical optimization; Artificial intelligence; Stochastic programming","authors":[{"name":"Willem‐Jan van Hoeve","is_ca":false},{"name":"Gilles Pesant","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Ashish Sabharwal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02204268813549134,"gpt":0.2694888309084734,"spread":0.247446142772982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004715466,0.002501155,0.002743057,0.005152,0.00167639,0.003642811,0.003456142,0.002770407,0.009980511],"category_scores_gemma":[0.0150491,0.00195481,0.003017978,0.005774654,0.00109931,0.006587212,0.002332099,0.003321541,0.002038473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626752,"about_ca_system_score_gemma":0.00194705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007170049,"about_ca_topic_score_gemma":0.01362194,"domain_scores_codex":[0.995706,0.0008513884,0.0003761433,0.001012204,0.001771262,0.0002830592],"domain_scores_gemma":[0.990988,0.005636087,0.0004448603,0.001147029,0.00157446,0.0002095454],"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.0002292231,0.0002896349,0.001091881,0.0003500016,0.0002690716,0.0001451562,0.0001601651,0.1311837,0.004989456,0.06605542,0.0168706,0.7783657],"study_design_scores_gemma":[0.00005135255,0.00004551298,0.0002542195,0.00005485203,0.00009886161,0.0001452653,0.00004222941,0.9451876,0.002855242,0.04380121,0.00742674,0.0000370277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001741939,0.0002066233,0.9964436,0.00007241299,0.00007153551,0.00005114909,0.00007653779,0.0003895961,0.0009466383],"genre_scores_gemma":[0.01884186,0.0002483845,0.9773221,0.0001148927,0.0001087772,0.0001090475,0.0004974618,0.0002076761,0.00254972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009980511,"threshold_uncertainty_score":0.03338808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972237262","doi":"10.1007/s10601-012-9136-9","title":"Using dual presolving reductions to reformulate cumulative constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Solver; Computer science; Constraint programming; Dual (grammatical number); Benchmark (surveying); Integer programming; Scheduling (production processes); Variable (mathematics); Linear programming; Domain (mathematical analysis); Constraint (computer-aided design); State variable; Computational complexity theory; Mathematics; Algorithm; Stochastic programming","authors":[{"name":"Stefan Heinz","is_ca":false},{"name":"Jens Schulz","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04453748127260258,"gpt":0.2950699864660795,"spread":0.2505325051934769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001442198,0.001255434,0.0008888296,0.001527105,0.0009008757,0.002217495,0.001941933,0.0007599359,0.00973809],"category_scores_gemma":[0.006885007,0.0007610981,0.001734855,0.001744326,0.001548462,0.003122719,0.002627473,0.005671014,0.001353748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382472,"about_ca_system_score_gemma":0.001537223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00362393,"about_ca_topic_score_gemma":0.006562791,"domain_scores_codex":[0.9989148,0.0003412597,0.00005236372,0.000183638,0.0003817137,0.0001261601],"domain_scores_gemma":[0.99821,0.000997557,0.0000953821,0.0002937244,0.0003340937,0.0000692139],"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.00005405955,0.00010504,0.0002138182,0.0001665494,0.00004306527,0.0001259985,0.000150752,0.1145614,0.001887841,0.7965779,0.008062835,0.07805069],"study_design_scores_gemma":[0.00002351882,0.00002367174,0.00008350863,0.00005369309,0.00003074379,0.0000584664,0.00005258181,0.3819958,0.002324976,0.602511,0.01281803,0.00002403251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005118775,0.0001578699,0.9818133,0.0002434343,0.0001239902,0.00004016727,0.0001010539,0.0001616747,0.01223983],"genre_scores_gemma":[0.227293,0.0005940901,0.7452204,0.0004456277,0.0003168701,0.0002766991,0.0007918112,0.0007322833,0.02432932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00973809,"threshold_uncertainty_score":0.03257716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2990678853","doi":"10.1007/s10601-020-09312-3","title":"Learning optimal decision trees using constraint programming","year":2020,"lang":"en","type":"article","venue":"Constraints","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Constraint programming; Computer science; Decision tree; Constraint (computer-aided design); Machine learning; Artificial intelligence; Key (lock); Constraint satisfaction; Incremental decision tree; Greedy algorithm; Constraint learning; Decision tree learning; Mathematical optimization; Constraint logic programming; Mathematics; Algorithm; Stochastic programming","authors":[{"name":"Hélène Verhaeghe","is_ca":false},{"name":"Siegfried Nijssen","is_ca":false},{"name":"Gilles Pesant","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":true},{"name":"Pierre Schaus","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04206220394095465,"gpt":0.2883871106859103,"spread":0.2463249067449557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00444465,0.001475142,0.003050035,0.002267297,0.0009900843,0.003267269,0.002508789,0.001964298,0.005699894],"category_scores_gemma":[0.02609738,0.001605763,0.001892426,0.004825234,0.001294244,0.004227702,0.001464882,0.003924933,0.000891819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554552,"about_ca_system_score_gemma":0.003016691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006680328,"about_ca_topic_score_gemma":0.009106113,"domain_scores_codex":[0.9959186,0.001949827,0.0002850078,0.0008064297,0.0007945042,0.0002456225],"domain_scores_gemma":[0.9680123,0.0290885,0.0008985798,0.000632166,0.001060537,0.0003079447],"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.0001730332,0.0002692836,0.001418678,0.0006124792,0.0002031524,0.0001795413,0.0001069815,0.7460088,0.0006207197,0.05335309,0.010361,0.1866933],"study_design_scores_gemma":[0.00002869451,0.00001955949,0.00007035323,0.00004706764,0.0000212447,0.00002687181,0.00002136537,0.9420699,0.0002774405,0.0563898,0.001017531,0.00001022846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01012498,0.0009365864,0.9854347,0.000623606,0.00005946488,0.0001414748,0.0005168674,0.0003225306,0.00183982],"genre_scores_gemma":[0.1945985,0.001341172,0.7983378,0.0003676067,0.0001783994,0.0006147668,0.0024051,0.0002703527,0.001886221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006680328,"threshold_uncertainty_score":0.02350581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996357025","doi":"10.1007/s10601-014-9178-2","title":"The salesman and the tree: the importance of search in CP","year":2014,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Generalization; Mathematical optimization; Computer science; Heuristic; Graph; Mathematics; Theoretical computer science","authors":[{"name":"Jean-Guillaume Fages","is_ca":false},{"name":"Xavier Lorca","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01036059648106432,"gpt":0.2366117209435817,"spread":0.2262511244625173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281647,0.001130447,0.002840993,0.002533952,0.001339677,0.004477942,0.002310605,0.003059585,0.009069896],"category_scores_gemma":[0.04600269,0.001101391,0.001163438,0.005607374,0.005313019,0.01638147,0.002487345,0.006877571,0.0007847886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002262549,"about_ca_system_score_gemma":0.002585376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0089204,"about_ca_topic_score_gemma":0.006272345,"domain_scores_codex":[0.9959329,0.00230363,0.0001428238,0.0004437909,0.0009802369,0.0001967255],"domain_scores_gemma":[0.9632595,0.03341376,0.0005960102,0.001117572,0.001130021,0.0004831248],"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.000176806,0.00004452417,0.0004635302,0.0003861367,0.00004909158,0.00008529688,0.0001177502,0.06866558,0.0001722156,0.8466524,0.008923897,0.07426278],"study_design_scores_gemma":[0.00002993149,0.00001977445,0.00009165108,0.00006258381,0.00001765798,0.00004024658,0.00003095253,0.20607,0.0000973238,0.7893807,0.004144866,0.00001435916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01279201,0.01764332,0.9354659,0.008157487,0.0007411083,0.00009325761,0.0002501775,0.0001595694,0.02469724],"genre_scores_gemma":[0.4336437,0.03403643,0.5084381,0.002272141,0.004467433,0.0004287878,0.0004208951,0.000549843,0.01574275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009069896,"threshold_uncertainty_score":0.0303418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000553024","doi":"10.1007/s10601-019-09306-w","title":"Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem","year":2020,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"","keywords":"Integer programming; Solver; Exploit; Computer science; Set (abstract data type); Mathematical optimization; Integer (computer science); Inductive logic programming; Tree (set theory); Linear programming; Space (punctuation); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Combinatorics; Programming language","authors":[{"name":"Jaime E. González","is_ca":true},{"name":"André A. Ciré","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02200102872839966,"gpt":0.2629475568475838,"spread":0.2409465281191841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002140297,0.0006924496,0.001170989,0.001587196,0.0005481092,0.00120513,0.001111339,0.001323877,0.006427536],"category_scores_gemma":[0.008893582,0.0006722647,0.0008874658,0.004029396,0.0004623199,0.00208987,0.001185238,0.001786575,0.0006224153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008368634,"about_ca_system_score_gemma":0.001423472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004577728,"about_ca_topic_score_gemma":0.006497223,"domain_scores_codex":[0.9988114,0.0006297576,0.00005490191,0.0001124278,0.0003233365,0.00006824473],"domain_scores_gemma":[0.9956307,0.003695228,0.0001388121,0.0001318572,0.0003328845,0.0000704301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001598097,0.0002449583,0.0005067668,0.0001508611,0.00004522074,0.0001121861,0.00009208803,0.7651438,0.001201899,0.0909402,0.00260486,0.1387973],"study_design_scores_gemma":[0.0000173766,0.00002055377,0.00005634808,0.000009248508,0.000007820833,0.00001582586,0.000007392212,0.9813834,0.0002696657,0.01728253,0.0009245524,0.000005314169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005419442,0.0001718398,0.9915469,0.000102152,0.00001965414,0.00003345262,0.00006993148,0.0002490811,0.002387551],"genre_scores_gemma":[0.1029598,0.0002476397,0.8945732,0.00006225277,0.00002393516,0.0001440509,0.0001635896,0.0001446072,0.001680879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006427536,"threshold_uncertainty_score":0.0215022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044003064","doi":"10.1007/s10601-009-9088-x","title":"A global constraint for total weighted completion time for unary resources","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Unary operation; Mathematical optimization; Constraint (computer-aided design); Computer science; Schedule; Job shop scheduling; Resource constraints; Scheduling (production processes); Constraint programming; Upper and lower bounds; Mathematics; Algorithm; Distributed computing; Discrete mathematics","authors":[{"name":"András Kovács","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01036900503029169,"gpt":0.2331787535556989,"spread":0.2228097485254072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005726268,0.002518326,0.002506858,0.001602184,0.0009482499,0.002996211,0.003289193,0.001552681,0.009962279],"category_scores_gemma":[0.01296441,0.001099802,0.001317741,0.003515527,0.001771131,0.006105172,0.002300939,0.003957839,0.001136481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750398,"about_ca_system_score_gemma":0.002945294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003827637,"about_ca_topic_score_gemma":0.007170032,"domain_scores_codex":[0.9964688,0.0008692825,0.000206651,0.000816351,0.00110117,0.0005377172],"domain_scores_gemma":[0.9925579,0.004196134,0.0004555912,0.0008670723,0.001587699,0.0003357694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002745272,0.0001415736,0.0007268037,0.0007869782,0.0001154349,0.0003298873,0.0001611592,0.770676,0.01398263,0.1380756,0.00947141,0.06525793],"study_design_scores_gemma":[0.00004557369,0.0001971911,0.0006658768,0.0001153926,0.0001043588,0.0002670263,0.00006607419,0.9031841,0.01023009,0.07493056,0.0101392,0.00005466022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009071,0.0003278222,0.983844,0.0002517139,0.0001458497,0.00008041225,0.000381306,0.0002036531,0.005694326],"genre_scores_gemma":[0.3447859,0.0008765418,0.6359133,0.0004092994,0.0003637387,0.0004887072,0.001151031,0.001280544,0.01473101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009962279,"threshold_uncertainty_score":0.03332716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964542244","doi":"10.1007/s10601-008-9050-3","title":"Expressive power and abstraction in Essence","year":2008,"lang":"en","type":"article","venue":"Constraints","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abstraction; Expressive power; Power (physics); Computer science; Programming language; Epistemology; Philosophy; Physics","authors":[{"name":"David G. M. Mitchell","is_ca":true},{"name":"Eugenia Ternovska","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0157907896426227,"gpt":0.232063165849829,"spread":0.2162723762072063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005814987,0.000832549,0.001241397,0.001932607,0.002198093,0.008868664,0.002392222,0.00240849,0.006898629],"category_scores_gemma":[0.01698602,0.0009929333,0.001572431,0.001738775,0.01888701,0.02559199,0.006801116,0.007373695,0.0009669974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002248124,"about_ca_system_score_gemma":0.001411241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002233027,"about_ca_topic_score_gemma":0.001435267,"domain_scores_codex":[0.9945697,0.002021393,0.0004375701,0.0009585881,0.001576687,0.0004360018],"domain_scores_gemma":[0.9891214,0.005922012,0.0004175341,0.003366079,0.0008339596,0.000338966],"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.000006660133,0.000004415934,0.00004666703,0.0000242448,0.000005306803,0.00001300077,0.0002051555,0.0002888257,0.00009442332,0.9964051,0.0004094568,0.002496774],"study_design_scores_gemma":[0.000005500851,0.000002232849,0.00002303049,0.00001077943,0.000005349627,0.00002174285,0.00004017884,0.0006144641,0.00009468264,0.9952046,0.003973984,0.000003506973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02905776,0.006988967,0.7959126,0.0182049,0.0006196098,0.00008115686,0.0004299319,0.0005989147,0.1481062],"genre_scores_gemma":[0.8091171,0.003305021,0.159531,0.00332103,0.00132663,0.0003544693,0.0005759826,0.0003703328,0.02209835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008868664,"threshold_uncertainty_score":0.03075296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562987626","doi":"10.1023/a:1025697810124","title":"A Formal Approach to Agent Design: An Overview of Constraint-Based Agents","year":2003,"lang":"en","type":"article","venue":"Constraints","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Constraint (computer-aided design); Computer science; Automaton; Formal verification; Formal specification; Constraint logic programming; Constraint satisfaction problem; Theoretical computer science; Constraint graph; Constraint satisfaction; Programming language; Artificial intelligence; Mathematics","authors":[{"name":"Alan K. Mackworth","is_ca":true},{"name":"Ying Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1476368975762101,"gpt":0.3154502977111036,"spread":0.1678134001348935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005139302,0.001656989,0.00190588,0.002711613,0.002363503,0.009499891,0.006105862,0.00354682,0.004917827],"category_scores_gemma":[0.00754408,0.001868829,0.00241277,0.004258336,0.007115834,0.008676819,0.003695006,0.005375915,0.001813153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003778132,"about_ca_system_score_gemma":0.005888964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00882475,"about_ca_topic_score_gemma":0.009914643,"domain_scores_codex":[0.9955549,0.001713925,0.0005920951,0.0005158263,0.001407115,0.0002162581],"domain_scores_gemma":[0.9952365,0.002757803,0.0003477083,0.0005746453,0.0008384911,0.0002449936],"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.00001840702,0.00007887993,0.0001663498,0.0007559097,0.00006353232,0.0001108508,0.0003847663,0.02005505,0.0005625294,0.9342941,0.00414832,0.03936135],"study_design_scores_gemma":[0.00003068509,0.00002621513,0.00007811642,0.0004338804,0.0000514519,0.0001805004,0.0001852806,0.05786831,0.001101573,0.8425965,0.09739847,0.00004904656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004910159,0.006303927,0.9813874,0.00222675,0.0001009558,0.000140544,0.0001042285,0.0001888306,0.009056393],"genre_scores_gemma":[0.03032597,0.01273634,0.9516595,0.0005847343,0.0002359543,0.0005873832,0.0002857853,0.0001098579,0.003474554],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009499891,"threshold_uncertainty_score":0.02741235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1517613281","doi":"10.1023/a:1017936325308","title":"A Constraint-Based Robotic Soccer Team","year":2002,"lang":"en","type":"article","venue":"Constraints","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Controller (irrigation); Java; Control engineering; Task (project management); Constraint (computer-aided design); Distributed computing; Real-time computing; Artificial intelligence; Systems engineering; Engineering; Operating system","authors":[{"name":"Yu Zhang","is_ca":true},{"name":"Alan K. Mackworth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03076165025613987,"gpt":0.2313039543876464,"spread":0.2005423041315065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003391231,0.0005769117,0.0008268424,0.0003180323,0.001270705,0.000832449,0.001534621,0.001148642,0.005294597],"category_scores_gemma":[0.0008198399,0.0004337593,0.0004447449,0.0004865802,0.0007017369,0.0005878872,0.001656979,0.0006774237,0.0005485459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005313362,"about_ca_system_score_gemma":0.00131616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01438019,"about_ca_topic_score_gemma":0.01043004,"domain_scores_codex":[0.9997309,0.00005045813,0.00001630028,0.000076813,0.00008785263,0.00003768584],"domain_scores_gemma":[0.9996777,0.00009195594,0.00002158913,0.0000358529,0.00007517789,0.00009773445],"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.000507449,0.0002206006,0.0007734353,0.0001167107,0.00007578073,0.000896072,0.0002318992,0.9018826,0.0141388,0.0166157,0.003737905,0.06080298],"study_design_scores_gemma":[0.00005938588,0.00009499715,0.0001270415,0.000004415926,0.00001259517,0.00004505297,0.00003681885,0.9925064,0.001323248,0.003860372,0.00191909,0.0000106104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1708356,0.0001853386,0.7982827,0.0006941015,0.0001649071,0.000361934,0.0002881242,0.001625061,0.02756224],"genre_scores_gemma":[0.6949313,0.000118781,0.2954593,0.0001111191,0.00002605607,0.0002866819,0.0002621371,0.00009508216,0.008709542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01438019,"threshold_uncertainty_score":0.02859294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1696171692","doi":"10.1007/s10601-015-9214-x","title":"On Algorithm Selection, with an application to combinatorial search problems","year":2015,"lang":"en","type":"article","venue":"Constraints","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Machine learning; Selection (genetic algorithm); Artificial intelligence; De facto; Robustness (evolution); Field (mathematics); Constraint (computer-aided design); Algorithm; Mathematics","authors":[{"name":"Lars Kotthoff","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02590515421391894,"gpt":0.2804183302547102,"spread":0.2545131760407913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008430235,0.003178052,0.003861267,0.006391045,0.002083304,0.004291192,0.003816718,0.004328065,0.009839129],"category_scores_gemma":[0.05165993,0.001279279,0.002273524,0.01742669,0.003808764,0.005956933,0.004824382,0.005913771,0.001432907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001737687,"about_ca_system_score_gemma":0.002338579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004523471,"about_ca_topic_score_gemma":0.005570363,"domain_scores_codex":[0.9921745,0.004970928,0.0002956125,0.0005884238,0.001668699,0.0003019986],"domain_scores_gemma":[0.9459118,0.04917256,0.0009436721,0.001262678,0.002081278,0.000627995],"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.0002747852,0.0003771399,0.001673561,0.0009006603,0.0002273097,0.0005761398,0.0003328632,0.3125489,0.0009212134,0.3887573,0.0275793,0.2658309],"study_design_scores_gemma":[0.0001258178,0.0001070821,0.0003516619,0.0001169534,0.00006049653,0.0002381182,0.00007743309,0.713942,0.0003732944,0.2763397,0.008219623,0.00004782485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003094111,0.002416286,0.9847493,0.001187191,0.0003409064,0.0001662148,0.0001079408,0.0001759179,0.007762201],"genre_scores_gemma":[0.08566689,0.00526748,0.8947274,0.000832376,0.001814943,0.0009337972,0.0003804246,0.0004419664,0.009934723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009839129,"threshold_uncertainty_score":0.04458386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1063455699","doi":"10.1007/s10601-015-9196-8","title":"A hybrid constraint programming approach to a wood procurement problem with bucking decisions","year":2015,"lang":"en","type":"article","venue":"Constraints","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"FPInnovations","keywords":"Procurement; Flexibility (engineering); Constraint (computer-aided design); Constraint programming; Integer programming; Mathematical optimization; Computer science; Set (abstract data type); Programming paradigm; Operations research; Mathematics; Stochastic programming; Business","authors":[{"name":"Amira Dems","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Jean‐Marc Frayret","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05045296916200682,"gpt":0.2725449922231356,"spread":0.2220920230611288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257884,0.001538603,0.001680098,0.001629709,0.0007956184,0.002694181,0.003504284,0.002780002,0.01031593],"category_scores_gemma":[0.004093744,0.001736653,0.001849796,0.003403001,0.001127422,0.002138681,0.001617188,0.002102448,0.000692135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00150219,"about_ca_system_score_gemma":0.00188577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01324571,"about_ca_topic_score_gemma":0.01330955,"domain_scores_codex":[0.998735,0.0005898099,0.00004786127,0.0002030746,0.0003231358,0.0001010827],"domain_scores_gemma":[0.9974674,0.00201481,0.0001239523,0.00009435637,0.0002217727,0.00007782653],"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.0000151185,0.00003863217,0.00009456558,0.00007584853,0.00003083966,0.00006868234,0.00002280133,0.9673378,0.000302273,0.02114626,0.0008134349,0.01005377],"study_design_scores_gemma":[0.000008479486,0.00001243923,0.00002992723,0.0000114527,0.000008157583,0.00001444502,0.00001106059,0.9923028,0.0001062543,0.006459611,0.001029021,0.00000641363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004633824,0.000250747,0.9875848,0.0001769177,0.00005326233,0.0000744913,0.0001346939,0.00006539225,0.007025835],"genre_scores_gemma":[0.2081233,0.0009369044,0.7707762,0.0003487974,0.0001722523,0.0007516433,0.0004410387,0.0002590755,0.01819075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01324571,"threshold_uncertainty_score":0.0345102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297312265","doi":"10.1007/s10601-022-09337-w","title":"Short- and medium-term optimization of underground mine planning using constraint programming","year":2022,"lang":"en","type":"article","venue":"Constraints","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Computer science; Scheduling (production processes); Integer programming; Constraint (computer-aided design); Constraint satisfaction; Automation; Mathematical optimization; Task (project management); Operations research; Industrial engineering; Stochastic programming; Engineering; Artificial intelligence; Algorithm; Mathematics; Systems engineering","authors":[{"name":"Louis-Pierre Campeau","is_ca":true},{"name":"Michel Gamache","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03815083992490736,"gpt":0.2579665200586732,"spread":0.2198156801337658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789757,0.0009696157,0.001325191,0.0007776049,0.0006017129,0.002635691,0.00170399,0.001564997,0.005887071],"category_scores_gemma":[0.007154133,0.001001124,0.001075584,0.002111643,0.0009901098,0.002491957,0.00139688,0.002054353,0.0003569092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00236206,"about_ca_system_score_gemma":0.003035948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01772158,"about_ca_topic_score_gemma":0.01794923,"domain_scores_codex":[0.9985988,0.0007300724,0.00005843691,0.0001733198,0.0002630069,0.0001764018],"domain_scores_gemma":[0.9953062,0.003889019,0.0002264072,0.00008994139,0.0003260587,0.0001623563],"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.00003333286,0.00001767102,0.0001520118,0.00004369996,0.00002592052,0.00003491003,0.000009963942,0.984487,0.0001559912,0.01004542,0.0005827295,0.00441132],"study_design_scores_gemma":[0.000004955202,0.00001469375,0.00009774126,0.000009554473,0.00000657356,0.000008299652,0.00001218652,0.9921234,0.0001211978,0.007120641,0.0004750572,0.00000573068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04292032,0.001671172,0.932931,0.001310054,0.0001985454,0.0001160783,0.0007015215,0.0001106763,0.02004062],"genre_scores_gemma":[0.7748961,0.001941088,0.2021791,0.0002465465,0.0001945907,0.0004942542,0.0006784524,0.0002646046,0.01910515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01772158,"threshold_uncertainty_score":0.0352369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4383620205","doi":"10.1007/s10601-023-09348-1","title":"SAT-based optimal classification trees for non-binary data","year":2023,"lang":"en","type":"article","venue":"Constraints","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Interpretability; Computer science; Overfitting; Pruning; Machine learning; Artificial intelligence; Decision tree; Categorical variable; Heuristic; Incremental decision tree; Binary decision diagram; Heuristics; Data mining; Decision tree learning; Algorithm; Artificial neural network","authors":[{"name":"Pouya Shati","is_ca":true},{"name":"Eldan Cohen","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1147390700826188,"gpt":0.345109813977273,"spread":0.2303707438946542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496236,0.001060888,0.002070235,0.001384276,0.0008493606,0.002547352,0.002701584,0.001780384,0.009841002],"category_scores_gemma":[0.01849319,0.001132097,0.001707025,0.003034449,0.001235301,0.005287846,0.002049528,0.003549819,0.001531136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00162417,"about_ca_system_score_gemma":0.002346076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004042068,"about_ca_topic_score_gemma":0.009297829,"domain_scores_codex":[0.9976237,0.0009363315,0.0001755431,0.0005251822,0.0004851792,0.0002539376],"domain_scores_gemma":[0.984659,0.01276121,0.0005247786,0.001084397,0.000757355,0.0002132857],"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.0007306016,0.0005108546,0.002448149,0.0006257961,0.0002240555,0.0001957869,0.0002517425,0.5307843,0.002650763,0.1041879,0.03209549,0.3252945],"study_design_scores_gemma":[0.00006247377,0.00003713427,0.0002073786,0.00003385308,0.00002723292,0.00003842252,0.00003605206,0.8876292,0.0005096731,0.1103451,0.00106468,0.000008764268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04256508,0.001429904,0.9430343,0.002191468,0.0002190881,0.0002228105,0.001828051,0.001710433,0.006798839],"genre_scores_gemma":[0.4571893,0.0008439419,0.5279792,0.001120689,0.0004201107,0.0004646021,0.005831703,0.0005645963,0.00558588],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009841002,"threshold_uncertainty_score":0.03292143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404651431","doi":"10.1007/s10601-024-09377-4","title":"Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver","year":2024,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Solver; Heuristic; Selection (genetic algorithm); Constraint (computer-aided design); Computer science; Problem solver; Mathematical optimization; Value (mathematics); Constraint satisfaction problem; Constraint programming; Artificial intelligence; Mathematics; Machine learning; Stochastic programming","authors":[{"name":"Tom Marty","is_ca":true},{"name":"Léo Boisvert","is_ca":true},{"name":"Tristan François","is_ca":false},{"name":"Pierre Tessier","is_ca":false},{"name":"Louis Gautier","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Quentin Cappart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01497864478727082,"gpt":0.2519402801471005,"spread":0.2369616353598297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526169,0.001124101,0.001039258,0.0006338409,0.00042127,0.001273718,0.001705342,0.001793412,0.004487143],"category_scores_gemma":[0.008701343,0.00058176,0.0007322193,0.0007264463,0.001176968,0.001312518,0.001626003,0.002236693,0.0005291687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001233709,"about_ca_system_score_gemma":0.002007975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003813445,"about_ca_topic_score_gemma":0.004349635,"domain_scores_codex":[0.9987842,0.0005281466,0.00005596887,0.0002500553,0.0001904375,0.0001912766],"domain_scores_gemma":[0.9956845,0.003157664,0.0002966699,0.0003089118,0.0003810723,0.0001712178],"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.00008745962,0.0001233062,0.0007620453,0.00009030898,0.00002787356,0.00006355315,0.00004434821,0.933463,0.001725955,0.01502672,0.001422897,0.04716251],"study_design_scores_gemma":[0.000009191674,0.00001367735,0.00002752648,0.000005793004,0.000002866449,0.000004960504,0.000003944146,0.9969237,0.000380525,0.002447857,0.0001778628,0.000002030468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0404931,0.0001704498,0.9541784,0.0003557773,0.00005312767,0.0001199574,0.00006064298,0.0007467638,0.00382175],"genre_scores_gemma":[0.5752205,0.0001230743,0.4216968,0.0003322483,0.00004490351,0.0002659656,0.0001678688,0.00024752,0.001901168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004487143,"threshold_uncertainty_score":0.01501101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062540065","doi":"10.1007/s10601-013-9140-8","title":"View-based propagation of decomposable constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Propagator; Constraint (computer-aided design); Decomposition; Local consistency; Simple (philosophy); Decomposition method (queueing theory); Code (set theory)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01162011928520506,"gpt":0.2288750876340045,"spread":0.2172549683487995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002701908,0.001400028,0.001090624,0.002783262,0.0008321338,0.002670083,0.002806238,0.001279208,0.008258156],"category_scores_gemma":[0.01464766,0.001219393,0.002070187,0.002963811,0.0009605506,0.004925109,0.003649781,0.003157047,0.001008955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107624,"about_ca_system_score_gemma":0.001758589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007670272,"about_ca_topic_score_gemma":0.01378256,"domain_scores_codex":[0.996819,0.0007612007,0.0001375464,0.0003964862,0.001639137,0.0002465673],"domain_scores_gemma":[0.9914692,0.004968342,0.000459911,0.001426263,0.001453077,0.000223261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003252001,0.0003648086,0.002141522,0.0005773523,0.0002712694,0.0007999896,0.0006383331,0.3221079,0.01318134,0.2176427,0.01926577,0.4226839],"study_design_scores_gemma":[0.00003389341,0.00005013145,0.0003578197,0.00008688081,0.0000892522,0.0001527185,0.0001147251,0.8653765,0.007842948,0.1179876,0.007869245,0.00003827697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009428781,0.0002511682,0.9837298,0.0002506021,0.00008755164,0.0001571793,0.0004556326,0.0008005043,0.004838927],"genre_scores_gemma":[0.2311341,0.0008328176,0.7588148,0.000292435,0.0001117382,0.0002286464,0.002046228,0.0005920649,0.005947244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008258156,"threshold_uncertainty_score":0.02762634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2257535843","doi":"10.1007/s10601-016-9238-x","title":"ℚ-bounds consistency for the spread constraint with variable mean","year":2016,"lang":"en","type":"article","venue":"Constraints","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Variable (mathematics); Constraint (computer-aided design); Mathematics; Consistency (knowledge bases); Piecewise; Local consistency; Algorithm; Extension (predicate logic); Function (biology); Mathematical optimization; Computer science; Constraint satisfaction; Statistics; Discrete mathematics","authors":[{"name":"Soon Chee Loong","is_ca":true},{"name":"Wen-Yang Ku","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02114691847701545,"gpt":0.2322014977262077,"spread":0.2110545792491923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01304685,0.001953181,0.004053639,0.002751893,0.002601883,0.006517561,0.008074513,0.003815424,0.01038254],"category_scores_gemma":[0.08957387,0.002254972,0.003303595,0.006548978,0.004635072,0.01807746,0.009396043,0.0106802,0.00167513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003093751,"about_ca_system_score_gemma":0.005177681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004962429,"about_ca_topic_score_gemma":0.003722791,"domain_scores_codex":[0.9834425,0.005449997,0.001101577,0.003923732,0.004574212,0.001508109],"domain_scores_gemma":[0.9119903,0.06245442,0.003170658,0.0134398,0.007392264,0.001552578],"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.0007722436,0.000234866,0.002040977,0.0005975286,0.0003535243,0.0002436309,0.0005931334,0.2151393,0.002134422,0.6646003,0.02044292,0.09284728],"study_design_scores_gemma":[0.00007136581,0.00004676955,0.0002769506,0.00007788397,0.00006566918,0.00009579737,0.00005490624,0.3796548,0.001441525,0.6148165,0.003354538,0.00004343479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254648,0.0007719257,0.9772847,0.001870251,0.00020046,0.0000858631,0.0004724334,0.0005370858,0.00623086],"genre_scores_gemma":[0.3858498,0.001400538,0.5908739,0.002080905,0.001429699,0.0006364134,0.002485177,0.001602204,0.01364132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01304685,"threshold_uncertainty_score":0.06899911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386913035","doi":"10.1007/s10601-023-09355-2","title":"Constraint programming approaches to electric vehicle and robot routing problems","year":2023,"lang":"en","type":"article","venue":"Constraints","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Electric vehicle; Greenhouse gas; Robot; Mobile robot; Computer science; Battery (electricity); Variety (cybernetics); Investment (military); Electric motor; Vehicle routing problem; Automotive engineering; Routing (electronic design automation); Engineering; Electrical engineering; Embedded system; Artificial intelligence","authors":[{"name":"Kyle E. C. Booth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0801388474127351,"gpt":0.2332340308149371,"spread":0.153095183402202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002155129,0.001690329,0.001300487,0.001552112,0.0008858247,0.002933859,0.003044199,0.001815045,0.009694587],"category_scores_gemma":[0.0068036,0.001138566,0.001429268,0.005002372,0.001839091,0.002914489,0.00129518,0.003412849,0.0007980779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002530662,"about_ca_system_score_gemma":0.002658166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02101081,"about_ca_topic_score_gemma":0.0191956,"domain_scores_codex":[0.9982274,0.0008068067,0.00008200636,0.0002507285,0.0004803441,0.0001527019],"domain_scores_gemma":[0.9965752,0.002738123,0.0001817974,0.0001070179,0.0003071178,0.00009079649],"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.00002437724,0.00006069206,0.0001467202,0.0002873472,0.00007088641,0.0001252304,0.00009061392,0.3881968,0.0002347748,0.5722814,0.007834992,0.03064615],"study_design_scores_gemma":[0.00003495883,0.00001852223,0.0001335058,0.000098709,0.00003310063,0.00006662152,0.00009458583,0.4421068,0.0002053351,0.5298969,0.02728519,0.00002573466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003122435,0.004234284,0.9590286,0.001859883,0.0002635238,0.00008519808,0.0003852939,0.00006170142,0.03095915],"genre_scores_gemma":[0.2350511,0.02085758,0.6905749,0.001424529,0.001645481,0.0007529273,0.001254473,0.0002997004,0.04813926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02101081,"threshold_uncertainty_score":0.04177701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230472497","doi":"10.1007/s10601-010-9091-2","title":"Editor’s note","year":2010,"lang":"de","type":"article","venue":"Constraints","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Medicine","authors":[{"name":"Gilles Pesant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00933857758907345,"gpt":0.2676948821483601,"spread":0.2583563045592866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002730781,0.001923488,0.002155362,0.002718846,0.00303498,0.005980146,0.003435104,0.00750328,0.289158],"category_scores_gemma":[0.03307379,0.001008363,0.001597014,0.002787275,0.001085041,0.002899523,0.001631242,0.009063317,0.1343518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002191733,"about_ca_system_score_gemma":0.003964653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007821719,"about_ca_topic_score_gemma":0.01645911,"domain_scores_codex":[0.9974234,0.0003750601,0.0003221306,0.0004024241,0.00117907,0.0002980307],"domain_scores_gemma":[0.9883171,0.003723978,0.0006043157,0.0009659912,0.005649589,0.0007391778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001465954,0.000005300379,0.00001584536,0.00003766305,0.000002748662,0.00004961358,0.00000776783,0.000017255,0.00003009606,0.0006370814,0.9950166,0.004165375],"study_design_scores_gemma":[0.00001315435,0.000005369317,0.00009723649,0.0000786648,0.000008726315,0.00006764826,0.00002136907,0.00008294005,0.0001370997,0.0006116584,0.9988666,0.000009638153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0003519622,0.003744523,0.001545665,0.1776066,0.6626217,0.0001899929,0.002166928,0.0006501832,0.1511224],"genre_scores_gemma":[0.005416734,0.00419118,0.002838566,0.1253765,0.2191975,0.0002534938,0.001053617,0.001004335,0.6406681],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.710842,"threshold_uncertainty_score":0.9673297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978238761","doi":"10.1007/s10601-006-8055-z","title":"Introduction to the Special Issue on Principles and Practice of Constraint Programming (CP 2005)","year":2006,"lang":"en","type":"article","venue":"Constraints","topic":"Operations Management Techniques","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Constraint programming; Constraint (computer-aided design); Computer science; Programming language; Mathematics; Mathematical optimization; Stochastic programming","authors":[{"name":"Barry O’Sullivan","is_ca":false},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05824297091881563,"gpt":0.3666021104407021,"spread":0.3083591395218865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290208,0.001583321,0.001798253,0.003548659,0.001054905,0.006462883,0.002033424,0.002906185,0.08520473],"category_scores_gemma":[0.009057306,0.0009132709,0.001445974,0.005944199,0.001634133,0.006530789,0.001821862,0.00720231,0.03492101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001407899,"about_ca_system_score_gemma":0.002418561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002023927,"about_ca_topic_score_gemma":0.003037588,"domain_scores_codex":[0.9982077,0.0003925375,0.0001855566,0.0003150757,0.0008238048,0.00007540063],"domain_scores_gemma":[0.9937639,0.003313294,0.000303794,0.0006483367,0.001536855,0.0004338928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001275174,0.00004638948,0.00007975237,0.0003821178,0.00001703063,0.00004829257,0.00004743236,0.0007394095,0.0002722917,0.04510685,0.824827,0.1284207],"study_design_scores_gemma":[0.000005169909,0.00001889854,0.0001595948,0.0002571585,0.00001089307,0.0001520908,0.00002566194,0.0009199386,0.0001425909,0.03967684,0.9586101,0.00002097377],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"editorial","genre_scores_codex":[0.001010009,0.1435712,0.3493753,0.05581404,0.2504989,0.0003922695,0.002800445,0.001780343,0.1947574],"genre_scores_gemma":[0.01179862,0.1777807,0.2081604,0.02454596,0.2824091,0.0006081765,0.004916536,0.002332367,0.2874483],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.08520473,"threshold_uncertainty_score":0.2850382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7116789795","doi":"10.1007/s10601-025-09382-1","title":"Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming","year":2025,"lang":"en","type":"article","venue":"Constraints","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dynamic programming; Benders' decomposition; Constraint programming; Integer programming; Constraint (computer-aided design); Exploit; Set (abstract data type); Variable (mathematics); State (computer science)","authors":[{"name":"Jiachen Zhang","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007320887997034605,"gpt":0.2277455770914777,"spread":0.2204246890944431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001500327,0.001314742,0.001420532,0.001150823,0.0006276676,0.001809108,0.001565666,0.001328949,0.007005961],"category_scores_gemma":[0.004482282,0.00103387,0.001453994,0.001413714,0.001089842,0.001933779,0.001582608,0.002370834,0.0007789303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001113031,"about_ca_system_score_gemma":0.001840076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004214903,"about_ca_topic_score_gemma":0.006239304,"domain_scores_codex":[0.9990817,0.0003062497,0.00003674056,0.0001698764,0.0002767221,0.0001288228],"domain_scores_gemma":[0.9984888,0.001123335,0.00009842298,0.00008335432,0.0001591574,0.00004688662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004489905,0.00006100153,0.0001383218,0.000104847,0.00002993204,0.00002712472,0.00003382891,0.9294655,0.0009003005,0.03698976,0.001135611,0.03106893],"study_design_scores_gemma":[0.00001201266,0.00001500522,0.00002590183,0.00001160465,0.000005988271,0.000005624741,0.00001117557,0.9763242,0.0004346602,0.02262884,0.0005203348,0.000004523591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00598127,0.0001113692,0.9885252,0.000148474,0.00002632362,0.00004551078,0.00008929745,0.0001784549,0.004894053],"genre_scores_gemma":[0.2606463,0.000379599,0.7320987,0.0002209193,0.00009074278,0.000288608,0.0005040001,0.0003286497,0.005442456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007005961,"threshold_uncertainty_score":0.02343726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083081391","doi":"10.1007/s10601-013-9143-5","title":"Introduction to the special issue on constraint modelling and reformulation","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Computer science; Management science; Engineering; Mechanical engineering","authors":[{"name":"Andrea Rendl","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01394586661107254,"gpt":0.2255223947929468,"spread":0.2115765281818743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004141793,0.00256299,0.003013115,0.004135394,0.001521926,0.006470914,0.003369875,0.00335204,0.06125475],"category_scores_gemma":[0.01368895,0.001428972,0.003601084,0.00694014,0.003053192,0.009871574,0.003162858,0.01024351,0.02739461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002077132,"about_ca_system_score_gemma":0.002100567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00178521,"about_ca_topic_score_gemma":0.002244979,"domain_scores_codex":[0.9961709,0.001045236,0.0004274688,0.0008575658,0.001331228,0.0001675054],"domain_scores_gemma":[0.9913507,0.005308954,0.000297276,0.001124261,0.001616336,0.0003026092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002963894,0.0000685428,0.0001021811,0.0009110285,0.00005913804,0.0001343232,0.0001104485,0.001749135,0.0005939156,0.1327026,0.7292992,0.1342398],"study_design_scores_gemma":[0.000008290606,0.00002042747,0.0001437828,0.0003254538,0.0000243215,0.0002716363,0.00003211483,0.002579169,0.0002886362,0.09982131,0.8964469,0.00003788633],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"editorial","genre_scores_codex":[0.0007341331,0.1075536,0.5590008,0.03332666,0.1904459,0.0003106305,0.002014736,0.001748107,0.1048653],"genre_scores_gemma":[0.01460035,0.1315142,0.2682953,0.02091612,0.38774,0.0008113275,0.005908703,0.004347524,0.1658664],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.06125475,"threshold_uncertainty_score":0.2049176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4250584656","doi":"10.1023/a:1009825009635","title":"Introduction","year":2000,"lang":"en","type":"article","venue":"Constraints","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","authors":[{"name":"J. Christopher Beck","is_ca":false},{"name":"Andrew Davenport","is_ca":true},{"name":"Claude Le Pape","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009929681234525355,"gpt":0.2344244563770206,"spread":0.2244947751424952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001149142,0.001947836,0.0009072457,0.001935348,0.001766086,0.005892554,0.003225213,0.00164277,0.4914037],"category_scores_gemma":[0.007299263,0.0008885052,0.001553414,0.002256599,0.0009947991,0.006317252,0.002972012,0.003447627,0.2306581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001286188,"about_ca_system_score_gemma":0.002074751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003491034,"about_ca_topic_score_gemma":0.003698375,"domain_scores_codex":[0.9983822,0.0002893737,0.00007975524,0.0004721673,0.0006005255,0.0001759494],"domain_scores_gemma":[0.9974899,0.0005939884,0.0001202502,0.0008708973,0.0007362836,0.0001886905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001411573,0.0000802354,0.0003134624,0.0003807646,0.00002121821,0.00009898418,0.000153839,0.001562363,0.001191305,0.3040572,0.5314233,0.160576],"study_design_scores_gemma":[0.00002105783,0.00001245075,0.0001330208,0.0001237662,0.0000126487,0.0001142239,0.00006569545,0.002241905,0.001225578,0.07444016,0.9215893,0.00002018213],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002062056,0.0009381508,0.1407296,0.003888258,0.00230156,0.0003420576,0.01553522,0.009981708,0.8242214],"genre_scores_gemma":[0.05087643,0.002591387,0.1475005,0.002878069,0.001861153,0.0006988951,0.0388795,0.01111478,0.7435992],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5085963,"threshold_uncertainty_score":0.7254509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}