{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":698,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":698,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"e47bdbb6d638","filters":{"topic":"Constraint Satisfaction and Optimization"}},"results":[{"id":"W2950680102","doi":"10.1613/jair.2861","title":"ParamILS: An Automatic Algorithm Configuration Framework","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":868,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1317989993784504,"gpt":0.4330978139636827,"spread":0.3012988145852324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002695411,0.00009384088,0.0001720099,0.0005103695,0.0002411882,0.0005595533,0.0006928926,0.0001056194,0.0002152002],"category_scores_gemma":[0.0006998332,0.00008234097,0.00007489429,0.0009714768,0.0001069186,0.001285788,0.00002859926,0.0006489058,0.00009577684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029833,"about_ca_system_score_gemma":0.0003120291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000784536,"about_ca_topic_score_gemma":0.000004490466,"domain_scores_codex":[0.9974569,0.0003788173,0.0006755476,0.0001878976,0.0009853191,0.0003155388],"domain_scores_gemma":[0.9977697,0.0003622062,0.000220992,0.0003085313,0.001117304,0.0002212619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007233642,0.0001059511,0.000007197234,0.000001857213,0.000005413895,0.00002504357,0.0008360335,0.001653283,0.000834292,0.09942779,0.00006404477,0.8970318],"study_design_scores_gemma":[0.00001999192,0.0007433739,0.0005695195,0.00005883939,0.000002742384,0.00008036155,0.0006867655,0.7412845,0.01279114,0.2435119,0.0001535925,0.00009727454],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006466527,0.00005869308,0.9893742,0.003154361,0.0003754575,0.000127318,4.553011e-7,0.00004130184,0.0004016993],"genre_scores_gemma":[0.7044448,0.00009123165,0.2950411,0.0001321056,0.000266373,0.00000127201,6.720128e-7,0.000004098448,0.00001830815],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8969346,"threshold_uncertainty_score":0.5395786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147148915","doi":"10.1613/jair.2490","title":"SATzilla: Portfolio-based Algorithm Selection for SAT","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":835,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Solver; Portfolio; Scalability; Selection (genetic algorithm); Set (abstract data type); Class (philosophy); Local search (optimization); Algorithm; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1824121673170033,"gpt":0.4086704943385303,"spread":0.226258327021527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107196,0.00009273928,0.0001731313,0.0007339581,0.0004460012,0.0001387892,0.0004478974,0.00008174893,0.0001145639],"category_scores_gemma":[0.0004454133,0.00008375545,0.0001461786,0.001120889,0.0001616295,0.0004885521,0.00003974252,0.000380913,0.00004062097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678748,"about_ca_system_score_gemma":0.0007917904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002171155,"about_ca_topic_score_gemma":0.00001997106,"domain_scores_codex":[0.99787,0.0001627529,0.0005922227,0.0001983073,0.0008249019,0.0003518579],"domain_scores_gemma":[0.9970078,0.0004441606,0.0002104016,0.0001628064,0.002004867,0.0001699238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005704911,0.0001124508,0.0003217427,0.000007023882,0.00001637975,0.00002348089,0.0002561768,0.005787748,0.001698268,0.007841962,0.001297471,0.9825802],"study_design_scores_gemma":[0.00008654765,0.0007041182,0.0003852873,0.00002777508,0.000004302574,0.0003106717,0.0001938001,0.9229377,0.0597044,0.01222745,0.003283295,0.0001346403],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004628446,0.00007739657,0.9930465,0.001348724,0.0004608664,0.0002047826,0.000001609992,0.0000272447,0.0002044173],"genre_scores_gemma":[0.5725212,0.0002015908,0.4265145,0.00009308095,0.0004951037,0.000009896355,0.000001671485,0.00001253184,0.0001505274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9824456,"threshold_uncertainty_score":0.3430326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026753685","doi":"10.1137/s0097539700376676","title":"Classifying the Complexity of Constraints Using Finite Algebras","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":580,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Universal algebra; Surjective function; Mathematics; Constraint satisfaction; Class (philosophy); Constraint (computer-aided design); Set (abstract data type); Algebra over a field; Algebraic number; Simple (philosophy); Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08292401402696233,"gpt":0.3007412606629095,"spread":0.2178172466359471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007539427,0.0001237056,0.0001691689,0.0001397606,0.000538098,0.0002049718,0.0004608449,0.00004211232,0.00008416779],"category_scores_gemma":[0.0001103997,0.00009359844,0.0001096471,0.0003116641,0.0003228826,0.0002894325,0.0001156947,0.0004191339,0.00001295653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008588102,"about_ca_system_score_gemma":0.0001310553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002339855,"about_ca_topic_score_gemma":0.000002966241,"domain_scores_codex":[0.9986017,0.0001775822,0.0004718151,0.0001678714,0.0003405268,0.0002405407],"domain_scores_gemma":[0.9987704,0.0003158751,0.0004555109,0.0002183227,0.0001515044,0.00008837064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008367515,0.00006198309,0.001999977,0.000009576363,0.0000476247,0.00001330652,0.001198121,0.3885073,0.001024337,0.09780629,0.00008086906,0.5092422],"study_design_scores_gemma":[0.0003742689,0.00003828253,0.00733885,0.0001123538,0.000006359482,0.0004020287,0.0001089558,0.9888541,0.0005881488,0.001636993,0.0004188393,0.0001208639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06922815,0.0000369744,0.9256728,0.002402202,0.0004879751,0.00007422088,8.332344e-7,0.00004890446,0.002047882],"genre_scores_gemma":[0.8633766,0.000006216606,0.1358414,0.0005378395,0.000225319,1.037089e-7,3.104882e-7,0.000005722174,0.000006574602],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7941484,"threshold_uncertainty_score":0.413867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997649256","doi":"10.1145/1120582.1120584","title":"A dichotomy theorem for constraint satisfaction problems on a 3-element set","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":372,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Element (criminal law); Set (abstract data type); Mathematics; Domain (mathematical analysis); Class (philosophy); Local consistency; Time complexity; Constraint satisfaction dual problem; Maximal element; Mathematical optimization; Algebraic number; Computer science; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01866132233556832,"gpt":0.2543906495361,"spread":0.2357293272005317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966211,0.00008033848,0.0001071797,0.00008159974,0.0001215855,0.0001009391,0.0006418477,0.00003178303,0.00002825206],"category_scores_gemma":[0.0001891767,0.00005011807,0.0001366726,0.0001351254,0.00003812191,0.000205437,0.00009313627,0.000125063,0.000003244114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009307962,"about_ca_system_score_gemma":0.00008531069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001152943,"about_ca_topic_score_gemma":0.00002906097,"domain_scores_codex":[0.9991379,0.0000577072,0.0003254209,0.00009776814,0.0002606063,0.0001206381],"domain_scores_gemma":[0.9988315,0.0001352741,0.0004109472,0.0004457699,0.0001418692,0.00003467266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001771517,0.0002859746,0.03334785,0.00006902106,0.0002137973,0.00001217452,0.001441065,0.1053694,0.009592135,0.4312829,0.0646893,0.3535193],"study_design_scores_gemma":[0.006776102,0.001294439,0.2475231,0.0004883902,0.0001192238,0.001021694,0.0002990945,0.07274754,0.0137379,0.606491,0.04884579,0.0006556755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06502546,0.00002557919,0.9127021,0.01926705,0.001273212,0.0005689269,0.000009192897,0.00003617836,0.001092315],"genre_scores_gemma":[0.9575295,0.000007039313,0.04183053,0.0004010056,0.0001352887,0.00000765295,5.613283e-7,0.000004915047,0.00008344628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8925041,"threshold_uncertainty_score":0.2043756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041091076","doi":"10.1145/502102.502106","title":"Interval arithmetic","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Interval arithmetic; Interval (graph theory); Arithmetic; Multiplication (music); Affine arithmetic; Division (mathematics); Subtraction; Arbitrary-precision arithmetic; Saturation arithmetic; Mathematics; Real number; Second-order arithmetic; Set (abstract data type); Floating point; Algorithm; Computer science; Discrete mathematics; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01825708143144391,"gpt":0.2500798188606352,"spread":0.2318227374291913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782736,0.00002833792,0.0000501896,0.00004292838,0.0000380855,0.0000543578,0.001200798,0.00001274351,0.0000457095],"category_scores_gemma":[0.0003320935,0.00001686089,0.00006969013,0.0001497998,0.00001447114,0.0002195442,0.0002358983,0.00009670974,0.000009786433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002141729,"about_ca_system_score_gemma":0.00003189189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001144802,"about_ca_topic_score_gemma":0.000002297674,"domain_scores_codex":[0.9996086,0.00003300158,0.0001388422,0.00003394118,0.0001346497,0.00005098732],"domain_scores_gemma":[0.9993505,0.00003394886,0.0001367453,0.0003837539,0.0000675328,0.00002747912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003575323,0.0001397183,0.06005742,0.000007143003,0.00009831308,0.00009920492,0.001557257,0.007578402,0.002084366,0.0152634,0.03719135,0.8758877],"study_design_scores_gemma":[0.00232735,0.0003936696,0.6223949,0.0002301417,0.00006312824,0.01206054,0.0002193959,0.1039185,0.003392344,0.1281931,0.1263983,0.0004086067],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09331795,0.00006873457,0.8532039,0.04893294,0.002094164,0.00003966565,1.322286e-7,0.00001782739,0.002324671],"genre_scores_gemma":[0.9348432,0.00003104404,0.06388153,0.0007341535,0.00009774676,1.268162e-7,1.408955e-8,0.000001825106,0.0004103368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8754791,"threshold_uncertainty_score":0.2231401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1487965496","doi":"","title":"SATLIB: An Online Resource for Research on SAT","year":2000,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":312,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Suite; Computer science; Resource (disambiguation); Implementation; Set (abstract data type); World Wide Web; Data science; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.184314762949718,"gpt":0.3995988594853813,"spread":0.2152840965356633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003717251,0.00005329251,0.00005338774,0.0001128162,0.0001660166,0.0001233984,0.0002876175,0.00003875418,0.0006409982],"category_scores_gemma":[0.00002475104,0.00004639291,0.00002486463,0.0002782221,0.00003253626,0.0002240658,0.00002334741,0.00009703977,0.0001364279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949366,"about_ca_system_score_gemma":0.00003845732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001788815,"about_ca_topic_score_gemma":0.00008245811,"domain_scores_codex":[0.9991414,0.0000764516,0.0001045628,0.0002616092,0.000222067,0.0001939341],"domain_scores_gemma":[0.9993325,0.0001463746,0.00001057623,0.000352897,0.00006913607,0.00008844975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002154686,0.00007983227,0.00006669198,0.000001785388,0.000002045537,9.199526e-7,0.0001812808,0.002704018,0.00004324149,0.05138212,0.006206565,0.93931],"study_design_scores_gemma":[0.0006898915,0.0005716697,0.009528513,0.0000129779,0.000001334052,0.000008885393,0.0001489857,0.5520504,0.0004954724,0.003411678,0.432889,0.0001911487],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1146115,0.00001449514,0.7551066,0.01572482,0.0001660881,0.0007437972,0.00001704931,0.0009206829,0.1126951],"genre_scores_gemma":[0.6591871,0.00002295371,0.3035148,0.003978574,0.0002752408,0.00003085421,0.00007126104,0.00002389376,0.0328953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9391188,"threshold_uncertainty_score":0.7018481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000977215","doi":"10.1080/00029890.2000.12005203","title":"A Better Bound on the Variance","year":2000,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Variance (accounting); Mathematics; Statistics; Combinatorics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.009707701948663027,"gpt":0.2248565767065913,"spread":0.2151488747579283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001303659,0.00009882449,0.000123805,0.00002483663,0.0001214019,0.0001431219,0.0003608967,0.00001662456,0.001681326],"category_scores_gemma":[0.00005722577,0.00006358808,0.0000509578,0.000290233,0.0002014577,0.0001292788,0.00002644457,0.0001098886,0.001233753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001977939,"about_ca_system_score_gemma":0.00001853335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001197621,"about_ca_topic_score_gemma":0.000002234342,"domain_scores_codex":[0.999177,0.0000646366,0.0001594028,0.0002054399,0.0002138523,0.0001796484],"domain_scores_gemma":[0.9990738,0.0003279069,0.00005050981,0.0004651052,0.00001799677,0.00006468807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006779888,0.00009079059,0.0000545813,0.000003774937,0.00001828392,0.000008470587,0.0005678931,0.0004843267,0.00003000191,0.7861922,0.003079879,0.209463],"study_design_scores_gemma":[0.0003276637,0.0002942454,0.01283559,0.00006327418,0.0000158339,0.00002819355,0.0001140423,0.4272164,0.0001486977,0.533468,0.02500754,0.0004805538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02358674,0.000006138533,0.4926222,0.0335036,0.00006057104,0.0002455031,0.000002866751,0.0002358529,0.4497365],"genre_scores_gemma":[0.9161146,0.000005083097,0.07087144,0.0116723,0.00005071521,0.0000411105,7.833562e-7,0.00001088734,0.00123306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8925279,"threshold_uncertainty_score":0.9995439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519526968","doi":"10.1007/3-540-46135-3_16","title":"Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Smoothing; Probabilistic logic; Computer science; Novelty; Scaling; Range (aeronautics); Algorithm; Focus (optics); Probabilistic analysis of algorithms; Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01669627243050656,"gpt":0.2472365281927607,"spread":0.2305402557622541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007016279,0.0003449792,0.0003320537,0.0005917397,0.0002934504,0.0005357375,0.0009229261,0.0002257584,0.00001710788],"category_scores_gemma":[0.00008732358,0.0003264509,0.0000810378,0.0003538787,0.0008594309,0.0002177413,0.0005390059,0.0004639884,0.00001101102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003611712,"about_ca_system_score_gemma":0.0002568035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006740942,"about_ca_topic_score_gemma":0.00002624178,"domain_scores_codex":[0.9972336,0.00002531836,0.0003867569,0.00124043,0.0006183833,0.00049551],"domain_scores_gemma":[0.9982206,0.0006579809,0.0001290519,0.0005987862,0.0002305432,0.0001630752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002039265,0.000008842007,0.000008519038,0.00003878476,0.000002697313,0.000005600685,0.0003870116,0.4685925,0.0000104154,0.01003908,0.000001165245,0.5209033],"study_design_scores_gemma":[0.0002502331,0.00008026871,0.00009835191,0.0002083581,0.000006073767,0.0000608691,3.261596e-7,0.9835444,0.00005655983,0.01518286,0.0001541648,0.0003575241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001715634,0.0001974403,0.9967602,0.0007583945,0.0008019588,0.0006787426,0.000005671594,0.0001307617,0.0004952581],"genre_scores_gemma":[0.5740873,0.00003302987,0.425052,0.0004993762,0.0001005624,0.00001319874,0.000006570482,0.00002885244,0.0001791207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5739157,"threshold_uncertainty_score":0.9999188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1490176645","doi":"10.1609/aaai.v24i1.7565","title":"Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Set (abstract data type); Algorithm; Domain (mathematical analysis); Exploit; Solver; Selection (genetic algorithm); Process (computing); Portfolio; Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04901435405641711,"gpt":0.2953699114374654,"spread":0.2463555573810483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004430297,0.0001719681,0.0001827947,0.0001530892,0.0002430292,0.0002675822,0.0008404367,0.000109757,0.0001566994],"category_scores_gemma":[0.0004790555,0.0001400365,0.0001175673,0.0004862118,0.0001754198,0.0003488934,0.00007214494,0.0002841632,0.00002327571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000272267,"about_ca_system_score_gemma":0.0001821267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000131676,"about_ca_topic_score_gemma":0.00001715284,"domain_scores_codex":[0.9985486,0.000008100714,0.0004621596,0.0003829003,0.0003335984,0.0002646692],"domain_scores_gemma":[0.9984714,0.0001139106,0.0003246852,0.0001849932,0.0008177216,0.00008726503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002074367,0.0000739505,0.0002155696,0.00002463725,0.000007898279,7.901794e-8,0.0001418018,0.0003236743,0.08006689,0.7845703,0.00007347293,0.134481],"study_design_scores_gemma":[0.00003213692,0.000081446,0.0003181641,0.00003772486,0.000006820145,0.00000359383,0.00003609075,0.57323,0.3909171,0.03511845,0.0001007993,0.0001176229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04372091,0.000001379577,0.9430262,0.003804643,0.0008666983,0.0006754732,0.000004664285,0.0002440244,0.007656014],"genre_scores_gemma":[0.9280593,0.000001931119,0.07149282,0.0002100733,0.00007000323,0.00005014623,7.39713e-7,0.000009953144,0.0001050078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8843384,"threshold_uncertainty_score":0.5710521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130202378","doi":"10.1111/j.0824-7935.2004.00234.x","title":"Preference‐Based Constrained Optimization with CP‐Nets","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Backtracking; Mathematical optimization; Computer science; Preference; Set (abstract data type); Pareto principle; Property (philosophy); Optimization problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04561028564651798,"gpt":0.2598856250634991,"spread":0.2142753394169811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001119695,0.0001688328,0.0001257861,0.0001734627,0.0001698173,0.0001922833,0.0003780184,0.00005727599,0.0001679775],"category_scores_gemma":[0.00004337315,0.0001558832,0.00003974597,0.0006097857,0.0001561705,0.0005185257,0.00004234674,0.000120182,0.00006745875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009737752,"about_ca_system_score_gemma":0.0005172011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001233139,"about_ca_topic_score_gemma":0.00000958282,"domain_scores_codex":[0.9986959,0.00003704357,0.0002815987,0.0004010809,0.0003831467,0.000201221],"domain_scores_gemma":[0.9990003,0.0001338093,0.000131255,0.0002311965,0.0003883956,0.0001150054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008527532,0.00004232502,0.0001589474,0.000004399599,0.000007941056,0.000005914398,0.0001116292,0.8564628,0.000005874734,0.1303721,0.00001130922,0.01280823],"study_design_scores_gemma":[0.0003325352,0.0001189994,0.000825321,0.00004797427,0.000004636108,0.00004567389,0.00002689072,0.9821427,0.0009632795,0.01520871,0.00006087499,0.0002223582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005527618,0.0000176146,0.9949422,0.001905087,0.0001476877,0.0002320314,0.000004742795,0.0002834154,0.001914421],"genre_scores_gemma":[0.5305465,0.000002741541,0.4689223,0.0004567966,0.00001076971,0.00001149209,0.00003021258,0.000005427376,0.00001376643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5299937,"threshold_uncertainty_score":0.6356732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978526866","doi":"10.5555/777092.777193","title":"An adaptive noise mechanism for walkSAT","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Noise (video); Computer science; Novelty; Satisfiability; Algorithm; Simple (philosophy); Process (computing); Noise measurement; Mathematical optimization; Artificial intelligence; Mathematics; Noise reduction","retraction":null,"screen_n_in":null,"score":{"opus":0.0285513143877047,"gpt":0.2366861883306424,"spread":0.2081348739429377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004521374,0.00005275057,0.0000473074,0.00004425794,0.00007564674,0.00006706072,0.0001629686,0.00002750805,0.0003664361],"category_scores_gemma":[0.000008858867,0.00004763909,0.0000272567,0.0000896666,0.000008567172,0.0004377479,0.00001610021,0.00002381612,0.0000621736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001508328,"about_ca_system_score_gemma":0.000006271202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006867318,"about_ca_topic_score_gemma":0.00001972568,"domain_scores_codex":[0.9995649,0.0000123444,0.00007573643,0.0001711048,0.00007421413,0.0001016688],"domain_scores_gemma":[0.9996311,0.00002331165,0.00002255054,0.0001891862,0.00007417981,0.00005966094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000131922,0.00002110068,0.000008501186,6.815504e-7,0.00000259471,4.641184e-7,0.0001814684,0.0002662517,0.0004010137,0.8972196,0.0006677018,0.1012293],"study_design_scores_gemma":[0.0001958404,0.0001093017,0.00009278156,0.000001140015,0.00000151407,0.000004221855,0.00003232118,0.9872848,0.001530902,0.01026235,0.0004060246,0.00007885489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003330905,0.000002917181,0.9896199,0.0009504818,0.0001765899,0.0001388716,0.000001368963,0.0001958595,0.008580984],"genre_scores_gemma":[0.6516907,0.000005035209,0.3464427,0.0007423501,0.00002348701,0.00001365634,9.371301e-7,0.000003209933,0.001077898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9870185,"threshold_uncertainty_score":0.4012218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145996207","doi":"10.1016/j.artint.2006.02.003","title":"Constraint-based optimization and utility elicitation using the minimax decision criterion","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Waterloo; University of Toronto","funders":"","keywords":"Regret; Minimax; Computer science; Mathematical optimization; Preference elicitation; Exploit; Set (abstract data type); Constraint (computer-aided design); Function (biology); Preference; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04697374374933979,"gpt":0.3001038880978434,"spread":0.2531301443485036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003799741,0.0001163784,0.0000918544,0.0001039604,0.0003494831,0.0003023098,0.0001943976,0.00006035927,0.00007635585],"category_scores_gemma":[0.0001272355,0.00009785039,0.00003791524,0.0004160394,0.000225807,0.0004285803,0.00004676208,0.00008384424,0.000008499415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003472082,"about_ca_system_score_gemma":0.00006944623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001596411,"about_ca_topic_score_gemma":0.0001018215,"domain_scores_codex":[0.9988384,0.0000928186,0.0003739248,0.0003126227,0.0002172389,0.0001649657],"domain_scores_gemma":[0.9991047,0.0002943814,0.0001179375,0.0002618068,0.000179823,0.00004132939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001635119,0.0000437549,0.0006868857,0.00000486298,0.000002534964,0.000002068257,0.0002064427,0.4560592,0.002199073,0.05856085,0.0000254329,0.4821925],"study_design_scores_gemma":[0.00002763626,0.00002122821,0.0009486803,0.00001635043,0.000005651892,0.000009067332,0.0001273572,0.9742193,0.01122184,0.01323608,0.00005780737,0.0001090174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04211002,0.00003750501,0.9562141,0.0008598503,0.0002727958,0.0001959406,0.000002712527,0.00008873617,0.0002183162],"genre_scores_gemma":[0.7805293,0.00000586517,0.2192339,0.0001784535,0.00003522352,0.000004094633,0.000005361921,0.000004388748,0.000003458746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7384193,"threshold_uncertainty_score":0.3990223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W139194355","doi":"10.1007/978-3-642-23786-7_19","title":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Sequence (biology); Computer science; Conjunctive normal form; Boolean satisfiability problem; Generalization; Satisfiability; Algorithm; Set (abstract data type); Mathematical optimization; Theoretical computer science; Mathematics; Boolean function; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02642937924592157,"gpt":0.2449300714418118,"spread":0.2185006921958902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006101414,0.0004530859,0.0005092592,0.0006468619,0.0002248028,0.0002924204,0.002128666,0.0002745111,0.0001180659],"category_scores_gemma":[0.00009632752,0.0004352596,0.0001243637,0.000572926,0.0008800391,0.001073968,0.0007936121,0.0005500386,0.0000205634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002366295,"about_ca_system_score_gemma":0.0005606828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005989789,"about_ca_topic_score_gemma":0.0001689082,"domain_scores_codex":[0.9967443,0.00003503223,0.0006584238,0.00119993,0.000815529,0.0005468223],"domain_scores_gemma":[0.9977391,0.0003166416,0.0005245652,0.0009705229,0.0003001165,0.0001491041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005401781,0.0000209079,0.000410355,0.00005976844,0.00001488747,0.00002585927,0.00181311,0.008946307,0.001760682,0.01936282,0.00006629613,0.9675136],"study_design_scores_gemma":[0.0006686467,0.0003229054,0.0004819916,0.001462186,0.00002533934,0.0001809896,0.000002018674,0.8016391,0.009155203,0.1803754,0.00369457,0.001991661],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001180041,0.0004496698,0.9918857,0.0002525898,0.001145381,0.0002742187,0.00001558246,0.000139372,0.005719459],"genre_scores_gemma":[0.5275186,0.000231855,0.4707845,0.000952346,0.0001339679,0.000006712884,0.00001264739,0.00003623388,0.0003230766],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9655219,"threshold_uncertainty_score":0.9998099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1660649481","doi":"10.1007/b138243","title":"Fuzzy Modeling with Spatial Information for Geographic Problems","year":2005,"lang":"en","type":"book","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Geographic information system; Computer science; Fuzzy logic; Spatial analysis; Cartography; Geography; Data science; Information retrieval; Artificial intelligence; Remote sensing","retraction":null,"screen_n_in":null,"score":{"opus":0.01011123818097235,"gpt":0.1942757624426246,"spread":0.1841645242616523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001151168,0.0001885035,0.00015964,0.0003181486,0.0001104752,0.000257512,0.0002531057,0.0001668468,0.00003462744],"category_scores_gemma":[0.000005590615,0.0001581711,0.00007487996,0.0000874441,0.00002125579,0.001161335,0.0000444481,0.0001385485,0.00002936495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007028267,"about_ca_system_score_gemma":0.0003551532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004303388,"about_ca_topic_score_gemma":0.0004392364,"domain_scores_codex":[0.9990451,0.000006657209,0.0003064565,0.0002141947,0.0002552789,0.0001723301],"domain_scores_gemma":[0.9992098,0.00002248142,0.0001737675,0.0002671905,0.0002671755,0.00005958907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000929293,0.00000833968,0.000009772459,0.00007937055,0.00003552719,1.93859e-7,0.0002023271,0.3907683,2.50293e-7,0.1737507,0.001971041,0.4331649],"study_design_scores_gemma":[0.0003887321,0.0000686639,0.000007350269,0.00005895206,0.00001353142,0.000008556707,0.000003539622,0.9503507,9.090589e-7,0.005629273,0.04322621,0.0002435884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[6.678568e-7,0.0000115424,0.7344931,0.0002396133,0.0001188244,0.0005441964,0.000006612456,0.0002096383,0.2643758],"genre_scores_gemma":[0.00703756,0.0001828535,0.7679296,0.001710802,0.0005990883,0.0003338449,0.0009945756,0.00005637527,0.2211553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5595824,"threshold_uncertainty_score":0.645003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033044509","doi":"10.1609/aaai.v35i5.16484","title":"Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Combinatorial optimization; Mathematical optimization; Reinforcement learning; Constraint programming; Knapsack problem; Travelling salesman problem; Computer science; Optimization problem; Solver; Heuristics; Context (archaeology); Quadratic assignment problem; Integer programming; Lin–Kernighan heuristic; Mathematics; Stochastic programming; 2-opt; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04400025295225241,"gpt":0.2862828622392445,"spread":0.2422826092869921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003616845,0.0001406656,0.0001766624,0.0000584432,0.0003077993,0.0003552356,0.0003070614,0.0000690153,0.00003847718],"category_scores_gemma":[0.0006263028,0.0001254873,0.00006652033,0.0003537303,0.000172443,0.0003015788,0.0001862149,0.0001797525,0.000002010976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003453405,"about_ca_system_score_gemma":0.0001297115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004315205,"about_ca_topic_score_gemma":0.000001310013,"domain_scores_codex":[0.9987566,0.00001720846,0.0004085898,0.0003443505,0.0002602009,0.0002130037],"domain_scores_gemma":[0.9985519,0.0001149301,0.0003024382,0.0001031299,0.0008621378,0.00006543025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002154603,0.0000386939,0.0002049109,0.00003250692,0.00001204635,2.067161e-7,0.0006026276,0.0115629,0.00304412,0.8797358,0.000007985888,0.1047366],"study_design_scores_gemma":[0.0001208014,0.0001981697,0.00002138372,0.0001632886,0.00001435483,0.00001038676,0.001119015,0.8353307,0.1353212,0.02728781,0.0002280732,0.0001848817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004494737,0.00001650323,0.9883503,0.002113572,0.0006180364,0.0005090354,0.000001000501,0.00009588645,0.00380094],"genre_scores_gemma":[0.9408212,0.0000449069,0.05889666,0.0000740082,0.00003168352,0.00003411475,0.000002246302,0.000007429591,0.00008774458],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9363264,"threshold_uncertainty_score":0.5117223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1591802374","doi":"10.1007/978-3-540-24605-3_26","title":"Effective Preprocessing with Hyper-Resolution and Equality Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; DPLL algorithm; Reduction (mathematics); Search tree; Preprocessor; Pruning; Solver; Boolean satisfiability problem; Tree (set theory); Algorithm; Node (physics); Benchmark (surveying); Theoretical computer science; Mathematical optimization; Search algorithm; Artificial intelligence; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01220269376855133,"gpt":0.2419361708464378,"spread":0.2297334770778865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005292647,0.0003023132,0.0002652942,0.0004349429,0.0003054816,0.0004394761,0.0004601668,0.0001880104,0.000008902201],"category_scores_gemma":[0.0000405251,0.0002638563,0.00003544184,0.0004188949,0.0006731712,0.0008876286,0.0002889068,0.0004330463,0.000004684621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004105555,"about_ca_system_score_gemma":0.0004481798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003076614,"about_ca_topic_score_gemma":0.00006118829,"domain_scores_codex":[0.9977319,0.00003429371,0.0002603215,0.001157583,0.000521729,0.0002941199],"domain_scores_gemma":[0.998832,0.0001114434,0.0002244824,0.0005157012,0.0002142183,0.0001021116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009121229,0.0000103685,0.00007234032,0.0000367056,0.000004971585,0.000005389894,0.0007291597,0.1121888,0.0001057384,0.012532,3.929225e-7,0.874305],"study_design_scores_gemma":[0.0009931513,0.000496398,0.003638614,0.001340055,0.00002529421,0.0006764103,0.000001106923,0.7942363,0.002368834,0.1948678,0.0002207273,0.001135231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004924664,0.000161437,0.9956425,0.0004841953,0.000502218,0.0004434275,0.000001252957,0.0001587518,0.002113719],"genre_scores_gemma":[0.6254832,0.00002387947,0.3740573,0.0001819915,0.0001494092,0.00001007236,0.000003074905,0.00001472579,0.00007639467],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8731698,"threshold_uncertainty_score":0.9999813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092520161","doi":"10.1016/s0304-3975(01)00164-5","title":"Frozen development in graph coloring","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Graph coloring; Complete coloring; Combinatorics; Fractional coloring; Edge coloring; Mathematics; List coloring; Discrete mathematics; Random graph; Greedy coloring; Dense graph; Graph; Line graph; Graph power; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01116320134667742,"gpt":0.2351134554278947,"spread":0.2239502540812173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836393,0.0001034638,0.0001092226,0.0003125076,0.0002239774,0.0002479296,0.0009770647,0.00003031476,0.00007014469],"category_scores_gemma":[0.00003599549,0.00009404594,0.00002209985,0.001594036,0.0006656058,0.0005997237,0.0004177882,0.0001188205,0.00006395295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008835911,"about_ca_system_score_gemma":0.0001438253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002685362,"about_ca_topic_score_gemma":0.000006498279,"domain_scores_codex":[0.998503,0.00004374915,0.0002295125,0.0004435555,0.0004038032,0.0003764385],"domain_scores_gemma":[0.9993365,0.00008211182,0.00003457507,0.0003169576,0.00007978896,0.0001500931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002704318,0.000023968,0.002488123,0.000001025078,8.206798e-7,0.00001504867,0.0004294388,0.001134956,0.00008213061,0.8487735,0.000004775812,0.1470435],"study_design_scores_gemma":[0.0004523612,0.0000645412,0.06693605,0.00003731313,0.000001044034,0.00008122958,0.00001185779,0.8699444,0.002199694,0.05910911,0.000829844,0.000332558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09607591,0.000005626883,0.8975837,0.000560933,0.0003550904,0.00009384772,6.409378e-8,0.000130515,0.005194379],"genre_scores_gemma":[0.7476379,0.000004151887,0.2520613,0.0002627735,0.00001999711,0.000004581352,2.124687e-7,0.000002263665,0.000006822331],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8688095,"threshold_uncertainty_score":0.3835082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1871585472","doi":"10.14288/1.0051500","title":"SATenstein : automatically building local search SAT solvers from components","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Boolean satisfiability problem; Satisfiability; Task (project management); Context (archaeology); Solver; Local search (optimization); Range (aeronautics); Satisfiability modulo theories; Theoretical computer science; Selection (genetic algorithm); Programming language; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009889219578066074,"gpt":0.1833860784666706,"spread":0.1734968588886046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001306221,0.00004276745,0.0001872526,0.00005741469,0.0002230123,0.000193181,0.0005012599,0.00008393022,0.000115281],"category_scores_gemma":[0.00001124572,0.0001501893,0.00008680304,0.0002964498,0.0001678061,0.0005810638,0.0001345632,0.0001263422,0.00003957094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009970208,"about_ca_system_score_gemma":0.00007762593,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02673743,"about_ca_topic_score_gemma":0.01963608,"domain_scores_codex":[0.9988852,0.00006471616,0.0001283532,0.0003597793,0.000335493,0.0002264667],"domain_scores_gemma":[0.999321,0.00005156414,0.00006958964,0.0002767996,0.0001301655,0.0001508151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00000356148,0.00006199402,0.003076031,0.000006465898,0.00001869241,0.0001002573,0.000220371,0.0007360907,0.001566546,0.0000585907,0.0004280119,0.9937234],"study_design_scores_gemma":[0.000637917,0.00004568376,0.8526651,0.00007327259,0.000008586896,0.00002258077,0.0002353194,0.1454987,0.000005149478,0.00062784,0.00004425567,0.0001356807],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5321909,0.00001049998,0.4667941,0.0002685092,0.00007131486,0.0000765633,0.00001578619,0.0001201615,0.0004521626],"genre_scores_gemma":[0.9450041,0.00001676157,0.05475555,0.0001224689,0.00001047543,5.557252e-8,0.00001505494,0.000003766241,0.00007175826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9935877,"threshold_uncertainty_score":0.998253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047467760","doi":"10.1002/rsa.20061","title":"Cores in random hypergraphs and Boolean formulas","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; struct; Mathematics; Literal (mathematical logic); Combinatorics; Core (optical fiber); Discrete mathematics; Random graph; Algorithm; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.005996719707171033,"gpt":0.2216096229441444,"spread":0.2156129032369733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497027,0.0001315614,0.0002102367,0.0001391656,0.0001151567,0.0001548235,0.000108587,0.00005737435,0.00002661591],"category_scores_gemma":[0.00002535888,0.0001046856,0.00003725708,0.0001458161,0.00006816487,0.0003437616,0.00005824459,0.0001051304,9.321845e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001041604,"about_ca_system_score_gemma":0.00001926506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004060765,"about_ca_topic_score_gemma":0.000107544,"domain_scores_codex":[0.9991882,0.00004054911,0.0002018286,0.0002650274,0.0001265595,0.0001778016],"domain_scores_gemma":[0.9996022,0.0001046425,0.00005116937,0.0001342385,0.00002236842,0.0000853724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001145,0.000009977838,0.002953678,0.00001040011,0.00001590482,0.000006974883,0.0006842443,0.001211436,0.0001366391,0.01764753,0.0001057423,0.977103],"study_design_scores_gemma":[0.04240464,0.0001086043,0.1171874,0.00004546648,0.00002324391,0.0003195844,0.0001556412,0.8058005,0.0009096539,0.02196975,0.01042675,0.0006487581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.314379,0.002912445,0.6772009,0.002473271,0.0004632635,0.0006627478,0.00001173586,0.0001931334,0.001703487],"genre_scores_gemma":[0.9569929,0.0006382672,0.04193955,0.000279917,0.00007761501,0.000006756823,0.00000311672,0.000005856532,0.00005597995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764542,"threshold_uncertainty_score":0.4268954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1258972194","doi":"10.1613/jair.4726","title":"AutoFolio: An Automatically Configured Algorithm Selector","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Benchmark (surveying); Parameterized complexity; Set (abstract data type); Algorithm; Exploit; Hyperparameter; Variety (cybernetics); Selection (genetic algorithm); Range (aeronautics); State (computer science); Machine learning; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2320042108967314,"gpt":0.4389980739433883,"spread":0.2069938630466569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004610363,0.0001038374,0.0002064978,0.0006055731,0.0001548519,0.0005296979,0.0009162091,0.00009301355,0.0001688228],"category_scores_gemma":[0.001084271,0.00008896671,0.00007431196,0.001168406,0.0001818417,0.001098796,0.0000958219,0.000573651,0.0001717925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001759957,"about_ca_system_score_gemma":0.001236416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003206591,"about_ca_topic_score_gemma":0.00002494985,"domain_scores_codex":[0.9967655,0.0005134497,0.0007009537,0.0002092095,0.001407541,0.0004033814],"domain_scores_gemma":[0.9958146,0.0002620699,0.0001908997,0.0003086265,0.002851911,0.0005718495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002765334,0.0001703619,0.00002901121,0.000003716361,0.00001849187,0.00007037818,0.00151497,0.001668709,0.001404746,0.0763135,0.0006040996,0.9181744],"study_design_scores_gemma":[0.0000602312,0.0008408852,0.0001664333,0.00002616648,0.000003749448,0.0002033418,0.0009220534,0.9303192,0.01444951,0.05174135,0.001142715,0.0001243154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005495106,0.00004591129,0.9904596,0.001941539,0.0005630216,0.000127909,0.000001106044,0.00005614448,0.001309694],"genre_scores_gemma":[0.5792866,0.00003566895,0.419948,0.0000992832,0.0004735946,0.000003848543,0.000001192843,0.00001373464,0.0001379622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9286506,"threshold_uncertainty_score":0.5107889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W32539537","doi":"10.1007/978-3-642-31612-8_18","title":"Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Solver; Exploit; Computer science; Portfolio; Set (abstract data type); Competition (biology); Algorithm; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02370113490786962,"gpt":0.3029840092867271,"spread":0.2792828743788575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001311103,0.0004986848,0.0004748005,0.001107782,0.0004298972,0.0004185492,0.001460062,0.0002741214,0.0001877878],"category_scores_gemma":[0.0001479124,0.0004962869,0.0001505101,0.0009352439,0.0003072464,0.0005263388,0.0005788099,0.0006433725,0.0001163815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008073035,"about_ca_system_score_gemma":0.001146965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003018503,"about_ca_topic_score_gemma":0.00004030842,"domain_scores_codex":[0.9960841,0.00006380043,0.0006076334,0.001193822,0.0012345,0.0008161733],"domain_scores_gemma":[0.9971917,0.000410562,0.0003048048,0.0009677521,0.0007089734,0.0004162049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002498462,0.00002634705,0.00006152478,0.000006415821,0.000008822287,0.0000102277,0.000151906,0.1061699,0.0002051166,0.003783045,0.00003101181,0.8895431],"study_design_scores_gemma":[0.0003745675,0.0001450249,0.0005285112,0.0001742178,0.00001547123,0.00003895377,9.601641e-8,0.9890248,0.001378653,0.006237751,0.001437541,0.0006444583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003740852,0.0002247043,0.9948905,0.001202243,0.001999405,0.000669784,0.00002970899,0.0002575462,0.0006886636],"genre_scores_gemma":[0.05676802,0.00001389972,0.9400156,0.002518318,0.0004708479,0.00002308444,0.00003178265,0.00003240774,0.0001260424],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8888987,"threshold_uncertainty_score":0.9997489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155616412","doi":"10.1007/s10732-006-6550-4","title":"On global warming: Flow-based soft global constraints","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Cardinality (data modeling); Graph; Constraint graph; Constraint satisfaction; Computer science; Mathematical optimization; Consistency (knowledge bases); Flow (mathematics); Mathematics; Theoretical computer science; Discrete mathematics; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.008280661343385138,"gpt":0.2432512250558484,"spread":0.2349705637124633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000208978,0.0001209315,0.0001713331,0.00005537787,0.00008212189,0.0001289827,0.0003080825,0.00006312664,0.0000582966],"category_scores_gemma":[0.0001961339,0.0001089689,0.0001083434,0.0002633895,0.00009252691,0.0001427572,0.00002606366,0.0001356697,0.00002405137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002185561,"about_ca_system_score_gemma":0.0003336177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005346445,"about_ca_topic_score_gemma":0.000008121459,"domain_scores_codex":[0.9987565,0.00005111123,0.0004474347,0.0001307809,0.0004325819,0.000181616],"domain_scores_gemma":[0.9989982,0.0001058876,0.0003323395,0.0001670743,0.0002857024,0.0001107825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001091936,0.0005436801,0.02681994,0.00002930836,0.00005577675,0.0008180873,0.00003120699,0.3926876,0.00004960959,0.2877679,0.04004012,0.2510476],"study_design_scores_gemma":[0.003478276,0.0006393377,0.05036538,0.0001589189,0.00006557591,0.001409487,0.00002493819,0.8741205,0.0002266668,0.06192823,0.007057086,0.0005256173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004827246,0.00003400846,0.9884618,0.0009267806,0.00114192,0.00004478317,0.0000252611,0.00003934595,0.004498836],"genre_scores_gemma":[0.8584988,0.000002923682,0.1408361,0.0004904709,0.0001488275,2.368952e-7,0.000002040662,0.000003236273,0.00001744577],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8536715,"threshold_uncertainty_score":0.4443624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984853564","doi":"10.1016/s0004-3702(01)00151-5","title":"Local search characteristics of incomplete SAT procedures","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Weighting; Local search (optimization); Descent (aeronautics); Computer science; Mathematical optimization; Linear search; Mathematics; Algorithm; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05189737654584579,"gpt":0.2973862910330178,"spread":0.2454889144871721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883961,0.00008786216,0.0001230636,0.0001085497,0.00008542923,0.00006629685,0.0003619337,0.00004344547,0.0001586185],"category_scores_gemma":[0.00009104061,0.00008724732,0.00004109109,0.0004676417,0.0001584132,0.000237102,0.0001003477,0.00009530167,0.0001687763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002591616,"about_ca_system_score_gemma":0.0001037994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005286291,"about_ca_topic_score_gemma":0.00008575604,"domain_scores_codex":[0.9989676,0.00004008409,0.0003496692,0.0002235099,0.0002313965,0.0001877731],"domain_scores_gemma":[0.9993275,0.00008068798,0.00007876271,0.0002564258,0.0001868955,0.00006976198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001739539,0.00005878888,0.003964273,0.00001451618,0.000006502678,0.000009593444,0.0006018879,0.002663611,0.002330594,0.1814992,0.00002012699,0.8088135],"study_design_scores_gemma":[0.00003693921,0.0001749712,0.03147284,0.00006165062,0.000007316013,0.00007438603,0.0004710605,0.873495,0.07085121,0.0222414,0.000764386,0.0003488098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05780605,0.00001091671,0.9404442,0.0007069555,0.0001944858,0.000101238,0.000002479107,0.00007244054,0.0006612394],"genre_scores_gemma":[0.9889168,0.00004196765,0.0108244,0.0001294394,0.00003765797,0.000003557601,0.000003785309,0.000004809631,0.0000376481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9311107,"threshold_uncertainty_score":0.3557843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025473159","doi":"10.1007/s10951-008-0080-x","title":"A theoretic and practical framework for scheduling in a stochastic environment","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0288714523609218,"gpt":0.2837969058946502,"spread":0.2549254535337284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761483,0.00007342865,0.0001467613,0.000146824,0.00008491743,0.00004827068,0.00008583607,0.00005960038,0.0000116645],"category_scores_gemma":[0.0006265122,0.00006601949,0.00004710882,0.0001043051,0.00006290593,0.0003960899,0.00003847445,0.0002738255,0.000001699061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004596685,"about_ca_system_score_gemma":0.000101551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.509446e-7,"about_ca_topic_score_gemma":2.426973e-7,"domain_scores_codex":[0.999204,0.00003582524,0.0003230477,0.0001211954,0.0001814162,0.000134462],"domain_scores_gemma":[0.999097,0.0004619645,0.0002206985,0.00008790578,0.00004708956,0.00008526965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001157037,0.0001561889,0.003631903,0.00002793173,0.00004020314,0.0001388281,0.00303035,0.6718939,0.0005558111,0.3047951,0.00000614733,0.01560796],"study_design_scores_gemma":[0.0009167529,0.0001726351,0.003770546,0.0001762788,0.00001461242,0.00168819,0.0002678622,0.9532118,0.0001218845,0.03948605,0.00003417372,0.0001392041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1512848,0.0001436711,0.8460975,0.002256305,0.0001189953,0.00008083607,1.70708e-7,0.00000688627,0.00001086706],"genre_scores_gemma":[0.511256,0.00006718138,0.488558,0.00007161316,0.00004122422,0.000001507607,5.057466e-8,0.000002857329,0.00000158893],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3599712,"threshold_uncertainty_score":0.2692197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999823208","doi":"10.5555/777092.777187","title":"Enhancing Davis Putnam with extended binary clause reasoning","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"DPLL algorithm; Backtracking; Computer science; Heuristics; Boolean satisfiability problem; Binary number; Solver; Satisfiability; Theoretical computer science; Heuristic; Conjunctive normal form; Algorithm; Artificial intelligence; Mathematics; Programming language; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01142885634625179,"gpt":0.2137317807357935,"spread":0.2023029243895417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007882024,0.00008869747,0.00007745907,0.00008787312,0.0001269531,0.0001294161,0.0001770497,0.00003089128,0.0007993817],"category_scores_gemma":[0.00001783738,0.00007208734,0.0000217423,0.0003378069,0.00002418883,0.0005966302,0.00005483671,0.00008027453,0.0001129136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002856875,"about_ca_system_score_gemma":0.00001665848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001595924,"about_ca_topic_score_gemma":0.00004448549,"domain_scores_codex":[0.9992672,0.00002573531,0.0001223024,0.0002527112,0.0001632705,0.0001688007],"domain_scores_gemma":[0.9995077,0.00003065286,0.00004683804,0.0002901022,0.00004864672,0.00007604554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002022363,0.0002971232,0.007573633,0.00003121696,0.00007957774,0.0002287482,0.004313387,0.007720389,0.007637268,0.1905691,0.006274257,0.7752551],"study_design_scores_gemma":[0.000600145,0.0001646471,0.01447666,0.0000569305,0.000007730551,0.0001726298,0.000136555,0.978354,0.00358137,0.0001433864,0.001958923,0.000346993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007680342,0.00002989808,0.9626411,0.0008251495,0.000112088,0.00008127707,2.122177e-7,0.0003767941,0.02825315],"genre_scores_gemma":[0.7194973,0.00002061704,0.2775578,0.0003534734,0.00002053528,0.000005030794,9.295761e-7,0.000005908192,0.002538463],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9706336,"threshold_uncertainty_score":0.8752669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125336041","doi":"","title":"Generalized nogoods in CSPs","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Solver; Computer science; Boolean satisfiability problem; Mathematical optimization; Yield (engineering); Artificial intelligence; Theoretical computer science; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1145998237209562,"gpt":0.3476652843411281,"spread":0.2330654606201719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854817,0.0001306389,0.0001228227,0.0003131708,0.00009213348,0.000184638,0.0004305058,0.00007813715,0.0007465421],"category_scores_gemma":[0.0001938194,0.0001359837,0.00004427219,0.0005435183,0.00005961433,0.0004912778,0.00005111668,0.0001877977,0.0006811395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001556507,"about_ca_system_score_gemma":0.0002457108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002114101,"about_ca_topic_score_gemma":0.0003390549,"domain_scores_codex":[0.9984223,0.00007768898,0.0003981447,0.0003673489,0.000524693,0.0002098341],"domain_scores_gemma":[0.999227,0.0001083102,0.00008696192,0.0001831595,0.0003190459,0.00007555398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008170186,0.00005651918,0.00006331361,7.503559e-7,0.000001724894,0.000001160195,0.0001393375,0.0183187,0.0003856324,0.7184158,0.00006182664,0.2625471],"study_design_scores_gemma":[0.00005816862,0.00003708455,0.001527327,0.00001696569,8.460962e-7,0.000004765955,0.00003519097,0.8696401,0.01286407,0.1143181,0.001295974,0.0002014121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007964488,0.00001372893,0.9436952,0.01270048,0.0003265194,0.0001917076,0.000005328826,0.0001432688,0.03495928],"genre_scores_gemma":[0.9621134,0.00002652579,0.03623861,0.001291452,0.0001051049,0.00002114734,0.000006625835,0.000004910748,0.0001922158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9541489,"threshold_uncertainty_score":0.8754898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147012241","doi":"10.1016/s0304-3975(01)00154-2","title":"Rigorous results for random (2+p)-SAT","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01110638169363145,"gpt":0.2534107792008292,"spread":0.2423043975071978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410612,0.0001380332,0.0001605821,0.0001668348,0.0004629553,0.0004481437,0.0012353,0.0000447303,0.00002736803],"category_scores_gemma":[0.0002326369,0.000114691,0.00007286738,0.0008936697,0.001191313,0.0006610653,0.0003001348,0.00009542704,0.0000661918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000515756,"about_ca_system_score_gemma":0.0001117693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001743676,"about_ca_topic_score_gemma":0.000001403433,"domain_scores_codex":[0.9981244,0.00005781015,0.0002963593,0.0006321662,0.0004310355,0.0004582213],"domain_scores_gemma":[0.9984214,0.0004399481,0.00007025204,0.0006020323,0.0002457676,0.0002205458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006582385,0.00002421764,0.0000286479,0.00000168348,0.000002042401,0.00000490856,0.0001916363,0.001007779,0.00009129958,0.8776513,0.0001713391,0.1207593],"study_design_scores_gemma":[0.001665946,0.0001529444,0.0006730928,0.00001081873,0.000003357013,0.00008688302,0.000003526435,0.9123986,0.0005811125,0.08237204,0.00186238,0.0001892788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003289905,0.000008421133,0.9854616,0.002991371,0.0008518701,0.0002996493,0.00000331265,0.0002815281,0.006812362],"genre_scores_gemma":[0.7039872,0.000006250111,0.2952616,0.0005863193,0.0001059302,0.000009526894,0.000002084769,0.000003902286,0.00003724364],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9113908,"threshold_uncertainty_score":0.4676963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104749823","doi":"","title":"Learning to solve QBF","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Solver; Heuristic; Boolean satisfiability problem; Mathematical optimization; Maximum satisfiability problem; Boolean data type; Classifier (UML); Set (abstract data type); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Boolean function","retraction":null,"screen_n_in":null,"score":{"opus":0.008842868261025316,"gpt":0.2458777848377235,"spread":0.2370349165766981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001775904,0.00003061963,0.00002787144,0.00006487158,0.00005473928,0.00005038568,0.0001005404,0.00001507048,0.0001624744],"category_scores_gemma":[0.00002713133,0.00002865719,0.00001330983,0.0001932322,0.000004459022,0.0001348826,0.00004370443,0.00004328079,0.0002523801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001360909,"about_ca_system_score_gemma":0.00001102886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009683136,"about_ca_topic_score_gemma":0.00003541819,"domain_scores_codex":[0.9996427,0.000003577138,0.00006781643,0.0001039337,0.0000787089,0.0001032194],"domain_scores_gemma":[0.9997781,0.00002857318,0.00001190636,0.00008635841,0.00002948085,0.00006558607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001685527,0.000007626266,0.002833133,8.260876e-7,0.000002608137,0.000004473474,0.0009963354,0.006412263,0.0009414122,0.1264213,0.001050669,0.8613276],"study_design_scores_gemma":[0.0009303344,0.0004112851,0.2520827,0.0000222791,0.000005351046,0.00008392797,0.001392059,0.4560632,0.02183157,0.00275931,0.2634858,0.0009320701],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0029988,0.000001227883,0.9314801,0.0007808311,0.0001379565,0.0000343847,1.757109e-8,0.0001829096,0.06438376],"genre_scores_gemma":[0.6070768,8.198058e-7,0.3898621,0.0009397455,0.00002288426,6.037209e-7,2.776317e-7,0.000001796728,0.002094998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8603956,"threshold_uncertainty_score":0.324392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993886628","doi":"10.1016/j.tcs.2008.12.049","title":"Affine systems of equations and counting infinitary logic","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unary operation; Discrete mathematics; Constraint satisfaction problem; Affine transformation; Counting problem; Abelian group; Datalog; Algebra over a field; Pure mathematics; Computer science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01276918873415195,"gpt":0.2434179504003676,"spread":0.2306487616662157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007210198,0.00008086475,0.0001226343,0.0001579587,0.0001885123,0.0001979841,0.0004798601,0.00002723378,0.00001483177],"category_scores_gemma":[0.0001081517,0.00006866446,0.00001877419,0.0007027502,0.000869533,0.0005046168,0.0001626591,0.00007380125,0.000005368766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001775109,"about_ca_system_score_gemma":0.00006418047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003124241,"about_ca_topic_score_gemma":3.040503e-7,"domain_scores_codex":[0.9989309,0.00004408809,0.00022503,0.00028189,0.000325168,0.0001929212],"domain_scores_gemma":[0.999177,0.000206694,0.0000711274,0.0002758868,0.0001744956,0.0000947552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.968395e-7,0.00001431692,0.00008787848,0.000002900537,8.123487e-7,0.000001029785,0.0001323597,0.002537407,0.0003391601,0.9562262,0.000004320312,0.04065267],"study_design_scores_gemma":[0.0001118319,0.0001204134,0.00535435,0.00002108828,0.00000222543,0.00002285083,0.000007413964,0.941218,0.0001990972,0.05284569,0.00000943404,0.00008761976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01028564,0.00003195388,0.985191,0.0009982694,0.0002201065,0.00009675758,6.958632e-7,0.00008869259,0.003086827],"genre_scores_gemma":[0.8869597,0.000004817036,0.1127244,0.0002762716,0.0000296497,7.972748e-7,4.06362e-7,0.000001239505,0.000002758852],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9386806,"threshold_uncertainty_score":0.3203831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1528564561","doi":"","title":"A fast and simple algorithm for bounds consistency of the all different constraint","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; Backtracking; Constraint programming; Constraint (computer-aided design); Consistency (knowledge bases); Constraint logic programming; Computer science; Constraint satisfaction; Mathematical optimization; Binary constraint; Benchmark (surveying); Constraint learning; Interleaving; Algorithm; Constraint satisfaction problem; Simple (philosophy); Mathematics; Artificial intelligence; Stochastic programming; Probabilistic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.01529265733168559,"gpt":0.2373962479057004,"spread":0.2221035905740148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008703204,0.00006740612,0.00009166353,0.00002561597,0.00008072084,0.00005029696,0.0001046824,0.00002654727,0.00005913679],"category_scores_gemma":[0.00003578297,0.00004362785,0.0000474602,0.00007036427,0.0001216767,0.0000725249,0.00003632037,0.00003250707,5.320277e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001168791,"about_ca_system_score_gemma":0.00005297293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006981522,"about_ca_topic_score_gemma":0.00003249881,"domain_scores_codex":[0.9994838,0.00003269737,0.0001509986,0.0001423649,0.00008581262,0.0001043028],"domain_scores_gemma":[0.9995773,0.00008729949,0.00005820955,0.0001749048,0.00006144428,0.00004081143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.225294e-7,0.00004028174,0.002420324,0.00001034557,0.00002491515,2.48562e-7,0.0003121494,0.00003773516,0.0003318049,0.5672998,0.0003272676,0.4291943],"study_design_scores_gemma":[0.002943872,0.0002440232,0.03119866,0.00002977277,0.00004936523,0.0001674784,0.0008939195,0.893168,0.01277932,0.04347118,0.01453801,0.0005163852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003396079,0.00001792792,0.9917001,0.0004448273,0.0001445355,0.0002202146,0.000007991046,0.00002680984,0.004041475],"genre_scores_gemma":[0.8606446,0.000009066081,0.1386849,0.0003941196,0.000004976265,0.00001178355,0.000001339472,0.000003034183,0.0002460915],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8931303,"threshold_uncertainty_score":0.1779092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W152517204","doi":"10.1007/s10462-004-5899-8","title":"Relation Algebras and their Application in Temporal and Spatial Reasoning","year":2005,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Binary relation; Relation (database); Spatial intelligence; Relational calculus; Converse; Relation algebra; Computer science; Spatial relation; Formalism (music); Algebra over a field; Mathematics; Relational model; Calculus (dental); Relational database; Discrete mathematics; Pure mathematics; Artificial intelligence; Information retrieval; Two-element Boolean algebra","retraction":null,"screen_n_in":null,"score":{"opus":0.02811598587504287,"gpt":0.2862117436893437,"spread":0.2580957578143008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004204136,0.00008729586,0.0001328413,0.00006457174,0.00006658278,0.00006064945,0.00009107291,0.00003725077,0.00001883628],"category_scores_gemma":[0.00007986512,0.0000779138,0.00001868102,0.0002736364,0.00004112245,0.0004006932,0.00004615278,0.00008747185,0.00002733289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002642752,"about_ca_system_score_gemma":0.00002301052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001430745,"about_ca_topic_score_gemma":0.0008743235,"domain_scores_codex":[0.9991837,0.00006235334,0.0003239014,0.0002522942,0.00007206196,0.0001056974],"domain_scores_gemma":[0.9996102,0.0000541454,0.0000945198,0.0001587181,0.00003480585,0.00004757758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.523563e-7,0.000008252811,0.00158153,0.00003276258,0.00000105136,2.047031e-7,0.0001818575,0.0000845002,0.00004325057,0.05081071,0.000005513509,0.9472495],"study_design_scores_gemma":[0.00003167502,0.00003214013,0.009329994,0.0007554202,0.000007148712,0.00003194365,0.00005925968,0.9671026,0.0009400737,0.01462588,0.006838062,0.000245836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003276125,0.009209979,0.9836303,0.003260789,0.00004445614,0.0003118275,3.474728e-7,0.00004806707,0.0002180834],"genre_scores_gemma":[0.9677029,0.01578284,0.01600556,0.0004329984,0.00003877447,0.00002241939,0.000004250201,0.000004004192,0.000006204561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9676248,"threshold_uncertainty_score":0.3177232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970251068","doi":"10.1016/s0166-218x(00)00262-6","title":"Investigations on autark assignments","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01423618923611557,"gpt":0.232626912351096,"spread":0.2183907231149804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009032254,0.000117423,0.0001082562,0.00005635973,0.0001340556,0.0001150813,0.0002703698,0.00004484815,0.0006577015],"category_scores_gemma":[0.00001235552,0.0001063885,0.00003468898,0.00022218,0.00004402862,0.0001376551,0.0000292397,0.00008689388,0.0007587862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003070031,"about_ca_system_score_gemma":0.00002856469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.485731e-7,"about_ca_topic_score_gemma":8.814382e-7,"domain_scores_codex":[0.9991722,0.000009267192,0.0002085039,0.0002072681,0.0002477416,0.0001550221],"domain_scores_gemma":[0.9993697,0.00006122335,0.00006146347,0.0004038282,0.00001322461,0.00009052608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001814402,0.00006638293,0.00001785432,0.00001432044,0.00001530456,0.000001398643,0.00121266,0.003254076,0.0005991049,0.9328787,0.001050582,0.06088778],"study_design_scores_gemma":[0.001247025,0.0001010684,0.001793256,0.000104738,0.00003717002,0.00002094319,0.0002927751,0.6392853,0.005722895,0.3352025,0.01528555,0.0009068433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005865746,0.000002017288,0.7709891,0.0006421804,0.00005761206,0.0002360803,0.000003975043,0.0002588549,0.2219444],"genre_scores_gemma":[0.4603258,0.00001211358,0.5371585,0.00101996,0.00003222503,0.00006329652,0.00001755456,0.00001704006,0.001353486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6360312,"threshold_uncertainty_score":0.9752914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575452963","doi":"10.1613/jair.788","title":"Conflict-Directed Backjumping Revisited","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Look-ahead; Beam stack search; Constraint learning; Consistency (knowledge bases); Local consistency; Heuristic; Computer science; Constraint satisfaction problem; Focus (optics); Constraint (computer-aided design); Mathematical optimization; Algorithm; Contrast (vision); Constraint satisfaction; Search algorithm; Mathematics; Artificial intelligence; Incremental heuristic search; Beam search","retraction":null,"screen_n_in":null,"score":{"opus":0.2109980789570575,"gpt":0.4285933742557623,"spread":0.2175952952987048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989935,0.00009018095,0.0001892185,0.000730199,0.0002326174,0.0003755818,0.0007112829,0.00007277869,0.0004856511],"category_scores_gemma":[0.001010364,0.00007997937,0.00009865154,0.00189516,0.000134482,0.0007034949,0.0001102479,0.000584496,0.0001871228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125705,"about_ca_system_score_gemma":0.0002509718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001813125,"about_ca_topic_score_gemma":0.00001332352,"domain_scores_codex":[0.9975235,0.0003450253,0.0006872815,0.0001928906,0.0008900285,0.0003612088],"domain_scores_gemma":[0.9969949,0.0004433955,0.0002132012,0.0002744553,0.001873086,0.0002009813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008028609,0.0001112604,0.0006649866,0.000009885238,0.000031661,0.0001807167,0.001041329,0.001697137,0.00857255,0.05620814,0.001375079,0.9300269],"study_design_scores_gemma":[0.000182253,0.0009001982,0.002936948,0.0004223748,0.000015233,0.001387485,0.001960676,0.8437591,0.05555571,0.03990287,0.05244819,0.0005289305],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01539029,0.0002397966,0.9774647,0.00298875,0.0003790898,0.0001334424,4.799164e-7,0.00006162696,0.003341817],"genre_scores_gemma":[0.9570758,0.001439995,0.04060103,0.0001389024,0.0004286122,0.000002308865,8.479052e-7,0.0000114902,0.0003010365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416855,"threshold_uncertainty_score":0.5317539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185085875","doi":"10.1016/j.artint.2015.11.002","title":"SATenstein: Automatically building local search SAT solvers from components","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Solver; Parameterized complexity; Boolean satisfiability problem; Local search (optimization); Satisfiability; Task (project management); Theoretical computer science; State (computer science); Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1141609460867904,"gpt":0.3091856572084594,"spread":0.195024711121669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003682791,0.000141126,0.0001565335,0.0001108219,0.0001322193,0.0002611647,0.0005532837,0.00007746703,0.0001119783],"category_scores_gemma":[0.0001077332,0.0001422252,0.00005569291,0.00039275,0.0001789644,0.0004864654,0.0002150413,0.0001684811,0.001017963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233394,"about_ca_system_score_gemma":0.0001379134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004778503,"about_ca_topic_score_gemma":0.00008531598,"domain_scores_codex":[0.9983195,0.0001030296,0.0003829749,0.0003975425,0.0004855087,0.0003114316],"domain_scores_gemma":[0.9989125,0.0001653205,0.00006208868,0.0003811704,0.0002020717,0.0002768374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002693945,0.00009209018,0.001146676,0.000004569478,0.00002652698,0.00003827766,0.002428401,0.07228913,0.004901001,0.1915883,0.0002235618,0.7272345],"study_design_scores_gemma":[0.00003987183,0.00004585366,0.0007377854,0.00002123285,0.000004508575,0.000007304021,0.0004681119,0.947593,0.02320391,0.02747157,0.0002246278,0.0001821629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07649842,0.00001856364,0.9204543,0.001157324,0.000697527,0.0001253476,0.000003305362,0.00026344,0.0007818172],"genre_scores_gemma":[0.8804225,0.000003928373,0.1191966,0.000277973,0.00006131485,0.000003448703,0.000008256258,0.000007663519,0.00001831983],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8753039,"threshold_uncertainty_score":0.9997599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2717681899","doi":"10.1111/tops.12277","title":"Representation and Computation in Cognitive Models","year":2017,"lang":"en","type":"article","venue":"Topics in Cognitive Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Science North","funders":"Air Force Office of Scientific Research; Office of Naval Research; National Science Foundation","keywords":"Cognition; Representation (politics); Computation; Computer science; Cognitive science; Cognitive model; Artificial intelligence; Theoretical computer science; Cognitive psychology; Psychology; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1057287436027888,"gpt":0.388826642501243,"spread":0.2830978988984542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004897785,0.00006987661,0.00009079956,0.0002546601,0.0003030864,0.0004117923,0.0002735259,0.00003057015,0.000006098434],"category_scores_gemma":[0.0006343105,0.00007569624,0.00001095148,0.0003799197,0.0004811734,0.00232601,0.0002136331,0.0001066197,0.000003087839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004523455,"about_ca_system_score_gemma":0.0001043124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001120589,"about_ca_topic_score_gemma":0.0002390886,"domain_scores_codex":[0.9989897,0.00003866315,0.0001574295,0.0004131928,0.0002349637,0.0001660335],"domain_scores_gemma":[0.9993604,0.0001337263,0.0001074753,0.0001422417,0.0002074302,0.0000486829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001224952,0.0000458451,0.1010848,0.000005406736,0.000002138645,0.00002825884,0.003558754,0.001792478,0.00009841158,0.03339048,0.000003205036,0.859978],"study_design_scores_gemma":[0.0005379714,0.00001721562,0.4726843,0.00006738566,0.000001231376,0.000006944906,0.0002802413,0.5015546,0.0004758968,0.02428649,9.393801e-7,0.00008672067],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2978967,0.00001391949,0.6832139,0.0006342831,0.0001977496,0.0002143324,0.000001835555,0.00002202544,0.01780521],"genre_scores_gemma":[0.9916766,0.00003025467,0.008075251,0.0001294368,0.00001463067,0.00001088844,0.000001539578,0.000001763491,0.00005968157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8598912,"threshold_uncertainty_score":0.3970922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481022196","doi":"10.1007/978-3-540-45193-8_11","title":"hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Computer science; Constraint satisfaction; Scheduling (production processes); Constraint satisfaction problem; Mathematical optimization; Modular design; Heuristic; Benchmark (surveying); Nurse scheduling problem; Constraint logic programming; Job shop scheduling; Operations research; Artificial intelligence; Flow shop scheduling; Programming language; Schedule; Mathematics; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.01152992932066334,"gpt":0.2606834279933662,"spread":0.2491534986727029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008151573,0.0003997867,0.0004364033,0.001137783,0.0002198144,0.0004534256,0.001112234,0.0002117812,0.00001073398],"category_scores_gemma":[0.00008179688,0.0004117693,0.00007650259,0.001056325,0.0002826175,0.0003716127,0.0003635364,0.0006236052,0.00002052472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018062,"about_ca_system_score_gemma":0.001084361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005553895,"about_ca_topic_score_gemma":0.0007467643,"domain_scores_codex":[0.9964905,0.00005417385,0.0006933993,0.001441514,0.000673444,0.0006469217],"domain_scores_gemma":[0.9982308,0.0001285073,0.0003034706,0.0008429416,0.0002381858,0.0002561249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001530781,0.0000130043,0.00004794421,0.00004019006,0.00000187705,0.000007501388,0.001904563,0.1887969,0.00001232477,0.01269895,0.000001984795,0.7964733],"study_design_scores_gemma":[0.0008527308,0.0004926049,0.0002441236,0.001521904,0.000005324762,0.0001262933,0.0000231137,0.9656593,0.0003596416,0.01634512,0.01275899,0.001610806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004074208,0.0003306016,0.9939911,0.002695875,0.0006153811,0.001211951,0.000003572143,0.0001574952,0.0009532899],"genre_scores_gemma":[0.1262324,0.0000247851,0.8712618,0.002295214,0.00008633212,0.00003823485,0.000009185404,0.00002364211,0.00002836556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7948624,"threshold_uncertainty_score":0.9998334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151266168","doi":"10.1023/a:1011402324562","title":"Random Constraint Satisfaction: A More Accurate Picture","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Complement (music); Constraint (computer-aided design); Mathematics; Applied mathematics; Point (geometry); Constraint satisfaction problem; Mathematical optimization; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01599495645134832,"gpt":0.257697762280475,"spread":0.2417028058291266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000251157,0.0002677118,0.0002721559,0.0001816609,0.0002556302,0.0002860586,0.0003963322,0.0001518009,0.002035794],"category_scores_gemma":[0.0001333641,0.0002555349,0.0001370603,0.0005169732,0.0004938515,0.0006767811,0.00009588165,0.0002807538,0.0002241694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007735831,"about_ca_system_score_gemma":0.0002307401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001106451,"about_ca_topic_score_gemma":0.00002850301,"domain_scores_codex":[0.9982227,0.00009473111,0.0004102696,0.0005260993,0.0003343577,0.0004118286],"domain_scores_gemma":[0.9987275,0.000149083,0.0001658962,0.0005424898,0.000173303,0.0002417107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00004073339,0.00004675278,0.01815141,0.00001260427,0.00008322719,0.0002388704,0.001039715,0.001401501,0.000749933,0.04922242,0.001567042,0.9274458],"study_design_scores_gemma":[0.03154939,0.000436667,0.5668484,0.0004677041,0.0001980483,0.01777721,0.00492702,0.2689226,0.002612902,0.01785837,0.08313899,0.005262672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01912964,0.00005436809,0.9537196,0.00355816,0.0009637079,0.0003908384,0.00001342434,0.0005789571,0.02159129],"genre_scores_gemma":[0.9747998,0.00007270847,0.02334752,0.001336155,0.0001077761,0.00002477356,0.00001058512,0.00001296545,0.0002877768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9556701,"threshold_uncertainty_score":0.9999897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018508868","doi":"10.1007/s11786-013-0149-6","title":"Near Sets: An Introduction","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Set (abstract data type); Combinatorics; Relation (database); Space (punctuation); Discrete mathematics; Data mining; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01423836951559186,"gpt":0.2504741927382823,"spread":0.2362358232226904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379511,0.0001027809,0.0001109863,0.0002202567,0.0001914364,0.0009869114,0.0009394075,0.00003111829,0.00008156303],"category_scores_gemma":[0.00004314112,0.00009517264,0.00001866739,0.001110555,0.000233267,0.002631191,0.0002517739,0.000105233,0.0001507372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007993904,"about_ca_system_score_gemma":0.0001075072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001473419,"about_ca_topic_score_gemma":0.000007830573,"domain_scores_codex":[0.9986442,0.00002893286,0.000263079,0.0004336196,0.0003688321,0.0002613366],"domain_scores_gemma":[0.9989355,0.000041048,0.00008080452,0.0006819417,0.0001523138,0.0001083957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.152907e-7,0.0002414282,0.0008939566,0.00002426946,0.000002532593,0.000003493207,0.005400152,0.04996397,0.000643765,0.1477848,0.0005985796,0.7944427],"study_design_scores_gemma":[0.00009146928,0.00003565114,0.004507522,0.000007586438,4.776188e-7,0.0000320779,0.0000164092,0.9794263,0.0002340841,0.01544643,0.00008426367,0.0001177005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06560889,0.000002152573,0.9310324,0.002120095,0.0006201944,0.0001909923,1.454961e-7,0.0001560154,0.000269155],"genre_scores_gemma":[0.2748832,0.000001104664,0.7248589,0.0001751844,0.00005689001,0.00001067084,5.038585e-7,0.000003429355,0.00001020716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9294624,"threshold_uncertainty_score":0.9516808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076946745","doi":"10.1016/j.ic.2009.05.003","title":"The complexity of constraint satisfaction games and QCSP","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Ministerio de Educación, Cultura y Deporte","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Local consistency; Constraint (computer-aided design); Constraint satisfaction dual problem; Mathematics; Predicate (mathematical logic); Surjective function; Sentence; Set (abstract data type); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01776225052734606,"gpt":0.2474102144643625,"spread":0.2296479639370164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000175196,0.00006212114,0.00006926864,0.00007454691,0.0001990151,0.0001994117,0.00005096711,0.0000290101,0.000002783883],"category_scores_gemma":[0.00002840045,0.00004965562,0.00001503757,0.0001285669,0.0001665748,0.001086296,0.00001937434,0.00005078502,0.000002574066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001278763,"about_ca_system_score_gemma":0.00002709177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560766,"about_ca_topic_score_gemma":0.00001108127,"domain_scores_codex":[0.9994357,0.00003177281,0.0002699789,0.00006688283,0.0001241703,0.00007147311],"domain_scores_gemma":[0.9995357,0.00006052597,0.0001751233,0.0000741687,0.0001173867,0.00003705882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003732209,0.000002299354,0.0004122739,0.000004029826,0.000002588119,3.825165e-8,0.0005293504,0.0005560817,0.00002174534,0.2217159,0.00005092119,0.7767011],"study_design_scores_gemma":[0.0004127365,0.0000796118,0.4422566,0.00001167783,0.000003507654,0.00003480892,0.0003432143,0.5223083,0.0001160484,0.03372984,0.0006145247,0.00008913771],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03575245,0.00004071354,0.9592411,0.003135141,0.0001027387,0.0001440413,0.000002000343,0.00006953243,0.001512284],"genre_scores_gemma":[0.9845179,0.00009138959,0.01505792,0.0003145305,0.000005893468,0.000001638826,0.000006721679,7.257605e-7,0.000003257064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9487655,"threshold_uncertainty_score":0.2024898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1765613701","doi":"10.1007/978-3-642-44973-4_40","title":"Identifying Key Algorithm Parameters and Instance Features Using Forward Selection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Key (lock); Salient; Set (abstract data type); Algorithm; Variety (cybernetics); Selection (genetic algorithm); Machine learning; Feature (linguistics); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01973576009910112,"gpt":0.2501540446791399,"spread":0.2304182845800388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003682465,0.0003977556,0.0003513999,0.0007957187,0.0003710693,0.001142251,0.0007862263,0.000270914,0.00002206468],"category_scores_gemma":[0.00004658552,0.0003931819,0.00007531726,0.0005642424,0.000435684,0.001328457,0.0004703899,0.0006022066,0.0000114547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003169109,"about_ca_system_score_gemma":0.00027018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007055855,"about_ca_topic_score_gemma":0.0001022574,"domain_scores_codex":[0.9973673,0.0000327126,0.0003746914,0.001156385,0.0006225839,0.0004462976],"domain_scores_gemma":[0.9987058,0.0001729947,0.0002790934,0.0004669402,0.0002248478,0.0001503076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001234299,0.000004895134,0.00006209876,0.00001843079,0.000009309332,0.000008842703,0.0004439786,0.03511942,0.0001249879,0.004456035,0.000009875078,0.9597409],"study_design_scores_gemma":[0.0001856058,0.00004797155,0.000493135,0.0002407549,0.000009001816,0.0002081292,4.627587e-7,0.9566835,0.0006277029,0.04086809,0.0001608589,0.0004748233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002428874,0.0002904516,0.996766,0.0002194522,0.001336083,0.0003710704,0.000002427079,0.0001524816,0.0006191686],"genre_scores_gemma":[0.02396145,0.00009352177,0.9750083,0.0005839949,0.0001297785,0.000005434692,0.000002604589,0.00002255187,0.0001923759],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9592661,"threshold_uncertainty_score":0.9998947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062671967","doi":"10.1016/j.jcss.2003.07.011","title":"A sharp threshold in proof complexity yields lower bounds for satisfiability search","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Mathematics; Combinatorics; Resolution (logic); Range (aeronautics); Conjunctive normal form; Discrete mathematics; Exponential function; Boolean satisfiability problem; Upper and lower bounds; Exponential time hypothesis; Time complexity; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05440909133257375,"gpt":0.293218237044864,"spread":0.2388091457122902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002759427,0.00009277017,0.0002426959,0.0002202099,0.0001974216,0.0003853101,0.0003627492,0.00004337002,0.000006060229],"category_scores_gemma":[0.00002711884,0.00006938839,0.00007090343,0.000413275,0.0001858784,0.0006696031,0.00005067446,0.0001150288,4.59658e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005639738,"about_ca_system_score_gemma":0.000233697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006736957,"about_ca_topic_score_gemma":0.00002341101,"domain_scores_codex":[0.9985802,0.0001378821,0.0004802995,0.0002261437,0.000374805,0.0002006623],"domain_scores_gemma":[0.9992278,0.000172186,0.000173466,0.0001312547,0.0001988239,0.00009645084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003993714,0.0002026817,0.1376455,0.0002795901,0.00003029,0.0000273215,0.002595701,0.01375821,0.00008224919,0.8041597,0.0006712522,0.04050759],"study_design_scores_gemma":[0.001193015,0.0009001095,0.05915838,0.0002454585,0.000006208176,0.0006248533,0.0003581636,0.9258829,0.0001780723,0.01070209,0.0005141361,0.0002365623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1062497,0.0001109933,0.8907408,0.0005283755,0.0007710995,0.0002142312,0.000001136832,0.00001262532,0.00137104],"genre_scores_gemma":[0.9075145,0.000002961602,0.09234968,0.00006916552,0.00005107039,0.000002389114,8.160926e-8,0.000001778276,0.000008367743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9121248,"threshold_uncertainty_score":0.3715554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092928619","doi":"10.1016/j.jcss.2007.06.015","title":"The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Corollary; Combinatorics; Mathematics; Satisfiability; Randomized algorithm; Discrete mathematics; Time complexity; Boolean satisfiability problem; Computability; Ramsey's theorem","retraction":null,"screen_n_in":null,"score":{"opus":0.05216442578228685,"gpt":0.2959712926665272,"spread":0.2438068668842404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003063791,0.00005818349,0.0001373645,0.0001225315,0.0003503577,0.00020604,0.0003902274,0.00002537649,5.001001e-7],"category_scores_gemma":[0.00001274587,0.00003558562,0.00005118537,0.0002211583,0.0002693449,0.0006203636,0.00003592994,0.00004869115,1.574358e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001948331,"about_ca_system_score_gemma":0.0000846955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006337062,"about_ca_topic_score_gemma":0.00002909913,"domain_scores_codex":[0.9989802,0.00008139652,0.0004582044,0.0001031364,0.0002597538,0.0001172874],"domain_scores_gemma":[0.9988148,0.0002675012,0.0004483487,0.00009940327,0.0003016482,0.00006826389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004023049,0.00003715857,0.006811649,0.00005552128,0.00002281821,0.000002984496,0.001756962,0.00418996,0.0005389169,0.8003106,0.0001702577,0.1860629],"study_design_scores_gemma":[0.0004290729,0.0007453417,0.05027603,0.00008491796,0.000007035124,0.000338234,0.0006289356,0.9416112,0.0005718319,0.004636839,0.0005727578,0.00009778817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05055321,0.00006731369,0.947832,0.0005365195,0.0006551452,0.0000980909,6.798379e-7,0.00001138811,0.0002456285],"genre_scores_gemma":[0.8379368,0.000006440936,0.1619166,0.00003124623,0.000102777,2.88757e-7,1.421481e-7,0.000001117747,0.000004605718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9374213,"threshold_uncertainty_score":0.2694703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3131262006","doi":"10.24963/ijcai.2021/595","title":"Combinatorial Optimization and Reasoning with Graph Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"Deutsche Forschungsgemeinschaft; Australian Government","keywords":"Computer science; Combinatorial optimization; Key (lock); Artificial intelligence; Artificial neural network; Theoretical computer science; Graph; Block (permutation group theory); Machine learning; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007260825204586705,"gpt":0.2083105452298668,"spread":0.20104972002528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001155147,0.0001912432,0.000197958,0.00009986808,0.0001247113,0.0008247932,0.0002118438,0.0001774113,0.00004777846],"category_scores_gemma":[0.00001713582,0.0001737952,0.00004084508,0.0002594387,0.00004838933,0.0003459335,0.0005087311,0.0003419463,1.901713e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002603399,"about_ca_system_score_gemma":0.00008771492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005045595,"about_ca_topic_score_gemma":0.00002472283,"domain_scores_codex":[0.998854,0.00008050631,0.0001853785,0.0005257414,0.0001926045,0.0001617463],"domain_scores_gemma":[0.9991865,0.00003950193,0.0001373048,0.0003752013,0.0001693773,0.00009208601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003828006,0.00001032033,0.001360021,0.000009208373,0.00001945685,0.000008947775,0.00009933175,0.9731855,3.144258e-7,0.01831652,0.00002377946,0.006962706],"study_design_scores_gemma":[0.0003258823,0.00002413475,0.001258929,0.00005267009,0.00001376916,0.00003719697,0.00003204841,0.9977868,0.000006347473,0.0002350775,0.000008033841,0.0002191732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001939585,0.0001122049,0.9941229,0.0003475286,0.001498789,0.000187948,5.393624e-7,0.000252055,0.001538476],"genre_scores_gemma":[0.6245389,0.0001441551,0.3749311,0.0001745187,0.00009441446,0.00001583108,0.00005773379,0.00001272953,0.00003059689],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6225994,"threshold_uncertainty_score":0.79535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001157763","doi":"10.1023/b:jmma.0000026709.24659.da","title":"A General Approach for Constraint Solving by Local Search","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Guided Local Search; Tabu search; Constraint programming; Mathematical optimization; Constraint (computer-aided design); Set (abstract data type); Computer science; Local search (optimization); Constraint satisfaction; Resolution (logic); Mathematics; Artificial intelligence; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.03257880984352848,"gpt":0.2623488479533102,"spread":0.2297700381097817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061168,0.00009442324,0.000212676,0.00007278996,0.00009898767,0.0001315313,0.0001564699,0.00005669226,0.000004176144],"category_scores_gemma":[0.00002334228,0.00007384953,0.00008510029,0.00007771469,0.00009380087,0.0002327322,0.00002898587,0.0001664093,8.171748e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003768666,"about_ca_system_score_gemma":0.00008260143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001834093,"about_ca_topic_score_gemma":3.506089e-8,"domain_scores_codex":[0.9990492,0.00002246369,0.0003701047,0.0001379941,0.000244825,0.0001754379],"domain_scores_gemma":[0.9994034,0.0001078494,0.0001107099,0.00008503559,0.0001473056,0.000145746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006709025,0.0001162298,0.000001463179,0.00005663999,0.00002660199,0.000004081021,0.0005900221,0.8381348,0.000111405,0.1015573,0.00003944267,0.05935538],"study_design_scores_gemma":[0.0006535512,0.00009710074,5.373603e-7,0.00004524051,0.000009629301,0.0003139699,0.000128677,0.9560559,0.0004049618,0.04217558,0.00002977161,0.00008504048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001941645,0.00011099,0.9970385,0.0005600236,0.000052383,0.0001020187,0.000002310454,0.00001859699,0.0001735594],"genre_scores_gemma":[0.1849004,0.000039807,0.8149064,0.00005720218,0.00005695827,0.000002098161,7.750413e-7,0.000005583983,0.00003073211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1829588,"threshold_uncertainty_score":0.3011496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1585071718","doi":"10.1023/a:1008788926897","title":"Temporal Granularity: Completing the Puzzle","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Granularity; Computer science; Temporal database; Semantics (computer science); Data mining; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02279624169315993,"gpt":0.2435481714601876,"spread":0.2207519297670277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001081327,0.00007926038,0.0001383926,0.0002038352,0.0001881627,0.0005186546,0.000433708,0.00003793783,0.00002613225],"category_scores_gemma":[0.00008963411,0.00005122188,0.00009160663,0.0003320872,0.00002395729,0.002059785,0.0000425596,0.0001723949,0.00008409814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006996476,"about_ca_system_score_gemma":0.00005791186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003262683,"about_ca_topic_score_gemma":0.000004441406,"domain_scores_codex":[0.9984139,0.0000868857,0.0008935609,0.00004161286,0.0004469699,0.0001170788],"domain_scores_gemma":[0.9982921,0.0000858903,0.0008417564,0.0001804818,0.0005348133,0.00006492093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001010804,0.0001305607,0.04829291,0.0001478178,0.0002395593,0.0000423997,0.01767632,0.2017949,0.00008294549,0.2936344,0.0212054,0.4166517],"study_design_scores_gemma":[0.0003403099,0.00008090967,0.001918763,0.0001029649,0.000009341686,0.002149582,0.002842019,0.2969819,0.0001230637,0.000216016,0.6950851,0.0001500118],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002169232,0.00008350732,0.9900547,0.00143442,0.001437333,0.0001422603,9.077042e-7,0.0000308058,0.004646795],"genre_scores_gemma":[0.9953919,0.000087674,0.003935657,0.0003775634,0.0001259148,0.000002244107,0.000002923699,0.0000024271,0.00007366955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9932227,"threshold_uncertainty_score":0.5001398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2292954498","doi":"10.1109/lra.2016.2522096","title":"Mixed-Integer and Constraint Programming Techniques for Mobile Robot Task Planning","year":2016,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Constraint programming; Robot; Integer programming; Task (project management); Computer science; Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Plan (archaeology); Mobile robot; Integer (computer science); Motion planning; Artificial intelligence; Mathematics; Algorithm; Stochastic programming; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01616640003394109,"gpt":0.2481487157063605,"spread":0.2319823156724194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001716399,0.0001107025,0.0001121157,0.0001063002,0.0001338365,0.0001877554,0.00008100375,0.000049167,0.000001718286],"category_scores_gemma":[0.00002109604,0.00008574772,0.00002865563,0.00007625024,0.00009338625,0.0003742772,0.0000262538,0.0000416477,0.000001250013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002615921,"about_ca_system_score_gemma":0.00001746988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001939696,"about_ca_topic_score_gemma":0.000001036035,"domain_scores_codex":[0.9992736,0.00002316409,0.0001961069,0.0002464027,0.00009547103,0.0001652311],"domain_scores_gemma":[0.9995391,0.0001278595,0.0001012891,0.0001196535,0.0000501417,0.0000619874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003564759,0.00001778815,0.000873252,0.00004241603,0.00002282807,0.00000348408,0.0003990057,0.01420589,0.04005206,0.01408275,0.0006767472,0.9296202],"study_design_scores_gemma":[0.00124725,0.0002339029,0.003152034,0.0004186134,0.00003399717,0.0001383933,0.0001828753,0.968584,0.01830077,0.001014309,0.005975591,0.0007182563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006282179,0.00002161137,0.9880998,0.004673329,0.0002163619,0.0003748191,0.000003566111,0.0003100571,0.00001825051],"genre_scores_gemma":[0.611046,0.00001198188,0.3883303,0.0004918389,0.00003796223,0.00005920496,0.000002306849,0.00000701909,0.00001345053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9543781,"threshold_uncertainty_score":0.3496691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170780172","doi":"10.1613/jair.3463","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Benchmark (surveying); Constraint programming; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Search tree; Mathematical optimization; Local search (optimization); Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2126970487318262,"gpt":0.408101652300917,"spread":0.1954046035690908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006791956,0.0001167365,0.000199786,0.0005935691,0.0004010872,0.0003859244,0.0004163682,0.00009257729,0.00008539693],"category_scores_gemma":[0.001208196,0.0001063935,0.0001304176,0.0006852772,0.0002293018,0.0009162728,0.00006052179,0.0006252225,0.00003302514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002054427,"about_ca_system_score_gemma":0.0005300402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000036908,"about_ca_topic_score_gemma":0.00003714543,"domain_scores_codex":[0.9971641,0.0002968434,0.0007433028,0.0001752698,0.001010022,0.0006104134],"domain_scores_gemma":[0.996358,0.001170434,0.0002595477,0.0002194382,0.001723766,0.0002687798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007159277,0.000183141,0.003876985,0.00007937827,0.00003074871,0.00000477795,0.00154617,0.04255699,0.006048503,0.1174219,0.0002663295,0.8279135],"study_design_scores_gemma":[0.0001986534,0.0007225528,0.002627636,0.0002296893,0.00001683396,0.0001501035,0.00160333,0.9112295,0.05035222,0.03012172,0.002403871,0.0003438671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01438154,0.0001066208,0.9823598,0.001765804,0.0008410977,0.0003452369,0.000003996275,0.00002835685,0.0001675076],"genre_scores_gemma":[0.9055119,0.00004783325,0.09392729,0.00005551639,0.0004260031,0.000007325733,0.000001085191,0.00001091701,0.00001215186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8911303,"threshold_uncertainty_score":0.4338601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104290979","doi":"10.1016/s0004-3702(99)00099-5","title":"Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Heuristic; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Exploit; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01929389070529535,"gpt":0.284133776847167,"spread":0.2648398861418716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001812325,0.0001782516,0.0002273256,0.0002468223,0.0002606487,0.0002778303,0.0004015882,0.0001020662,0.001676056],"category_scores_gemma":[0.0001798988,0.0001839534,0.000158699,0.001517491,0.0001197946,0.0002713547,0.00003209625,0.000139904,0.00009373482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006242887,"about_ca_system_score_gemma":0.0001276433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006233496,"about_ca_topic_score_gemma":0.0003906713,"domain_scores_codex":[0.9984469,0.00005469691,0.0004665142,0.000504991,0.0002157037,0.0003112359],"domain_scores_gemma":[0.9989468,0.0002226058,0.00011193,0.0003698332,0.0002311292,0.0001176903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002183713,0.00003955368,0.0001516773,0.000009861627,0.00013958,0.000004337381,0.0006048332,0.1798216,0.0007817317,0.0719979,0.00001259107,0.7464145],"study_design_scores_gemma":[0.00002356548,0.00004714685,0.0001906922,0.00001251517,0.00009276268,0.00001086149,0.0001085193,0.9565501,0.00410415,0.03838088,0.0002554359,0.0002234225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02490659,0.00002543656,0.9726424,0.0007479201,0.0001620928,0.0003334049,0.00004018288,0.0003473318,0.0007946577],"genre_scores_gemma":[0.6876032,0.00002141068,0.3120263,0.0001716371,0.00002013307,0.00001404868,0.00002116158,0.000007457021,0.0001145901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7767285,"threshold_uncertainty_score":0.9992365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985398779","doi":"10.1080/13658810802022814","title":"Qualified topological relations between spatial objects with possible vague shape","year":2008,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Boundary (topology); Closeness; Mathematics; Intersection (aeronautics); Social connectedness; Vagueness; Topology (electrical circuits); Object (grammar); Topological space; Spatial relation; Pure mathematics; Geography; Computer science; Fuzzy logic; Geometry; Cartography; Combinatorics; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02042566497445259,"gpt":0.2517280324831861,"spread":0.2313023675087335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004711563,0.0001348881,0.0002337323,0.0007332496,0.0001716206,0.000298888,0.0006278071,0.0001268067,0.00007035023],"category_scores_gemma":[0.0001372486,0.0001021364,0.0001326789,0.0004750939,0.0001207488,0.002839206,0.00006597519,0.0003046764,0.00004684675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007172952,"about_ca_system_score_gemma":0.0001951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000886105,"about_ca_topic_score_gemma":0.00000881958,"domain_scores_codex":[0.9975384,0.0001154976,0.001002516,0.0001085855,0.001076111,0.0001588294],"domain_scores_gemma":[0.9972719,0.0001977743,0.0008344107,0.0001549583,0.001377977,0.0001630015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000310236,0.00023206,0.7608287,0.00003111113,0.0009384608,0.0001667191,0.005692558,0.04109318,0.00006635941,0.1442608,0.00210549,0.04427433],"study_design_scores_gemma":[0.004036687,0.0008405524,0.8606009,0.000241022,0.00004527961,0.004670591,0.0008329977,0.1131073,0.000145881,0.0009132884,0.01394578,0.0006196448],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07441075,0.00003636268,0.9186096,0.001800618,0.001184862,0.0001564983,0.00001464267,0.00008135402,0.003705271],"genre_scores_gemma":[0.9935686,0.00003400165,0.005873195,0.0001991118,0.0002571547,0.000005416622,0.00002318917,0.000003827834,0.00003552071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9191578,"threshold_uncertainty_score":0.4165002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1583185913","doi":"10.1007/978-3-540-45193-8_70","title":"Unrestricted Nogood Recording in CSP Search","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Backtracking; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02160351198768318,"gpt":0.2525285820532642,"spread":0.2309250700655811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083423,0.0003851128,0.0003912858,0.001638543,0.0001717592,0.0004835522,0.00158552,0.0003070295,0.0000718126],"category_scores_gemma":[0.0001253137,0.0003938407,0.00008380279,0.001534774,0.0003252518,0.0006307797,0.0005193516,0.000957185,0.00003885996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004907114,"about_ca_system_score_gemma":0.0006035798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007251088,"about_ca_topic_score_gemma":0.0002759289,"domain_scores_codex":[0.9967108,0.00007018734,0.0005229968,0.001285277,0.0007954533,0.0006152808],"domain_scores_gemma":[0.9982293,0.0003822793,0.0001654838,0.0008737371,0.0001945106,0.0001547376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000352478,0.00002275608,0.000967926,0.00001872403,0.000005056891,0.00009998982,0.0004731946,0.1146078,0.00005311663,0.01684641,0.00002422222,0.8668773],"study_design_scores_gemma":[0.0005795138,0.0001223267,0.001655763,0.00040561,0.000004088401,0.0001237908,4.158806e-7,0.9417627,0.0005665313,0.05299412,0.000926665,0.0008585099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001397563,0.0001093246,0.9900816,0.001128251,0.001574666,0.0003453869,0.000002112122,0.0001264921,0.006492394],"genre_scores_gemma":[0.1911136,0.0001779185,0.8052604,0.002410773,0.00025139,0.00001164909,0.000009276486,0.00005027132,0.0007147582],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8660188,"threshold_uncertainty_score":0.9998513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}