{"meta":{"query_hash":"9cf1555b9aa1","filters":{"venue":"Constraints"},"cohort_total":31,"direct_labels_cover":0,"predictions_cover":31,"exported":31,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9cf1555b9aa1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Constraints"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05045296916200682,"score_gpt":0.2725449922231356,"score_spread":0.2220920230611288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1063455699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046338243,0.00025074702,0.9875848,0.00017691775,0.000053262327,0.0000744913,0.00013469387,0.00006539225,0.007025835],"genre_scores_gemma":[0.20812333,0.0009369044,0.7707762,0.00034879736,0.00017225234,0.0007516433,0.00044103872,0.00025907555,0.01819075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998735,0.0005898099,0.000047861267,0.00020307457,0.0003231358,0.00010108266],"domain_scores_gemma":[0.9974674,0.0020148095,0.00012395225,0.00009435637,0.00022177272,0.00007782653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022578838,0.0015386035,0.0016800979,0.001629709,0.0007956184,0.0026941807,0.0035042844,0.0027800023,0.010315926],"category_scores_gemma":[0.0040937443,0.0017366533,0.0018497964,0.0034030005,0.0011274215,0.0021386815,0.001617188,0.0021024484,0.00069213496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015118505,0.000038632166,0.000094565585,0.000075848526,0.000030839663,0.00006868234,0.000022801327,0.9673378,0.00030227297,0.021146256,0.0008134349,0.010053766],"study_design_scores_gemma":[0.0000084794865,0.000012439231,0.00002992723,0.000011452696,0.000008157583,0.000014445017,0.00001106059,0.9923028,0.000106254345,0.006459611,0.001029021,0.00000641363],"about_ca_topic_score_codex":0.013245713,"about_ca_topic_score_gemma":0.013309553,"teacher_disagreement_score":0.013245713,"about_ca_system_score_codex":0.0015021904,"about_ca_system_score_gemma":0.0018857698,"threshold_uncertainty_score":0.034510195},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030761650256139875,"score_gpt":0.23130395438764637,"score_spread":0.20054230413150648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517613281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17083561,0.00018533863,0.79828274,0.0006941015,0.00016490713,0.00036193398,0.00028812417,0.0016250608,0.027562236],"genre_scores_gemma":[0.69493127,0.00011878098,0.29545927,0.00011111907,0.000026056066,0.00028668193,0.00026213712,0.000095082156,0.008709542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.000050458133,0.000016300275,0.000076813,0.00008785263,0.000037685837],"domain_scores_gemma":[0.99967766,0.00009195594,0.00002158913,0.0000358529,0.00007517789,0.00009773445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033912313,0.00057691167,0.00082684244,0.0003180323,0.0012707048,0.000832449,0.0015346213,0.0011486423,0.0052945972],"category_scores_gemma":[0.0008198399,0.00043375927,0.00044474486,0.0004865802,0.00070173695,0.0005878872,0.0016569793,0.00067742367,0.0005485459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050744903,0.00022060065,0.0007734353,0.0001167107,0.00007578073,0.00089607196,0.00023189918,0.90188265,0.0141388,0.016615704,0.003737905,0.060802985],"study_design_scores_gemma":[0.00005938588,0.00009499715,0.00012704145,0.0000044159265,0.000012595169,0.000045052973,0.000036818852,0.99250644,0.0013232484,0.0038603717,0.0019190904,0.000010610404],"about_ca_topic_score_codex":0.014380186,"about_ca_topic_score_gemma":0.01043004,"teacher_disagreement_score":0.014380186,"about_ca_system_score_codex":0.0005313362,"about_ca_system_score_gemma":0.0013161597,"threshold_uncertainty_score":0.028592944},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1476368975762101,"score_gpt":0.3154502977111036,"score_spread":0.16781340013489351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562987626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004910159,0.006303927,0.9813874,0.0022267497,0.00010095584,0.00014054398,0.00010422849,0.00018883064,0.009056393],"genre_scores_gemma":[0.030325972,0.012736339,0.9516595,0.0005847343,0.0002359543,0.0005873832,0.00028578533,0.000109857945,0.0034745543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555486,0.0017139253,0.0005920951,0.00051582634,0.0014071146,0.00021625812],"domain_scores_gemma":[0.99523646,0.0027578026,0.00034770832,0.0005746453,0.0008384911,0.00024499357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051393015,0.001656989,0.0019058797,0.0027116127,0.0023635027,0.009499891,0.0061058616,0.00354682,0.0049178274],"category_scores_gemma":[0.0075440803,0.0018688295,0.0024127697,0.004258336,0.007115834,0.008676819,0.003695006,0.0053759147,0.0018131532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018407025,0.00007887993,0.00016634984,0.00075590966,0.000063532316,0.00011085084,0.00038476626,0.020055048,0.0005625294,0.9342941,0.0041483203,0.03936135],"study_design_scores_gemma":[0.000030685085,0.000026215128,0.00007811642,0.0004338804,0.000051451898,0.00018050044,0.00018528063,0.05786831,0.0011015735,0.84259653,0.09739847,0.000049046557],"about_ca_topic_score_codex":0.00882475,"about_ca_topic_score_gemma":0.009914643,"teacher_disagreement_score":0.009499891,"about_ca_system_score_codex":0.0037781317,"about_ca_system_score_gemma":0.0058889636,"threshold_uncertainty_score":0.027412355},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02590515421391894,"score_gpt":0.28041833025471025,"score_spread":0.2545131760407913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696171692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030941106,0.0024162864,0.98474926,0.0011871915,0.00034090635,0.00016621484,0.00010794085,0.00017591786,0.0077622007],"genre_scores_gemma":[0.08566689,0.0052674804,0.8947274,0.000832376,0.0018149427,0.00093379716,0.00038042464,0.00044196637,0.009934723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921745,0.004970928,0.0002956125,0.0005884238,0.0016686992,0.0003019986],"domain_scores_gemma":[0.9459118,0.049172558,0.00094367214,0.0012626778,0.0020812775,0.000627995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008430235,0.0031780517,0.003861267,0.006391045,0.0020833039,0.0042911917,0.0038167178,0.004328065,0.009839129],"category_scores_gemma":[0.051659934,0.0012792789,0.0022735244,0.017426694,0.0038087636,0.0059569334,0.0048243823,0.0059137708,0.001432907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027478518,0.0003771399,0.0016735608,0.0009006603,0.00022730969,0.0005761398,0.0003328632,0.31254888,0.00092121336,0.38875726,0.027579302,0.26583087],"study_design_scores_gemma":[0.00012581775,0.00010708208,0.0003516619,0.000116953364,0.00006049653,0.0002381182,0.00007743309,0.713942,0.0003732944,0.27633974,0.008219623,0.00004782485],"about_ca_topic_score_codex":0.004523471,"about_ca_topic_score_gemma":0.0055703633,"teacher_disagreement_score":0.009839129,"about_ca_system_score_codex":0.0017376869,"about_ca_system_score_gemma":0.0023385787,"threshold_uncertainty_score":0.044583857},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029087930865425562,"score_gpt":0.2622588816988172,"score_spread":0.23317095083339168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859892029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21151751,0.0006591404,0.76806194,0.0009667762,0.00007699509,0.000093223796,0.00006511869,0.00022543158,0.018333841],"genre_scores_gemma":[0.87460893,0.00022189908,0.116550684,0.00019637377,0.000044208024,0.000100206125,0.000075139156,0.00019637265,0.008006203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00017347395,0.000008463734,0.000045850175,0.00007806439,0.000056514426],"domain_scores_gemma":[0.9988638,0.0006047562,0.00012969165,0.0001422892,0.00013827028,0.00012126024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433184,0.000404067,0.00059448817,0.0004903472,0.0010645397,0.0010372299,0.0018053177,0.001175887,0.0037591816],"category_scores_gemma":[0.004699931,0.0002257284,0.0004599706,0.00077720085,0.0010082124,0.0017901497,0.0011711987,0.00084359996,0.00037658025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003400307,0.00018930975,0.0046428223,0.0001492176,0.00025876847,0.0007963852,0.0009969745,0.62571746,0.01237184,0.18125841,0.010205286,0.1630734],"study_design_scores_gemma":[0.000050134426,0.00018345128,0.00091884326,0.000020495869,0.00006996714,0.00029552932,0.0002884877,0.9516412,0.002915741,0.038071804,0.0055101505,0.000034227887],"about_ca_topic_score_codex":0.0021978144,"about_ca_topic_score_gemma":0.00403807,"teacher_disagreement_score":0.0037591816,"about_ca_system_score_codex":0.0005185026,"about_ca_system_score_gemma":0.00062559225,"threshold_uncertainty_score":0.012575686},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abstraction; Expressive power; Power (physics); Computer science; Programming language; Epistemology; Philosophy; Physics","score_opus":0.015790789642622698,"score_gpt":0.23206316584982903,"score_spread":0.21627237620720632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964542244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029057764,0.006988967,0.79591256,0.0182049,0.00061960984,0.00008115686,0.00042993185,0.00059891475,0.14810623],"genre_scores_gemma":[0.80911714,0.0033050214,0.15953101,0.0033210304,0.0013266297,0.00035446935,0.00057598256,0.00037033283,0.022098348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945697,0.0020213933,0.0004375701,0.00095858815,0.0015766871,0.0004360018],"domain_scores_gemma":[0.9891214,0.0059220116,0.00041753412,0.0033660794,0.0008339596,0.00033896597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058149872,0.000832549,0.0012413971,0.0019326067,0.0021980926,0.008868664,0.0023922224,0.00240849,0.0068986285],"category_scores_gemma":[0.016986018,0.0009929333,0.0015724307,0.0017387749,0.018887006,0.02559199,0.006801116,0.007373695,0.0009669974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066601333,0.0000044159337,0.00004666703,0.000024244804,0.000005306803,0.00001300077,0.00020515548,0.00028882571,0.00009442332,0.9964051,0.00040945684,0.002496774],"study_design_scores_gemma":[0.0000055008513,0.0000022328486,0.000023030492,0.000010779433,0.0000053496274,0.00002174285,0.000040178842,0.00061446405,0.00009468264,0.99520457,0.003973984,0.0000035069731],"about_ca_topic_score_codex":0.0022330275,"about_ca_topic_score_gemma":0.0014352669,"teacher_disagreement_score":0.008868664,"about_ca_system_score_codex":0.002248124,"about_ca_system_score_gemma":0.0014112407,"threshold_uncertainty_score":0.030752957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044537481272602576,"score_gpt":0.2950699864660795,"score_spread":0.2505325051934769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972237262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051187747,0.00015786993,0.9818133,0.00024343435,0.00012399025,0.000040167266,0.000101053905,0.00016167475,0.0122398315],"genre_scores_gemma":[0.22729295,0.0005940901,0.74522036,0.0004456277,0.00031687008,0.00027669905,0.00079181115,0.0007322833,0.024329321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891484,0.0003412597,0.000052363725,0.00018363795,0.0003817137,0.00012616006],"domain_scores_gemma":[0.99820995,0.000997557,0.0000953821,0.0002937244,0.00033409367,0.0000692139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014421977,0.0012554337,0.0008888296,0.0015271053,0.0009008757,0.002217495,0.0019419333,0.00075993594,0.00973809],"category_scores_gemma":[0.0068850066,0.00076109805,0.0017348547,0.0017443257,0.0015484623,0.003122719,0.0026274733,0.0056710136,0.0013537478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054059547,0.00010504001,0.00021381825,0.00016654943,0.000043065273,0.0001259985,0.000150752,0.114561446,0.0018878413,0.7965779,0.008062835,0.07805069],"study_design_scores_gemma":[0.000023518822,0.000023671744,0.00008350863,0.00005369309,0.000030743795,0.000058466398,0.00005258181,0.3819958,0.0023249765,0.602511,0.01281803,0.00002403251],"about_ca_topic_score_codex":0.0036239298,"about_ca_topic_score_gemma":0.0065627913,"teacher_disagreement_score":0.00973809,"about_ca_system_score_codex":0.0013824721,"about_ca_system_score_gemma":0.0015372225,"threshold_uncertainty_score":0.032577157},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.058242970918815626,"score_gpt":0.3666021104407021,"score_spread":0.3083591395218865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978238761","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010100089,0.14357118,0.3493753,0.055814043,0.2504989,0.00039226955,0.0028004453,0.0017803428,0.19475743],"genre_scores_gemma":[0.011798621,0.1777807,0.20816043,0.02454596,0.28240907,0.0006081765,0.004916536,0.0023323675,0.28744826],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982077,0.0003925375,0.00018555656,0.0003150757,0.00082380476,0.000075400625],"domain_scores_gemma":[0.99376386,0.0033132944,0.000303794,0.0006483367,0.0015368552,0.0004338928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290208,0.0015833209,0.0017982526,0.0035486592,0.0010549045,0.006462883,0.002033424,0.0029061849,0.08520473],"category_scores_gemma":[0.009057306,0.0009132709,0.001445974,0.005944199,0.0016341334,0.0065307887,0.0018218618,0.00720231,0.034921005],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012751741,0.000046389476,0.00007975237,0.00038211784,0.000017030632,0.000048292568,0.000047432357,0.00073940953,0.00027229165,0.045106854,0.824827,0.12842074],"study_design_scores_gemma":[0.000005169909,0.000018898536,0.00015959478,0.0002571585,0.00001089307,0.00015209075,0.000025661939,0.0009199386,0.00014259087,0.03967684,0.95861006,0.000020973766],"about_ca_topic_score_codex":0.0020239267,"about_ca_topic_score_gemma":0.0030375884,"teacher_disagreement_score":0.08520473,"about_ca_system_score_codex":0.0014078987,"about_ca_system_score_gemma":0.0024185611,"threshold_uncertainty_score":0.28503817},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Generalization; Mathematical optimization; Computer science; Heuristic; Graph; Mathematics; Theoretical computer science","score_opus":0.01036059648106432,"score_gpt":0.23661172094358165,"score_spread":0.22625112446251733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996357025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012792009,0.01764332,0.9354659,0.008157487,0.00074110826,0.000093257615,0.00025017746,0.00015956938,0.024697239],"genre_scores_gemma":[0.4336437,0.03403643,0.5084381,0.0022721414,0.004467433,0.00042878784,0.00042089514,0.000549843,0.015742747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959329,0.0023036303,0.00014282385,0.00044379086,0.0009802369,0.00019672546],"domain_scores_gemma":[0.9632595,0.033413764,0.0005960102,0.0011175724,0.0011300206,0.0004831248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281647,0.0011304467,0.0028409935,0.0025339515,0.0013396766,0.004477942,0.002310605,0.0030595849,0.009069896],"category_scores_gemma":[0.04600269,0.0011013907,0.0011634384,0.0056073745,0.0053130193,0.016381467,0.0024873447,0.006877571,0.0007847886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017680599,0.000044524175,0.00046353025,0.0003861367,0.000049091585,0.00008529688,0.00011775022,0.06866558,0.00017221556,0.8466524,0.008923897,0.074262775],"study_design_scores_gemma":[0.00002993149,0.00001977445,0.000091651076,0.00006258381,0.00001765798,0.000040246578,0.000030952528,0.20606998,0.0000973238,0.78938067,0.0041448656,0.000014359162],"about_ca_topic_score_codex":0.0089204,"about_ca_topic_score_gemma":0.006272345,"teacher_disagreement_score":0.009069896,"about_ca_system_score_codex":0.0022625485,"about_ca_system_score_gemma":0.0025853761,"threshold_uncertainty_score":0.030341804},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017217442439509133,"score_gpt":0.2827290062673527,"score_spread":0.2655115638278436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005924051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003021688,0.00019597434,0.9927511,0.00017283346,0.000060687726,0.00009533944,0.00017488012,0.0010270927,0.002500277],"genre_scores_gemma":[0.067185916,0.00022065725,0.9277301,0.00015445739,0.00008964194,0.0002486471,0.000838777,0.0006533,0.002878557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959837,0.000942833,0.0002395382,0.0008532901,0.0016140196,0.00036663588],"domain_scores_gemma":[0.9925565,0.0038266657,0.00038066972,0.0017798169,0.0012747197,0.00018172734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030972282,0.0015382767,0.0022069488,0.0024421134,0.001448332,0.0040370747,0.0040238216,0.0021198874,0.010316404],"category_scores_gemma":[0.015306269,0.0012792678,0.0016474592,0.0040396024,0.0011951848,0.0060627065,0.004556483,0.00467304,0.0022503533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005105662,0.00028842784,0.00085097004,0.00034740125,0.00015269643,0.00014924702,0.00027965597,0.2005251,0.008608475,0.12336909,0.02447748,0.64044094],"study_design_scores_gemma":[0.00015229186,0.000058541482,0.00026515123,0.0000535785,0.000060125083,0.0001160349,0.00007825428,0.89255077,0.0078585,0.08881631,0.00995415,0.000036321442],"about_ca_topic_score_codex":0.0048660683,"about_ca_topic_score_gemma":0.005549349,"teacher_disagreement_score":0.010316404,"about_ca_system_score_codex":0.001638005,"about_ca_system_score_gemma":0.0034041815,"threshold_uncertainty_score":0.034511805},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20855653994690412,"score_gpt":0.3669972140349245,"score_spread":0.1584406740880204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035237530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01235004,0.00015846336,0.98364383,0.00011686316,0.000035745892,0.0001022259,0.000130155,0.0006464638,0.0028161737],"genre_scores_gemma":[0.27194858,0.00018238998,0.72217774,0.0002045205,0.00006245386,0.00033131643,0.00047984553,0.0002675654,0.0043455716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929714,0.00022877712,0.00002964335,0.00010358097,0.00026913686,0.00007172327],"domain_scores_gemma":[0.99871683,0.00071301276,0.000085832406,0.00014265261,0.00029322493,0.000048488055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089986983,0.0008008861,0.0013219089,0.0015172837,0.000527588,0.00096267427,0.001884982,0.0009974398,0.0069613196],"category_scores_gemma":[0.0019055497,0.00070758065,0.000982058,0.0019011444,0.00040870317,0.0009803299,0.0006993315,0.0008824369,0.00069945946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120531375,0.00015020414,0.0002280238,0.00014106026,0.00006411992,0.000080757425,0.000035223526,0.84589577,0.0038114074,0.008583693,0.0026153594,0.13827392],"study_design_scores_gemma":[0.000011819646,0.000018177643,0.000037876034,0.0000030338053,0.0000101014075,0.000010771839,0.0000034247512,0.9972187,0.00046150247,0.0018975559,0.00032267417,0.000004312417],"about_ca_topic_score_codex":0.006799911,"about_ca_topic_score_gemma":0.008158528,"teacher_disagreement_score":0.0069613196,"about_ca_system_score_codex":0.0007994153,"about_ca_system_score_gemma":0.0012747481,"threshold_uncertainty_score":0.023287892},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01036900503029169,"score_gpt":0.23317875355569895,"score_spread":0.22280974852540725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044003064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009071,0.00032782223,0.983844,0.00025171394,0.00014584974,0.00008041225,0.000381306,0.00020365314,0.0056943255],"genre_scores_gemma":[0.3447859,0.00087654183,0.63591325,0.00040929936,0.0003637387,0.00048870716,0.0011510305,0.0012805441,0.014731011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964688,0.0008692825,0.00020665098,0.000816351,0.0011011703,0.00053771725],"domain_scores_gemma":[0.9925579,0.004196134,0.00045559116,0.00086707226,0.0015876986,0.00033576944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057262676,0.0025183258,0.002506858,0.0016021843,0.0009482499,0.0029962114,0.0032891927,0.0015526805,0.009962279],"category_scores_gemma":[0.012964405,0.0010998017,0.0013177408,0.0035155271,0.0017711306,0.0061051724,0.0023009388,0.003957839,0.0011364813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002745272,0.00014157362,0.00072680373,0.00078697817,0.00011543492,0.00032988726,0.0001611592,0.770676,0.013982633,0.13807559,0.00947141,0.06525793],"study_design_scores_gemma":[0.000045573688,0.00019719111,0.00066587684,0.00011539256,0.00010435881,0.00026702633,0.000066074186,0.90318406,0.010230092,0.07493056,0.010139195,0.000054660217],"about_ca_topic_score_codex":0.0038276368,"about_ca_topic_score_gemma":0.0071700322,"teacher_disagreement_score":0.009962279,"about_ca_system_score_codex":0.0017503976,"about_ca_system_score_gemma":0.0029452944,"threshold_uncertainty_score":0.033327162},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.011620119285205061,"score_gpt":0.22887508763400452,"score_spread":0.21725496834879945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062540065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094287805,0.00025116818,0.9837298,0.0002506021,0.00008755164,0.0001571793,0.0004556326,0.00080050435,0.0048389267],"genre_scores_gemma":[0.23113412,0.00083281763,0.7588148,0.00029243503,0.00011173816,0.00022864644,0.002046228,0.0005920649,0.005947244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996819,0.00076120073,0.00013754643,0.00039648617,0.0016391368,0.0002465673],"domain_scores_gemma":[0.9914692,0.0049683424,0.00045991104,0.0014262627,0.0014530774,0.00022326101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027019083,0.0014000275,0.0010906237,0.0027832624,0.00083213375,0.0026700827,0.0028062381,0.0012792076,0.0082581565],"category_scores_gemma":[0.014647659,0.0012193931,0.0020701874,0.002963811,0.00096055056,0.0049251085,0.0036497805,0.0031570466,0.0010089552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032520015,0.0003648086,0.0021415225,0.0005773523,0.0002712694,0.0007999896,0.0006383331,0.32210788,0.013181341,0.21764268,0.019265765,0.42268392],"study_design_scores_gemma":[0.000033893408,0.000050131446,0.00035781966,0.000086880806,0.0000892522,0.0001527185,0.00011472512,0.86537653,0.007842948,0.11798761,0.007869245,0.00003827697],"about_ca_topic_score_codex":0.007670272,"about_ca_topic_score_gemma":0.013782558,"teacher_disagreement_score":0.0082581565,"about_ca_system_score_codex":0.0011076243,"about_ca_system_score_gemma":0.0017585894,"threshold_uncertainty_score":0.027626336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011346852216264703,"score_gpt":0.23404778957776173,"score_spread":0.22270093736149704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072384654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008305703,0.000099248056,0.98443514,0.000104622595,0.00003510814,0.00010704299,0.00027887494,0.0028516813,0.0037826032],"genre_scores_gemma":[0.19802108,0.00020666386,0.7943969,0.00014812834,0.000026208018,0.0003078224,0.0007180511,0.00039522914,0.0057799052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992854,0.00008045978,0.00003397511,0.00021183514,0.00034375992,0.00004455054],"domain_scores_gemma":[0.9994716,0.0001130882,0.000048557384,0.00011354066,0.00018679138,0.00006636437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038876684,0.00079515536,0.0009940042,0.00050243584,0.00086556486,0.0013677861,0.0021003545,0.001101789,0.0078102336],"category_scores_gemma":[0.0011428784,0.0007160952,0.0006077627,0.0008015419,0.000618218,0.0010832513,0.001831503,0.000822415,0.0018710982],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006926353,0.00020075445,0.001236178,0.00044422672,0.0001681489,0.0007627352,0.00035204503,0.35067368,0.21415599,0.03447261,0.017718887,0.3791221],"study_design_scores_gemma":[0.00007668801,0.00009696529,0.0005168087,0.000013291321,0.000034459583,0.0001936636,0.000031483232,0.9537491,0.025720445,0.0042771627,0.015233963,0.000055887886],"about_ca_topic_score_codex":0.012178359,"about_ca_topic_score_gemma":0.015547756,"teacher_disagreement_score":0.012178359,"about_ca_system_score_codex":0.00077023846,"about_ca_system_score_gemma":0.0018017757,"threshold_uncertainty_score":0.026127815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028373339513326462,"score_gpt":0.25406665282411695,"score_spread":0.22569331331079048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082779900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035494033,0.00020532569,0.9940462,0.000065933295,0.000065217806,0.000025987982,0.00012073098,0.00022379543,0.0016973709],"genre_scores_gemma":[0.1708998,0.00085139216,0.8124434,0.00029205656,0.0002257874,0.00018044964,0.0016816091,0.00051040604,0.012915162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824333,0.0003625315,0.00010469542,0.00033465622,0.0007842915,0.00017039038],"domain_scores_gemma":[0.996935,0.001737925,0.00015488628,0.00046698554,0.0006406085,0.000064710635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015708983,0.0016065263,0.0018613907,0.0019345897,0.00071111444,0.0021068477,0.0019808693,0.0014785695,0.011088765],"category_scores_gemma":[0.0069902153,0.0009042085,0.001558447,0.002774412,0.0005760251,0.003037594,0.0012231639,0.002080337,0.0014507752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000293977,0.00016053293,0.00061314023,0.00045998217,0.0001727783,0.0002494917,0.00011521893,0.4493287,0.017896656,0.109303005,0.013555674,0.4078509],"study_design_scores_gemma":[0.000015982694,0.000024712117,0.00012847496,0.00002038329,0.00002706674,0.000048947684,0.000011115788,0.9687421,0.0027725175,0.024681155,0.0035123439,0.000015222459],"about_ca_topic_score_codex":0.01051463,"about_ca_topic_score_gemma":0.014020465,"teacher_disagreement_score":0.011088765,"about_ca_system_score_codex":0.0011920462,"about_ca_system_score_gemma":0.0012583464,"threshold_uncertainty_score":0.037095606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Computer science; Management science; Engineering; Mechanical engineering","score_opus":0.013945866611072541,"score_gpt":0.2255223947929468,"score_spread":0.21157652818187428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083081391","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007341331,0.107553616,0.55900085,0.03332666,0.19044591,0.00031063048,0.002014736,0.0017481073,0.1048653],"genre_scores_gemma":[0.014600352,0.13151424,0.26829532,0.020916123,0.38774,0.0008113275,0.0059087034,0.004347524,0.16586643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617094,0.0010452358,0.00042746883,0.0008575658,0.0013312281,0.0001675054],"domain_scores_gemma":[0.99135065,0.0053089536,0.00029727595,0.0011242608,0.0016163362,0.0003026092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041417927,0.0025629897,0.0030131154,0.0041353935,0.0015219258,0.0064709135,0.003369875,0.00335204,0.06125475],"category_scores_gemma":[0.01368895,0.0014289716,0.0036010838,0.00694014,0.0030531918,0.009871574,0.0031628578,0.010243515,0.027394611],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029638939,0.0000685428,0.00010218108,0.0009110285,0.000059138045,0.00013432321,0.00011044849,0.0017491346,0.00059391564,0.13270262,0.7292992,0.13423984],"study_design_scores_gemma":[0.000008290606,0.000020427467,0.00014378283,0.00032545382,0.000024321504,0.0002716363,0.000032114825,0.0025791693,0.00028863625,0.09982131,0.89644694,0.000037886333],"about_ca_topic_score_codex":0.0017852103,"about_ca_topic_score_gemma":0.0022449787,"teacher_disagreement_score":0.06125475,"about_ca_system_score_codex":0.002077132,"about_ca_system_score_gemma":0.0021005673,"threshold_uncertainty_score":0.20491755},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02494302236139297,"score_gpt":0.25400062977385135,"score_spread":0.22905760741245837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099452584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033098708,0.0005017402,0.98051363,0.00040143542,0.00005826872,0.00004677413,0.00036895144,0.00020518182,0.014594123],"genre_scores_gemma":[0.31046873,0.0024102093,0.6603965,0.00047562397,0.00026297904,0.00063686195,0.0025222392,0.00080474693,0.022022163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957794,0.0017994976,0.00019134309,0.0004843668,0.0014665768,0.00027871045],"domain_scores_gemma":[0.98706853,0.010597936,0.00056818925,0.00070460705,0.0008214419,0.00023930662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388477,0.001586941,0.0017005759,0.0031537123,0.0009300015,0.0040018894,0.00200966,0.0015214034,0.015642386],"category_scores_gemma":[0.023387685,0.0013691221,0.0015286192,0.0034428714,0.0017968084,0.0051804474,0.0027962148,0.0038487762,0.002023345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067508816,0.000053089643,0.00019129203,0.00024668043,0.000036661364,0.000059453207,0.00012248095,0.21985684,0.00045492355,0.7064212,0.007104359,0.06538555],"study_design_scores_gemma":[0.000012573418,0.000011663807,0.00005876904,0.00008526188,0.0000128107495,0.000016990367,0.000016640814,0.24042548,0.0004391472,0.75182253,0.007087941,0.000010127238],"about_ca_topic_score_codex":0.0037936196,"about_ca_topic_score_gemma":0.0046205046,"teacher_disagreement_score":0.015642386,"about_ca_system_score_codex":0.002774238,"about_ca_system_score_gemma":0.0015446453,"threshold_uncertainty_score":0.052328944},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12199776890677005,"score_gpt":0.3955546711748169,"score_spread":0.27355690226804685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111805524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024650285,0.0002504,0.9932186,0.00053201977,0.00005172354,0.000077789125,0.00024258977,0.00042057797,0.0027412956],"genre_scores_gemma":[0.14145856,0.0012711119,0.8491073,0.00050134823,0.00021653739,0.00089276663,0.0011063261,0.00039349674,0.0050525335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967932,0.0014861949,0.0003652737,0.0003046895,0.0007180312,0.0003325655],"domain_scores_gemma":[0.9943335,0.003795256,0.00064989174,0.00055476045,0.0005332629,0.00013324495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004118864,0.001401204,0.0009867549,0.0011328597,0.00090163486,0.004307068,0.0030068804,0.0013523562,0.0049364367],"category_scores_gemma":[0.008660791,0.0011074144,0.0025981995,0.0015456444,0.0021592868,0.0048374557,0.0018567718,0.004676519,0.0012276378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044101584,0.000084654974,0.00013884415,0.00018065773,0.000028978407,0.00008923935,0.0003408337,0.09137534,0.00097449595,0.88743734,0.00207151,0.017233986],"study_design_scores_gemma":[0.00006554051,0.000025077674,0.00003786912,0.00011726076,0.000038743838,0.00005403986,0.00013670775,0.28913116,0.0012397248,0.6913625,0.017763497,0.000027913911],"about_ca_topic_score_codex":0.004854583,"about_ca_topic_score_gemma":0.0063897646,"teacher_disagreement_score":0.0049364367,"about_ca_system_score_codex":0.0021794245,"about_ca_system_score_gemma":0.0035928425,"threshold_uncertainty_score":0.021782875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022042688135491338,"score_gpt":0.26948883090847336,"score_spread":0.24744614277298202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137578750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001741939,0.00020662327,0.99644357,0.00007241299,0.000071535505,0.00005114909,0.00007653779,0.00038959613,0.0009466383],"genre_scores_gemma":[0.018841859,0.00024838446,0.9773221,0.00011489273,0.00010877722,0.000109047476,0.0004974618,0.00020767614,0.0025497202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995706,0.00085138844,0.00037614332,0.0010122037,0.0017712616,0.0002830592],"domain_scores_gemma":[0.99098796,0.005636087,0.0004448603,0.0011470286,0.0015744601,0.00020954537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004715466,0.0025011555,0.0027430567,0.0051519996,0.0016763901,0.0036428114,0.003456142,0.002770407,0.009980511],"category_scores_gemma":[0.015049102,0.00195481,0.0030179783,0.0057746535,0.0010993095,0.0065872124,0.0023320995,0.0033215405,0.0020384728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022922314,0.00028963495,0.0010918811,0.00035000156,0.00026907164,0.00014515624,0.00016016507,0.13118365,0.004989456,0.06605542,0.0168706,0.77836573],"study_design_scores_gemma":[0.000051352552,0.000045512978,0.0002542195,0.00005485203,0.00009886161,0.00014526534,0.000042229407,0.9451876,0.0028552415,0.043801207,0.00742674,0.000037027698],"about_ca_topic_score_codex":0.0071700495,"about_ca_topic_score_gemma":0.013621945,"teacher_disagreement_score":0.009980511,"about_ca_system_score_codex":0.0016267519,"about_ca_system_score_gemma":0.0019470499,"threshold_uncertainty_score":0.03338808},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015994956451348324,"score_gpt":0.257697762280475,"score_spread":0.24170280582912665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151266168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040109917,0.028681256,0.8691533,0.048914902,0.0021063657,0.00005562537,0.00080418075,0.0003948259,0.045878425],"genre_scores_gemma":[0.3673832,0.077631146,0.45996892,0.025668519,0.019728087,0.00065816246,0.0026779808,0.0016565607,0.0446274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952304,0.0017798388,0.0002453367,0.0007270986,0.0018059908,0.00021132732],"domain_scores_gemma":[0.9912621,0.0047140447,0.000417743,0.0022030657,0.0011413778,0.0002617172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006009879,0.0020333235,0.0028016383,0.0036206702,0.0015490862,0.008718511,0.0050283447,0.005002607,0.012606535],"category_scores_gemma":[0.020106126,0.00121909,0.0014394397,0.003679507,0.01088816,0.028683508,0.0035453865,0.010598843,0.0023722944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019611238,0.000018398965,0.00011673081,0.00016934467,0.00002381868,0.000034469118,0.0000953218,0.004316008,0.00020005829,0.97243047,0.00923128,0.013344497],"study_design_scores_gemma":[0.000012959963,0.0000114159875,0.0000839208,0.00005454241,0.000009843937,0.000059171645,0.000055990004,0.014947095,0.00010689004,0.9641216,0.020518832,0.000017714912],"about_ca_topic_score_codex":0.0034638317,"about_ca_topic_score_gemma":0.0027547693,"teacher_disagreement_score":0.012606535,"about_ca_system_score_codex":0.002287357,"about_ca_system_score_gemma":0.001656693,"threshold_uncertainty_score":0.042173028},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021146918477015452,"score_gpt":0.2322014977262077,"score_spread":0.21105457924919227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257535843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012546476,0.0007719257,0.97728467,0.0018702511,0.00020045998,0.0000858631,0.0004724334,0.0005370858,0.0062308605],"genre_scores_gemma":[0.38584977,0.0014005377,0.5908739,0.0020809046,0.0014296985,0.0006364134,0.002485177,0.0016022037,0.01364132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9834425,0.005449997,0.001101577,0.003923732,0.0045742122,0.0015081088],"domain_scores_gemma":[0.9119903,0.062454425,0.0031706577,0.013439795,0.0073922644,0.0015525782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013046848,0.0019531809,0.004053639,0.0027518927,0.0026018831,0.0065175607,0.008074513,0.0038154237,0.0103825405],"category_scores_gemma":[0.08957387,0.0022549715,0.0033035951,0.006548978,0.004635072,0.018077455,0.009396043,0.010680196,0.0016751305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007722436,0.00023486605,0.002040977,0.00059752865,0.00035352434,0.00024363094,0.0005931334,0.21513934,0.002134422,0.66460025,0.020442916,0.09284728],"study_design_scores_gemma":[0.00007136581,0.00004676955,0.00027695062,0.000077883975,0.000065669185,0.00009579737,0.000054906242,0.37965477,0.0014415251,0.6148165,0.0033545385,0.000043434786],"about_ca_topic_score_codex":0.004962429,"about_ca_topic_score_gemma":0.0037227906,"teacher_disagreement_score":0.013046848,"about_ca_system_score_codex":0.0030937511,"about_ca_system_score_gemma":0.005177681,"threshold_uncertainty_score":0.06899911},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04206220394095465,"score_gpt":0.28838711068591033,"score_spread":0.2463249067449557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990678853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010124983,0.00093658635,0.98543465,0.00062360597,0.000059464877,0.00014147475,0.00051686744,0.00032253057,0.0018398203],"genre_scores_gemma":[0.19459851,0.0013411718,0.7983378,0.00036760673,0.00017839936,0.0006147668,0.0024051,0.00027035273,0.0018862208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959186,0.001949827,0.00028500785,0.00080642966,0.00079450425,0.00024562253],"domain_scores_gemma":[0.96801233,0.029088499,0.00089857983,0.000632166,0.0010605373,0.00030794475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00444465,0.0014751422,0.003050035,0.0022672974,0.0009900843,0.003267269,0.002508789,0.0019642976,0.005699894],"category_scores_gemma":[0.026097376,0.0016057625,0.0018924258,0.004825234,0.0012942442,0.0042277016,0.0014648819,0.0039249333,0.000891819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001730332,0.00026928363,0.001418678,0.00061247917,0.00020315239,0.00017954125,0.00010698153,0.74600875,0.00062071974,0.053353086,0.010361005,0.18669334],"study_design_scores_gemma":[0.00002869451,0.000019559486,0.00007035323,0.000047067635,0.000021244703,0.000026871809,0.000021365373,0.94206995,0.00027744053,0.056389805,0.0010175309,0.000010228464],"about_ca_topic_score_codex":0.0066803284,"about_ca_topic_score_gemma":0.009106113,"teacher_disagreement_score":0.0066803284,"about_ca_system_score_codex":0.001554552,"about_ca_system_score_gemma":0.0030166914,"threshold_uncertainty_score":0.023505807},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022001028728399662,"score_gpt":0.26294755684758375,"score_spread":0.2409465281191841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000553024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005419442,0.00017183984,0.9915469,0.000102152044,0.000019654139,0.000033452623,0.000069931484,0.00024908115,0.0023875511],"genre_scores_gemma":[0.1029598,0.00024763966,0.8945732,0.00006225277,0.000023935165,0.00014405088,0.00016358962,0.00014460723,0.0016808794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881136,0.00062975765,0.00005490191,0.00011242784,0.00032333654,0.00006824473],"domain_scores_gemma":[0.99563074,0.0036952284,0.00013881206,0.00013185723,0.00033288452,0.0000704301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021402969,0.00069244957,0.0011709895,0.0015871957,0.00054810924,0.0012051304,0.0011113388,0.001323877,0.0064275363],"category_scores_gemma":[0.008893582,0.0006722647,0.00088746584,0.004029396,0.0004623199,0.0020898697,0.001185238,0.0017865747,0.0006224153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015980974,0.0002449583,0.00050676684,0.00015086106,0.000045220735,0.00011218612,0.000092088034,0.7651438,0.0012018988,0.0909402,0.0026048596,0.13879733],"study_design_scores_gemma":[0.000017376597,0.000020553769,0.000056348083,0.000009248508,0.000007820833,0.000015825857,0.0000073922124,0.9813834,0.0002696657,0.017282534,0.0009245524,0.000005314169],"about_ca_topic_score_codex":0.004577728,"about_ca_topic_score_gemma":0.006497223,"teacher_disagreement_score":0.0064275363,"about_ca_system_score_codex":0.0008368634,"about_ca_system_score_gemma":0.0014234722,"threshold_uncertainty_score":0.021502197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Medicine","score_opus":0.00933857758907345,"score_gpt":0.26769488214836007,"score_spread":0.2583563045592866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230472497","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035196217,0.0037445228,0.001545665,0.17760657,0.66262174,0.00018999288,0.002166928,0.0006501832,0.15112242],"genre_scores_gemma":[0.005416734,0.0041911798,0.0028385662,0.12537648,0.21919754,0.00025349375,0.0010536173,0.0010043347,0.6406681],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974234,0.00037506013,0.00032213063,0.00040242414,0.0011790704,0.0002980307],"domain_scores_gemma":[0.9883171,0.0037239776,0.0006043157,0.00096599123,0.0056495895,0.0007391778],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027307812,0.0019234876,0.0021553617,0.002718846,0.0030349798,0.0059801457,0.003435104,0.0075032804,0.28915796],"category_scores_gemma":[0.03307379,0.0010083632,0.0015970141,0.0027872755,0.0010850411,0.0028995231,0.0016312421,0.0090633165,0.1343518],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146595385,0.0000053003787,0.00001584536,0.00003766305,0.0000027486624,0.000049613584,0.00000776783,0.000017254997,0.000030096064,0.0006370814,0.99501663,0.0041653747],"study_design_scores_gemma":[0.000013154346,0.0000053693175,0.00009723649,0.0000786648,0.000008726315,0.00006764826,0.000021369067,0.00008294005,0.00013709968,0.0006116584,0.99886656,0.000009638153],"about_ca_topic_score_codex":0.007821719,"about_ca_topic_score_gemma":0.01645911,"teacher_disagreement_score":0.710842,"about_ca_system_score_codex":0.0021917329,"about_ca_system_score_gemma":0.0039646532,"threshold_uncertainty_score":0.96732974},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.009929681234525355,"score_gpt":0.23442445637702058,"score_spread":0.22449477514249522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250584656","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002062056,0.0009381508,0.14072962,0.0038882582,0.0023015602,0.00034205758,0.015535218,0.009981708,0.8242214],"genre_scores_gemma":[0.050876435,0.0025913867,0.14750046,0.0028780694,0.0018611529,0.00069889514,0.038879495,0.011114777,0.7435992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983822,0.00028937368,0.00007975524,0.00047216727,0.0006005255,0.0001759494],"domain_scores_gemma":[0.9974899,0.0005939884,0.000120250246,0.00087089726,0.0007362836,0.00018869048],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011491418,0.0019478357,0.00090724573,0.0019353476,0.0017660855,0.0058925543,0.0032252131,0.0016427696,0.4914037],"category_scores_gemma":[0.0072992626,0.0008885052,0.0015534142,0.0022565995,0.0009947991,0.006317252,0.0029720117,0.0034476272,0.23065813],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014115727,0.0000802354,0.0003134624,0.00038076463,0.000021218213,0.00009898418,0.000153839,0.0015623629,0.0011913049,0.30405724,0.53142333,0.16057605],"study_design_scores_gemma":[0.000021057827,0.000012450747,0.00013302079,0.00012376619,0.000012648699,0.00011422391,0.00006569545,0.0022419053,0.0012255781,0.07444016,0.9215893,0.000020182131],"about_ca_topic_score_codex":0.0034910336,"about_ca_topic_score_gemma":0.0036983748,"teacher_disagreement_score":0.5085963,"about_ca_system_score_codex":0.0012861878,"about_ca_system_score_gemma":0.0020747513,"threshold_uncertainty_score":0.7254509},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021729185091301555,"score_gpt":0.24121363847145047,"score_spread":0.2194844533801489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293107948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14103477,0.0005079271,0.84065545,0.0030501417,0.0001664731,0.0002049768,0.0002844478,0.0024942416,0.011601658],"genre_scores_gemma":[0.80845624,0.00031151017,0.18475674,0.00096264767,0.000071262424,0.00024489744,0.0004851093,0.0005180589,0.004193615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987317,0.00047450283,0.000063827014,0.00039571628,0.0001998165,0.0001344708],"domain_scores_gemma":[0.9941613,0.0037954475,0.00024116831,0.0012135607,0.00043675496,0.00015181831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161669,0.00091491576,0.0010749553,0.000361873,0.00060811016,0.0016091242,0.002444411,0.0018859602,0.005455721],"category_scores_gemma":[0.018187597,0.00070504635,0.0007391069,0.00042943557,0.0019681146,0.0060571516,0.0024582187,0.005218004,0.0010165607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018099573,0.00022852201,0.001835355,0.00019588604,0.000058819078,0.00010399808,0.00017905058,0.80896306,0.003989261,0.057450205,0.0065583517,0.1202564],"study_design_scores_gemma":[0.000007418979,0.00003158063,0.00008318968,0.000011862823,0.000004331965,0.000011521893,0.000016535827,0.9715469,0.00086752913,0.026920814,0.00049396534,0.000004336752],"about_ca_topic_score_codex":0.003873352,"about_ca_topic_score_gemma":0.0048879003,"teacher_disagreement_score":0.005455721,"about_ca_system_score_codex":0.0014338859,"about_ca_system_score_gemma":0.0015892886,"threshold_uncertainty_score":0.01825124},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03815083992490736,"score_gpt":0.2579665200586732,"score_spread":0.21981568013376585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297312265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042920325,0.0016711716,0.932931,0.0013100543,0.00019854541,0.00011607833,0.0007015215,0.00011067633,0.02004062],"genre_scores_gemma":[0.77489614,0.0019410885,0.20217915,0.00024654646,0.00019459067,0.0004942542,0.0006784524,0.00026460463,0.019105151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.00073007244,0.00005843691,0.00017331977,0.00026300686,0.00017640177],"domain_scores_gemma":[0.9953062,0.0038890194,0.00022640717,0.000089941386,0.00032605865,0.00016235633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027897565,0.0009696157,0.0013251909,0.00077760493,0.0006017129,0.0026356908,0.0017039898,0.0015649974,0.005887071],"category_scores_gemma":[0.007154133,0.0010011242,0.0010755843,0.0021116433,0.0009901098,0.002491957,0.0013968805,0.0020543535,0.0003569092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033332864,0.000017671018,0.00015201175,0.00004369996,0.000025920524,0.000034910026,0.000009963942,0.984487,0.00015599119,0.010045419,0.0005827295,0.00441132],"study_design_scores_gemma":[0.000004955202,0.000014693755,0.000097741264,0.000009554473,0.00000657356,0.000008299652,0.000012186524,0.9921234,0.00012119784,0.0071206414,0.00047505723,0.0000057306797],"about_ca_topic_score_codex":0.017721584,"about_ca_topic_score_gemma":0.017949231,"teacher_disagreement_score":0.017721584,"about_ca_system_score_codex":0.0023620597,"about_ca_system_score_gemma":0.0030359481,"threshold_uncertainty_score":0.035236895},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11473907008261876,"score_gpt":0.345109813977273,"score_spread":0.23037074389465423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383620205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042565085,0.0014299041,0.9430343,0.0021914684,0.00021908809,0.00022281047,0.0018280514,0.001710433,0.006798839],"genre_scores_gemma":[0.45718932,0.00084394193,0.5279792,0.0011206889,0.00042011068,0.0004646021,0.0058317026,0.0005645963,0.00558588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762374,0.00093633146,0.00017554313,0.00052518223,0.00048517925,0.00025393756],"domain_scores_gemma":[0.98465896,0.012761208,0.0005247786,0.001084397,0.00075735495,0.00021328569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024962362,0.0010608879,0.0020702346,0.0013842757,0.0008493606,0.0025473516,0.0027015836,0.0017803845,0.009841002],"category_scores_gemma":[0.018493194,0.0011320965,0.0017070246,0.0030344492,0.0012353013,0.005287846,0.0020495278,0.0035498193,0.0015311363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007306016,0.00051085465,0.0024481486,0.0006257961,0.00022405555,0.0001957869,0.00025174252,0.5307843,0.002650763,0.104187876,0.03209549,0.3252945],"study_design_scores_gemma":[0.000062473766,0.000037134272,0.00020737865,0.00003385308,0.000027232916,0.000038422517,0.000036052057,0.8876292,0.00050967315,0.11034514,0.0010646796,0.000008764268],"about_ca_topic_score_codex":0.0040420685,"about_ca_topic_score_gemma":0.009297829,"teacher_disagreement_score":0.009841002,"about_ca_system_score_codex":0.0016241705,"about_ca_system_score_gemma":0.0023460758,"threshold_uncertainty_score":0.032921433},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0801388474127351,"score_gpt":0.23323403081493707,"score_spread":0.15309518340220196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386913035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031224347,0.0042342837,0.9590286,0.0018598832,0.00026352378,0.00008519808,0.00038529385,0.00006170142,0.030959154],"genre_scores_gemma":[0.23505111,0.020857578,0.69057494,0.0014245287,0.0016454809,0.00075292727,0.0012544726,0.00029970036,0.04813926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982274,0.0008068067,0.00008200636,0.00025072848,0.00048034408,0.00015270188],"domain_scores_gemma":[0.9965752,0.002738123,0.00018179735,0.00010701788,0.0003071178,0.000090796486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021551289,0.001690329,0.0013004873,0.0015521122,0.00088582473,0.0029338594,0.003044199,0.0018150451,0.0096945865],"category_scores_gemma":[0.0068035997,0.0011385661,0.0014292682,0.0050023724,0.0018390914,0.0029144888,0.0012951801,0.0034128488,0.0007980779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024377245,0.00006069206,0.00014672017,0.00028734715,0.00007088641,0.00012523039,0.00009061392,0.38819683,0.00023477476,0.5722814,0.007834992,0.030646155],"study_design_scores_gemma":[0.000034958834,0.00001852223,0.00013350578,0.000098708995,0.00003310063,0.00006662152,0.000094585834,0.44210684,0.00020533509,0.5298969,0.027285188,0.000025734656],"about_ca_topic_score_codex":0.021010814,"about_ca_topic_score_gemma":0.019195603,"teacher_disagreement_score":0.021010814,"about_ca_system_score_codex":0.0025306623,"about_ca_system_score_gemma":0.0026581655,"threshold_uncertainty_score":0.041777015},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014978644787270816,"score_gpt":0.2519402801471005,"score_spread":0.2369616353598297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404651431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404931,0.00017044978,0.9541784,0.00035577727,0.000053127667,0.000119957396,0.000060642982,0.00074676384,0.0038217502],"genre_scores_gemma":[0.57522047,0.0001230743,0.42169678,0.0003322483,0.000044903514,0.00026596562,0.00016786875,0.00024752005,0.0019011677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878424,0.00052814663,0.00005596887,0.00025005525,0.00019043748,0.00019127656],"domain_scores_gemma":[0.9956845,0.0031576643,0.00029666987,0.0003089118,0.0003810723,0.00017121782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025261694,0.0011241013,0.0010392581,0.00063384086,0.00042126997,0.0012737177,0.0017053416,0.0017934119,0.004487143],"category_scores_gemma":[0.008701343,0.00058175996,0.0007322193,0.00072644633,0.0011769683,0.0013125183,0.0016260032,0.002236693,0.0005291687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745962,0.00012330618,0.00076204527,0.00009030898,0.000027873564,0.00006355315,0.000044348213,0.933463,0.0017259547,0.01502672,0.0014228973,0.047162507],"study_design_scores_gemma":[0.000009191674,0.000013677345,0.00002752648,0.000005793004,0.000002866449,0.0000049605037,0.0000039441456,0.99692374,0.00038052496,0.0024478566,0.00017786276,0.0000020304678],"about_ca_topic_score_codex":0.003813445,"about_ca_topic_score_gemma":0.004349635,"teacher_disagreement_score":0.004487143,"about_ca_system_score_codex":0.0012337093,"about_ca_system_score_gemma":0.0020079748,"threshold_uncertainty_score":0.015011013},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.007320887997034605,"score_gpt":0.22774557709147772,"score_spread":0.22042468909444313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116789795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059812698,0.00011136917,0.9885252,0.00014847404,0.000026323623,0.00004551078,0.00008929745,0.00017845485,0.004894053],"genre_scores_gemma":[0.2606463,0.00037959896,0.7320987,0.00022091929,0.00009074278,0.00028860802,0.0005040001,0.00032864965,0.0054424563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908173,0.0003062497,0.00003674056,0.0001698764,0.00027672213,0.00012882281],"domain_scores_gemma":[0.9984888,0.0011233351,0.00009842298,0.000083354316,0.0001591574,0.000046886624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001500327,0.0013147416,0.0014205322,0.0011508233,0.00062766764,0.0018091076,0.0015656659,0.0013289491,0.0070059607],"category_scores_gemma":[0.0044822823,0.0010338702,0.0014539936,0.0014137136,0.0010898416,0.0019337788,0.001582608,0.0023708337,0.00077893026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004489905,0.000061001527,0.00013832176,0.000104846986,0.000029932042,0.000027124719,0.000033828906,0.9294655,0.0009003005,0.03698976,0.0011356113,0.03106893],"study_design_scores_gemma":[0.000012012661,0.000015005219,0.000025901832,0.0000116046485,0.000005988271,0.0000056247413,0.000011175567,0.9763242,0.00043466024,0.022628844,0.0005203348,0.0000045235906],"about_ca_topic_score_codex":0.0042149033,"about_ca_topic_score_gemma":0.0062393043,"teacher_disagreement_score":0.0070059607,"about_ca_system_score_codex":0.0011130308,"about_ca_system_score_gemma":0.0018400756,"threshold_uncertainty_score":0.023437262},"labels":[],"label_agreement":null}]}