{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024818081,0.00004753101,0.9393479,0.00008283277,0.00011065398,0.0013286393,0.000012729968,0.00081013195,0.033441454],"genre_scores_gemma":[0.4981526,8.448012e-7,0.5015552,0.00004117919,0.000033532157,0.0001480677,0.000008614995,0.00004042156,0.00001955326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812865,0.00006945366,0.000393779,0.00039833703,0.00044401528,0.00056575506],"domain_scores_gemma":[0.9987638,0.00007965096,0.00006072765,0.00033182753,0.00025016072,0.0005138144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008934242,0.0002877047,0.0002950614,0.00018355045,0.00008977031,0.0001557313,0.00025231246,0.000067829555,0.000018198636],"category_scores_gemma":[0.00031506352,0.00026075475,0.00004678478,0.0004312084,0.0001844324,0.00012833877,0.000067327004,0.00026299115,0.00003616283],"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.00003126297,0.00020950094,0.00091643207,0.00010263599,0.00017629661,0.00004566624,0.0034887216,0.42112875,0.000569575,0.0029296067,0.00095936283,0.56944215],"study_design_scores_gemma":[0.016461484,0.0017245628,0.0010094516,0.0038675454,0.0005318577,0.004890864,0.016701316,0.8715587,0.017508768,0.0031338488,0.055824813,0.006786759],"about_ca_topic_score_codex":0.0000027892909,"about_ca_topic_score_gemma":0.0000018701297,"teacher_disagreement_score":0.56265545,"about_ca_system_score_codex":0.00019310771,"about_ca_system_score_gemma":0.0002215112,"threshold_uncertainty_score":0.99998444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021524688,0.00031270704,0.9174519,0.0029101442,0.00055955455,0.00022120377,0.000010186183,0.00064835325,0.07573346],"genre_scores_gemma":[0.9433739,0.0000023657758,0.054266296,0.0017213662,0.0000564358,0.000011415643,0.000004180918,0.00001225539,0.00055178587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983919,0.00009410036,0.0002770229,0.0004586736,0.00026566023,0.00051259133],"domain_scores_gemma":[0.9987826,0.0002836963,0.00010305035,0.0005475351,0.000072504525,0.0002106325],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031238573,0.00021202503,0.00022011493,0.00012901647,0.00021272751,0.00020160608,0.00072169094,0.000113395836,0.0012023855],"category_scores_gemma":[0.00011370112,0.00020800723,0.00010595079,0.0002973195,0.00041166687,0.00022795856,0.000072527,0.00027980361,0.0008527013],"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.000007818165,0.00042190283,0.013411555,0.000119616976,0.00012421387,0.00048733762,0.0023486677,0.007050677,0.001632885,0.08945975,0.07534932,0.8095863],"study_design_scores_gemma":[0.0016364952,0.00017904244,0.00080573733,0.000267509,0.000025954678,0.00025044184,0.00009861004,0.98319256,0.0012024542,0.0027889735,0.008687049,0.00086514023],"about_ca_topic_score_codex":0.000006932528,"about_ca_topic_score_gemma":0.0000014806851,"teacher_disagreement_score":0.9761419,"about_ca_system_score_codex":0.000043326254,"about_ca_system_score_gemma":0.000120485536,"threshold_uncertainty_score":0.99992526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056569586,0.00022596045,0.9158605,0.00002684829,0.00027740587,0.0005018538,0.000008767128,0.000103325954,0.07733841],"genre_scores_gemma":[0.8259267,0.0000064070814,0.17346065,0.00047791094,0.000017222214,0.000030561143,0.0000039741267,0.000009968703,0.00006658106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796474,0.0002886153,0.00037310983,0.0005087238,0.0003123678,0.0005524715],"domain_scores_gemma":[0.99855953,0.000091858245,0.00013554978,0.0006739355,0.0001511669,0.00038793575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585633,0.00023714846,0.00032975548,0.00013938647,0.00011710262,0.00009134257,0.00085276033,0.00009991667,0.00015679264],"category_scores_gemma":[0.00019724382,0.00021377108,0.00012962184,0.000423507,0.00030050325,0.00033406567,0.00009775264,0.000120514254,0.0000851223],"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.00001644037,0.0010304525,0.00085178606,0.00014476047,0.00006298232,0.00005064995,0.0024611184,0.0006740429,0.0010379002,0.84085923,0.00097069045,0.15183997],"study_design_scores_gemma":[0.03253066,0.008999288,0.039816726,0.0020732488,0.0005130437,0.0032977485,0.005259311,0.57704633,0.18717504,0.060367342,0.07162672,0.011294525],"about_ca_topic_score_codex":0.0000044930825,"about_ca_topic_score_gemma":0.0000013432573,"teacher_disagreement_score":0.82026976,"about_ca_system_score_codex":0.000052632153,"about_ca_system_score_gemma":0.00045738168,"threshold_uncertainty_score":0.8717332},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051861424,0.0000019779143,0.9915033,0.00055300357,0.00014171339,0.00042383815,0.000018318082,0.00020903967,0.0019626934],"genre_scores_gemma":[0.5220642,4.5631117e-7,0.47698304,0.00032666163,0.0002046542,0.00025739093,0.000049398233,0.000016330858,0.000097863616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.00003797565,0.00012807497,0.00045322702,0.00032700947,0.00022738327],"domain_scores_gemma":[0.9988493,0.000030680127,0.00003568376,0.00047937277,0.00026701132,0.0003379775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003532768,0.000108390646,0.000096839685,0.000087415574,0.00012584314,0.0001835551,0.00058196386,0.000042502266,0.000006002052],"category_scores_gemma":[0.000019524605,0.00009555757,0.000011359843,0.0005888445,0.0000858255,0.0002894969,0.0000755461,0.00012108688,0.0002317936],"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.000006204778,0.00020732603,0.000070939765,0.0000022768706,0.000008969462,0.0000016295795,0.0005875463,0.0004034052,0.00012060238,0.19112863,0.0015771289,0.8058853],"study_design_scores_gemma":[0.0032153227,0.0040123924,0.0015164412,0.00007118085,0.000015782905,0.00018642528,0.00037426627,0.9054545,0.0034263132,0.049609672,0.031150423,0.00096725166],"about_ca_topic_score_codex":0.00005317425,"about_ca_topic_score_gemma":0.000007846762,"teacher_disagreement_score":0.9050511,"about_ca_system_score_codex":0.00006474156,"about_ca_system_score_gemma":0.00022591335,"threshold_uncertainty_score":0.38967246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008937826,0.00020626311,0.9767794,0.0034613658,0.00014183104,0.00035954855,0.000001332136,0.000040892635,0.010071558],"genre_scores_gemma":[0.98187274,0.00060745666,0.016326824,0.00017933686,0.00008333154,0.000043123182,0.0000038890807,0.000007228738,0.0008760446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847937,0.0002694756,0.0002634811,0.00044922772,0.00031810274,0.00022032323],"domain_scores_gemma":[0.9993727,0.00011421173,0.00006040926,0.00032478775,0.000056463075,0.0000713832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094034744,0.000105891115,0.00014121241,0.000106064734,0.00013640981,0.00016905156,0.0002520885,0.000050225626,0.00022589735],"category_scores_gemma":[0.00009569037,0.0000858216,0.000024148549,0.00035268257,0.0007222374,0.00023791805,0.000101490674,0.00020591001,0.00008790403],"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.000054205033,0.00023706912,0.0014455505,0.000018583516,0.00003296704,0.00008029766,0.0006999236,0.032569714,0.00020065752,0.06816476,0.0004389888,0.8960573],"study_design_scores_gemma":[0.0026391372,0.00013371654,0.0102801435,0.00004075026,0.000010122749,0.00048386268,0.00084148307,0.9715255,0.00017827957,0.0059077092,0.0076952125,0.00026408903],"about_ca_topic_score_codex":0.000058330334,"about_ca_topic_score_gemma":0.000013881848,"teacher_disagreement_score":0.97293496,"about_ca_system_score_codex":0.000069561196,"about_ca_system_score_gemma":0.00007707895,"threshold_uncertainty_score":0.3499703},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83451986,0.00027903187,0.07541823,0.00018355141,0.00047985883,0.00014018368,0.000001123989,0.0001642745,0.0888139],"genre_scores_gemma":[0.9977827,0.000029665933,0.0019766525,0.000060226546,0.000017981061,0.000004641518,2.0449409e-7,0.0000031578254,0.00012478507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99938697,0.000022850296,0.00010645362,0.00023414141,0.0000855916,0.0001639681],"domain_scores_gemma":[0.9996257,0.00006769125,0.00004390351,0.00016387837,0.0000348848,0.0000639825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087606415,0.00007475841,0.000088472,0.000054088676,0.00008241651,0.00003145054,0.00019167668,0.000049255512,0.000044944616],"category_scores_gemma":[0.00007220089,0.000068214074,0.000017726848,0.00010718406,0.00023477765,0.00030630708,0.00006898925,0.00010252714,0.00007802965],"study_design_candidate":"observational","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.000029914403,0.0006311774,0.2558788,0.000057418358,0.000044080913,0.0038022161,0.03753427,0.00005181006,0.034609925,0.43983623,0.0036802546,0.22384389],"study_design_scores_gemma":[0.0013556305,0.00010680148,0.971783,0.000109956345,0.0000031694633,0.0022617704,0.00048184898,0.0027785345,0.0057803774,0.013249223,0.0015506337,0.00053908373],"about_ca_topic_score_codex":0.000012058249,"about_ca_topic_score_gemma":0.0000070566302,"teacher_disagreement_score":0.7159042,"about_ca_system_score_codex":0.000016625643,"about_ca_system_score_gemma":0.000059440878,"threshold_uncertainty_score":0.27816892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07143907,0.000011124978,0.9050222,0.0019293185,0.00086214044,0.000788924,0.000014291101,0.00038295833,0.019549936],"genre_scores_gemma":[0.80848753,0.0000028634888,0.19065414,0.00047222967,0.00007301996,0.000026585383,0.000004590402,0.000013857688,0.0002652054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998101,0.00008880089,0.00045788052,0.00055821886,0.0003042822,0.0004898424],"domain_scores_gemma":[0.9985577,0.000091091715,0.00014804845,0.0005062099,0.0003360148,0.00036092062],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021759653,0.00024148935,0.00023154133,0.00029874622,0.00034832442,0.00035888513,0.00035157413,0.0001547502,0.001861299],"category_scores_gemma":[0.00019747137,0.00024540912,0.00009062245,0.0005958164,0.00044939911,0.0012462977,0.00021572018,0.00028122132,0.0005296689],"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.000008760704,0.00013979194,0.0014536968,0.000024727615,0.00017159998,0.000046278532,0.0047823964,0.023723552,0.049691033,0.17071426,0.0023553085,0.7468886],"study_design_scores_gemma":[0.0026397605,0.00021087064,0.06903057,0.00041772373,0.00007443603,0.0019501556,0.0023086981,0.89545244,0.008027924,0.01416733,0.003220373,0.0024997036],"about_ca_topic_score_codex":0.00007039496,"about_ca_topic_score_gemma":0.000008289808,"teacher_disagreement_score":0.8717289,"about_ca_system_score_codex":0.00016175114,"about_ca_system_score_gemma":0.00023916682,"threshold_uncertainty_score":0.9999998},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04651025,0.00008429033,0.057269733,0.20950207,0.0021980577,0.0043872227,0.00007073004,0.0003077129,0.6796699],"genre_scores_gemma":[0.9257178,0.000011639529,0.059342213,0.00072503346,0.00850907,0.00006647199,0.0000073495553,0.00001562587,0.00560485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787444,0.00024638342,0.0005446966,0.00042094445,0.0007022698,0.00021125081],"domain_scores_gemma":[0.99800843,0.00087668345,0.00023582316,0.00051129813,0.00031337855,0.000054363198],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003989697,0.00012145661,0.00017237963,0.00023440656,0.0001741448,0.00032391486,0.00034520857,0.000046170655,0.0009875756],"category_scores_gemma":[0.00638422,0.00008177079,0.000038413276,0.0004139541,0.00066195737,0.0002805941,0.00013038274,0.000117662705,0.00022820952],"study_design_candidate":"not_applicable","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.000037617905,0.0001282151,0.00026755343,0.000003617413,0.000013353863,0.000005741263,0.00028259197,0.00020468357,0.0005928768,0.12707868,0.19460413,0.67678094],"study_design_scores_gemma":[0.00012029753,0.00010492051,0.001678483,0.000013308016,0.000014238631,0.00003481128,0.001935348,0.000058384794,0.0018739162,0.0012725089,0.99279755,0.00009621549],"about_ca_topic_score_codex":0.000025209642,"about_ca_topic_score_gemma":0.00010168683,"teacher_disagreement_score":0.8792075,"about_ca_system_score_codex":0.000037132548,"about_ca_system_score_gemma":0.000052847852,"threshold_uncertainty_score":0.9999257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31354606,0.0005349555,0.55165184,0.06067232,0.00068902766,0.0012331592,0.0000054434117,0.000107330634,0.07155989],"genre_scores_gemma":[0.9987145,0.00006181931,0.0008189951,0.00031191757,0.00001486014,0.000007364123,3.342959e-7,0.0000022864317,0.00006790609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991834,0.00021120843,0.00018835574,0.00013522837,0.00014781755,0.000133992],"domain_scores_gemma":[0.99874943,0.0007593429,0.000067656765,0.00035539537,0.000042479125,0.000025670477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012908578,0.00006034206,0.00008482264,0.000026080452,0.00017556867,0.00008150726,0.00040628025,0.00002486288,0.00001589527],"category_scores_gemma":[0.00016806011,0.000028276922,0.000027692122,0.00018790629,0.001336327,0.00007988609,0.00009288812,0.00012948686,0.000004135789],"study_design_candidate":"observational","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.000007112587,0.0000049743007,0.022032013,0.0000026992145,0.000006118708,6.5331744e-7,0.000822408,0.000068986315,0.00003158162,0.5403609,0.00007380246,0.43658876],"study_design_scores_gemma":[0.0034591542,0.00005101754,0.6655223,0.000053931908,0.000011488624,0.0001043797,0.0012265965,0.29488882,0.00042241666,0.030719373,0.0032988195,0.00024171038],"about_ca_topic_score_codex":0.000012158517,"about_ca_topic_score_gemma":0.00035935038,"teacher_disagreement_score":0.68516845,"about_ca_system_score_codex":0.000008912946,"about_ca_system_score_gemma":0.00005559049,"threshold_uncertainty_score":0.49237528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013437726,0.00015766626,0.9889217,0.002371466,0.0007856713,0.0006207196,0.00014852462,0.00027225,0.0053782435],"genre_scores_gemma":[0.79364675,0.000007907354,0.20529017,0.00080062187,0.00015596132,0.000048352722,0.0000119471015,0.0000066709376,0.00003164349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982297,0.00010250862,0.00039905217,0.0005261975,0.00031404785,0.000428538],"domain_scores_gemma":[0.99841285,0.00023467664,0.00013887836,0.0007097028,0.0002829944,0.0002209005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006771307,0.00022053899,0.00021700536,0.00004748986,0.00054572895,0.00037465204,0.00067650987,0.00010051233,0.00017458721],"category_scores_gemma":[0.00008850335,0.00017799337,0.00018034515,0.00029142332,0.000987372,0.00027798637,0.000074857635,0.00013411515,0.000040450468],"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.0000027229949,0.00006250749,0.0004088037,0.0000032320227,0.00003636848,0.0000029318953,0.00015507557,0.0027876876,0.000016138902,0.11966555,0.00019317404,0.87666583],"study_design_scores_gemma":[0.0010464785,0.00007746796,0.00684962,0.0000139557715,0.000039665632,0.00028686688,0.00038743805,0.97870386,0.00012187595,0.0014250848,0.0107077155,0.00033995943],"about_ca_topic_score_codex":0.00001747357,"about_ca_topic_score_gemma":0.000037174967,"teacher_disagreement_score":0.9759162,"about_ca_system_score_codex":0.00020914522,"about_ca_system_score_gemma":0.0004471512,"threshold_uncertainty_score":0.7258359},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21041334,0.00013082087,0.76080275,0.00070202723,0.0005680108,0.0003698759,0.00009005038,0.00014732388,0.026775805],"genre_scores_gemma":[0.9581317,3.682452e-7,0.0393394,0.00025160346,0.0002943797,0.00003572844,0.00008549787,0.00001021348,0.0018511415],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976955,0.00018174891,0.0004759617,0.00049556675,0.0008233452,0.00032785136],"domain_scores_gemma":[0.9985287,0.00033372722,0.00014652289,0.00054523646,0.00033326304,0.000112557405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209596,0.00013277949,0.00021407621,0.00022686132,0.00031968532,0.00037210318,0.00037659748,0.000067213936,0.0007473651],"category_scores_gemma":[0.0012219861,0.00011605958,0.00013564032,0.0005533834,0.00042508217,0.00014335183,0.000029730307,0.00012447646,0.00060006534],"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.000059491846,0.0017396618,0.026458533,0.000016400105,0.00010868599,0.000102895974,0.00025577992,0.13118212,0.027384577,0.07884658,0.37898356,0.35486174],"study_design_scores_gemma":[0.0018890473,0.000045415552,0.009145286,0.000015686006,0.000056426637,0.00009594134,0.00023052587,0.9210145,0.010457207,0.01707996,0.039431583,0.0005384018],"about_ca_topic_score_codex":0.00004439566,"about_ca_topic_score_gemma":0.00001625745,"teacher_disagreement_score":0.7898324,"about_ca_system_score_codex":0.000041510262,"about_ca_system_score_gemma":0.00024904183,"threshold_uncertainty_score":0.8183124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06251976,0.00016223842,0.925197,0.00040965845,0.00044273672,0.0008110561,0.0006789821,0.00080024404,0.008978293],"genre_scores_gemma":[0.7455343,0.0000032563773,0.2536619,0.00018837817,0.00022357036,0.000038200687,0.00021988091,0.000018634026,0.000111882044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992573,0.000010186187,0.00021615223,0.00017267531,0.000087468536,0.00025617887],"domain_scores_gemma":[0.9995951,0.000080646605,0.00003101941,0.00011012553,0.00008755539,0.00009552836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012020491,0.00014463451,0.00018153511,0.000044222143,0.00008584203,0.000045657278,0.00008598205,0.000099323915,0.00014031082],"category_scores_gemma":[0.000051078812,0.00015384727,0.000094979456,0.000111084526,0.00011874838,0.000050739607,0.000004994326,0.000047450594,0.000024667683],"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.0003215753,0.00031076555,0.00032633293,0.0002257925,0.00041454,0.000021784264,0.0010103547,0.13046582,0.0045753247,0.028633682,0.021952698,0.81174135],"study_design_scores_gemma":[0.0018087222,0.0001593719,0.0012133702,0.0000536999,0.000035231307,0.0000749739,0.00011556449,0.99135643,0.00030564857,0.0025391928,0.0020185104,0.0003192954],"about_ca_topic_score_codex":4.2474338e-7,"about_ca_topic_score_gemma":3.101122e-7,"teacher_disagreement_score":0.8608906,"about_ca_system_score_codex":0.00005924768,"about_ca_system_score_gemma":0.000025255067,"threshold_uncertainty_score":0.627371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01637473,0.000020138368,0.96396434,0.00092767115,0.00031607083,0.00056485314,0.00000741796,0.0001915207,0.017633272],"genre_scores_gemma":[0.9073935,0.000003886761,0.09216635,0.00031661202,0.000015042781,0.000033019816,0.000010829899,0.00000749459,0.00005324659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986414,0.000083927735,0.00043409728,0.00032149153,0.0002620375,0.00025709116],"domain_scores_gemma":[0.99879295,0.00011929696,0.00021745729,0.0004024926,0.00033400132,0.00013381038],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022308985,0.00015846582,0.00021200882,0.00017266285,0.000087040076,0.00011299199,0.00038043124,0.00008466564,0.00268695],"category_scores_gemma":[0.00009987126,0.00015508756,0.00008088694,0.00036134175,0.00062005676,0.0005777942,0.000053036045,0.00011019386,0.0003012465],"study_design_candidate":"design_other","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.000003071744,0.00011239256,0.005308622,0.00005187748,0.000026673915,0.000004462165,0.00016724753,0.0008118472,0.0105017265,0.066639416,0.00081530935,0.9155573],"study_design_scores_gemma":[0.0050418954,0.00036478735,0.087809175,0.0004386121,0.0000453102,0.00020422584,0.00037959495,0.7929216,0.09611066,0.013097631,0.0020734356,0.0015130795],"about_ca_topic_score_codex":0.0000148693925,"about_ca_topic_score_gemma":0.0000041256985,"teacher_disagreement_score":0.91404426,"about_ca_system_score_codex":0.00004051045,"about_ca_system_score_gemma":0.00029867626,"threshold_uncertainty_score":0.99822474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028260096,0.000025221363,0.9154866,0.00034975712,0.00084629486,0.00028319456,0.000012078891,0.00084902,0.079321854],"genre_scores_gemma":[0.8869795,8.74783e-7,0.11229827,0.0005701875,0.00005810901,0.000008308433,0.0000081100825,0.0000121441235,0.00006448062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981108,0.00006425595,0.00049157074,0.00049907167,0.00031632942,0.0005179736],"domain_scores_gemma":[0.99860424,0.00021403054,0.00018221901,0.00053946825,0.00017411538,0.00028593608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076494913,0.0002328615,0.00023874262,0.00028009742,0.00020700712,0.00018869886,0.00048472034,0.00013890772,0.00030699768],"category_scores_gemma":[0.00007609571,0.00024379398,0.00010901413,0.00044629892,0.00050019496,0.00029020736,0.00006439014,0.0002110842,0.0002544905],"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.000010548914,0.00005965008,0.0020226946,0.000044606266,0.00003493065,0.00031130962,0.0002784656,0.00066647783,0.0014242976,0.22178629,0.0001852156,0.7731755],"study_design_scores_gemma":[0.010006765,0.0004716332,0.034525372,0.0007150206,0.000121232464,0.0056677167,0.0034690686,0.90047526,0.020280618,0.0006894101,0.019779678,0.003798201],"about_ca_topic_score_codex":0.000015552134,"about_ca_topic_score_gemma":0.000018315095,"teacher_disagreement_score":0.8998088,"about_ca_system_score_codex":0.00022224507,"about_ca_system_score_gemma":0.00048473035,"threshold_uncertainty_score":0.99416304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032418196,0.00004492961,0.9832955,0.00033758438,0.0013891199,0.0005082748,0.00003501841,0.00034290802,0.010804816],"genre_scores_gemma":[0.9010993,0.000006118435,0.09798452,0.00051249267,0.00015823089,0.000059655868,0.000017457149,0.000015055169,0.0001471288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984956,0.0000445782,0.00034316367,0.00034926148,0.00015774404,0.00060966343],"domain_scores_gemma":[0.99885976,0.0001797576,0.00014020967,0.00039750934,0.00013619261,0.00028656315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038931897,0.00020879685,0.00020916494,0.00014518366,0.00019770079,0.00014916528,0.0003936805,0.00011748121,0.0007039347],"category_scores_gemma":[0.00012508151,0.00021789508,0.00012249054,0.00022764025,0.00035815858,0.0007954943,0.000089678855,0.00012971975,0.000069871145],"study_design_candidate":"design_other","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.0000056244216,0.00006855388,0.0017183261,0.000027875798,0.000049821556,0.0000022807965,0.00064115267,0.0000064143933,0.011194613,0.1689758,0.0005266523,0.8167829],"study_design_scores_gemma":[0.026315456,0.0009730595,0.0792232,0.00070010714,0.00036885423,0.0024331305,0.0026722192,0.61934245,0.13126616,0.052244373,0.07501241,0.009448552],"about_ca_topic_score_codex":0.000002029139,"about_ca_topic_score_gemma":0.0000017708232,"teacher_disagreement_score":0.89785755,"about_ca_system_score_codex":0.00006997109,"about_ca_system_score_gemma":0.00013371135,"threshold_uncertainty_score":0.88855034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009325516,0.0000047936546,0.9309878,0.04209158,0.0011685665,0.00059179304,0.0000030415852,0.00012227494,0.015704686],"genre_scores_gemma":[0.9557531,0.000013078377,0.036946665,0.0016211972,0.005174263,0.000035226156,0.000006265056,0.000009087869,0.00044114047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989863,0.000050200324,0.00021841514,0.0003551474,0.00019418218,0.00019573398],"domain_scores_gemma":[0.9993155,0.00005882368,0.00006447617,0.00032750686,0.000116967814,0.00011671048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002205049,0.00012681764,0.00010194755,0.00011549962,0.00022080181,0.00027412787,0.00019149545,0.000055339846,0.001280229],"category_scores_gemma":[0.000061294646,0.00009587172,0.000028588303,0.00022263391,0.0001572516,0.00040903382,0.000061957806,0.00013962701,0.0007459131],"study_design_candidate":"design_other","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.0000036905433,0.00001322552,0.00005814452,0.00000280222,0.000008448302,8.8965567e-7,0.0007032607,0.030762069,0.00010627828,0.06956516,0.010970733,0.8878053],"study_design_scores_gemma":[0.00070844014,0.00018244944,0.006478159,0.000042172396,0.000011826882,0.00015567047,0.00062609033,0.8401665,0.00091582787,0.0071852864,0.14299415,0.0005334484],"about_ca_topic_score_codex":0.000015686368,"about_ca_topic_score_gemma":0.0000074685986,"teacher_disagreement_score":0.9464276,"about_ca_system_score_codex":0.00005235295,"about_ca_system_score_gemma":0.00003962847,"threshold_uncertainty_score":0.9996327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027083965,0.00006094087,0.9546786,0.00063078816,0.0011130912,0.00010275104,0.000010458412,0.00025267754,0.01606673],"genre_scores_gemma":[0.9004493,0.0000072361286,0.098961465,0.00040292184,0.00006925645,0.0000045254124,0.000015095174,0.0000059989607,0.00008420789],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989545,0.000045183384,0.00020115523,0.00031283,0.0002868856,0.0001994529],"domain_scores_gemma":[0.99903566,0.00012261464,0.00006283395,0.0003924539,0.00012044092,0.00026597444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021293962,0.00011756653,0.00012351436,0.00008714008,0.00007733356,0.00024600406,0.0003916397,0.00007848734,0.00026802017],"category_scores_gemma":[0.00017874266,0.0001126741,0.000054417855,0.00026831593,0.00016340577,0.00043334867,0.00009956993,0.000100428304,0.0004584243],"study_design_candidate":"design_other","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.000004793776,0.000025001096,0.0054542352,6.752668e-7,0.000011250527,0.000020710171,0.00053479214,0.0000959114,0.0000805089,0.020687532,0.0024183043,0.9706663],"study_design_scores_gemma":[0.012788529,0.00044728763,0.23815751,0.00031514696,0.00008231917,0.00042349228,0.0019860922,0.29676166,0.0030518665,0.29893598,0.14397176,0.0030783613],"about_ca_topic_score_codex":0.000036627946,"about_ca_topic_score_gemma":0.00006857652,"teacher_disagreement_score":0.96758795,"about_ca_system_score_codex":0.000056861227,"about_ca_system_score_gemma":0.00017485429,"threshold_uncertainty_score":0.58922696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18541539,0.00030941906,0.8101721,0.00065201573,0.00017607269,0.0003789696,0.000020464493,0.00009225885,0.0027833541],"genre_scores_gemma":[0.89234155,0.0000018761864,0.10737904,0.00007600151,0.000084510655,0.00001630598,0.000006678756,0.000007953951,0.000086063905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997906,0.00004386234,0.0007028264,0.00035945675,0.000511193,0.00047664886],"domain_scores_gemma":[0.99843985,0.000490514,0.00021294825,0.00034980386,0.00039185607,0.000115039875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981561,0.00014231884,0.00031159693,0.00027089944,0.00020593012,0.00015464851,0.00045798454,0.00010074877,0.00009256523],"category_scores_gemma":[0.003595156,0.0001124824,0.00021121776,0.00045316925,0.00018005687,0.0003485569,0.000040503077,0.00015904407,0.000029282488],"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.00005636922,0.0002212206,0.0010885248,0.000025256702,0.00005655521,0.000003246879,0.0028053462,0.120963275,0.0014555653,0.06072131,0.000062211606,0.8125411],"study_design_scores_gemma":[0.0012005272,0.00025225847,0.000538392,0.00023635171,0.00006111921,0.00002319041,0.004644737,0.8763239,0.0011249208,0.11451566,0.0006922449,0.00038671296],"about_ca_topic_score_codex":0.00001108804,"about_ca_topic_score_gemma":0.0000072916796,"teacher_disagreement_score":0.8121544,"about_ca_system_score_codex":0.000016433902,"about_ca_system_score_gemma":0.00013954846,"threshold_uncertainty_score":0.4586899},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020402453,0.000016282827,0.98814297,0.0007981762,0.000375812,0.00037781766,0.000022822935,0.00015577635,0.008070073],"genre_scores_gemma":[0.7380729,0.000004785927,0.26156878,0.0001409323,0.000028917475,0.000006219623,0.000010781526,0.0000048320785,0.00016185641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885976,0.00002636745,0.00037426146,0.00030385127,0.00018454647,0.00025122392],"domain_scores_gemma":[0.9990409,0.00012855705,0.00017705161,0.00030971348,0.00018168529,0.00016207725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019204101,0.00014716708,0.00020876229,0.00017544444,0.000109559944,0.000087025386,0.0003775268,0.00008283054,0.0002375112],"category_scores_gemma":[0.00012365756,0.00016207699,0.00011151974,0.00028093255,0.0002894623,0.0004312824,0.000036333517,0.000090242705,0.00000885167],"study_design_candidate":"design_other","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.0000022321817,0.00005542903,0.00035402077,0.000006008179,0.000015911215,0.0000023819523,0.00025544566,0.00015905847,0.0008036565,0.1659329,0.00059426285,0.8318187],"study_design_scores_gemma":[0.021955889,0.001516625,0.27497122,0.000703047,0.00014597029,0.00043816853,0.00093472534,0.5030164,0.041179657,0.14739168,0.004946965,0.0027996562],"about_ca_topic_score_codex":0.000005545341,"about_ca_topic_score_gemma":0.0000041686844,"teacher_disagreement_score":0.829019,"about_ca_system_score_codex":0.000033088207,"about_ca_system_score_gemma":0.00021982644,"threshold_uncertainty_score":0.66093075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019129638,0.000054368094,0.9537196,0.0035581596,0.00096370786,0.0003908384,0.000013424343,0.0005789571,0.021591287],"genre_scores_gemma":[0.97479975,0.00007270847,0.023347523,0.0013361545,0.00010777608,0.000024773555,0.000010585116,0.000012965445,0.00028777684],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982227,0.00009473111,0.0004102696,0.0005260993,0.00033435767,0.0004118286],"domain_scores_gemma":[0.9987275,0.000149083,0.00016589617,0.0005424898,0.00017330302,0.00024171073],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025115703,0.00026771182,0.00027215586,0.00018166094,0.00025563024,0.00028605858,0.00039633218,0.00015180094,0.0020357938],"category_scores_gemma":[0.0001333641,0.0002555349,0.00013706025,0.0005169732,0.00049385155,0.00067678106,0.00009588165,0.00028075377,0.00022416939],"study_design_candidate":"design_other","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.000040733394,0.000046752775,0.018151408,0.00001260427,0.00008322719,0.00023887045,0.0010397153,0.001401501,0.000749933,0.049222417,0.0015670422,0.92744577],"study_design_scores_gemma":[0.03154939,0.00043666697,0.5668484,0.0004677041,0.00019804826,0.017777214,0.00492702,0.26892263,0.0026129019,0.01785837,0.083138995,0.0052626715],"about_ca_topic_score_codex":0.000011064507,"about_ca_topic_score_gemma":0.000028503006,"teacher_disagreement_score":0.9556701,"about_ca_system_score_codex":0.00007735831,"about_ca_system_score_gemma":0.00023074009,"threshold_uncertainty_score":0.9999897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023027792,0.00004613151,0.96562713,0.0043824157,0.0004273459,0.00047570202,0.00008438432,0.00013934581,0.028587254],"genre_scores_gemma":[0.72070545,0.000027137245,0.27427897,0.001325716,0.00018878699,0.00016137247,0.000011429009,0.000023073208,0.0032780555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875087,0.000028854227,0.0001979612,0.00041493555,0.00021509534,0.00039229204],"domain_scores_gemma":[0.9984195,0.000493224,0.00009347409,0.0007867177,0.00011778988,0.00008927445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050704926,0.00016480751,0.00015284074,0.000051266972,0.00025589645,0.00027837214,0.0011063357,0.000036995483,0.00017371339],"category_scores_gemma":[0.00006165702,0.00007975278,0.000053567688,0.00019021967,0.0009453857,0.00050435256,0.00019660323,0.00005774721,0.00007447895],"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.0000056099525,0.00002313554,0.00010715678,0.000008270927,0.000071701725,0.000008863103,0.00009663569,6.1496394e-7,0.00023767378,0.68171006,0.0027732565,0.314957],"study_design_scores_gemma":[0.010234199,0.00093915215,0.0019349477,0.000665019,0.0002281702,0.0004571444,0.001538137,0.007299779,0.0023569078,0.19722107,0.77520823,0.0019172283],"about_ca_topic_score_codex":0.000007142566,"about_ca_topic_score_gemma":0.00001035009,"teacher_disagreement_score":0.772435,"about_ca_system_score_codex":0.000026519418,"about_ca_system_score_gemma":0.00017684558,"threshold_uncertainty_score":0.3483313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050279018,0.000031598312,0.94788146,0.0005769632,0.00007864257,0.00014636443,0.0000084118565,0.00028541326,0.0007121428],"genre_scores_gemma":[0.500522,0.0000022205083,0.4992654,0.00013446638,0.000052629213,0.000005973881,0.000004958867,0.000006173139,0.0000061758165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987657,0.000031374457,0.00024455128,0.00045649786,0.00020719416,0.00029469756],"domain_scores_gemma":[0.99925673,0.00011330623,0.00009242471,0.00024908685,0.00006236525,0.00022606588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000187561,0.00013801362,0.00015730502,0.00004537108,0.00023307126,0.00031375,0.00063275796,0.000052251693,0.000053780805],"category_scores_gemma":[0.00018727983,0.00013680426,0.00006085817,0.00036403514,0.00025468422,0.0003285641,0.00027689082,0.00021862032,0.00007981969],"study_design_candidate":"design_other","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.0000014544884,0.000018944582,0.0002144245,0.0000034922568,0.00000977419,0.0000226125,0.0006515994,0.00068739196,0.001443879,0.00657087,0.00007216202,0.9903034],"study_design_scores_gemma":[0.00047185304,0.00013312203,0.0003933969,0.00006549931,0.000012435408,0.00012616486,0.00079615787,0.9814392,0.0008009139,0.00020920973,0.015229135,0.00032291657],"about_ca_topic_score_codex":0.000005151834,"about_ca_topic_score_gemma":5.431283e-7,"teacher_disagreement_score":0.98998046,"about_ca_system_score_codex":0.00002192807,"about_ca_system_score_gemma":0.00012370062,"threshold_uncertainty_score":0.5578716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032665525,0.000008574455,0.961895,0.003969362,0.000036437712,0.00091218314,0.0000061106434,0.00017681945,0.00032998042],"genre_scores_gemma":[0.8209844,0.0000037533869,0.17824008,0.00065190083,0.000023478684,0.00006835464,0.000015189762,0.000008539422,0.000004266899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868894,0.000070823866,0.00020710705,0.00049422804,0.0003124442,0.0002264489],"domain_scores_gemma":[0.99912643,0.00006499364,0.000056374436,0.00030512267,0.00016578769,0.00028127083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043126,0.00015088658,0.00012490519,0.000079369536,0.0001639552,0.0003844951,0.00041409954,0.000059687332,0.000030785468],"category_scores_gemma":[0.00003743898,0.00010012079,0.00002132116,0.00062047795,0.00016436877,0.00034492576,0.00014611978,0.0002312772,0.00003732678],"study_design_candidate":"design_other","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.000027563141,0.000019296682,0.0022133128,0.000005503136,0.000009366535,0.0000046484506,0.0021673338,0.00067284144,0.00012188864,0.003304961,0.000042237207,0.99141103],"study_design_scores_gemma":[0.0022354536,0.0014550019,0.027583774,0.00016179893,0.00003518491,0.00030852717,0.005351298,0.9473659,0.0008872527,0.0024779884,0.0112448465,0.00089299574],"about_ca_topic_score_codex":0.000029394834,"about_ca_topic_score_gemma":0.00024881,"teacher_disagreement_score":0.99051803,"about_ca_system_score_codex":0.000037424605,"about_ca_system_score_gemma":0.00013032768,"threshold_uncertainty_score":0.40828076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10178958,0.0010581224,0.0011951957,0.0019406929,0.7305554,0.0015306834,0.0044455454,0.001214886,0.15626988],"genre_scores_gemma":[0.9084218,0.000014986554,0.0029102906,0.0002467163,0.087125376,0.000013389199,0.00007762744,0.00019412214,0.0009956666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969623,0.0001143858,0.00051725906,0.00072566915,0.00064840406,0.0010319847],"domain_scores_gemma":[0.9973725,0.00025210244,0.00026144914,0.0011291327,0.00030726788,0.00067752076],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00082374597,0.00047859232,0.0004201182,0.00020602287,0.00022598734,0.00022818193,0.00068762363,0.0006611773,0.021291452],"category_scores_gemma":[0.0013151867,0.00053511065,0.00022501437,0.00034636183,0.004034174,0.00022279134,0.00018600909,0.0018531365,0.359229],"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.000043295622,0.00031628477,0.0014965707,0.000047319783,0.00019487251,0.00022807595,0.00066213467,0.0000019688202,0.22032191,0.0052347505,0.706181,0.065271825],"study_design_scores_gemma":[0.0014202283,0.000050914983,0.0029475982,0.00008860451,0.00022580523,0.00006546276,0.000081134946,0.0005030442,0.0061483607,0.00069224415,0.9870391,0.0007375153],"about_ca_topic_score_codex":0.000018497944,"about_ca_topic_score_gemma":0.000060174407,"teacher_disagreement_score":0.8066322,"about_ca_system_score_codex":0.00008946444,"about_ca_system_score_gemma":0.00094195927,"threshold_uncertainty_score":0.99971},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6810729,0.000023355655,0.000045544853,0.00095420046,0.00022933232,0.00010091792,0.000023507837,0.00031447422,0.3172358],"genre_scores_gemma":[0.99284726,0.0000024816406,0.0004214443,0.00007969911,0.00069158303,0.00000416255,0.000013828273,0.000019022866,0.005920499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945277,0.000027059634,0.000093062474,0.00016808364,0.000097727796,0.00016131972],"domain_scores_gemma":[0.99971074,0.000008344107,0.000015386357,0.00018721579,0.000023152568,0.000055150686],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012034987,0.00006309988,0.00006253988,0.0000359314,0.000042426003,0.000017804763,0.00006727011,0.000029641013,0.13719732],"category_scores_gemma":[0.00003692246,0.000064561726,0.000025599435,0.00013365949,0.000304851,0.00009238991,0.000004383903,0.00007032496,0.11379787],"study_design_candidate":"not_applicable","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.000021276459,0.000044996068,0.0004163151,0.0000021469787,0.000015232111,0.000010297845,0.000119033,0.000023086639,0.015295538,0.0031547216,0.13963997,0.8412574],"study_design_scores_gemma":[0.0006203033,0.000027169533,0.011994744,0.0000071918807,0.000015918058,0.00024364085,0.000076196986,0.00009962401,0.006113882,0.0013582286,0.97922146,0.00022163983],"about_ca_topic_score_codex":0.0000024931103,"about_ca_topic_score_gemma":0.0000014015528,"teacher_disagreement_score":0.8410357,"about_ca_system_score_codex":0.0000325466,"about_ca_system_score_gemma":0.000023784442,"threshold_uncertainty_score":0.88689214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040008187,0.0003143734,0.9539479,0.0018252176,0.0005286228,0.00031266478,0.000001359788,0.000373249,0.0026884377],"genre_scores_gemma":[0.9733128,0.000021839023,0.025721628,0.0005948363,0.00007327329,0.000031109725,0.0000058828596,0.000012595463,0.00022605524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859005,0.00027842738,0.0001933396,0.00033438238,0.00032095567,0.00028284558],"domain_scores_gemma":[0.99936324,0.00015029128,0.00013794207,0.00027307452,0.000034460012,0.000040963798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052429095,0.00011087793,0.000094699804,0.00006179079,0.0010477516,0.000117048745,0.00074773206,0.000027909027,0.00005511045],"category_scores_gemma":[0.000034408455,0.00009372955,0.000056214983,0.00051729864,0.00015430851,0.0002495194,0.00028732693,0.0005028095,0.0000052185515],"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.000007471302,0.000022767656,0.0011207702,0.000011199544,0.000023612227,0.00006339452,0.014611891,0.4026646,0.0057818126,0.22496878,0.0004061267,0.35031757],"study_design_scores_gemma":[0.00060568785,0.00023687739,0.0006049322,0.00006157962,0.000015375676,0.00038781884,0.0016360478,0.88320583,0.0013826144,0.098972134,0.012286947,0.00060416234],"about_ca_topic_score_codex":0.000003441044,"about_ca_topic_score_gemma":0.0000022965319,"teacher_disagreement_score":0.9333046,"about_ca_system_score_codex":0.000052106912,"about_ca_system_score_gemma":0.000045999637,"threshold_uncertainty_score":0.80585647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8448784,0.00019327625,0.15363114,0.000010679597,0.00015639956,0.00016381289,0.00002470745,0.00015765383,0.0007839351],"genre_scores_gemma":[0.9435108,0.000012545671,0.05638404,0.000012192865,0.00002173672,0.000013242635,0.000021250662,0.000021218508,0.0000029799469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993702,0.000013103007,0.0002458794,0.0001309695,0.00006908892,0.00017072354],"domain_scores_gemma":[0.99975455,0.00003378976,0.00004279008,0.000103591075,0.000013458177,0.000051802734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018346813,0.000104987754,0.00016436205,0.0000897768,0.000085765765,0.000023294613,0.00008133173,0.00004060216,0.00017671335],"category_scores_gemma":[0.000010144085,0.00013131891,0.000026765923,0.000070116366,0.00017205514,0.00006708739,0.00007213184,0.00012664277,1.2214578e-7],"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.000009266014,0.000028223752,0.010300216,0.00014013886,0.00008883122,0.000033350123,0.00092146185,0.9217125,0.003194168,0.00081304234,0.000069585694,0.0626892],"study_design_scores_gemma":[0.00042848644,0.00009054711,0.00093235564,0.00010985254,0.000048916227,0.00044677648,0.002908141,0.9932825,0.00085220666,0.00018286877,0.00032188103,0.00039544774],"about_ca_topic_score_codex":0.0000027045746,"about_ca_topic_score_gemma":7.451268e-7,"teacher_disagreement_score":0.098632395,"about_ca_system_score_codex":0.00007403781,"about_ca_system_score_gemma":0.000025909387,"threshold_uncertainty_score":0.535503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002089283,0.0000064671835,0.9916302,0.0030222929,0.00024040246,0.0004999892,0.0005572353,0.001157463,0.00079665496],"genre_scores_gemma":[0.7230383,0.0000066809775,0.2739247,0.00026660052,0.000057304194,0.00017083167,0.0023576275,0.000014901757,0.00016303694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852884,0.000036665726,0.00026782745,0.00065904687,0.00020623048,0.00030136856],"domain_scores_gemma":[0.9973133,0.00026797087,0.00012900546,0.0021041918,0.00010688546,0.00007864819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061712734,0.00013428273,0.00014165124,0.00019541044,0.00014290103,0.00014371546,0.0023556696,0.00008713615,0.000018326102],"category_scores_gemma":[0.00024168061,0.00013852064,0.000040763913,0.0005387778,0.00023297418,0.0006256591,0.0003453909,0.000090668866,0.0002495404],"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.000026048172,0.00017289602,0.0011087939,0.00007816513,0.000034558645,0.000020054053,0.00019215037,0.00007826277,0.08357356,0.06579575,0.25102207,0.5978977],"study_design_scores_gemma":[0.00047405763,0.00006451203,0.026448984,0.000034786248,0.000007285498,0.0000041941835,0.0000632122,0.94687945,0.0069690347,0.00086807524,0.01794692,0.00023949805],"about_ca_topic_score_codex":0.0000017503213,"about_ca_topic_score_gemma":0.000001794078,"teacher_disagreement_score":0.9468012,"about_ca_system_score_codex":0.000042079155,"about_ca_system_score_gemma":0.00025221505,"threshold_uncertainty_score":0.5648708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963745,0.00004054159,0.02955095,0.0007291043,0.00012864402,0.0007973432,0.000016752496,0.0016117205,0.003379924],"genre_scores_gemma":[0.9975973,0.000005473875,0.002137727,0.00005595804,0.00002246758,0.00010033193,0.000024301038,0.000019825464,0.00003664817],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991743,0.000008448998,0.00023234823,0.00018281587,0.000094176314,0.00030790007],"domain_scores_gemma":[0.9997063,0.000040259176,0.000016700422,0.00010711199,0.000026047295,0.00010357689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020766963,0.00011570289,0.00011722951,0.00016694287,0.000082356986,0.00005226844,0.000062877465,0.0000543251,0.000025596473],"category_scores_gemma":[0.000031802854,0.00012738032,0.000024622374,0.0008187222,0.000089850364,0.000067224915,0.000008523371,0.00012894675,0.000056058478],"study_design_candidate":"design_other","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.0000029565092,0.00004159626,0.012530724,0.000198747,0.00009383622,0.000013775875,0.003932466,0.02599864,0.039551508,0.0351837,0.00024723372,0.88220483],"study_design_scores_gemma":[0.0032164461,0.00027379266,0.6175998,0.0004858957,0.00014335981,0.00012965086,0.009820149,0.3293091,0.019117475,0.0027858608,0.01462648,0.0024919806],"about_ca_topic_score_codex":0.0000036120434,"about_ca_topic_score_gemma":0.000018446297,"teacher_disagreement_score":0.8797128,"about_ca_system_score_codex":0.0000243601,"about_ca_system_score_gemma":0.000027959011,"threshold_uncertainty_score":0.5194419},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014666397,0.0004295225,0.9792382,0.0004842143,0.00053252233,0.00025303478,0.000002018879,0.0008859407,0.003508128],"genre_scores_gemma":[0.9170159,0.000049758903,0.08254764,0.00009158952,0.00007392181,0.000021566922,0.0000061676146,0.00001671256,0.00017670696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849284,0.000103850754,0.00029689423,0.00054794975,0.00021456959,0.000343914],"domain_scores_gemma":[0.99938494,0.00018949108,0.000069571615,0.00012477042,0.00007826272,0.00015298033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035244954,0.00020488341,0.00017585796,0.00027470684,0.0002664409,0.0006753871,0.00013358773,0.00009559361,0.00014624847],"category_scores_gemma":[0.00018730477,0.00021067674,0.00006766489,0.00057080894,0.0003309993,0.00044025117,0.00010390622,0.00037679158,0.000041141426],"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.0000019967354,0.000011730467,0.0012625802,0.00004981092,0.000037498212,0.000067775254,0.0006706637,0.0006676386,0.0021332635,0.0421678,0.000056454173,0.9528728],"study_design_scores_gemma":[0.00047422043,0.00015286746,0.0022199145,0.00028896198,0.000042861033,0.0015359912,0.0003415831,0.97936,0.0003741762,0.001753261,0.012925156,0.0005310091],"about_ca_topic_score_codex":0.000012450026,"about_ca_topic_score_gemma":0.000016566037,"teacher_disagreement_score":0.97869235,"about_ca_system_score_codex":0.0000776888,"about_ca_system_score_gemma":0.00026151937,"threshold_uncertainty_score":0.85911477},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09958258,0.00018001403,0.8955165,0.00021496502,0.00016866784,0.0011377266,0.0000074736877,0.00067397923,0.0025180448],"genre_scores_gemma":[0.85466933,0.000005751052,0.1450399,0.000062543375,0.000013109388,0.000104118,0.000054093933,0.00003598952,0.000015189684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854714,0.000036521353,0.00035299608,0.0003837789,0.0001953247,0.00048427013],"domain_scores_gemma":[0.99944335,0.000073127514,0.00007900233,0.00020483394,0.000093797134,0.000105900406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024101294,0.0003065737,0.00027249672,0.00022089883,0.00016330587,0.00019863731,0.000114281844,0.00014572304,0.000019527586],"category_scores_gemma":[0.000016640372,0.00029595563,0.000046378158,0.00026194946,0.00032450736,0.00016471816,0.00003448817,0.00025961592,0.0000035939368],"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.00008581984,0.00025431695,0.032876633,0.0021518471,0.00055314787,0.0001595244,0.0014890308,0.30576804,0.013204188,0.006038564,0.000049069207,0.6373698],"study_design_scores_gemma":[0.008459039,0.0004964894,0.013986452,0.0042715333,0.00037085457,0.0003829057,0.005704729,0.957921,0.0030774581,0.0017756755,0.0013179274,0.002235888],"about_ca_topic_score_codex":0.000004225148,"about_ca_topic_score_gemma":0.00007205876,"teacher_disagreement_score":0.7550867,"about_ca_system_score_codex":0.00020297796,"about_ca_system_score_gemma":0.000110590394,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null}]}