{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209596,0.0001327795,0.0002140762,0.0002268613,0.0003196853,0.0003721032,0.0003765975,0.00006721394,0.0007473651],"category_scores_gemma":[0.001221986,0.0001160596,0.0001356403,0.0005533834,0.0004250822,0.0001433518,0.00002973031,0.0001244765,0.0006000653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004151026,"about_ca_system_score_gemma":0.0002490418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004439566,"about_ca_topic_score_gemma":0.00001625745,"domain_scores_codex":[0.9976955,0.0001817489,0.0004759617,0.0004955668,0.0008233452,0.0003278514],"domain_scores_gemma":[0.9985287,0.0003337272,0.0001465229,0.0005452365,0.000333263,0.0001125574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005949185,0.001739662,0.02645853,0.0000164001,0.000108686,0.000102896,0.0002557799,0.1311821,0.02738458,0.07884658,0.3789836,0.3548617],"study_design_scores_gemma":[0.001889047,0.00004541555,0.009145286,0.00001568601,0.00005642664,0.00009594134,0.0002305259,0.9210145,0.01045721,0.01707996,0.03943158,0.0005384018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2104133,0.0001308209,0.7608027,0.0007020272,0.0005680108,0.0003698759,0.00009005038,0.0001473239,0.02677581],"genre_scores_gemma":[0.9581317,3.682452e-7,0.0393394,0.0002516035,0.0002943797,0.00003572844,0.00008549787,0.00001021348,0.001851141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7898324,"threshold_uncertainty_score":0.8183124,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000524291,0.0001108779,0.0000946998,0.00006179079,0.001047752,0.0001170487,0.0007477321,0.00002790903,0.00005511045],"category_scores_gemma":[0.00003440845,0.00009372955,0.00005621498,0.0005172986,0.0001543085,0.0002495194,0.0002873269,0.0005028095,0.000005218551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005210691,"about_ca_system_score_gemma":0.00004599964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003441044,"about_ca_topic_score_gemma":0.000002296532,"domain_scores_codex":[0.9985901,0.0002784274,0.0001933396,0.0003343824,0.0003209557,0.0002828456],"domain_scores_gemma":[0.9993632,0.0001502913,0.0001379421,0.0002730745,0.00003446001,0.0000409638],"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.000007471302,0.00002276766,0.00112077,0.00001119954,0.00002361223,0.00006339452,0.01461189,0.4026646,0.005781813,0.2249688,0.0004061267,0.3503176],"study_design_scores_gemma":[0.0006056878,0.0002368774,0.0006049322,0.00006157962,0.00001537568,0.0003878188,0.001636048,0.8832058,0.001382614,0.09897213,0.01228695,0.0006041623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04000819,0.0003143734,0.9539479,0.001825218,0.0005286228,0.0003126648,0.000001359788,0.000373249,0.002688438],"genre_scores_gemma":[0.9733128,0.00002183902,0.02572163,0.0005948363,0.00007327329,0.00003110972,0.00000588286,0.00001259546,0.0002260552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9333046,"threshold_uncertainty_score":0.8058565,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000251157,0.0002677118,0.0002721559,0.0001816609,0.0002556302,0.0002860586,0.0003963322,0.0001518009,0.002035794],"category_scores_gemma":[0.0001333641,0.0002555349,0.0001370603,0.0005169732,0.0004938515,0.0006767811,0.00009588165,0.0002807538,0.0002241694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007735831,"about_ca_system_score_gemma":0.0002307401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001106451,"about_ca_topic_score_gemma":0.00002850301,"domain_scores_codex":[0.9982227,0.00009473111,0.0004102696,0.0005260993,0.0003343577,0.0004118286],"domain_scores_gemma":[0.9987275,0.000149083,0.0001658962,0.0005424898,0.000173303,0.0002417107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00004073339,0.00004675278,0.01815141,0.00001260427,0.00008322719,0.0002388704,0.001039715,0.001401501,0.000749933,0.04922242,0.001567042,0.9274458],"study_design_scores_gemma":[0.03154939,0.000436667,0.5668484,0.0004677041,0.0001980483,0.01777721,0.00492702,0.2689226,0.002612902,0.01785837,0.08313899,0.005262672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01912964,0.00005436809,0.9537196,0.00355816,0.0009637079,0.0003908384,0.00001342434,0.0005789571,0.02159129],"genre_scores_gemma":[0.9747998,0.00007270847,0.02334752,0.001336155,0.0001077761,0.00002477356,0.00001058512,0.00001296545,0.0002877768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9556701,"threshold_uncertainty_score":0.9999897,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981561,0.0001423188,0.0003115969,0.0002708994,0.0002059301,0.0001546485,0.0004579845,0.0001007488,0.00009256523],"category_scores_gemma":[0.003595156,0.0001124824,0.0002112178,0.0004531693,0.0001800569,0.0003485569,0.00004050308,0.0001590441,0.00002928249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000164339,"about_ca_system_score_gemma":0.0001395485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001108804,"about_ca_topic_score_gemma":0.00000729168,"domain_scores_codex":[0.997906,0.00004386234,0.0007028264,0.0003594568,0.000511193,0.0004766489],"domain_scores_gemma":[0.9984398,0.000490514,0.0002129482,0.0003498039,0.0003918561,0.0001150399],"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.00005636922,0.0002212206,0.001088525,0.0000252567,0.00005655521,0.000003246879,0.002805346,0.1209633,0.001455565,0.06072131,0.00006221161,0.8125411],"study_design_scores_gemma":[0.001200527,0.0002522585,0.000538392,0.0002363517,0.00006111921,0.00002319041,0.004644737,0.8763239,0.001124921,0.1145157,0.0006922449,0.000386713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1854154,0.0003094191,0.8101721,0.0006520157,0.0001760727,0.0003789696,0.00002046449,0.00009225885,0.002783354],"genre_scores_gemma":[0.8923416,0.000001876186,0.107379,0.00007600151,0.00008451066,0.00001630598,0.000006678756,0.000007953951,0.0000860639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8121544,"threshold_uncertainty_score":0.4586899,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006771307,0.000220539,0.0002170054,0.00004748986,0.000545729,0.000374652,0.0006765099,0.0001005123,0.0001745872],"category_scores_gemma":[0.00008850335,0.0001779934,0.0001803451,0.0002914233,0.000987372,0.0002779864,0.00007485763,0.0001341152,0.00004045047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002091452,"about_ca_system_score_gemma":0.0004471512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001747357,"about_ca_topic_score_gemma":0.00003717497,"domain_scores_codex":[0.9982297,0.0001025086,0.0003990522,0.0005261975,0.0003140479,0.000428538],"domain_scores_gemma":[0.9984128,0.0002346766,0.0001388784,0.0007097028,0.0002829944,0.0002209005],"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.000002722995,0.00006250749,0.0004088037,0.000003232023,0.00003636848,0.000002931895,0.0001550756,0.002787688,0.0000161389,0.1196655,0.000193174,0.8766658],"study_design_scores_gemma":[0.001046479,0.00007746796,0.00684962,0.00001395577,0.00003966563,0.0002868669,0.000387438,0.9787039,0.0001218759,0.001425085,0.01070772,0.0003399594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001343773,0.0001576663,0.9889217,0.002371466,0.0007856713,0.0006207196,0.0001485246,0.00027225,0.005378244],"genre_scores_gemma":[0.7936468,0.000007907354,0.2052902,0.0008006219,0.0001559613,0.00004835272,0.0000119471,0.000006670938,0.00003164349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9759162,"threshold_uncertainty_score":0.7258359,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000389319,0.0002087968,0.0002091649,0.0001451837,0.0001977008,0.0001491653,0.0003936805,0.0001174812,0.0007039347],"category_scores_gemma":[0.0001250815,0.0002178951,0.0001224905,0.0002276403,0.0003581586,0.0007954943,0.00008967886,0.0001297197,0.00006987114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006997109,"about_ca_system_score_gemma":0.0001337113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002029139,"about_ca_topic_score_gemma":0.000001770823,"domain_scores_codex":[0.9984956,0.0000445782,0.0003431637,0.0003492615,0.000157744,0.0006096634],"domain_scores_gemma":[0.9988598,0.0001797576,0.0001402097,0.0003975093,0.0001361926,0.0002865632],"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.000005624422,0.00006855388,0.001718326,0.0000278758,0.00004982156,0.000002280796,0.0006411527,0.000006414393,0.01119461,0.1689758,0.0005266523,0.8167829],"study_design_scores_gemma":[0.02631546,0.0009730595,0.0792232,0.0007001071,0.0003688542,0.002433131,0.002672219,0.6193424,0.1312662,0.05224437,0.07501241,0.009448552],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00324182,0.00004492961,0.9832955,0.0003375844,0.00138912,0.0005082748,0.00003501841,0.000342908,0.01080482],"genre_scores_gemma":[0.9010993,0.000006118435,0.09798452,0.0005124927,0.0001582309,0.00005965587,0.00001745715,0.00001505517,0.0001471288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8978575,"threshold_uncertainty_score":0.8885503,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002129396,0.0001175665,0.0001235144,0.00008714008,0.00007733356,0.0002460041,0.0003916397,0.00007848734,0.0002680202],"category_scores_gemma":[0.0001787427,0.0001126741,0.00005441785,0.0002683159,0.0001634058,0.0004333487,0.00009956993,0.0001004283,0.0004584243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005686123,"about_ca_system_score_gemma":0.0001748543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003662795,"about_ca_topic_score_gemma":0.00006857652,"domain_scores_codex":[0.9989545,0.00004518338,0.0002011552,0.00031283,0.0002868856,0.0001994529],"domain_scores_gemma":[0.9990357,0.0001226146,0.00006283395,0.0003924539,0.0001204409,0.0002659744],"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.000004793776,0.0000250011,0.005454235,6.752668e-7,0.00001125053,0.00002071017,0.0005347921,0.0000959114,0.0000805089,0.02068753,0.002418304,0.9706663],"study_design_scores_gemma":[0.01278853,0.0004472876,0.2381575,0.000315147,0.00008231917,0.0004234923,0.001986092,0.2967617,0.003051867,0.298936,0.1439718,0.003078361],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02708397,0.00006094087,0.9546786,0.0006307882,0.001113091,0.000102751,0.00001045841,0.0002526775,0.01606673],"genre_scores_gemma":[0.9004493,0.000007236129,0.09896147,0.0004029218,0.00006925645,0.000004525412,0.00001509517,0.000005998961,0.00008420789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9675879,"threshold_uncertainty_score":0.589227,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009403474,0.0001058911,0.0001412124,0.0001060647,0.0001364098,0.0001690516,0.0002520885,0.00005022563,0.0002258974],"category_scores_gemma":[0.00009569037,0.0000858216,0.00002414855,0.0003526826,0.0007222374,0.0002379181,0.0001014907,0.00020591,0.00008790403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000695612,"about_ca_system_score_gemma":0.00007707895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005833033,"about_ca_topic_score_gemma":0.00001388185,"domain_scores_codex":[0.9984794,0.0002694756,0.0002634811,0.0004492277,0.0003181027,0.0002203232],"domain_scores_gemma":[0.9993727,0.0001142117,0.00006040926,0.0003247877,0.00005646308,0.0000713832],"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.00005420503,0.0002370691,0.00144555,0.00001858352,0.00003296704,0.00008029766,0.0006999236,0.03256971,0.0002006575,0.06816476,0.0004389888,0.8960573],"study_design_scores_gemma":[0.002639137,0.0001337165,0.01028014,0.00004075026,0.00001012275,0.0004838627,0.0008414831,0.9715255,0.0001782796,0.005907709,0.007695212,0.000264089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008937826,0.0002062631,0.9767794,0.003461366,0.000141831,0.0003595485,0.000001332136,0.00004089264,0.01007156],"genre_scores_gemma":[0.9818727,0.0006074567,0.01632682,0.0001793369,0.00008333154,0.00004312318,0.000003889081,0.000007228738,0.0008760446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972935,"threshold_uncertainty_score":0.3499703,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649491,0.0002328615,0.0002387426,0.0002800974,0.0002070071,0.0001886989,0.0004847203,0.0001389077,0.0003069977],"category_scores_gemma":[0.00007609571,0.000243794,0.0001090141,0.0004462989,0.000500195,0.0002902074,0.00006439014,0.0002110842,0.0002544905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002222451,"about_ca_system_score_gemma":0.0004847303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001555213,"about_ca_topic_score_gemma":0.0000183151,"domain_scores_codex":[0.9981108,0.00006425595,0.0004915707,0.0004990717,0.0003163294,0.0005179736],"domain_scores_gemma":[0.9986042,0.0002140305,0.000182219,0.0005394683,0.0001741154,0.0002859361],"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.00001054891,0.00005965008,0.002022695,0.00004460627,0.00003493065,0.0003113096,0.0002784656,0.0006664778,0.001424298,0.2217863,0.0001852156,0.7731755],"study_design_scores_gemma":[0.01000676,0.0004716332,0.03452537,0.0007150206,0.0001212325,0.005667717,0.003469069,0.9004753,0.02028062,0.0006894101,0.01977968,0.003798201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00282601,0.00002522136,0.9154866,0.0003497571,0.0008462949,0.0002831946,0.00001207889,0.00084902,0.07932185],"genre_scores_gemma":[0.8869795,8.74783e-7,0.1122983,0.0005701875,0.00005810901,0.000008308433,0.000008110082,0.00001214412,0.00006448062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8998088,"threshold_uncertainty_score":0.994163,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000192041,0.0001471671,0.0002087623,0.0001754444,0.0001095599,0.00008702539,0.0003775268,0.00008283054,0.0002375112],"category_scores_gemma":[0.0001236576,0.000162077,0.0001115197,0.0002809326,0.0002894623,0.0004312824,0.00003633352,0.00009024271,0.00000885167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003308821,"about_ca_system_score_gemma":0.0002198264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005545341,"about_ca_topic_score_gemma":0.000004168684,"domain_scores_codex":[0.9988598,0.00002636745,0.0003742615,0.0003038513,0.0001845465,0.0002512239],"domain_scores_gemma":[0.9990409,0.000128557,0.0001770516,0.0003097135,0.0001816853,0.0001620773],"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.000002232182,0.00005542903,0.0003540208,0.000006008179,0.00001591122,0.000002381952,0.0002554457,0.0001590585,0.0008036565,0.1659329,0.0005942628,0.8318187],"study_design_scores_gemma":[0.02195589,0.001516625,0.2749712,0.000703047,0.0001459703,0.0004381685,0.0009347253,0.5030164,0.04117966,0.1473917,0.004946965,0.002799656],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002040245,0.00001628283,0.988143,0.0007981762,0.000375812,0.0003778177,0.00002282293,0.0001557763,0.008070073],"genre_scores_gemma":[0.7380729,0.000004785927,0.2615688,0.0001409323,0.00002891747,0.000006219623,0.00001078153,0.000004832079,0.0001618564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.829019,"threshold_uncertainty_score":0.6609308,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002175965,0.0002414894,0.0002315413,0.0002987462,0.0003483244,0.0003588851,0.0003515741,0.0001547502,0.001861299],"category_scores_gemma":[0.0001974714,0.0002454091,0.00009062245,0.0005958164,0.0004493991,0.001246298,0.0002157202,0.0002812213,0.0005296689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001617511,"about_ca_system_score_gemma":0.0002391668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007039496,"about_ca_topic_score_gemma":0.000008289808,"domain_scores_codex":[0.998101,0.00008880089,0.0004578805,0.0005582189,0.0003042822,0.0004898424],"domain_scores_gemma":[0.9985577,0.00009109172,0.0001480484,0.0005062099,0.0003360148,0.0003609206],"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.000008760704,0.0001397919,0.001453697,0.00002472761,0.0001716,0.00004627853,0.004782396,0.02372355,0.04969103,0.1707143,0.002355309,0.7468886],"study_design_scores_gemma":[0.00263976,0.0002108706,0.06903057,0.0004177237,0.00007443603,0.001950156,0.002308698,0.8954524,0.008027924,0.01416733,0.003220373,0.002499704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07143907,0.00001112498,0.9050222,0.001929319,0.0008621404,0.000788924,0.0000142911,0.0003829583,0.01954994],"genre_scores_gemma":[0.8084875,0.000002863489,0.1906541,0.0004722297,0.00007301996,0.00002658538,0.000004590402,0.00001385769,0.0002652054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8717289,"threshold_uncertainty_score":0.9999998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000187561,0.0001380136,0.000157305,0.00004537108,0.0002330713,0.00031375,0.000632758,0.00005225169,0.0000537808],"category_scores_gemma":[0.0001872798,0.0001368043,0.00006085817,0.0003640351,0.0002546842,0.0003285641,0.0002768908,0.0002186203,0.00007981969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002192807,"about_ca_system_score_gemma":0.0001237006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005151834,"about_ca_topic_score_gemma":5.431283e-7,"domain_scores_codex":[0.9987657,0.00003137446,0.0002445513,0.0004564979,0.0002071942,0.0002946976],"domain_scores_gemma":[0.9992567,0.0001133062,0.00009242471,0.0002490869,0.00006236525,0.0002260659],"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.000001454488,0.00001894458,0.0002144245,0.000003492257,0.00000977419,0.0000226125,0.0006515994,0.000687392,0.001443879,0.00657087,0.00007216202,0.9903034],"study_design_scores_gemma":[0.000471853,0.000133122,0.0003933969,0.00006549931,0.00001243541,0.0001261649,0.0007961579,0.9814392,0.0008009139,0.0002092097,0.01522913,0.0003229166],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027902,0.00003159831,0.9478815,0.0005769632,0.00007864257,0.0001463644,0.000008411856,0.0002854133,0.0007121428],"genre_scores_gemma":[0.500522,0.000002220508,0.4992654,0.0001344664,0.00005262921,0.000005973881,0.000004958867,0.000006173139,0.000006175816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9899805,"threshold_uncertainty_score":0.5578716,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290858,0.00006034206,0.00008482264,0.00002608045,0.0001755687,0.00008150726,0.0004062802,0.00002486288,0.00001589527],"category_scores_gemma":[0.0001680601,0.00002827692,0.00002769212,0.0001879063,0.001336327,0.00007988609,0.00009288812,0.0001294869,0.000004135789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008912946,"about_ca_system_score_gemma":0.00005559049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215852,"about_ca_topic_score_gemma":0.0003593504,"domain_scores_codex":[0.9991834,0.0002112084,0.0001883557,0.0001352284,0.0001478176,0.000133992],"domain_scores_gemma":[0.9987494,0.0007593429,0.00006765677,0.0003553954,0.00004247913,0.00002567048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000007112587,0.000004974301,0.02203201,0.000002699215,0.000006118708,6.533174e-7,0.000822408,0.00006898632,0.00003158162,0.5403609,0.00007380246,0.4365888],"study_design_scores_gemma":[0.003459154,0.00005101754,0.6655223,0.00005393191,0.00001148862,0.0001043797,0.001226597,0.2948888,0.0004224167,0.03071937,0.00329882,0.0002417104],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3135461,0.0005349555,0.5516518,0.06067232,0.0006890277,0.001233159,0.000005443412,0.0001073306,0.07155989],"genre_scores_gemma":[0.9987145,0.00006181931,0.0008189951,0.0003119176,0.00001486014,0.000007364123,3.342959e-7,0.000002286432,0.00006790609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6851684,"threshold_uncertainty_score":0.4923753,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043126,0.0001508866,0.0001249052,0.00007936954,0.0001639552,0.0003844951,0.0004140995,0.00005968733,0.00003078547],"category_scores_gemma":[0.00003743898,0.0001001208,0.00002132116,0.0006204779,0.0001643688,0.0003449258,0.0001461198,0.0002312772,0.00003732678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000374246,"about_ca_system_score_gemma":0.0001303277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002939483,"about_ca_topic_score_gemma":0.00024881,"domain_scores_codex":[0.9986889,0.00007082387,0.000207107,0.000494228,0.0003124442,0.0002264489],"domain_scores_gemma":[0.9991264,0.00006499364,0.00005637444,0.0003051227,0.0001657877,0.0002812708],"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.00002756314,0.00001929668,0.002213313,0.000005503136,0.000009366535,0.000004648451,0.002167334,0.0006728414,0.0001218886,0.003304961,0.00004223721,0.991411],"study_design_scores_gemma":[0.002235454,0.001455002,0.02758377,0.0001617989,0.00003518491,0.0003085272,0.005351298,0.9473659,0.0008872527,0.002477988,0.01124485,0.0008929957],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03266552,0.000008574455,0.961895,0.003969362,0.00003643771,0.0009121831,0.000006110643,0.0001768194,0.0003299804],"genre_scores_gemma":[0.8209844,0.000003753387,0.1782401,0.0006519008,0.00002347868,0.00006835464,0.00001518976,0.000008539422,0.000004266899],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.990518,"threshold_uncertainty_score":0.4082808,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001202049,0.0001446345,0.0001815351,0.00004422214,0.00008584203,0.00004565728,0.00008598205,0.00009932392,0.0001403108],"category_scores_gemma":[0.00005107881,0.0001538473,0.00009497946,0.0001110845,0.0001187484,0.00005073961,0.000004994326,0.00004745059,0.00002466768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005924768,"about_ca_system_score_gemma":0.00002525507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.247434e-7,"about_ca_topic_score_gemma":3.101122e-7,"domain_scores_codex":[0.9992573,0.00001018619,0.0002161522,0.0001726753,0.00008746854,0.0002561789],"domain_scores_gemma":[0.9995951,0.00008064661,0.00003101941,0.0001101255,0.00008755539,0.00009552836],"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.0003215753,0.0003107656,0.0003263329,0.0002257925,0.00041454,0.00002178426,0.001010355,0.1304658,0.004575325,0.02863368,0.0219527,0.8117414],"study_design_scores_gemma":[0.001808722,0.0001593719,0.00121337,0.0000536999,0.00003523131,0.0000749739,0.0001155645,0.9913564,0.0003056486,0.002539193,0.00201851,0.0003192954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06251976,0.0001622384,0.925197,0.0004096584,0.0004427367,0.0008110561,0.0006789821,0.000800244,0.008978293],"genre_scores_gemma":[0.7455343,0.000003256377,0.2536619,0.0001883782,0.0002235704,0.00003820069,0.0002198809,0.00001863403,0.000111882],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8608906,"threshold_uncertainty_score":0.627371,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008760642,0.00007475841,0.000088472,0.00005408868,0.00008241651,0.00003145054,0.0001916767,0.00004925551,0.00004494462],"category_scores_gemma":[0.00007220089,0.00006821407,0.00001772685,0.0001071841,0.0002347776,0.0003063071,0.00006898925,0.0001025271,0.00007802965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662564,"about_ca_system_score_gemma":0.00005944088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001205825,"about_ca_topic_score_gemma":0.00000705663,"domain_scores_codex":[0.999387,0.0000228503,0.0001064536,0.0002341414,0.0000855916,0.0001639681],"domain_scores_gemma":[0.9996257,0.00006769125,0.00004390351,0.0001638784,0.0000348848,0.0000639825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0000299144,0.0006311774,0.2558788,0.00005741836,0.00004408091,0.003802216,0.03753427,0.00005181006,0.03460993,0.4398362,0.003680255,0.2238439],"study_design_scores_gemma":[0.00135563,0.0001068015,0.971783,0.0001099563,0.000003169463,0.00226177,0.000481849,0.002778535,0.005780377,0.01324922,0.001550634,0.0005390837],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8345199,0.0002790319,0.07541823,0.0001835514,0.0004798588,0.0001401837,0.000001123989,0.0001642745,0.0888139],"genre_scores_gemma":[0.9977827,0.00002966593,0.001976653,0.00006022655,0.00001798106,0.000004641518,2.044941e-7,0.000003157825,0.0001247851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7159042,"threshold_uncertainty_score":0.2781689,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585633,0.0002371485,0.0003297555,0.0001393865,0.0001171026,0.00009134257,0.0008527603,0.00009991667,0.0001567926],"category_scores_gemma":[0.0001972438,0.0002137711,0.0001296218,0.000423507,0.0003005032,0.0003340657,0.00009775264,0.0001205143,0.0000851223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005263215,"about_ca_system_score_gemma":0.0004573817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004493083,"about_ca_topic_score_gemma":0.000001343257,"domain_scores_codex":[0.9979647,0.0002886153,0.0003731098,0.0005087238,0.0003123678,0.0005524715],"domain_scores_gemma":[0.9985595,0.00009185824,0.0001355498,0.0006739355,0.0001511669,0.0003879358],"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.00001644037,0.001030453,0.0008517861,0.0001447605,0.00006298232,0.00005064995,0.002461118,0.0006740429,0.0010379,0.8408592,0.0009706905,0.15184],"study_design_scores_gemma":[0.03253066,0.008999288,0.03981673,0.002073249,0.0005130437,0.003297749,0.005259311,0.5770463,0.187175,0.06036734,0.07162672,0.01129453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005656959,0.0002259605,0.9158605,0.00002684829,0.0002774059,0.0005018538,0.000008767128,0.000103326,0.07733841],"genre_scores_gemma":[0.8259267,0.000006407081,0.1734606,0.0004779109,0.00001722221,0.00003056114,0.000003974127,0.000009968703,0.00006658106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8202698,"threshold_uncertainty_score":0.8717332,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003123857,0.000212025,0.0002201149,0.0001290165,0.0002127275,0.0002016061,0.0007216909,0.0001133958,0.001202386],"category_scores_gemma":[0.0001137011,0.0002080072,0.0001059508,0.0002973195,0.0004116669,0.0002279586,0.000072527,0.0002798036,0.0008527013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004332625,"about_ca_system_score_gemma":0.0001204855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006932528,"about_ca_topic_score_gemma":0.000001480685,"domain_scores_codex":[0.9983919,0.00009410036,0.0002770229,0.0004586736,0.0002656602,0.0005125913],"domain_scores_gemma":[0.9987826,0.0002836963,0.0001030503,0.0005475351,0.00007250452,0.0002106325],"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.000007818165,0.0004219028,0.01341156,0.000119617,0.0001242139,0.0004873376,0.002348668,0.007050677,0.001632885,0.08945975,0.07534932,0.8095863],"study_design_scores_gemma":[0.001636495,0.0001790424,0.0008057373,0.000267509,0.00002595468,0.0002504418,0.00009861004,0.9831926,0.001202454,0.002788974,0.008687049,0.0008651402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002152469,0.000312707,0.9174519,0.002910144,0.0005595546,0.0002212038,0.00001018618,0.0006483532,0.07573346],"genre_scores_gemma":[0.9433739,0.000002365776,0.0542663,0.001721366,0.0000564358,0.00001141564,0.000004180918,0.00001225539,0.0005517859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9761419,"threshold_uncertainty_score":0.9999253,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003532768,0.0001083906,0.00009683969,0.00008741557,0.0001258431,0.0001835551,0.0005819639,0.00004250227,0.000006002052],"category_scores_gemma":[0.0000195246,0.00009555757,0.00001135984,0.0005888445,0.0000858255,0.0002894969,0.0000755461,0.0001210869,0.0002317936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006474156,"about_ca_system_score_gemma":0.0002259133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005317425,"about_ca_topic_score_gemma":0.000007846762,"domain_scores_codex":[0.9988263,0.00003797565,0.000128075,0.000453227,0.0003270095,0.0002273833],"domain_scores_gemma":[0.9988493,0.00003068013,0.00003568376,0.0004793728,0.0002670113,0.0003379775],"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.000006204778,0.000207326,0.00007093976,0.000002276871,0.000008969462,0.00000162958,0.0005875463,0.0004034052,0.0001206024,0.1911286,0.001577129,0.8058853],"study_design_scores_gemma":[0.003215323,0.004012392,0.001516441,0.00007118085,0.00001578291,0.0001864253,0.0003742663,0.9054545,0.003426313,0.04960967,0.03115042,0.0009672517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005186142,0.000001977914,0.9915033,0.0005530036,0.0001417134,0.0004238382,0.00001831808,0.0002090397,0.001962693],"genre_scores_gemma":[0.5220642,4.563112e-7,0.476983,0.0003266616,0.0002046542,0.0002573909,0.00004939823,0.00001633086,0.00009786362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9050511,"threshold_uncertainty_score":0.3896725,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008934242,0.0002877047,0.0002950614,0.0001835505,0.00008977031,0.0001557313,0.0002523125,0.00006782955,0.00001819864],"category_scores_gemma":[0.0003150635,0.0002607548,0.00004678478,0.0004312084,0.0001844324,0.0001283388,0.000067327,0.0002629911,0.00003616283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001931077,"about_ca_system_score_gemma":0.0002215112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002789291,"about_ca_topic_score_gemma":0.00000187013,"domain_scores_codex":[0.9981287,0.00006945366,0.000393779,0.000398337,0.0004440153,0.0005657551],"domain_scores_gemma":[0.9987638,0.00007965096,0.00006072765,0.0003318275,0.0002501607,0.0005138144],"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.00003126297,0.0002095009,0.0009164321,0.000102636,0.0001762966,0.00004566624,0.003488722,0.4211287,0.000569575,0.002929607,0.0009593628,0.5694422],"study_design_scores_gemma":[0.01646148,0.001724563,0.001009452,0.003867545,0.0005318577,0.004890864,0.01670132,0.8715587,0.01750877,0.003133849,0.05582481,0.006786759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02481808,0.00004753101,0.9393479,0.00008283277,0.000110654,0.001328639,0.00001272997,0.000810132,0.03344145],"genre_scores_gemma":[0.4981526,8.448012e-7,0.5015552,0.00004117919,0.00003353216,0.0001480677,0.000008614995,0.00004042156,0.00001955326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5626554,"threshold_uncertainty_score":0.9999844,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001834681,0.0001049878,0.000164362,0.0000897768,0.00008576577,0.00002329461,0.00008133173,0.00004060216,0.0001767134],"category_scores_gemma":[0.00001014408,0.0001313189,0.00002676592,0.00007011637,0.0001720551,0.00006708739,0.00007213184,0.0001266428,1.221458e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007403781,"about_ca_system_score_gemma":0.00002590939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002704575,"about_ca_topic_score_gemma":7.451268e-7,"domain_scores_codex":[0.9993702,0.00001310301,0.0002458794,0.0001309695,0.00006908892,0.0001707235],"domain_scores_gemma":[0.9997545,0.00003378976,0.00004279008,0.0001035911,0.00001345818,0.00005180273],"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.000009266014,0.00002822375,0.01030022,0.0001401389,0.00008883122,0.00003335012,0.0009214618,0.9217125,0.003194168,0.0008130423,0.00006958569,0.0626892],"study_design_scores_gemma":[0.0004284864,0.00009054711,0.0009323556,0.0001098525,0.00004891623,0.0004467765,0.002908141,0.9932825,0.0008522067,0.0001828688,0.000321881,0.0003954477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8448784,0.0001932763,0.1536311,0.0000106796,0.0001563996,0.0001638129,0.00002470745,0.0001576538,0.0007839351],"genre_scores_gemma":[0.9435108,0.00001254567,0.05638404,0.00001219287,0.00002173672,0.00001324263,0.00002125066,0.00002121851,0.000002979947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0986324,"threshold_uncertainty_score":0.535503,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171273,0.0001342827,0.0001416512,0.0001954104,0.000142901,0.0001437155,0.00235567,0.00008713615,0.0000183261],"category_scores_gemma":[0.0002416806,0.0001385206,0.00004076391,0.0005387778,0.0002329742,0.0006256591,0.0003453909,0.00009066887,0.0002495404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004207915,"about_ca_system_score_gemma":0.000252215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001750321,"about_ca_topic_score_gemma":0.000001794078,"domain_scores_codex":[0.9985288,0.00003666573,0.0002678274,0.0006590469,0.0002062305,0.0003013686],"domain_scores_gemma":[0.9973133,0.0002679709,0.0001290055,0.002104192,0.0001068855,0.00007864819],"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.00002604817,0.000172896,0.001108794,0.00007816513,0.00003455864,0.00002005405,0.0001921504,0.00007826277,0.08357356,0.06579575,0.2510221,0.5978977],"study_design_scores_gemma":[0.0004740576,0.00006451203,0.02644898,0.00003478625,0.000007285498,0.000004194183,0.0000632122,0.9468794,0.006969035,0.0008680752,0.01794692,0.0002394981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002089283,0.000006467184,0.9916302,0.003022293,0.0002404025,0.0004999892,0.0005572353,0.001157463,0.000796655],"genre_scores_gemma":[0.7230383,0.000006680978,0.2739247,0.0002666005,0.00005730419,0.0001708317,0.002357627,0.00001490176,0.0001630369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9468012,"threshold_uncertainty_score":0.5648708,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003524495,0.0002048834,0.000175858,0.0002747068,0.0002664409,0.0006753871,0.0001335877,0.00009559361,0.0001462485],"category_scores_gemma":[0.0001873048,0.0002106767,0.00006766489,0.0005708089,0.0003309993,0.0004402512,0.0001039062,0.0003767916,0.00004114143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000776888,"about_ca_system_score_gemma":0.0002615194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001245003,"about_ca_topic_score_gemma":0.00001656604,"domain_scores_codex":[0.9984928,0.0001038508,0.0002968942,0.0005479497,0.0002145696,0.000343914],"domain_scores_gemma":[0.9993849,0.0001894911,0.00006957162,0.0001247704,0.00007826272,0.0001529803],"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.000001996735,0.00001173047,0.00126258,0.00004981092,0.00003749821,0.00006777525,0.0006706637,0.0006676386,0.002133264,0.0421678,0.00005645417,0.9528728],"study_design_scores_gemma":[0.0004742204,0.0001528675,0.002219914,0.000288962,0.00004286103,0.001535991,0.0003415831,0.97936,0.0003741762,0.001753261,0.01292516,0.0005310091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0146664,0.0004295225,0.9792382,0.0004842143,0.0005325223,0.0002530348,0.000002018879,0.0008859407,0.003508128],"genre_scores_gemma":[0.9170159,0.0000497589,0.08254764,0.00009158952,0.00007392181,0.00002156692,0.000006167615,0.00001671256,0.000176707],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9786924,"threshold_uncertainty_score":0.8591148,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002230899,0.0001584658,0.0002120088,0.0001726629,0.00008704008,0.000112992,0.0003804312,0.00008466564,0.00268695],"category_scores_gemma":[0.00009987126,0.0001550876,0.00008088694,0.0003613418,0.0006200568,0.0005777942,0.00005303604,0.0001101939,0.0003012465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004051045,"about_ca_system_score_gemma":0.0002986763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001486939,"about_ca_topic_score_gemma":0.000004125699,"domain_scores_codex":[0.9986414,0.00008392773,0.0004340973,0.0003214915,0.0002620375,0.0002570912],"domain_scores_gemma":[0.9987929,0.000119297,0.0002174573,0.0004024926,0.0003340013,0.0001338104],"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.000003071744,0.0001123926,0.005308622,0.00005187748,0.00002667392,0.000004462165,0.0001672475,0.0008118472,0.01050173,0.06663942,0.0008153094,0.9155573],"study_design_scores_gemma":[0.005041895,0.0003647874,0.08780918,0.0004386121,0.0000453102,0.0002042258,0.0003795949,0.7929216,0.09611066,0.01309763,0.002073436,0.00151308],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01637473,0.00002013837,0.9639643,0.0009276711,0.0003160708,0.0005648531,0.00000741796,0.0001915207,0.01763327],"genre_scores_gemma":[0.9073935,0.000003886761,0.09216635,0.000316612,0.00001504278,0.00003301982,0.0000108299,0.00000749459,0.00005324659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9140443,"threshold_uncertainty_score":0.9982247,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005070493,0.0001648075,0.0001528407,0.00005126697,0.0002558964,0.0002783721,0.001106336,0.00003699548,0.0001737134],"category_scores_gemma":[0.00006165702,0.00007975278,0.00005356769,0.0001902197,0.0009453857,0.0005043526,0.0001966032,0.00005774721,0.00007447895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002651942,"about_ca_system_score_gemma":0.0001768456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007142566,"about_ca_topic_score_gemma":0.00001035009,"domain_scores_codex":[0.9987509,0.00002885423,0.0001979612,0.0004149356,0.0002150953,0.000392292],"domain_scores_gemma":[0.9984195,0.000493224,0.00009347409,0.0007867177,0.0001177899,0.00008927445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005609952,0.00002313554,0.0001071568,0.000008270927,0.00007170172,0.000008863103,0.00009663569,6.149639e-7,0.0002376738,0.6817101,0.002773257,0.314957],"study_design_scores_gemma":[0.0102342,0.0009391521,0.001934948,0.000665019,0.0002281702,0.0004571444,0.001538137,0.007299779,0.002356908,0.1972211,0.7752082,0.001917228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002302779,0.00004613151,0.9656271,0.004382416,0.0004273459,0.000475702,0.00008438432,0.0001393458,0.02858725],"genre_scores_gemma":[0.7207054,0.00002713724,0.274279,0.001325716,0.000188787,0.0001613725,0.00001142901,0.00002307321,0.003278055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.772435,"threshold_uncertainty_score":0.3483313,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002076696,0.0001157029,0.0001172295,0.0001669429,0.00008235699,0.00005226844,0.00006287747,0.0000543251,0.00002559647],"category_scores_gemma":[0.00003180285,0.0001273803,0.00002462237,0.0008187222,0.00008985036,0.00006722492,0.000008523371,0.0001289467,0.00005605848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000243601,"about_ca_system_score_gemma":0.00002795901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003612043,"about_ca_topic_score_gemma":0.0000184463,"domain_scores_codex":[0.9991743,0.000008448998,0.0002323482,0.0001828159,0.00009417631,0.0003079001],"domain_scores_gemma":[0.9997063,0.00004025918,0.00001670042,0.000107112,0.0000260473,0.0001035769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000002956509,0.00004159626,0.01253072,0.000198747,0.00009383622,0.00001377588,0.003932466,0.02599864,0.03955151,0.0351837,0.0002472337,0.8822048],"study_design_scores_gemma":[0.003216446,0.0002737927,0.6175998,0.0004858957,0.0001433598,0.0001296509,0.009820149,0.3293091,0.01911747,0.002785861,0.01462648,0.002491981],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.963745,0.00004054159,0.02955095,0.0007291043,0.000128644,0.0007973432,0.0000167525,0.001611721,0.003379924],"genre_scores_gemma":[0.9975973,0.000005473875,0.002137727,0.00005595804,0.00002246758,0.0001003319,0.00002430104,0.00001982546,0.00003664817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8797128,"threshold_uncertainty_score":0.5194419,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000823746,0.0004785923,0.0004201182,0.0002060229,0.0002259873,0.0002281819,0.0006876236,0.0006611773,0.02129145],"category_scores_gemma":[0.001315187,0.0005351107,0.0002250144,0.0003463618,0.004034174,0.0002227913,0.0001860091,0.001853136,0.359229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008946444,"about_ca_system_score_gemma":0.0009419593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001849794,"about_ca_topic_score_gemma":0.00006017441,"domain_scores_codex":[0.9969623,0.0001143858,0.0005172591,0.0007256691,0.0006484041,0.001031985],"domain_scores_gemma":[0.9973725,0.0002521024,0.0002614491,0.001129133,0.0003072679,0.0006775208],"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.00004329562,0.0003162848,0.001496571,0.00004731978,0.0001948725,0.000228076,0.0006621347,0.00000196882,0.2203219,0.00523475,0.706181,0.06527182],"study_design_scores_gemma":[0.001420228,0.00005091498,0.002947598,0.00008860451,0.0002258052,0.00006546276,0.00008113495,0.0005030442,0.006148361,0.0006922442,0.9870391,0.0007375153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"empirical","genre_scores_codex":[0.1017896,0.001058122,0.001195196,0.001940693,0.7305554,0.001530683,0.004445545,0.001214886,0.1562699],"genre_scores_gemma":[0.9084218,0.00001498655,0.002910291,0.0002467163,0.08712538,0.0000133892,0.00007762744,0.0001941221,0.0009956666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8066322,"threshold_uncertainty_score":0.99971,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003989697,0.0001214566,0.0001723796,0.0002344066,0.0001741448,0.0003239149,0.0003452086,0.00004617065,0.0009875756],"category_scores_gemma":[0.00638422,0.00008177079,0.00003841328,0.0004139541,0.0006619574,0.0002805941,0.0001303827,0.0001176627,0.0002282095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003713255,"about_ca_system_score_gemma":0.00005284785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002520964,"about_ca_topic_score_gemma":0.0001016868,"domain_scores_codex":[0.9978744,0.0002463834,0.0005446966,0.0004209444,0.0007022698,0.0002112508],"domain_scores_gemma":[0.9980084,0.0008766835,0.0002358232,0.0005112981,0.0003133786,0.0000543632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003761791,0.0001282151,0.0002675534,0.000003617413,0.00001335386,0.000005741263,0.000282592,0.0002046836,0.0005928768,0.1270787,0.1946041,0.6767809],"study_design_scores_gemma":[0.0001202975,0.0001049205,0.001678483,0.00001330802,0.00001423863,0.00003481128,0.001935348,0.00005838479,0.001873916,0.001272509,0.9927976,0.00009621549],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04651025,0.00008429033,0.05726973,0.2095021,0.002198058,0.004387223,0.00007073004,0.0003077129,0.6796699],"genre_scores_gemma":[0.9257178,0.00001163953,0.05934221,0.0007250335,0.00850907,0.00006647199,0.000007349555,0.00001562587,0.00560485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8792075,"threshold_uncertainty_score":0.9999257,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002410129,0.0003065737,0.0002724967,0.0002208988,0.0001633059,0.0001986373,0.0001142818,0.000145723,0.00001952759],"category_scores_gemma":[0.00001664037,0.0002959556,0.00004637816,0.0002619495,0.0003245074,0.0001647182,0.00003448817,0.0002596159,0.000003593937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000202978,"about_ca_system_score_gemma":0.0001105904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004225148,"about_ca_topic_score_gemma":0.00007205876,"domain_scores_codex":[0.9985471,0.00003652135,0.0003529961,0.0003837789,0.0001953247,0.0004842701],"domain_scores_gemma":[0.9994434,0.00007312751,0.00007900233,0.0002048339,0.00009379713,0.0001059004],"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.00008581984,0.000254317,0.03287663,0.002151847,0.0005531479,0.0001595244,0.001489031,0.305768,0.01320419,0.006038564,0.00004906921,0.6373698],"study_design_scores_gemma":[0.008459039,0.0004964894,0.01398645,0.004271533,0.0003708546,0.0003829057,0.005704729,0.957921,0.003077458,0.001775675,0.001317927,0.002235888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09958258,0.000180014,0.8955165,0.000214965,0.0001686678,0.001137727,0.000007473688,0.0006739792,0.002518045],"genre_scores_gemma":[0.8546693,0.000005751052,0.1450399,0.00006254337,0.00001310939,0.000104118,0.00005409393,0.00003598952,0.00001518968],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7550867,"threshold_uncertainty_score":0.9999493,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002205049,0.0001268176,0.0001019476,0.0001154996,0.0002208018,0.0002741279,0.0001914954,0.00005533985,0.001280229],"category_scores_gemma":[0.00006129465,0.00009587172,0.0000285883,0.0002226339,0.0001572516,0.0004090338,0.00006195781,0.000139627,0.0007459131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005235295,"about_ca_system_score_gemma":0.00003962847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001568637,"about_ca_topic_score_gemma":0.000007468599,"domain_scores_codex":[0.9989863,0.00005020032,0.0002184151,0.0003551474,0.0001941822,0.000195734],"domain_scores_gemma":[0.9993155,0.00005882368,0.00006447617,0.0003275069,0.0001169678,0.0001167105],"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.000003690543,0.00001322552,0.00005814452,0.00000280222,0.000008448302,8.896557e-7,0.0007032607,0.03076207,0.0001062783,0.06956516,0.01097073,0.8878053],"study_design_scores_gemma":[0.0007084401,0.0001824494,0.006478159,0.0000421724,0.00001182688,0.0001556705,0.0006260903,0.8401665,0.0009158279,0.007185286,0.1429942,0.0005334484],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009325516,0.000004793655,0.9309878,0.04209158,0.001168567,0.000591793,0.000003041585,0.0001222749,0.01570469],"genre_scores_gemma":[0.9557531,0.00001307838,0.03694667,0.001621197,0.005174263,0.00003522616,0.000006265056,0.000009087869,0.0004411405],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9464276,"threshold_uncertainty_score":0.9996327,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001203499,0.00006309988,0.00006253988,0.0000359314,0.000042426,0.00001780476,0.00006727011,0.00002964101,0.1371973],"category_scores_gemma":[0.00003692246,0.00006456173,0.00002559943,0.0001336595,0.000304851,0.00009238991,0.000004383903,0.00007032496,0.1137979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325466,"about_ca_system_score_gemma":0.00002378444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000249311,"about_ca_topic_score_gemma":0.000001401553,"domain_scores_codex":[0.9994528,0.00002705963,0.00009306247,0.0001680836,0.0000977278,0.0001613197],"domain_scores_gemma":[0.9997107,0.000008344107,0.00001538636,0.0001872158,0.00002315257,0.00005515069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002127646,0.00004499607,0.0004163151,0.000002146979,0.00001523211,0.00001029784,0.000119033,0.00002308664,0.01529554,0.003154722,0.13964,0.8412574],"study_design_scores_gemma":[0.0006203033,0.00002716953,0.01199474,0.000007191881,0.00001591806,0.0002436409,0.00007619699,0.00009962401,0.006113882,0.001358229,0.9792215,0.0002216398],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6810729,0.00002335565,0.00004554485,0.0009542005,0.0002293323,0.0001009179,0.00002350784,0.0003144742,0.3172358],"genre_scores_gemma":[0.9928473,0.000002481641,0.0004214443,0.00007969911,0.000691583,0.00000416255,0.00001382827,0.00001902287,0.005920499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8410357,"threshold_uncertainty_score":0.8868921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}