{"meta":{"query_hash":"e47bdbb6d638","filters":{"topic":"Constraint Satisfaction and Optimization"},"cohort_total":698,"direct_labels_cover":0,"predictions_cover":698,"exported":698,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/e47bdbb6d638","api":"https://metacan.xera.ac/api/v1/cohort?topic=Constraint+Satisfaction+and+Optimization"},"results":[{"id":"W109111233","doi":"10.1007/978-3-642-33558-7_65","title":"A Pseudo-Boolean Set Covering Machine","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Greedy algorithm; Conjunction (astronomy); Boolean function; Set (abstract data type); Constraint (computer-aided design); Minification; Theoretical computer science; Boolean data type; True quantified Boolean formula; Upper and lower bounds; Algorithm; Mathematical optimization; Mathematics; Programming language","score_opus":0.01579781902115244,"score_gpt":0.23804309873796603,"score_spread":0.2222452797168136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109111233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034362536,0.00034663614,0.9916338,0.00059248507,0.001831802,0.0002560494,0.000008607195,0.00023321764,0.0050630625],"genre_scores_gemma":[0.28691337,0.00016134878,0.7089894,0.0024545747,0.00065242214,0.000008179689,0.000018349276,0.000053154985,0.00074920146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972378,0.000026545327,0.0004181868,0.0009952972,0.0007385648,0.00058360945],"domain_scores_gemma":[0.9981877,0.00020647571,0.00024073543,0.001012241,0.00013469481,0.00021812023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006004159,0.0004334791,0.0003723402,0.0006893706,0.00023637946,0.0004650206,0.0016654946,0.00024187553,0.00015872395],"category_scores_gemma":[0.00004932761,0.00041874812,0.00011221901,0.00045111886,0.0003667269,0.0008749545,0.0009172528,0.0006664711,0.00011566512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026030523,0.000010969449,0.0002477377,0.000019147092,0.0000080089385,0.000024792684,0.00060035277,0.035361443,0.000069299815,0.020404454,0.000017887232,0.9432333],"study_design_scores_gemma":[0.0003112802,0.000073549105,0.00055352866,0.00021219332,0.0000097747925,0.00021519045,1.3726157e-7,0.9648989,0.00048623653,0.027809648,0.0046233875,0.0008061711],"about_ca_topic_score_codex":0.000022943492,"about_ca_topic_score_gemma":0.00008791122,"teacher_disagreement_score":0.94242716,"about_ca_system_score_codex":0.00028456966,"about_ca_system_score_gemma":0.0003152444,"threshold_uncertainty_score":0.99982643},"labels":[],"label_agreement":null},{"id":"W111876617","doi":"10.1007/978-3-319-08909-6_9","title":"Coverage Driven Test Generation and Consistency Algorithm","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Solver; Computer science; Local consistency; Consistency (knowledge bases); Algorithm; Constraint (computer-aided design); Process (computing); Constraint satisfaction problem; Domain (mathematical analysis); Mathematics; Artificial intelligence; Programming language","score_opus":0.012176953579279096,"score_gpt":0.2190911942703553,"score_spread":0.20691424069107622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111876617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017308612,0.00014918631,0.9950849,0.00067437266,0.0010981958,0.0002519675,0.0000063806197,0.000117039475,0.0026006573],"genre_scores_gemma":[0.084577434,0.00021938814,0.9118786,0.002189218,0.0005593479,0.00000688917,0.000017321014,0.000025541858,0.0005262479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977741,0.000026600737,0.00036963305,0.001023945,0.00050323975,0.0003024458],"domain_scores_gemma":[0.9984436,0.00036030606,0.00020991592,0.000647628,0.00020102227,0.00013750528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003814963,0.0003259613,0.0003169052,0.00046738633,0.00028134117,0.00059686636,0.0007003058,0.00021978446,0.000030991578],"category_scores_gemma":[0.00010638112,0.00031863095,0.000056062698,0.0002542621,0.0004977982,0.0003994097,0.00043510372,0.00037049796,0.000022975399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.035125e-7,0.000006200709,0.00009866768,0.000007815064,0.000003258435,0.000013446028,0.0001390974,0.011776087,0.00009792526,0.010323699,0.000024765986,0.9775087],"study_design_scores_gemma":[0.00021648896,0.00009628372,0.00030858506,0.00007867449,0.0000053794492,0.00010249811,4.0746983e-8,0.9828655,0.00019150811,0.014386955,0.0013690161,0.00037906467],"about_ca_topic_score_codex":0.000009772502,"about_ca_topic_score_gemma":0.00007652012,"teacher_disagreement_score":0.9771297,"about_ca_system_score_codex":0.0001380551,"about_ca_system_score_gemma":0.0003081689,"threshold_uncertainty_score":0.99992657},"labels":[],"label_agreement":null},{"id":"W115542354","doi":"10.46298/dmtcs.291","title":"An Efficient Algorithm for the Maximum Distance Problem","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Time complexity; Scalability; Scheduling (production processes); Preprocessor; Computer science; Artificial intelligence; Mathematical optimization","score_opus":0.010378687990143624,"score_gpt":0.2578276345565877,"score_spread":0.24744894656644406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115542354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000337063,0.000018260778,0.99528664,0.0015499698,0.00040961488,0.00068403303,0.0000066294315,0.00023017728,0.0014775886],"genre_scores_gemma":[0.29961258,0.000006174133,0.69999325,0.00025051876,0.00007081545,0.000044083652,0.0000018206185,0.000010223283,0.000010531913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976174,0.00005267347,0.00038620265,0.0006591571,0.0007195211,0.0005650396],"domain_scores_gemma":[0.99779683,0.00046399847,0.0001340574,0.0010897408,0.00027701544,0.0002383287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530837,0.00022345314,0.00019998805,0.00010943551,0.000917539,0.0010292819,0.002289045,0.00004717733,0.000046406672],"category_scores_gemma":[0.00005458309,0.00014441971,0.00010159302,0.00096408586,0.0016782541,0.000487412,0.00034222574,0.0001433723,0.000021827667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021048409,0.00006662066,0.0000055090104,0.0000071224845,0.0000042227084,0.0000020262162,0.0007233671,0.0048801564,0.000031211635,0.82421994,0.00001312346,0.17004457],"study_design_scores_gemma":[0.00019543746,0.000099057834,0.00005442738,0.000022750057,0.000008906734,0.00004808854,0.00006470961,0.8325724,0.00011466613,0.16638216,0.0002452996,0.00019210468],"about_ca_topic_score_codex":0.0000013462709,"about_ca_topic_score_gemma":0.0000012554246,"teacher_disagreement_score":0.8276922,"about_ca_system_score_codex":0.000052711628,"about_ca_system_score_gemma":0.000100375204,"threshold_uncertainty_score":0.9925389},"labels":[],"label_agreement":null},{"id":"W116145823","doi":"","title":"Generalizations of Interval Graphs","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval graph; Interval (graph theory); Computer science; Context (archaeology); Graph theory; Constraint satisfaction; Constraint satisfaction problem; Theoretical computer science; Discrete mathematics; Indifference graph; Constraint (computer-aided design); Chordal graph; Graph; Mathematics; Combinatorics; Algorithm; Artificial intelligence; 1-planar graph; Probabilistic logic","score_opus":0.024376740920435104,"score_gpt":0.2516074585732732,"score_spread":0.22723071765283812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116145823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013733263,0.000017679859,0.96437186,0.00515011,0.00027974902,0.000117367345,0.000031997275,0.000069834496,0.016228113],"genre_scores_gemma":[0.9669654,0.0000054753878,0.03097041,0.0018810325,0.00001548382,0.0000020183984,0.000048292608,0.0000032169419,0.00010866379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00003476101,0.00022881968,0.00022669844,0.00021997742,0.00017934255],"domain_scores_gemma":[0.999119,0.00004844069,0.00008314247,0.00019432436,0.00031774663,0.00023738813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008592921,0.00010306149,0.000121529185,0.00077895547,0.00010700827,0.00009006904,0.0003311803,0.000052829957,0.00028482682],"category_scores_gemma":[0.000045292178,0.00011416269,0.000054877208,0.0008641209,0.000045554134,0.00021387721,0.000013206868,0.000087099455,0.000036865687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012023695,0.000017528038,0.0005679319,0.0000018105342,0.0000073560195,0.0000032239404,0.00007874068,0.046278853,0.000021325855,0.89334404,0.00080707687,0.05887088],"study_design_scores_gemma":[0.00042620674,0.0002070365,0.14044102,0.00004667158,0.000006047416,0.000023850494,0.000041733914,0.71154726,0.00012323451,0.14567629,0.0011353875,0.00032526738],"about_ca_topic_score_codex":0.00071364566,"about_ca_topic_score_gemma":0.0017999349,"teacher_disagreement_score":0.95323217,"about_ca_system_score_codex":0.00007220251,"about_ca_system_score_gemma":0.0006439051,"threshold_uncertainty_score":0.46554196},"labels":[],"label_agreement":null},{"id":"W12093412","doi":"","title":"A Framework to Manage Conditional Constraints and Qualitative Preferences.","year":2013,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Formalism (music); A priori and a posteriori; Theoretical computer science; Conditional dependence; Mathematics; Econometrics","score_opus":0.027384852635901798,"score_gpt":0.3092496450582871,"score_spread":0.2818647924223853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12093412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010764467,0.0000038276653,0.96739185,0.0038036457,0.000071347495,0.00021364418,0.000003891868,0.000098524746,0.017648827],"genre_scores_gemma":[0.69188476,0.0000021737605,0.30627704,0.0015070445,0.000007946002,0.000026121374,0.000002596709,0.0000015254868,0.0002907978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993807,0.000051835825,0.00011707445,0.0002101624,0.00012759978,0.00011264847],"domain_scores_gemma":[0.99945724,0.00019434784,0.000028048735,0.0001205581,0.00008068617,0.00011912414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009794243,0.00006910179,0.0000702416,0.00007861579,0.00006576641,0.00018236278,0.00012616378,0.00003748844,0.002402718],"category_scores_gemma":[0.000072579714,0.000060952927,0.000013565244,0.0001672953,0.000096483076,0.0004167135,0.00007155153,0.00006390773,0.00037096516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4644136e-7,0.000009786286,0.00029637976,0.000003149407,0.000009412629,7.293273e-7,0.0056053945,0.000044032393,0.000028857537,0.9070489,0.001435836,0.08551702],"study_design_scores_gemma":[0.00042603447,0.00012710306,0.117749006,0.000046485897,0.0000048906304,0.000031768108,0.00495847,0.030941369,0.00017949728,0.8436641,0.0013985323,0.00047271387],"about_ca_topic_score_codex":0.000030942647,"about_ca_topic_score_gemma":0.000009487478,"teacher_disagreement_score":0.6811203,"about_ca_system_score_codex":0.0000117704585,"about_ca_system_score_gemma":0.000018054176,"threshold_uncertainty_score":0.9985092},"labels":[],"label_agreement":null},{"id":"W123456301","doi":"","title":"Formal Description Techniques for CSPs and TCSPs.","year":2004,"lang":"en","type":"article","venue":"Software Engineering and Knowledge Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint satisfaction problem; Constraint satisfaction; Scheduling (production processes); Theoretical computer science; Variety (cybernetics); Model checking; Set (abstract data type); Constraint (computer-aided design); Formal specification; Temporal logic; Programming language; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.0076154845345589245,"score_gpt":0.20236581693967842,"score_spread":0.1947503324051195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123456301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009212528,0.00061987824,0.9885202,0.00004693894,0.0003513091,0.00017910129,0.0000025335542,0.00104358,0.000023903629],"genre_scores_gemma":[0.4897654,0.00006255423,0.5099774,0.000011067283,0.00008452395,0.000050107217,0.0000036950946,0.000018848124,0.00002636846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993218,0.000002837845,0.00014985938,0.0002263956,0.00005530946,0.00024376136],"domain_scores_gemma":[0.9996387,0.0000676352,0.00002122631,0.00012318676,0.000049122194,0.00010016624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014428202,0.00015930446,0.00012960071,0.00018630065,0.000089400135,0.00011927798,0.00009261781,0.00007847408,8.4543285e-7],"category_scores_gemma":[0.00014643095,0.00017351632,0.00003399972,0.00016377888,0.000011783043,0.00060386356,0.000072761584,0.000107130974,0.0000012344625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126207,0.00007045305,0.0010358737,0.0011122813,0.00008651062,0.000008503073,0.0035268683,0.15259798,0.00960045,0.2001084,0.00011038905,0.63172966],"study_design_scores_gemma":[0.001090753,0.00016473452,0.005360347,0.0003286715,0.000021516182,0.00015387835,0.000027036893,0.96815485,0.009442886,0.00042304434,0.014078699,0.0007536086],"about_ca_topic_score_codex":0.000002751249,"about_ca_topic_score_gemma":0.0000022544693,"teacher_disagreement_score":0.8155568,"about_ca_system_score_codex":0.000054737724,"about_ca_system_score_gemma":0.000026018253,"threshold_uncertainty_score":0.707579},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.23200421089673143,"score_gpt":0.4389980739433883,"score_spread":0.20699386304665687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1258972194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054951063,0.00004591129,0.99045956,0.0019415393,0.00056302163,0.000127909,0.0000011060437,0.000056144476,0.0013096936],"genre_scores_gemma":[0.57928663,0.000035668945,0.41994804,0.0000992832,0.00047359458,0.0000038485427,0.0000011928433,0.000013734639,0.00013796224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967655,0.00051344966,0.0007009537,0.00020920948,0.0014075408,0.00040338142],"domain_scores_gemma":[0.9958146,0.0002620699,0.00019089974,0.00030862648,0.0028519107,0.0005718495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004610363,0.0001038374,0.0002064978,0.0006055731,0.0001548519,0.00052969786,0.00091620913,0.00009301355,0.00016882282],"category_scores_gemma":[0.0010842705,0.000088966706,0.00007431196,0.001168406,0.00018184172,0.0010987957,0.000095821895,0.000573651,0.0001717925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002765334,0.00017036193,0.000029011206,0.0000037163609,0.000018491868,0.00007037818,0.0015149704,0.0016687092,0.0014047456,0.076313496,0.0006040996,0.9181744],"study_design_scores_gemma":[0.000060231203,0.00084088516,0.0001664333,0.000026166483,0.0000037494476,0.00020334178,0.0009220534,0.93031925,0.014449513,0.051741347,0.001142715,0.00012431537],"about_ca_topic_score_codex":0.000032065906,"about_ca_topic_score_gemma":0.00002494985,"teacher_disagreement_score":0.92865056,"about_ca_system_score_codex":0.00017599571,"about_ca_system_score_gemma":0.0012364159,"threshold_uncertainty_score":0.51078886},"labels":[],"label_agreement":null},{"id":"W131771944","doi":"","title":"A Markovian model for dynamic and constrained resource allocation problems","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Mathematical optimization; Resource allocation; Markov decision process; Markov process; Constraint (computer-aided design); Dimension (graph theory); Sequence (biology); State space; Stochastic modelling; Constraint satisfaction; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.011974683310104385,"score_gpt":0.24227305821345008,"score_spread":0.2302983749033457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131771944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012130057,0.0000098111595,0.99130464,0.0017422723,0.000030256817,0.00031149763,0.0000014627509,0.0001414425,0.0052455976],"genre_scores_gemma":[0.6747332,0.0000035426367,0.3237545,0.00034764942,0.0000047689555,0.000008746148,0.000006179911,0.0000035925757,0.0011378141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942034,0.000007699361,0.0001503067,0.00020130958,0.0000786765,0.00014164417],"domain_scores_gemma":[0.999637,0.00006462929,0.000043492422,0.00013444661,0.000055432643,0.000065000124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003438745,0.00006559915,0.000058493228,0.000084647116,0.00008557596,0.000069892965,0.000095188465,0.00004147729,0.0000072938174],"category_scores_gemma":[0.00002284895,0.00006290252,0.000019215704,0.00011261282,0.00003978049,0.0002046763,0.000027772241,0.00003423686,0.0000013641038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001722832,0.000031119474,0.0003382874,0.00003293438,0.000012744752,6.8928193e-7,0.0011408569,0.023586309,0.0019125137,0.27855623,0.0003247017,0.6940464],"study_design_scores_gemma":[0.0003322006,0.000020223468,0.00090963114,0.0000053596973,0.000002286167,0.000011751594,0.0000459414,0.99552566,0.000055679113,0.0025302263,0.00047706504,0.000083983075],"about_ca_topic_score_codex":0.000004365888,"about_ca_topic_score_gemma":0.00017407593,"teacher_disagreement_score":0.9719393,"about_ca_system_score_codex":0.000025425205,"about_ca_system_score_gemma":0.000037233996,"threshold_uncertainty_score":0.25650904},"labels":[],"label_agreement":null},{"id":"W134340496","doi":"","title":"Solving Temporal Constraints in Real Time and in a Dynamic Environment","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Local consistency; Constraint satisfaction problem; Constraint learning; Constraint (computer-aided design); Constraint satisfaction; Constraint satisfaction dual problem; Mathematical optimization; Computer science; Consistency (knowledge bases); Backtracking; Preprocessor; Algorithm; Mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.009794186294228157,"score_gpt":0.20454107317163323,"score_spread":0.19474688687740507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134340496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6042231,0.00006122676,0.34227726,0.0028133902,0.00010345433,0.00043711058,0.0000025897446,0.00019596254,0.049885925],"genre_scores_gemma":[0.96532524,0.00007872251,0.03411691,0.000059947175,0.000001747051,0.0000025332336,9.4742e-7,0.000002037335,0.00041189342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00002606432,0.00013703639,0.00017652115,0.000071575756,0.000113145536],"domain_scores_gemma":[0.99981916,0.00002549216,0.000022412436,0.00009623594,0.0000024688857,0.000034208253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009774661,0.000055852088,0.000068331094,0.00010926754,0.000018365328,0.000037400016,0.00006847266,0.000029796955,0.0007971065],"category_scores_gemma":[0.0000055338396,0.000056669836,0.0000087455255,0.00009333325,0.000052760835,0.0002098477,0.000048442453,0.00005431469,0.00006230866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056604954,0.00019300632,0.16699517,0.0000103415505,0.000007726402,0.00011427865,0.002618227,0.0062575913,0.0033247063,0.006517696,0.00015730096,0.8137983],"study_design_scores_gemma":[0.00031000425,0.000009980542,0.09143124,0.000007498095,3.1286928e-7,0.000014568549,0.000020569454,0.9079806,0.000010883215,0.00011357979,0.00002836435,0.00007238162],"about_ca_topic_score_codex":0.00005497765,"about_ca_topic_score_gemma":0.00022090247,"teacher_disagreement_score":0.901723,"about_ca_system_score_codex":0.000054634307,"about_ca_system_score_gemma":0.0000068312133,"threshold_uncertainty_score":0.87277573},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02642937924592157,"score_gpt":0.24493007144181175,"score_spread":0.2185006921958902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139194355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011800407,0.00044966978,0.9918857,0.00025258985,0.0011453814,0.00027421874,0.000015582464,0.000139372,0.005719459],"genre_scores_gemma":[0.52751863,0.00023185498,0.47078452,0.00095234596,0.0001339679,0.0000067128844,0.000012647386,0.00003623388,0.0003230766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967443,0.000035032233,0.0006584238,0.0011999297,0.00081552897,0.0005468223],"domain_scores_gemma":[0.9977391,0.0003166416,0.00052456517,0.00097052293,0.00030011646,0.00014910415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061014143,0.0004530859,0.00050925923,0.00064686185,0.00022480285,0.00029242036,0.0021286663,0.00027451108,0.000118065866],"category_scores_gemma":[0.00009632752,0.00043525963,0.00012436367,0.000572926,0.0008800391,0.0010739677,0.0007936121,0.00055003865,0.000020563404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005401781,0.0000209079,0.00041035502,0.000059768445,0.000014887474,0.000025859272,0.0018131103,0.008946307,0.0017606821,0.019362824,0.00006629613,0.9675136],"study_design_scores_gemma":[0.0006686467,0.0003229054,0.00048199162,0.0014621858,0.000025339337,0.00018098956,0.000002018674,0.8016391,0.009155203,0.18037543,0.0036945697,0.0019916608],"about_ca_topic_score_codex":0.00005989789,"about_ca_topic_score_gemma":0.00016890818,"teacher_disagreement_score":0.96552193,"about_ca_system_score_codex":0.00023662951,"about_ca_system_score_gemma":0.0005606828,"threshold_uncertainty_score":0.9998099},"labels":[],"label_agreement":null},{"id":"W142773386","doi":"10.1007/978-3-642-13059-5_56","title":"Predicting Optimal Constraint Satisfaction Methods","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Constraint satisfaction problem; Computer science; Constraint satisfaction dual problem; Constraint satisfaction; A priori and a posteriori; Variety (cybernetics); Constraint (computer-aided design); Constraint learning; Local consistency; Mathematical optimization; Backtracking; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.01719898647720418,"score_gpt":0.2846491178294287,"score_spread":0.2674501313522245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142773386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014911682,0.00006792745,0.99018085,0.00060779206,0.0039125895,0.00039347648,0.0000054914776,0.00035891915,0.004323865],"genre_scores_gemma":[0.05245996,0.000027947925,0.9464677,0.000532789,0.00035254328,0.000007981204,0.000004631579,0.000027736362,0.000118716496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965239,0.000071356764,0.00063484977,0.001435009,0.00076533464,0.00056953484],"domain_scores_gemma":[0.9973663,0.0006237323,0.00041306217,0.001072107,0.000299378,0.00022539559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001465791,0.00050303683,0.0004637616,0.00089996285,0.0004116838,0.0006872119,0.0013389405,0.0005455532,0.00017671364],"category_scores_gemma":[0.00023070072,0.000500958,0.00014636002,0.00050132384,0.00097514986,0.0008582708,0.00070168753,0.001601937,0.000033484142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022725712,0.0000065455847,0.0004111181,0.000011810258,0.000008927515,0.000018666049,0.0003694581,0.03193009,0.0011436803,0.013731866,0.0000017556403,0.9523638],"study_design_scores_gemma":[0.00031532472,0.00010734357,0.0016025152,0.00018025565,0.000013263135,0.000336219,5.0367044e-7,0.9527532,0.0041377866,0.038926,0.0008710213,0.0007566057],"about_ca_topic_score_codex":0.000040330928,"about_ca_topic_score_gemma":0.00022572836,"teacher_disagreement_score":0.9516072,"about_ca_system_score_codex":0.00028477795,"about_ca_system_score_gemma":0.0007514028,"threshold_uncertainty_score":0.9997442},"labels":[],"label_agreement":null},{"id":"W143535644","doi":"10.1007/978-3-540-69052-8_39","title":"Efficient Handling of Relational Database Combinatorial Queries Using CSPs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Tuple; Constraint (computer-aided design); Relational database; SQL; Database; Constraint satisfaction problem; Combinatorial explosion; Backtracking; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.025734946551540388,"score_gpt":0.24542847801456427,"score_spread":0.2196935314630239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143535644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067483523,0.00018295164,0.99493307,0.000108840446,0.002919569,0.00022538012,0.000011836756,0.000072483796,0.0008710469],"genre_scores_gemma":[0.2424284,0.000037527498,0.7570483,0.00014559618,0.00026964195,0.0000017935824,0.000013238319,0.000018780684,0.000036730526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973645,0.000032211883,0.00054114003,0.00081438076,0.0009435045,0.00030422973],"domain_scores_gemma":[0.9981379,0.0003518592,0.00038530584,0.00068739994,0.00033794082,0.00009962836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004720083,0.0002993802,0.00036445385,0.0007081333,0.00030158172,0.000119290096,0.0008674938,0.00019556895,0.000029313784],"category_scores_gemma":[0.00012919081,0.00030212698,0.000095344134,0.0005121643,0.000789048,0.0003223261,0.00059780036,0.0004367941,0.0000057305106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007384355,0.000024754163,0.00012840469,0.000021644051,0.0000075925786,0.000023827897,0.00058647664,0.88908327,0.00022062116,0.061413616,0.0000050182207,0.048477396],"study_design_scores_gemma":[0.00032684513,0.000045126977,0.0001262037,0.00026702852,0.0000058754895,0.00008871447,1.5545332e-7,0.9915922,0.00073881715,0.0062758853,0.00021378644,0.00031932243],"about_ca_topic_score_codex":0.000025559259,"about_ca_topic_score_gemma":0.000014042674,"teacher_disagreement_score":0.24175358,"about_ca_system_score_codex":0.00023299959,"about_ca_system_score_gemma":0.00092628173,"threshold_uncertainty_score":0.9999431},"labels":[],"label_agreement":null},{"id":"W1480301700","doi":"10.1007/11564751_43","title":"Using SAT in QBF","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.02741750222392105,"score_gpt":0.2642990166218196,"score_spread":0.23688151439789853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480301700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010242595,0.00016763483,0.9932912,0.00061388116,0.0011657621,0.00023464137,0.0000016777898,0.00010345272,0.0043193186],"genre_scores_gemma":[0.13834478,0.000046246212,0.8595064,0.0014640419,0.00035476114,0.0000025525285,0.0000032538085,0.00002362809,0.0002543339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974229,0.00002632317,0.00044862682,0.0010371567,0.00060780684,0.00045724105],"domain_scores_gemma":[0.998674,0.00016837275,0.00018641385,0.00074942637,0.00011143714,0.000110346315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050138147,0.0003408903,0.00033632808,0.0011090266,0.00013059929,0.00037273532,0.0013830952,0.0002518432,0.00007252188],"category_scores_gemma":[0.00004480518,0.00034579472,0.00007670118,0.0006607273,0.00034296635,0.0007279078,0.0005772775,0.0005938763,0.000040726543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012874291,0.000009005719,0.00024309767,0.000006585104,0.0000018594884,0.000032213808,0.00028264523,0.3356053,0.000050303563,0.0077439956,0.0000028006516,0.65602094],"study_design_scores_gemma":[0.00021677231,0.000026662003,0.00051640486,0.00020175612,0.0000024136489,0.00007891637,9.237204e-8,0.9739743,0.00016032867,0.023542184,0.0008545294,0.0004256747],"about_ca_topic_score_codex":0.000028772965,"about_ca_topic_score_gemma":0.00039032643,"teacher_disagreement_score":0.65559524,"about_ca_system_score_codex":0.00050942367,"about_ca_system_score_gemma":0.00053138484,"threshold_uncertainty_score":0.9998994},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; 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","score_opus":0.011529929320663341,"score_gpt":0.26068342799336625,"score_spread":0.2491534986727029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481022196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040742085,0.00033060164,0.9939911,0.0026958755,0.00061538105,0.0012119506,0.0000035721425,0.0001574952,0.00095328985],"genre_scores_gemma":[0.12623242,0.000024785097,0.87126184,0.002295214,0.00008633212,0.000038234848,0.000009185404,0.000023642111,0.000028365559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649054,0.00005417385,0.0006933993,0.001441514,0.00067344395,0.0006469217],"domain_scores_gemma":[0.99823076,0.00012850725,0.0003034706,0.0008429416,0.00023818576,0.00025612494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081515725,0.00039978666,0.0004364033,0.001137783,0.00021981439,0.00045342563,0.0011122336,0.0002117812,0.000010733984],"category_scores_gemma":[0.000081796876,0.00041176935,0.00007650259,0.0010563246,0.00028261746,0.00037161272,0.00036353635,0.0006236052,0.000020524722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015307807,0.0000130043,0.000047944213,0.00004019006,0.0000018770498,0.000007501388,0.0019045626,0.18879688,0.000012324766,0.012698954,0.000001984795,0.79647326],"study_design_scores_gemma":[0.0008527308,0.0004926049,0.00024412363,0.0015219036,0.000005324762,0.00012629331,0.0000231137,0.9656593,0.00035964162,0.01634512,0.0127589945,0.0016108059],"about_ca_topic_score_codex":0.00005553895,"about_ca_topic_score_gemma":0.0007467643,"teacher_disagreement_score":0.79486245,"about_ca_system_score_codex":0.0010180617,"about_ca_system_score_gemma":0.0010843611,"threshold_uncertainty_score":0.9998334},"labels":[],"label_agreement":null},{"id":"W1481901344","doi":"10.1007/978-3-540-79355-7_23","title":"An OCL-Based CSP Specification and Solving Tool","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Constraint programming; Computer science; Constraint satisfaction; Object Constraint Language; Constraint (computer-aided design); Constraint logic programming; Concurrent constraint logic programming; Usability; Programming language; Representation (politics); Theoretical computer science; Range (aeronautics); Local consistency; Mathematical optimization; Unified Modeling Language; Mathematics; Artificial intelligence; Human–computer interaction; Software; Engineering","score_opus":0.0989140523447704,"score_gpt":0.3371005366080038,"score_spread":0.2381864842632334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481901344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051031562,0.0014341587,0.98144436,0.00044928968,0.00049578573,0.00027204695,0.000009029125,0.0001237956,0.015720507],"genre_scores_gemma":[0.4079357,0.007733975,0.5749168,0.0011820046,0.00034831004,0.000056137353,0.00014412212,0.00006794643,0.007615013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982315,0.00003612418,0.00053664274,0.00064202375,0.00038559252,0.00016813866],"domain_scores_gemma":[0.9984922,0.0005087596,0.00023713197,0.00031296408,0.00039440693,0.000054556822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021752276,0.00027461458,0.00029041382,0.00034293602,0.00021518141,0.00008798758,0.0003471669,0.00012252848,0.00005003708],"category_scores_gemma":[0.00007395867,0.000299623,0.00005485351,0.00012033382,0.00037923982,0.00036142475,0.00012092766,0.00026162868,0.000040302242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008816558,0.00002994905,0.00021189239,0.000047839578,0.000043494823,0.000035973844,0.0014317881,0.3554241,0.0000016981921,0.46730372,0.00046596242,0.17499474],"study_design_scores_gemma":[0.000145073,0.00010965152,0.0014340115,0.00029487384,0.000010640561,0.00006252193,0.00011058745,0.8855903,0.0000333322,0.10684929,0.004740711,0.00061900297],"about_ca_topic_score_codex":0.000004028032,"about_ca_topic_score_gemma":0.000023053486,"teacher_disagreement_score":0.5301662,"about_ca_system_score_codex":0.00018241805,"about_ca_system_score_gemma":0.00016662356,"threshold_uncertainty_score":0.9999456},"labels":[],"label_agreement":null},{"id":"W1482700200","doi":"10.1109/time.1996.555685","title":"Characterizing temporal repetition","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Repetition (rhetorical device); Computer science; Artificial intelligence; Speech recognition","score_opus":0.021165173797710532,"score_gpt":0.21191234586297247,"score_spread":0.19074717206526193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482700200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024051515,0.000005537573,0.9191451,0.0037846977,0.00020288707,0.00003882606,2.1322226e-7,0.00028024818,0.07413735],"genre_scores_gemma":[0.93955773,0.000012613861,0.057491425,0.00082246255,0.000027759123,0.0000023205896,0.0000016771874,0.0000018326871,0.0020821597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996583,0.000011405522,0.00007829154,0.00011333876,0.00007106724,0.0000675959],"domain_scores_gemma":[0.9997794,0.000007501647,0.000025575497,0.0001388147,0.000019315861,0.000029362436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000042577063,0.000034835226,0.00003223379,0.000042701653,0.000050710623,0.000076904296,0.00008511834,0.00001697063,0.0013449144],"category_scores_gemma":[0.000007641498,0.000032787317,0.000017442313,0.0001164357,0.000007729741,0.00044504137,0.00002216732,0.000029607221,0.00027161455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010166539,0.00006153906,0.008166332,0.000006278287,0.000007640926,0.000013897837,0.000782557,0.00006152311,0.0043011587,0.25293052,0.0054938155,0.72817373],"study_design_scores_gemma":[0.0003788028,0.00004740284,0.031663854,0.000014084739,0.0000020932864,0.00008618963,0.000034484743,0.90821636,0.0031715017,0.0009096939,0.055179812,0.00029569454],"about_ca_topic_score_codex":0.0000043659256,"about_ca_topic_score_gemma":0.00000313811,"teacher_disagreement_score":0.9371526,"about_ca_system_score_codex":0.000010999051,"about_ca_system_score_gemma":0.000002766732,"threshold_uncertainty_score":0.999568},"labels":[],"label_agreement":null},{"id":"W1485568367","doi":"10.1017/cbo9780511808241.028","title":"Adding-Made-Easy Approximations","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.021926376450439985,"score_gpt":0.18997165540095487,"score_spread":0.16804527895051488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485568367","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017687274,0.000035530345,0.25902507,0.000029476072,0.00022309477,0.00022800075,0.00006750398,0.00032282996,0.7400667],"genre_scores_gemma":[0.00032817837,0.00017971541,0.009014774,0.00008811233,0.00006594584,8.3583865e-7,0.000053248885,0.000022101716,0.9902471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876004,0.000029228884,0.00018620117,0.00052011036,0.000288546,0.00021588692],"domain_scores_gemma":[0.9987199,0.000057225403,0.00022164913,0.00064919185,0.00018485918,0.00016717371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004944603,0.0002847831,0.00025607026,0.0002830486,0.00034582964,0.000088714245,0.00071659865,0.00027663953,0.000011656907],"category_scores_gemma":[0.000009230032,0.00036178643,0.00018531266,0.000019636114,0.0001719742,0.0002914325,0.00037008637,0.00035824708,0.000049910253],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047047733,0.000005173726,9.151314e-7,0.000014671876,0.000044890294,0.000089712616,0.00006486623,0.000057060985,0.0000066824414,0.95947146,0.032629423,0.0076104263],"study_design_scores_gemma":[0.00032343858,0.000019826874,0.000030465242,0.000063903404,0.000039280767,0.000078175195,0.0000065651025,0.006707045,0.00004341214,0.000010719686,0.9922689,0.00040822075],"about_ca_topic_score_codex":0.000022193182,"about_ca_topic_score_gemma":0.0000012377523,"teacher_disagreement_score":0.95963955,"about_ca_system_score_codex":0.000184136,"about_ca_system_score_gemma":0.00018709333,"threshold_uncertainty_score":0.9998834},"labels":[],"label_agreement":null},{"id":"W1485993952","doi":"10.1007/978-3-642-03685-9_10","title":"Optimal Sherali-Adams Gaps from Pairwise Independence","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairwise independence; Pairwise comparison; Constraint satisfaction problem; Hierarchy; Generalization; Conjecture; Independence (probability theory); Mathematics; Partition (number theory); Combinatorics; Domain (mathematical analysis); Discrete mathematics; Computer science; Random variable; Statistics; Independent and identically distributed random variables; Sum of normally distributed random variables","score_opus":0.012719353563984577,"score_gpt":0.2300012135828534,"score_spread":0.21728186001886882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485993952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014222405,0.00032491417,0.9915724,0.0012601892,0.0016507875,0.00033129996,0.000010278001,0.00031404992,0.004393894],"genre_scores_gemma":[0.10176817,0.00014072447,0.8933242,0.0033792765,0.00055267866,0.0000069465227,0.000022188326,0.000036110756,0.00076968526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955648,0.000047885576,0.0005961149,0.0017879654,0.0013707698,0.00063243526],"domain_scores_gemma":[0.99744433,0.00030702306,0.00032456144,0.0013916696,0.00027624506,0.00025619796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005805214,0.000590026,0.000514205,0.0006975905,0.00027794437,0.0008674689,0.0027832205,0.0004971815,0.00022103247],"category_scores_gemma":[0.000073062576,0.0005800187,0.00015619393,0.0005965362,0.0005141145,0.0011115915,0.000737506,0.0010824463,0.000103547696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051360907,0.000018692552,0.000083174884,0.0000051697666,0.000008320234,0.00009313778,0.00043786925,0.13125151,0.00006889603,0.0052103987,0.000035267418,0.8627824],"study_design_scores_gemma":[0.00050261634,0.0001954406,0.0014755357,0.00038284762,0.000012808901,0.000090136826,3.1072716e-7,0.90723324,0.0009202861,0.08525107,0.0027540522,0.0011816764],"about_ca_topic_score_codex":0.00008500373,"about_ca_topic_score_gemma":0.00018519996,"teacher_disagreement_score":0.86160076,"about_ca_system_score_codex":0.00036611827,"about_ca_system_score_gemma":0.0007365664,"threshold_uncertainty_score":0.99966514},"labels":[],"label_agreement":null},{"id":"W1487826456","doi":"10.1609/icaps.v23i1.13563","title":"Using Alternative Suboptimality Bounds in Heuristic Search","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Bounded function; Mathematical optimization; Heuristic; Upper and lower bounds; Computer science; Mathematics; Construct (python library); Constant (computer programming); Algorithm; Artificial intelligence","score_opus":0.0787746973012493,"score_gpt":0.32667422913694777,"score_spread":0.24789953183569846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487826456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98323274,0.000010610249,0.010591615,0.0014074907,0.00020638443,0.00013319122,0.000002018326,0.00012053191,0.0042954106],"genre_scores_gemma":[0.9782059,0.0000060448333,0.021637024,0.00008654541,0.000016116484,0.000005567767,9.2159627e-7,0.0000043796604,0.000037456823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.000013075137,0.0002451078,0.00023462156,0.0003138908,0.00014497754],"domain_scores_gemma":[0.99932086,0.000054073447,0.00015180132,0.000063226595,0.0003674468,0.00004256878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028744122,0.000103426406,0.000116924064,0.00017845385,0.000093714676,0.00035669951,0.00049048604,0.000047329973,0.000027417605],"category_scores_gemma":[0.00013379821,0.0000841885,0.000026520967,0.00020998777,0.00006691858,0.0004935691,0.00016788095,0.00020514145,0.000003273328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006409311,0.00015462935,0.34595567,0.0001062773,0.000119797165,0.000005604652,0.006096867,0.14976339,0.07484358,0.4158812,0.00012283471,0.0068860864],"study_design_scores_gemma":[0.0001966779,0.000016409567,0.037986673,0.00025781314,0.0000019949798,0.000014639185,0.00030900055,0.9554708,0.003096289,0.002562196,0.0000019397798,0.00008556988],"about_ca_topic_score_codex":0.0001736518,"about_ca_topic_score_gemma":0.0000012038596,"teacher_disagreement_score":0.8057074,"about_ca_system_score_codex":0.00006140693,"about_ca_system_score_gemma":0.00005773113,"threshold_uncertainty_score":0.34396616},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.18431476294971805,"score_gpt":0.3995988594853813,"score_spread":0.21528409653566327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487965496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114611454,0.000014495144,0.75510657,0.01572482,0.00016608812,0.0007437972,0.000017049315,0.00092068285,0.112695076],"genre_scores_gemma":[0.6591871,0.000022953713,0.30351484,0.0039785737,0.00027524077,0.000030854208,0.00007126104,0.000023893765,0.032895297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991414,0.0000764516,0.00010456275,0.00026160924,0.00022206701,0.00019393406],"domain_scores_gemma":[0.99933255,0.0001463746,0.000010576231,0.00035289704,0.00006913607,0.00008844975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037172507,0.000053292508,0.000053387736,0.00011281622,0.00016601656,0.00012339842,0.00028761747,0.000038754177,0.00064099825],"category_scores_gemma":[0.000024751036,0.00004639291,0.00002486463,0.0002782221,0.000032536263,0.00022406578,0.00002334741,0.000097039774,0.00013642793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021546864,0.00007983227,0.00006669198,0.0000017853883,0.0000020455373,9.1995264e-7,0.00018128083,0.0027040178,0.000043241485,0.051382117,0.006206565,0.93930995],"study_design_scores_gemma":[0.00068989146,0.0005716697,0.009528513,0.000012977896,0.0000013340524,0.000008885393,0.00014898565,0.5520504,0.0004954724,0.003411678,0.432889,0.00019114873],"about_ca_topic_score_codex":0.000017888151,"about_ca_topic_score_gemma":0.000082458115,"teacher_disagreement_score":0.9391188,"about_ca_system_score_codex":0.000029493662,"about_ca_system_score_gemma":0.00003845732,"threshold_uncertainty_score":0.7018481},"labels":[],"label_agreement":null},{"id":"W1489057821","doi":"10.1007/3-540-47922-8_5","title":"Transposition Table Driven Work Scheduling in Distributed Game-Tree Search","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Engineering; Operations management","score_opus":0.01700337401409503,"score_gpt":0.23242405791828966,"score_spread":0.21542068390419464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489057821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046354556,0.00017635645,0.99598277,0.0011178046,0.0006897998,0.00037098353,0.000010149294,0.00016032363,0.0010282882],"genre_scores_gemma":[0.66268414,0.00009751327,0.336402,0.0004478754,0.00016159442,0.000009209654,0.00003011203,0.000026125854,0.00014144581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968174,0.00005068568,0.00050641864,0.00119353,0.0008115775,0.0006203753],"domain_scores_gemma":[0.99857503,0.00020127781,0.00014617693,0.00072858366,0.00019279425,0.00015613149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047564646,0.00038870072,0.00039539443,0.0009552788,0.00017208756,0.0005063077,0.0014283567,0.0003234909,0.00007724908],"category_scores_gemma":[0.00003726585,0.00040697595,0.00009179725,0.0016112891,0.00038050202,0.00074988295,0.00029972143,0.00093252526,0.000043036856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004696603,0.000022370898,0.0009989578,0.000016363043,0.0000041865824,0.000053291325,0.00053300033,0.6891862,0.000046396253,0.0035982504,0.0000029957575,0.3055333],"study_design_scores_gemma":[0.00038168253,0.000057965735,0.003974921,0.00060612307,0.0000044766734,0.00002881006,2.771642e-7,0.9870034,0.0002652032,0.0070607136,0.00013765045,0.0004788154],"about_ca_topic_score_codex":0.000022766271,"about_ca_topic_score_gemma":0.00014151253,"teacher_disagreement_score":0.6622206,"about_ca_system_score_codex":0.00047993177,"about_ca_system_score_gemma":0.00029156313,"threshold_uncertainty_score":0.99983823},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Set (abstract data type); Algorithm; Domain (mathematical analysis); Exploit; Solver; Selection (genetic algorithm); Process (computing); Portfolio; Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.04901435405641711,"score_gpt":0.29536991143746544,"score_spread":0.24635555738104833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490176645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043720912,0.0000013795768,0.9430262,0.003804643,0.0008666983,0.00067547325,0.000004664285,0.00024402443,0.0076560136],"genre_scores_gemma":[0.92805934,0.0000019311192,0.07149282,0.0002100733,0.000070003225,0.000050146235,7.39713e-7,0.000009953144,0.00010500779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854857,0.000008100714,0.0004621596,0.00038290033,0.00033359844,0.00026466924],"domain_scores_gemma":[0.99847144,0.000113910595,0.00032468518,0.00018499323,0.0008177216,0.000087265034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044302968,0.00017196807,0.00018279468,0.00015308918,0.0002430292,0.00026758216,0.00084043667,0.00010975705,0.00015669945],"category_scores_gemma":[0.00047905548,0.00014003646,0.00011756733,0.0004862118,0.00017541977,0.0003488934,0.00007214494,0.00028416322,0.000023275714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020743673,0.0000739505,0.00021556957,0.000024637255,0.000007898279,7.901794e-8,0.00014180181,0.00032367426,0.08006689,0.7845703,0.000073472926,0.134481],"study_design_scores_gemma":[0.000032136923,0.000081446,0.0003181641,0.00003772486,0.000006820145,0.0000035938301,0.000036090747,0.57323,0.39091712,0.03511845,0.000100799254,0.00011762292],"about_ca_topic_score_codex":0.000013167595,"about_ca_topic_score_gemma":0.000017152843,"teacher_disagreement_score":0.88433844,"about_ca_system_score_codex":0.000027226697,"about_ca_system_score_gemma":0.00018212668,"threshold_uncertainty_score":0.5710521},"labels":[],"label_agreement":null},{"id":"W1492028561","doi":"10.1007/3-540-45049-1_54","title":"The Formal Specification and Implementation of a Modest First Order Temporal Logic","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; Nortel (Canada)","funders":"","keywords":"Computer science; Programming language; Temporal logic; Logic programming; Description logic; First-order logic; Syntax; Semantics (computer science); Interval temporal logic; Theoretical computer science; Artificial intelligence","score_opus":0.01619250709659672,"score_gpt":0.25426003266062475,"score_spread":0.23806752556402802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492028561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012427091,0.00012674129,0.9962113,0.0014689703,0.00029253738,0.00031638108,0.0000036827203,0.00003820431,0.0014179177],"genre_scores_gemma":[0.6924952,0.00053658476,0.30630502,0.00041448264,0.00011995234,0.000011135943,0.000012498742,0.000014507128,0.00009058831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998419,0.000016562683,0.0003878528,0.00050397,0.0004078445,0.00026476276],"domain_scores_gemma":[0.99887395,0.0001899773,0.0002505469,0.0004684836,0.00016308254,0.0000539463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045126316,0.00019560783,0.00017195797,0.00025615658,0.00035668374,0.0002878968,0.0006880665,0.00010023497,0.00003590487],"category_scores_gemma":[0.000014593948,0.0001501592,0.00003716899,0.0003313904,0.00045063737,0.0005869777,0.00023328749,0.0002041068,0.0000046827126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039319148,0.000004992411,0.00031042637,0.000010212172,0.0000035976448,0.000001637662,0.00044970235,0.015595738,0.000009806995,0.06766925,0.000005149447,0.9159356],"study_design_scores_gemma":[0.00037486712,0.00014172148,0.0043854215,0.000088326444,0.000006741912,0.000050578437,0.0000020368557,0.8742951,0.00022620347,0.11813105,0.0019419371,0.0003560106],"about_ca_topic_score_codex":0.00005119695,"about_ca_topic_score_gemma":0.00091539114,"teacher_disagreement_score":0.91557956,"about_ca_system_score_codex":0.00008547995,"about_ca_system_score_gemma":0.00023541991,"threshold_uncertainty_score":0.6123315},"labels":[],"label_agreement":null},{"id":"W1495927311","doi":"10.1007/978-3-642-02777-2_35","title":"VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Heuristics; Backtracking; DPLL algorithm; Probabilistic logic; Inference; Local consistency; Constraint satisfaction problem; Solver; Heuristic; Random variable; Theoretical computer science; Variable (mathematics); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.020088596819840737,"score_gpt":0.26177628607030023,"score_spread":0.2416876892504595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495927311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024890702,0.000035275494,0.9896952,0.0007231914,0.00026230447,0.00058553496,0.0000035975643,0.00037693567,0.008293103],"genre_scores_gemma":[0.10705567,0.000018364415,0.89168376,0.0008490069,0.00014084417,0.000010097776,0.0000054830575,0.000022169366,0.00021457755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965805,0.000029643506,0.00047548176,0.0013762062,0.0009849496,0.00055325945],"domain_scores_gemma":[0.9976323,0.00042291766,0.00023635576,0.0010249062,0.0005212463,0.00016227509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007246164,0.00050326355,0.00042881095,0.00084929884,0.00026593904,0.0007875478,0.0019346619,0.00026910746,0.000027137321],"category_scores_gemma":[0.00014809726,0.00040936383,0.00007005448,0.000847154,0.0007147633,0.00076397357,0.00053322274,0.0010381336,0.000012579089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039696756,0.00002368395,0.000054496213,0.000021035095,0.0000044296003,0.000021183847,0.00046361142,0.032284614,0.00014459228,0.04747338,0.0000018261792,0.91950315],"study_design_scores_gemma":[0.00026768367,0.0005236288,0.0003995722,0.001124131,0.00000941808,0.00019161777,4.844527e-7,0.942137,0.0017237267,0.052172337,0.0005025173,0.0009478915],"about_ca_topic_score_codex":0.000034743374,"about_ca_topic_score_gemma":0.0002261029,"teacher_disagreement_score":0.9185553,"about_ca_system_score_codex":0.00037242743,"about_ca_system_score_gemma":0.0010952844,"threshold_uncertainty_score":0.99983585},"labels":[],"label_agreement":null},{"id":"W1497380692","doi":"10.1007/3-540-44886-1_13","title":"Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Probabilistic logic; Computer science; Boolean satisfiability problem; Smoothing; Scheduling (production processes); Local search (optimization); Mathematical optimization; Job shop scheduling; Extension (predicate logic); Scaling; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Schedule","score_opus":0.015047019503925578,"score_gpt":0.24949310952874643,"score_spread":0.23444609002482084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497380692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096573815,0.00020526281,0.99637425,0.0010827277,0.0009045256,0.00069975905,0.000006164684,0.00012589907,0.00050481944],"genre_scores_gemma":[0.20959108,0.00005426803,0.78842926,0.0014999945,0.00009555673,0.000017971275,0.000015349708,0.00004149624,0.00025505424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997152,0.000038490845,0.0004155737,0.0012989468,0.0005748299,0.00052021426],"domain_scores_gemma":[0.99813944,0.00062842976,0.00014294172,0.0006325163,0.00028238786,0.00017429964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080011255,0.00038069225,0.00036991798,0.0006145372,0.00030315068,0.0005622515,0.000920422,0.00027849132,0.00001469007],"category_scores_gemma":[0.00009670304,0.0003611452,0.00008099976,0.00042804473,0.00088693463,0.0004112063,0.00039677363,0.00051091565,0.0000067020696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005327064,0.000011870686,0.000029070066,0.00007390352,0.000007136211,0.000011990713,0.0004208123,0.15846053,0.000032351272,0.030279351,0.000004424761,0.8106632],"study_design_scores_gemma":[0.00029014287,0.00008216994,0.0000811032,0.00018279855,0.000007351916,0.00007787815,3.7897465e-7,0.92967904,0.00012253936,0.068652615,0.00042597658,0.00039801406],"about_ca_topic_score_codex":0.0000075949715,"about_ca_topic_score_gemma":0.00005548103,"teacher_disagreement_score":0.81026524,"about_ca_system_score_codex":0.0003529091,"about_ca_system_score_gemma":0.00042607656,"threshold_uncertainty_score":0.99988407},"labels":[],"label_agreement":null},{"id":"W1498434299","doi":"","title":"A Graph Based Synthesis Algorithm for Solving CSPs.","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Constraint satisfaction problem; Computer science; Constraint graph; Constraint satisfaction; Algorithm; Graph; Local consistency; Theoretical computer science; Artificial intelligence","score_opus":0.01345724441940083,"score_gpt":0.22550436921543038,"score_spread":0.21204712479602955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498434299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002664654,0.000007787252,0.99279445,0.00039898782,0.00018524982,0.00012432302,0.000001440953,0.00015597067,0.006305145],"genre_scores_gemma":[0.060865503,0.0000023479254,0.93837655,0.00049652805,0.000008269494,0.000038576218,6.229173e-7,0.0000041572475,0.0002074371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948716,0.000019780042,0.000099950485,0.0001773571,0.00008457051,0.00013115816],"domain_scores_gemma":[0.9994966,0.00020030863,0.00002922857,0.00017067717,0.00005557964,0.00004761301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017129107,0.000061779734,0.000064472304,0.00008987171,0.00010300715,0.00008816177,0.00011814709,0.00002851787,0.00021082428],"category_scores_gemma":[0.00010511597,0.000057152203,0.00005876134,0.00019691543,0.000013667513,0.00019144583,0.000008593604,0.00002419605,0.000010906539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.679522e-7,0.000025343046,0.00016916808,0.000004659771,0.000007971294,8.9139536e-7,0.000034292236,0.0007089411,0.000123653,0.09596171,0.0009175121,0.9020453],"study_design_scores_gemma":[0.00020465394,0.000014062776,0.00021367663,0.000005623279,0.0000041040435,0.000004162403,0.000016815897,0.98467195,0.009357133,0.001650729,0.0037400892,0.000116994466],"about_ca_topic_score_codex":0.000004826124,"about_ca_topic_score_gemma":0.00000677204,"teacher_disagreement_score":0.983963,"about_ca_system_score_codex":0.000014750359,"about_ca_system_score_gemma":0.00005628686,"threshold_uncertainty_score":0.23305993},"labels":[],"label_agreement":null},{"id":"W1503365423","doi":"10.1007/978-3-540-45193-8_35","title":"Discrepancy-Based Additive Bounding for the AllDifferent Constraint","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounding overwatch; Computer science; Constraint programming; Constraint (computer-aided design); Mathematical optimization; Relaxation (psychology); Constraint satisfaction; Upper and lower bounds; Branch and bound; Heuristic; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.018828133467984006,"score_gpt":0.2502116011789794,"score_spread":0.23138346771099538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503365423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004384997,0.00014455557,0.99149704,0.003450919,0.0022687088,0.0008626941,0.00002858648,0.00011319914,0.0016299319],"genre_scores_gemma":[0.09850971,0.00006455194,0.8940112,0.006556174,0.00038571373,0.00009280684,0.000026581294,0.000046864014,0.00030639386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733806,0.00003674992,0.00042307356,0.0010696301,0.0006202183,0.00051225047],"domain_scores_gemma":[0.99697167,0.0014766657,0.00028740297,0.000885166,0.000254948,0.00012414745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065678824,0.0004206907,0.00034796252,0.0003955731,0.00055385585,0.00068809686,0.0014657169,0.00019416866,0.00008594118],"category_scores_gemma":[0.0001668198,0.00031086148,0.00018947771,0.0003190922,0.0009765932,0.00027965198,0.00024116093,0.00048199072,0.00000870534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061662163,0.000017449378,0.00002193317,0.000018022216,0.000019136363,0.000009666216,0.0003151328,0.03968293,0.00001970096,0.15006153,0.00007750299,0.80975085],"study_design_scores_gemma":[0.00044681772,0.00011205752,0.0001292841,0.00022116702,0.000017375445,0.000035069825,7.6941393e-7,0.9193394,0.0005288372,0.071797885,0.006844139,0.0005271912],"about_ca_topic_score_codex":0.0000060628527,"about_ca_topic_score_gemma":0.00009071214,"teacher_disagreement_score":0.8796565,"about_ca_system_score_codex":0.0003327727,"about_ca_system_score_gemma":0.0007105067,"threshold_uncertainty_score":0.9999344},"labels":[],"label_agreement":null},{"id":"W1508207627","doi":"","title":"Towards Temporal Reasoning Using Qualitative Probabilities","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Probabilistic logic; Axiom; Abstraction; Causality (physics); Qualitative reasoning; Computer science; Set (abstract data type); Constant (computer programming); Theoretical computer science; Probabilistic relevance model; Probability distribution; Temporal logic; Artificial intelligence; Mathematics; Algorithm; Probabilistic analysis of algorithms; Statistics; Programming language","score_opus":0.07442154708020235,"score_gpt":0.3150522443592541,"score_spread":0.24063069727905176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508207627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009801436,0.000023017285,0.95734096,0.00088099414,0.00012633938,0.000083041115,6.0241496e-7,0.00020333724,0.03154028],"genre_scores_gemma":[0.5490816,0.0000021485655,0.44999725,0.0001149093,0.000013457573,0.0000023078085,4.399383e-7,0.000002366813,0.0007855088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935055,0.0000827074,0.00013549396,0.00017116222,0.00013981652,0.00012025493],"domain_scores_gemma":[0.9996537,0.000036502555,0.000043158274,0.00015569245,0.000067791574,0.00004313242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001816639,0.000066195185,0.00007149641,0.00005834715,0.00009554126,0.00011097016,0.00012738229,0.000025758662,0.0005427415],"category_scores_gemma":[0.000065202905,0.00005915845,0.000030508638,0.00020872163,0.000042608823,0.0005537645,0.00004782855,0.000047882906,0.000028549615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019427694,0.00005224436,0.0016578791,0.000016392778,0.000019316622,0.000004591341,0.06037217,0.0028247952,0.00010368647,0.8217251,0.0010942594,0.112127654],"study_design_scores_gemma":[0.00014589031,0.000024779307,0.00032969617,0.000012509677,0.0000017611409,0.00001677064,0.0022350037,0.9919402,0.0002015542,0.0043105893,0.0006399142,0.00014135924],"about_ca_topic_score_codex":0.000109720444,"about_ca_topic_score_gemma":0.000018820985,"teacher_disagreement_score":0.98911536,"about_ca_system_score_codex":0.00004727238,"about_ca_system_score_gemma":0.00002507667,"threshold_uncertainty_score":0.5942639},"labels":[],"label_agreement":null},{"id":"W1510636674","doi":"10.1007/11564751_17","title":"Tractable Clones of Polynomials over Semigroups","year":2005,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Mathematics; Constraint satisfaction problem; Combinatorics; Semigroup; Conjecture; Class (philosophy); Discrete mathematics; Set (abstract data type); Exponent; Polynomial; Computer science","score_opus":0.008777145447686784,"score_gpt":0.24534849607655632,"score_spread":0.23657135062886953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510636674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06638144,0.00007150399,0.9315093,0.0013090641,0.0004683514,0.000106708416,9.478409e-7,0.00007052252,0.000082166],"genre_scores_gemma":[0.637487,0.0000068571508,0.36190835,0.0005112631,0.00008062539,0.0000016473568,3.1325408e-7,0.0000026362097,0.0000013090378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852496,0.000037757753,0.00030626426,0.0004489415,0.000375297,0.00030674814],"domain_scores_gemma":[0.99904513,0.000208991,0.00012269504,0.00045546063,0.00009025055,0.00007745815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202105,0.00012694046,0.00017780342,0.0003367723,0.00010195908,0.00015694866,0.0008519349,0.000060693696,0.000050004455],"category_scores_gemma":[0.00008022653,0.00011597396,0.00004571376,0.0013912192,0.00021557786,0.0011067889,0.00021684679,0.0001355765,0.00000936218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002554607,0.00004181477,0.0049370327,0.0000049290993,0.0000018416503,0.0000017532814,0.0007036021,0.21511224,0.0061963242,0.00096131064,0.00001565555,0.77202094],"study_design_scores_gemma":[0.00026860903,0.000040630868,0.025317835,0.000024956526,0.000001350493,0.000023701958,4.1748964e-7,0.9236329,0.049002506,0.0013454884,0.00017988204,0.00016171699],"about_ca_topic_score_codex":0.000048764137,"about_ca_topic_score_gemma":0.00011245395,"teacher_disagreement_score":0.7718592,"about_ca_system_score_codex":0.00008567603,"about_ca_system_score_gemma":0.00018117896,"threshold_uncertainty_score":0.4729281},"labels":[],"label_agreement":null},{"id":"W1511592741","doi":"10.1007/3-540-45349-0_43","title":"An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Heuristic; Local consistency; Probabilistic logic; Consistency (knowledge bases); Constructive; Constraint satisfaction; Consistent heuristic; Constraint (computer-aided design); Mathematical optimization; Null-move heuristic; Variable (mathematics); Algorithm; Incremental heuristic search; Artificial intelligence; Search algorithm; Mathematics; Beam search; Process (computing)","score_opus":0.018998376886875216,"score_gpt":0.27207606733040585,"score_spread":0.2530776904435306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511592741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020502289,0.000043890595,0.9903548,0.00011047022,0.00060242706,0.00068547047,0.000003036015,0.00014528743,0.0060044136],"genre_scores_gemma":[0.7604747,0.000011100851,0.23892882,0.00037582478,0.000092980095,0.000012029177,0.0000035539708,0.000022574659,0.0000784339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966937,0.00007925021,0.0006781336,0.0013074529,0.00083596277,0.0004055228],"domain_scores_gemma":[0.99758625,0.00039469905,0.0002694785,0.0012765708,0.00029474567,0.00017825948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055837043,0.00039229498,0.0005294849,0.0006705915,0.00022356973,0.00031584164,0.0016230702,0.00019272485,0.00017332172],"category_scores_gemma":[0.00015524618,0.0003759489,0.00006151905,0.0007787294,0.00056326995,0.00046407527,0.00035866824,0.00051435595,0.000018538503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018358369,0.00039701036,0.0008447225,0.000057435354,0.000020782643,0.00009078377,0.0029613057,0.52132297,0.000052564843,0.016013838,0.000004000527,0.45821625],"study_design_scores_gemma":[0.00050314,0.0010504681,0.0009485657,0.00021647823,0.000021260888,0.00013472201,0.0000017213277,0.856645,0.000033608554,0.13972273,0.00016027654,0.000562047],"about_ca_topic_score_codex":0.00008669556,"about_ca_topic_score_gemma":0.00016279017,"teacher_disagreement_score":0.75842446,"about_ca_system_score_codex":0.00016640207,"about_ca_system_score_gemma":0.0010019583,"threshold_uncertainty_score":0.9998692},"labels":[],"label_agreement":null},{"id":"W1512940807","doi":"10.1007/978-3-540-85958-1_7","title":"An Application of Constraint Programming to Superblock Instruction Scheduling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Parallel computing; Heuristics; Scheduling (production processes); Instruction scheduling; Suite; Optimizing compiler; Programming language; Mathematical optimization; Two-level scheduling; Schedule; Dynamic priority scheduling; Operating system; Mathematics","score_opus":0.012909769986630262,"score_gpt":0.24648779912681806,"score_spread":0.2335780291401878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512940807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013646045,0.000040058763,0.9965771,0.0002661189,0.00061131234,0.0005879201,0.0000029048917,0.00016730082,0.00038271284],"genre_scores_gemma":[0.40955168,0.000014065948,0.59012336,0.00017560156,0.000102810656,0.000009038398,0.0000054353277,0.000011798449,0.000006194585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997385,0.00002449857,0.000542505,0.0010512767,0.0006555813,0.00034110455],"domain_scores_gemma":[0.99817586,0.000091054026,0.00026701984,0.0008957506,0.00037964474,0.0001906794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004034863,0.00030935675,0.00034372407,0.0008846586,0.00020472349,0.00019204992,0.0011941644,0.00022619634,0.000008715243],"category_scores_gemma":[0.000050300314,0.00032437785,0.000075886615,0.0007418701,0.00052445155,0.00062287424,0.00026377031,0.00038141804,0.000010682135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026302303,0.00001544853,0.00015882002,0.000012865927,0.0000032399728,0.0000037321843,0.00061881624,0.1786065,0.00048431673,0.006610901,4.6469174e-7,0.8134823],"study_design_scores_gemma":[0.0002708174,0.00021978623,0.0004824302,0.00016858736,0.0000053619688,0.00018176263,0.0000012061652,0.9898078,0.0028959047,0.0047878874,0.00067910564,0.00049934065],"about_ca_topic_score_codex":0.000032103937,"about_ca_topic_score_gemma":0.000079412515,"teacher_disagreement_score":0.8129829,"about_ca_system_score_codex":0.00021027491,"about_ca_system_score_gemma":0.00046159365,"threshold_uncertainty_score":0.99992085},"labels":[],"label_agreement":null},{"id":"W1513735063","doi":"10.1007/11734673_6","title":"Weak Contact Structures","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Orthogonality; Axiom; Lattice (music); Distributive property; Relation (database); Algebraic structure; Algebraic number; Computer science; Connection (principal bundle); Mathematics; Pure mathematics; Algebra over a field; Geometry; Mathematical analysis; Physics; Data mining","score_opus":0.010940021367831605,"score_gpt":0.22949761510780095,"score_spread":0.21855759373996936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513735063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017117705,0.00016203214,0.9744762,0.0007852589,0.0019204655,0.00027243755,0.000005484066,0.0002270578,0.022133911],"genre_scores_gemma":[0.2937025,0.00004619334,0.7015097,0.0019903588,0.0007813765,0.000007968049,0.000023584082,0.000053766646,0.0018845279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997057,0.000024449215,0.0004565996,0.0011850632,0.00079548877,0.00048136915],"domain_scores_gemma":[0.99820155,0.00022430021,0.0002629775,0.0009824985,0.00019679409,0.00013189347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032718357,0.00044620637,0.00039637001,0.00077440246,0.0002337354,0.000633481,0.0017794095,0.0002985729,0.00010369953],"category_scores_gemma":[0.0000407311,0.00041505683,0.00012180977,0.0004341321,0.00037478167,0.00058969576,0.00054209784,0.00061445317,0.000041944255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027264152,0.000009806589,0.00013599315,0.000015003657,0.000007803726,0.000039539973,0.00012580297,0.09925091,0.0000867566,0.13401158,0.00020655496,0.7661075],"study_design_scores_gemma":[0.00048079633,0.00013834564,0.0027467178,0.00019559718,0.000010405729,0.00016664028,1.1872734e-7,0.7107823,0.0008033745,0.27422935,0.009348644,0.0010977414],"about_ca_topic_score_codex":0.000051405812,"about_ca_topic_score_gemma":0.00015898337,"teacher_disagreement_score":0.76500976,"about_ca_system_score_codex":0.00026730952,"about_ca_system_score_gemma":0.0004632393,"threshold_uncertainty_score":0.9998301},"labels":[],"label_agreement":null},{"id":"W1516376175","doi":"10.1016/b978-0-08-097086-8.43023-0","title":"Constraint-Satisfaction Models","year":2015,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint (computer-aided design); Constraint satisfaction; Computer science; Constraint learning; Artificial neural network; Artificial intelligence; Local consistency; Management science; Mathematics; Engineering","score_opus":0.03669243909480073,"score_gpt":0.24679801553143108,"score_spread":0.21010557643663036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516376175","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010164936,0.00025801305,0.10740944,0.0001637126,0.00087636634,0.00038886603,0.000021077161,0.0003758835,0.8905056],"genre_scores_gemma":[0.0022093905,0.000074813266,0.019556085,0.0003347801,0.00017973252,0.000019500612,0.000021934391,0.00005203099,0.97755176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979956,0.000034568122,0.0004894329,0.00063603686,0.00056758616,0.00027674314],"domain_scores_gemma":[0.9982649,0.00004602889,0.00032771053,0.0007909937,0.0003220298,0.00024833812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029023024,0.00041918462,0.00041301118,0.00026718722,0.0001268758,0.00020017139,0.00042665898,0.00039253334,0.00033478742],"category_scores_gemma":[0.00001397588,0.00043684317,0.00018628725,0.000025012538,0.00016250816,0.00037770305,0.00018742449,0.00047219225,0.00037979573],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017069984,0.0000013867956,0.0000014444983,0.000008785095,0.000028128661,0.000010846533,0.000098906996,0.00021271732,0.0000024479132,0.29887447,0.00036666772,0.7003925],"study_design_scores_gemma":[0.00039607976,0.000051191946,0.00001338799,0.00014773433,0.000044203356,0.00013320972,0.0000071994095,0.016958563,0.000007027301,0.26101813,0.72054875,0.00067453337],"about_ca_topic_score_codex":0.0000011744103,"about_ca_topic_score_gemma":0.000042915155,"teacher_disagreement_score":0.72018206,"about_ca_system_score_codex":0.00022381802,"about_ca_system_score_gemma":0.00045958054,"threshold_uncertainty_score":0.9998083},"labels":[],"label_agreement":null},{"id":"W1516765212","doi":"","title":"Nonbinary Constraint Satisfaction: From the Dual to the Primal","year":2001,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Local consistency; Consistency (knowledge bases); Encoding (memory); Constraint satisfaction problem; Computer science; Binary number; Dual (grammatical number); Constraint (computer-aided design); Consistency model; Theoretical computer science; Mathematics; Algorithm; Mathematical optimization; Arithmetic; Artificial intelligence","score_opus":0.015971990018730915,"score_gpt":0.23419229467997374,"score_spread":0.21822030466124281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516765212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024474958,0.000018778494,0.88741136,0.0707515,0.000688622,0.00026603625,0.000005002074,0.00018931656,0.01619444],"genre_scores_gemma":[0.96578175,0.000017352668,0.026221845,0.007272712,0.00019009037,0.000015964715,0.000002956903,0.0000043319587,0.00049301784],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99912626,0.00007502724,0.00016153618,0.000240433,0.0002315802,0.00016515015],"domain_scores_gemma":[0.9991416,0.0002235539,0.00004037007,0.00046586365,0.000056440647,0.00007216841],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018498638,0.00009699832,0.00006981305,0.000025766885,0.00031795888,0.00023358535,0.000329282,0.000033797067,0.001412955],"category_scores_gemma":[0.000037384703,0.000053077943,0.00004549648,0.00031968002,0.00006983932,0.00024890905,0.00014748999,0.00012508001,0.00038678915],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017570004,0.000025918755,0.041131493,6.330675e-7,0.000036515787,0.000025299802,0.0017936435,0.0027373936,0.00022765729,0.12917173,0.032303445,0.7925287],"study_design_scores_gemma":[0.00043169464,0.00008206073,0.849574,0.000010087443,0.000011135173,0.00028013962,0.00073917955,0.04603309,0.00016420895,0.0016750203,0.10072838,0.00027095652],"about_ca_topic_score_codex":0.00038407042,"about_ca_topic_score_gemma":0.0010276943,"teacher_disagreement_score":0.94130677,"about_ca_system_score_codex":0.000035320376,"about_ca_system_score_gemma":0.00007485451,"threshold_uncertainty_score":0.9994999},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016696272430506563,"score_gpt":0.2472365281927607,"score_spread":0.23054025576225415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519526968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017156343,0.00019744027,0.9967602,0.0007583945,0.00080195884,0.0006787426,0.000005671594,0.00013076175,0.00049525814],"genre_scores_gemma":[0.57408726,0.00003302987,0.42505202,0.00049937615,0.0001005624,0.000013198743,0.000006570482,0.000028852439,0.00017912073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972336,0.000025318357,0.00038675693,0.0012404297,0.00061838335,0.00049551],"domain_scores_gemma":[0.99822056,0.00065798085,0.00012905187,0.00059878617,0.00023054321,0.00016307515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007016279,0.00034497923,0.00033205366,0.0005917397,0.00029345043,0.00053573755,0.00092292606,0.00022575844,0.000017107877],"category_scores_gemma":[0.00008732358,0.00032645094,0.0000810378,0.00035387866,0.00085943093,0.00021774127,0.00053900585,0.00046398843,0.000011011017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020392652,0.0000088420065,0.000008519038,0.000038784758,0.0000026973128,0.000005600685,0.00038701156,0.4685925,0.0000104154005,0.010039081,0.000001165245,0.52090335],"study_design_scores_gemma":[0.00025023308,0.000080268714,0.00009835191,0.00020835806,0.000006073767,0.000060869104,3.261596e-7,0.9835444,0.000056559835,0.015182859,0.00015416478,0.00035752414],"about_ca_topic_score_codex":0.000006740942,"about_ca_topic_score_gemma":0.00002624178,"teacher_disagreement_score":0.5739157,"about_ca_system_score_codex":0.0003611712,"about_ca_system_score_gemma":0.0002568035,"threshold_uncertainty_score":0.99991876},"labels":[],"label_agreement":null},{"id":"W1521241992","doi":"10.1007/978-3-540-87877-3_28","title":"An Adverbial Approach for the Formal Specification of Topological Constraints Involving Regions with Broad Boundaries","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre de Géomatique du Québec; Université Laval","funders":"","keywords":"Adverbial; Topology (electrical circuits); Computer science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.029364224614895316,"score_gpt":0.24688251624107543,"score_spread":0.2175182916261801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521241992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006174581,0.0001284849,0.99703586,0.00039617092,0.00045116383,0.00063612335,0.000007530103,0.00007660475,0.0012063266],"genre_scores_gemma":[0.40317467,0.000050489332,0.5963071,0.0002557129,0.00015462135,0.000010219835,0.0000116843385,0.000009578356,0.00002594763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787813,0.000024882136,0.00041331007,0.0007385263,0.0005696312,0.00037550085],"domain_scores_gemma":[0.9979846,0.00044967854,0.0003380842,0.00077515154,0.0003627946,0.000089700756],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006375256,0.00027237882,0.00029450312,0.00033075205,0.00076749857,0.00037289178,0.0013846051,0.00020863001,0.0000103998145],"category_scores_gemma":[0.00006554836,0.00018778192,0.00008428586,0.00035782176,0.0044951346,0.00076035457,0.0001983998,0.000381694,7.5447036e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040438477,0.00005103111,0.00022154112,0.000029137904,0.000018524464,0.000006819526,0.0023564321,0.075148866,0.000056042925,0.28649506,0.000021191152,0.6355549],"study_design_scores_gemma":[0.000530945,0.00043637643,0.0019018354,0.00009390119,0.000015516876,0.0002763132,0.000008131174,0.98340636,0.00044458243,0.011535619,0.0008705105,0.00047990782],"about_ca_topic_score_codex":0.000017675113,"about_ca_topic_score_gemma":0.00010790779,"teacher_disagreement_score":0.9082575,"about_ca_system_score_codex":0.00011542515,"about_ca_system_score_gemma":0.00074523775,"threshold_uncertainty_score":0.99821407},"labels":[],"label_agreement":null},{"id":"W1521683430","doi":"10.1609/socs.v4i1.18288","title":"Optimal-Generation Variants of EPEA*","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Leverage (statistics); Mathematical optimization; Computer science; Scope (computer science); Class (philosophy); Mathematics; Branching (polymer chemistry); Artificial intelligence","score_opus":0.01847776980982106,"score_gpt":0.25402562463627865,"score_spread":0.2355478548264576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521683430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115099,0.000019474064,0.011489029,0.017737964,0.012671619,0.0003785096,0.000017788027,0.000078705576,0.04609702],"genre_scores_gemma":[0.99580884,0.000023117775,0.0035361475,0.00008291316,0.00020909528,0.000005986679,0.0000034141253,0.0000064761084,0.0003240143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998496,0.000018407738,0.00029540496,0.00025223906,0.0008198421,0.00011813351],"domain_scores_gemma":[0.9983021,0.000058607046,0.0001715441,0.00014382784,0.0012815808,0.000042330594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003510545,0.00008829149,0.00012171486,0.00007255966,0.00008422392,0.00012239722,0.00083366944,0.00005876278,0.000064922424],"category_scores_gemma":[0.00017688068,0.00007602504,0.00009162538,0.00038006494,0.000050578223,0.0003401509,0.00035142244,0.00013710091,0.0000057357647],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024732979,0.00016301028,0.001671439,0.000012891208,0.00004126626,5.9280137e-7,0.00024103987,0.0015780544,0.30741543,0.68705434,0.0006086163,0.0011886016],"study_design_scores_gemma":[0.00090356305,0.000104421735,0.0038715634,0.00006530294,0.00000823858,0.00001809606,0.000044509437,0.060372155,0.9302526,0.003402885,0.00083113415,0.00012553361],"about_ca_topic_score_codex":0.00002039012,"about_ca_topic_score_gemma":0.0000011456468,"teacher_disagreement_score":0.68365145,"about_ca_system_score_codex":0.000092078444,"about_ca_system_score_gemma":0.00012238073,"threshold_uncertainty_score":0.31002113},"labels":[],"label_agreement":null},{"id":"W1522643426","doi":"10.1109/tai.1996.560463","title":"An empirical investigation of the forward checking algorithm and its derivatives","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Heuristic; Pruning; Algorithm; Constraint satisfaction problem; Empirical research; Constraint (computer-aided design); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.022999064228905935,"score_gpt":0.27997321994580215,"score_spread":0.2569741557168962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522643426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13906157,0.000012923905,0.85726136,0.003114896,0.000037094407,0.00006359765,3.737891e-7,0.000039408573,0.000408793],"genre_scores_gemma":[0.79306686,0.0000041397047,0.20642754,0.00044663416,0.000015849982,0.0000012998231,3.8786507e-7,0.0000013492742,0.000035913577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960726,0.000038803595,0.00009901551,0.000107006716,0.00009464314,0.000053273383],"domain_scores_gemma":[0.9997414,0.000023024566,0.000045464447,0.00010773442,0.000046874746,0.000035501755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009023729,0.00003989101,0.000043343614,0.000029586763,0.00006180995,0.000034798522,0.000118723015,0.00002247321,0.000017631435],"category_scores_gemma":[0.000018173389,0.000027518376,0.000013054269,0.00016372559,0.000035583686,0.0005092495,0.000043225045,0.00003521559,0.0000012067404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010544197,0.000021178412,0.05997283,0.0000068887284,0.000009771285,1.479171e-7,0.0052265227,0.002111526,0.0066211745,0.023794476,0.00013032593,0.9021041],"study_design_scores_gemma":[0.0000855266,0.000012485952,0.20051141,0.0000043866858,0.0000012736509,0.0000036708311,0.000040143634,0.7714192,0.027234972,0.0005159326,0.00013018357,0.00004076089],"about_ca_topic_score_codex":0.0000023924706,"about_ca_topic_score_gemma":0.000008416,"teacher_disagreement_score":0.90206337,"about_ca_system_score_codex":0.000009522451,"about_ca_system_score_gemma":0.000028822726,"threshold_uncertainty_score":0.11221668},"labels":[],"label_agreement":null},{"id":"W1522779181","doi":"","title":"Local consistency in junction graphs for constraint-based inference","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Local consistency; Constraint satisfaction problem; Consistency (knowledge bases); Theoretical computer science; Constraint satisfaction; Weak consistency; Computer science; Constraint graph; Sequential consistency; Constraint programming; Mathematics; Strong consistency; Mathematical optimization; Consistency model; Algorithm; Correctness; Discrete mathematics; Artificial intelligence","score_opus":0.012945241794034498,"score_gpt":0.23892663826241353,"score_spread":0.22598139646837903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522779181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014746811,0.000007636562,0.9864059,0.0009025717,0.000187818,0.00022221162,0.0000018192447,0.00015116659,0.01064617],"genre_scores_gemma":[0.9190305,9.822703e-7,0.08043105,0.00033950654,0.0000070526758,0.000028340246,0.0000106203815,0.0000029328326,0.00014902152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992432,0.000025373538,0.00023598007,0.00023201143,0.0001039256,0.00015952949],"domain_scores_gemma":[0.9995033,0.00015390401,0.00005162365,0.00016271771,0.00009498817,0.000033455708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014382575,0.00008643915,0.00009444029,0.00018382956,0.00006344466,0.00006965231,0.00011839506,0.000055436314,0.000068375804],"category_scores_gemma":[0.000034004373,0.00008413151,0.00004989086,0.00032311227,0.000108911496,0.00023424957,0.0000137315865,0.000054984732,0.000009824583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006802151,0.000053395128,0.00885789,0.0000091017055,0.0000018676769,0.0000018320403,0.000017364886,0.015958756,0.00017064704,0.8761036,0.00044760306,0.09837114],"study_design_scores_gemma":[0.0012007189,0.00006523558,0.021811238,0.00001639398,0.0000030807191,0.00000607341,0.000055122517,0.95060253,0.0013201325,0.02378329,0.0009408816,0.00019528322],"about_ca_topic_score_codex":0.00023489012,"about_ca_topic_score_gemma":0.0012668774,"teacher_disagreement_score":0.9346438,"about_ca_system_score_codex":0.000040611234,"about_ca_system_score_gemma":0.0001544301,"threshold_uncertainty_score":0.34307835},"labels":[],"label_agreement":null},{"id":"W1522877314","doi":"10.1007/978-3-642-15396-9_4","title":"Testing Expressibility Is Hard","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Constraint (computer-aided design); Domain (mathematical analysis); Theoretical computer science; Conjunctive normal form; Discrete mathematics; Algorithm; Mathematics","score_opus":0.02705668565429976,"score_gpt":0.2504497056246213,"score_spread":0.22339301997032157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522877314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014344894,0.000050895138,0.98988867,0.00077643816,0.001925093,0.00027424778,0.000005052299,0.00025031655,0.0066858176],"genre_scores_gemma":[0.053623643,0.0000061152728,0.94386286,0.0018550833,0.00029500693,0.0000051737793,0.000002308737,0.000020524873,0.00032929718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678427,0.000022059026,0.00046173608,0.0015116379,0.0007599127,0.0004603804],"domain_scores_gemma":[0.9972428,0.00045461807,0.00027750895,0.0014899902,0.00036082967,0.00017422983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007093454,0.00039411784,0.00034713428,0.00050787686,0.00031670256,0.00063697854,0.0020149369,0.00036578084,0.00014500463],"category_scores_gemma":[0.00026660613,0.00037492454,0.000096812975,0.0005361648,0.000657662,0.0007040088,0.00089110225,0.0010605954,0.00006339092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013745988,0.000012275548,0.0005653384,0.000016766146,0.000003470393,0.00001862544,0.0004623326,0.004156575,0.0014480401,0.0030947854,0.0000137190755,0.9902067],"study_design_scores_gemma":[0.0002946483,0.0000915799,0.0040937164,0.00030376296,0.0000072440375,0.00011148375,1.0855583e-7,0.8139471,0.007219539,0.17082283,0.0021486927,0.0009593053],"about_ca_topic_score_codex":0.000019125966,"about_ca_topic_score_gemma":0.000048341113,"teacher_disagreement_score":0.9892474,"about_ca_system_score_codex":0.00015758429,"about_ca_system_score_gemma":0.0005986243,"threshold_uncertainty_score":0.99987024},"labels":[],"label_agreement":null},{"id":"W1524979267","doi":"","title":"Abstraction-Based Heuristics with True Distance Computations","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Abstraction; Permutation (music); Variety (cybernetics); Theoretical computer science; Computation; State space; State (computer science); Artificial intelligence; Algorithm; Mathematics","score_opus":0.006865015878028607,"score_gpt":0.22193786066650223,"score_spread":0.21507284478847363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524979267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030248446,0.0000035566175,0.9846773,0.003119088,0.000084620064,0.000074590615,0.0000017608406,0.00026401153,0.011472594],"genre_scores_gemma":[0.75366104,0.0000010752124,0.24539398,0.00074608217,0.000011771419,0.0000015332568,0.000005373818,0.0000018678111,0.0001772756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946076,0.000012391668,0.00011701436,0.0001666145,0.00014297233,0.00010027696],"domain_scores_gemma":[0.9995282,0.000084286665,0.00005161402,0.00018863477,0.00008954297,0.000057696474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003857724,0.00007101268,0.000060144113,0.00005706193,0.00011888479,0.0001191811,0.00012268058,0.000021294654,0.000060060556],"category_scores_gemma":[0.000015084699,0.000059932623,0.000018845312,0.0002633534,0.00002382917,0.0002371741,0.000004001536,0.00006165449,0.000027644648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008751343,0.00009668457,0.0012728175,0.0000034584607,0.000005392258,0.000010131171,0.000077185425,0.66288906,0.000024804116,0.22586524,0.0007339073,0.109012574],"study_design_scores_gemma":[0.00030295996,0.000069050635,0.043080583,0.0000073719275,0.0000029921216,0.0000071774375,0.00001206566,0.95336396,0.00014095794,0.0013706158,0.0015221296,0.00012015287],"about_ca_topic_score_codex":0.0000054672714,"about_ca_topic_score_gemma":0.00003444046,"teacher_disagreement_score":0.75335854,"about_ca_system_score_codex":0.00002700316,"about_ca_system_score_gemma":0.00007485529,"threshold_uncertainty_score":0.24439815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028115985875042875,"score_gpt":0.28621174368934366,"score_spread":0.2580957578143008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152517204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032761253,0.009209979,0.9836303,0.003260789,0.000044456145,0.0003118275,3.474728e-7,0.000048067068,0.00021808337],"genre_scores_gemma":[0.9677029,0.015782839,0.016005564,0.00043299838,0.00003877447,0.000022419388,0.000004250201,0.0000040041923,0.0000062045606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991837,0.00006235334,0.00032390142,0.00025229418,0.00007206196,0.00010569744],"domain_scores_gemma":[0.99961025,0.0000541454,0.0000945198,0.00015871806,0.000034805846,0.000047577578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042041362,0.000087295855,0.00013284135,0.00006457174,0.000066582776,0.00006064945,0.000091072914,0.00003725077,0.00001883628],"category_scores_gemma":[0.000079865116,0.0000779138,0.000018681018,0.00027363643,0.000041122454,0.00040069316,0.000046152778,0.00008747185,0.000027332893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.523563e-7,0.000008252811,0.0015815295,0.00003276258,0.00000105136,2.0470313e-7,0.00018185748,0.0000845002,0.000043250573,0.050810706,0.0000055135088,0.94724953],"study_design_scores_gemma":[0.000031675023,0.00003214013,0.009329994,0.00075542025,0.000007148712,0.000031943648,0.000059259684,0.9671026,0.00094007375,0.014625881,0.0068380623,0.00024583595],"about_ca_topic_score_codex":0.00014307446,"about_ca_topic_score_gemma":0.0008743235,"teacher_disagreement_score":0.9676248,"about_ca_system_score_codex":0.000026427522,"about_ca_system_score_gemma":0.000023010522,"threshold_uncertainty_score":0.31772324},"labels":[],"label_agreement":null},{"id":"W1526117045","doi":"10.1023/a:1015084116772","title":"Introduction to the Special Issue on Parallel Meta-Heuristics","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Manitoba; Université du Québec à Montréal","funders":"","keywords":"Mathematics","score_opus":0.028662797890831735,"score_gpt":0.2463276832061558,"score_spread":0.21766488531532407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526117045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010631247,0.00008609252,0.9219292,0.06962191,0.0045751194,0.00010357608,0.0000037396,0.000022314294,0.0035517511],"genre_scores_gemma":[0.18169709,0.0015056434,0.6255923,0.011716605,0.16523859,0.00001093439,0.000003868041,0.00006404774,0.014170956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987465,0.000093508446,0.00043054027,0.00014160726,0.00044230736,0.00014553731],"domain_scores_gemma":[0.9988582,0.00013333697,0.0002887556,0.00031295553,0.00029545682,0.000111261936],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037496994,0.000115412724,0.00021202592,0.00014447815,0.00014173605,0.00015597335,0.00042468842,0.000039003266,0.001160047],"category_scores_gemma":[0.0005605752,0.00007507987,0.00012841735,0.00029364927,0.00002987973,0.00015808055,0.0000467976,0.000273382,0.00033372757],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014574675,0.00007547607,0.000021788615,0.0000029465955,0.00010781329,0.0000288326,0.00037883176,0.057021767,0.0000067834,0.011205185,0.8746198,0.056516223],"study_design_scores_gemma":[0.00020387203,0.00026122257,0.0004850601,0.000004525522,0.00013350126,0.00020349667,0.00002478317,0.032631733,0.000040381947,0.00067123584,0.9652333,0.0001068861],"about_ca_topic_score_codex":9.152276e-7,"about_ca_topic_score_gemma":0.0000034843679,"teacher_disagreement_score":0.29633692,"about_ca_system_score_codex":0.00005327816,"about_ca_system_score_gemma":0.000023209272,"threshold_uncertainty_score":0.999753},"labels":[],"label_agreement":null},{"id":"W1528015358","doi":"10.1007/978-3-540-24840-8_18","title":"A Hybrid Schema for Systematic Local Search","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Schema (genetic algorithms); Computer science; Information retrieval","score_opus":0.017355640596167517,"score_gpt":0.2537859112549982,"score_spread":0.2364302706588307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528015358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009404688,0.00012282183,0.9958939,0.00066668075,0.0008948553,0.0013049691,0.000006129979,0.00017597694,0.00092529046],"genre_scores_gemma":[0.2964372,0.000012959575,0.70204127,0.000939221,0.00021336736,0.00004533547,0.0000080176105,0.00003447997,0.00026815612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968753,0.000027999522,0.0005481566,0.0011585503,0.0008549399,0.0005350682],"domain_scores_gemma":[0.9978002,0.0004772738,0.00020910507,0.0009778915,0.00036653818,0.00016903969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090089027,0.00039671102,0.0005439423,0.00074716675,0.00025702862,0.0005378814,0.0017643555,0.0001864276,0.000029414148],"category_scores_gemma":[0.00010598922,0.00036017742,0.00016204362,0.0003406019,0.00056965475,0.00048637058,0.0005051937,0.0004556467,0.000047272646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006778858,0.000027942036,0.0000063546527,0.0030093007,0.000021987102,0.000059116654,0.0005425278,0.45210162,0.00003440618,0.20600522,0.0000115834055,0.33817318],"study_design_scores_gemma":[0.0003638083,0.00011243807,0.0000080206655,0.0036952626,0.00000848299,0.0001422996,2.397216e-7,0.8901899,0.0009414568,0.104059204,0.00003979853,0.0004390793],"about_ca_topic_score_codex":0.000010658003,"about_ca_topic_score_gemma":0.000023246508,"teacher_disagreement_score":0.4380883,"about_ca_system_score_codex":0.0006006969,"about_ca_system_score_gemma":0.0011042281,"threshold_uncertainty_score":0.999885},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; 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","score_opus":0.015292657331685588,"score_gpt":0.2373962479057004,"score_spread":0.22210359057401483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528564561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033960794,0.00001792792,0.9917001,0.0004448273,0.0001445355,0.00022021457,0.000007991046,0.000026809841,0.0040414752],"genre_scores_gemma":[0.86064464,0.000009066081,0.13868494,0.00039411962,0.0000049762652,0.0000117835525,0.0000013394716,0.0000030341832,0.0002460915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994838,0.00003269737,0.00015099865,0.00014236488,0.00008581262,0.000104302766],"domain_scores_gemma":[0.99957734,0.00008729949,0.000058209553,0.00017490484,0.000061444276,0.00004081143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087032044,0.00006740612,0.000091663525,0.000025615971,0.00008072084,0.000050296963,0.000104682425,0.000026547268,0.000059136786],"category_scores_gemma":[0.00003578297,0.000043627853,0.000047460202,0.00007036427,0.00012167672,0.0000725249,0.00003632037,0.000032507072,5.320277e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.225294e-7,0.000040281742,0.002420324,0.000010345574,0.00002491515,2.4856203e-7,0.00031214944,0.000037735164,0.00033180488,0.5672998,0.0003272676,0.42919433],"study_design_scores_gemma":[0.0029438725,0.00024402322,0.031198662,0.000029772767,0.000049365226,0.00016747844,0.0008939195,0.89316803,0.012779319,0.043471184,0.014538008,0.0005163852],"about_ca_topic_score_codex":0.000006981522,"about_ca_topic_score_gemma":0.000032498807,"teacher_disagreement_score":0.8931303,"about_ca_system_score_codex":0.000011687911,"about_ca_system_score_gemma":0.000052972933,"threshold_uncertainty_score":0.17790923},"labels":[],"label_agreement":null},{"id":"W1530989307","doi":"10.1007/3-540-45578-7_52","title":"Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Parallel computing; Constraint programming; Solver; Schedule; Dynamic priority scheduling; Two-level scheduling; Mathematical optimization; Programming language; Mathematics; Operating system","score_opus":0.016145709199109425,"score_gpt":0.22731769948222708,"score_spread":0.21117199028311764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530989307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005199479,0.00009842831,0.9931458,0.00072792737,0.0010375007,0.00057748856,0.000004607514,0.000255813,0.003632443],"genre_scores_gemma":[0.056738336,0.000029541632,0.94195455,0.0005242754,0.00042473042,0.000020565429,0.0000123008185,0.000036285815,0.00025941836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971735,0.000014014642,0.00042356332,0.0012245453,0.0006486565,0.0005157148],"domain_scores_gemma":[0.9983961,0.00017398389,0.00032090847,0.000570535,0.00039999295,0.00013846881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031774197,0.00045765497,0.00038668668,0.0007555833,0.00036310114,0.000635101,0.0011154334,0.00027030945,0.000027072045],"category_scores_gemma":[0.000050760736,0.00040627434,0.000086088505,0.0007062676,0.0005789965,0.0011726493,0.00025623944,0.0004972705,0.000009843583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019473639,0.000018405277,0.00007159279,0.000048232687,0.000010843717,0.000019988702,0.000531828,0.395354,0.00011355375,0.0055909725,0.0000020901273,0.59821904],"study_design_scores_gemma":[0.000691371,0.00043449792,0.00007483539,0.00051305507,0.000016156908,0.000473,0.0000020801783,0.97677684,0.0023245732,0.016463973,0.0014111464,0.0008184696],"about_ca_topic_score_codex":0.000008732376,"about_ca_topic_score_gemma":0.00006286055,"teacher_disagreement_score":0.59740055,"about_ca_system_score_codex":0.00024400021,"about_ca_system_score_gemma":0.00060795783,"threshold_uncertainty_score":0.9998389},"labels":[],"label_agreement":null},{"id":"W1533933130","doi":"10.1007/3-540-44886-1_14","title":"A Comparison of Consistency Propagation Algorithms in Constraint Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Heuristic; Algorithm; Computer science; Mathematical optimization; Arc (geometry); Constraint satisfaction problem; Mathematics; Artificial intelligence","score_opus":0.02290560349101612,"score_gpt":0.27194775385489783,"score_spread":0.24904215036388172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533933130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003082608,0.00017332964,0.993495,0.0004680423,0.00089596125,0.00059054303,0.000004453466,0.00007151937,0.0042703245],"genre_scores_gemma":[0.20717756,0.000041402167,0.7923022,0.00034290805,0.00004379446,0.000009580662,0.0000113156075,0.000018633664,0.000052592168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686563,0.00006916851,0.0009788607,0.00097590295,0.0007398587,0.00037060675],"domain_scores_gemma":[0.9979948,0.00025113247,0.00058836763,0.00067816634,0.00038737783,0.000100194346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075318024,0.00036834533,0.00060442864,0.0011799546,0.0001149313,0.00018630379,0.00086540985,0.0003030861,0.000058713707],"category_scores_gemma":[0.00015032658,0.00037750407,0.00009041897,0.00088087324,0.0008096675,0.0005346851,0.00022282124,0.00052481407,0.000005427648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026430203,0.000041143958,0.00047664443,0.000028414783,0.000004379083,0.000009184371,0.0005322778,0.6525956,0.000040761453,0.017098973,0.0000030763827,0.32916692],"study_design_scores_gemma":[0.00038656595,0.00011234918,0.00021539976,0.00030988661,0.0000057336406,0.000038189497,0.0000012573065,0.9873904,0.0008259486,0.01027325,0.000060247872,0.00038078826],"about_ca_topic_score_codex":0.00001610316,"about_ca_topic_score_gemma":0.00008795788,"teacher_disagreement_score":0.33479482,"about_ca_system_score_codex":0.0003276502,"about_ca_system_score_gemma":0.0007155929,"threshold_uncertainty_score":0.9998677},"labels":[],"label_agreement":null},{"id":"W1537351989","doi":"10.1007/3-540-45153-6_8","title":"Constraint Programming Lessons Learned from Crossword Puzzles","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Constraint programming; Constraint logic programming; Constraint (computer-aided design); Heuristic; Constraint satisfaction; Independence (probability theory); Mathematical optimization; Concurrent constraint logic programming; Theoretical computer science; Artificial intelligence; Mathematics; Stochastic programming","score_opus":0.041867821549464446,"score_gpt":0.2843121943162207,"score_spread":0.24244437276675623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537351989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040431773,0.00020351769,0.98372155,0.009234858,0.0015145168,0.00039376784,0.000013660205,0.0003643529,0.0045133466],"genre_scores_gemma":[0.13627271,0.00021574424,0.8607463,0.0012741426,0.00054155034,0.000016522488,0.00003071269,0.000048387057,0.00085388205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614495,0.0000433258,0.00047121407,0.0017516634,0.00089032896,0.0006985392],"domain_scores_gemma":[0.99750733,0.00044719107,0.00035492628,0.0011882612,0.00026699787,0.0002353076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005404146,0.0005509113,0.0005128988,0.00066677766,0.00041031506,0.0018875465,0.0020670898,0.00039053202,0.00012233436],"category_scores_gemma":[0.00013629737,0.000539877,0.00016480192,0.0006432376,0.0012801306,0.0007920917,0.00081024884,0.00088765466,0.000046800626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027844874,0.000015336076,0.00008267676,0.000006949935,0.000011430848,0.00008047019,0.00040225725,0.011099508,0.00005829877,0.02470151,0.000012027541,0.9635267],"study_design_scores_gemma":[0.0008647745,0.00015111499,0.0004920442,0.00067951524,0.000024722041,0.00020254994,0.0000025694233,0.649915,0.0007784289,0.30610514,0.038977657,0.0018065135],"about_ca_topic_score_codex":0.000058769532,"about_ca_topic_score_gemma":0.0004258047,"teacher_disagreement_score":0.9617202,"about_ca_system_score_codex":0.0003065013,"about_ca_system_score_gemma":0.0007288714,"threshold_uncertainty_score":0.99970526},"labels":[],"label_agreement":null},{"id":"W1537738406","doi":"10.1609/icaps.v20i1.13426","title":"Computer-Aided Algorithm Design: Automated Tuning, Configuration, Selection, and Beyond","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Structuring; Intuition; Integer programming; Scheduling (production processes); Selection (genetic algorithm); Mathematical optimization; Algorithm; Machine learning; Mathematics","score_opus":0.029888213250378406,"score_gpt":0.2744444472290716,"score_spread":0.24455623397869317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537738406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18886605,0.000094448216,0.79849976,0.0067429026,0.00086298614,0.00025697466,0.000009481358,0.0019099117,0.0027574725],"genre_scores_gemma":[0.75285375,0.00002550052,0.24669884,0.0002910717,0.000034423214,0.00000573084,0.0000058240194,0.0000070728984,0.00007777902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886423,0.000025262556,0.0003054737,0.00034908,0.000312884,0.00014309288],"domain_scores_gemma":[0.9986392,0.00009107521,0.00025930605,0.0000676336,0.0008769302,0.00006585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029177734,0.00015145956,0.00016218908,0.00014340677,0.00025219997,0.0005390206,0.0002941995,0.00008275688,0.000017543514],"category_scores_gemma":[0.00014905469,0.00013308173,0.000030315892,0.00030242716,0.00005967258,0.00045897544,0.0001621509,0.00018301926,0.0000015776651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001210327,0.00032573976,0.03668813,0.00020905292,0.00079617376,0.000030243447,0.009453237,0.09787554,0.23139556,0.53054327,0.0062359297,0.08632609],"study_design_scores_gemma":[0.00035094767,0.0000448825,0.0052830763,0.0002079856,0.000009875622,0.00016143633,0.00022123163,0.97986805,0.012578785,0.0010959443,0.000038106304,0.00013967254],"about_ca_topic_score_codex":0.0000058555142,"about_ca_topic_score_gemma":6.712022e-7,"teacher_disagreement_score":0.8819925,"about_ca_system_score_codex":0.000033839675,"about_ca_system_score_gemma":0.00012851713,"threshold_uncertainty_score":0.5426915},"labels":[],"label_agreement":null},{"id":"W1540511301","doi":"10.1007/978-3-642-13059-5_12","title":"Finding a Single, All, or the Most Probable Solution to a Finite or Non-finite Interval Algebra Network","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Interval (graph theory); Computer science; Algebra over a field; Mathematics; Pure mathematics; Combinatorics","score_opus":0.03095552379147703,"score_gpt":0.25525366600454746,"score_spread":0.22429814221307043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540511301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028591488,0.000028660332,0.9902146,0.004301666,0.0033175282,0.0009106827,0.000004124958,0.00018594904,0.0010081873],"genre_scores_gemma":[0.044411413,0.00003105222,0.94146335,0.010916672,0.001103063,0.000050489343,0.000013056168,0.00005561521,0.0019553069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962995,0.000053260526,0.0006368484,0.0013336133,0.0008172829,0.0008594907],"domain_scores_gemma":[0.9967152,0.001197742,0.00036987432,0.0012069923,0.00027932954,0.00023089573],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010960947,0.00054154894,0.000448084,0.0005525671,0.00065382395,0.0013407676,0.0026893574,0.00038414833,0.00012960308],"category_scores_gemma":[0.0004319469,0.00032991025,0.000119694596,0.0015017515,0.0004892833,0.00076851354,0.0015881186,0.0011567087,0.00008377873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004635543,0.000027936178,0.000030610223,0.000022498634,0.000018764238,0.000054186523,0.0016183336,0.31316632,0.00021108745,0.0019350856,0.00020564014,0.6826632],"study_design_scores_gemma":[0.0003132735,0.00042352136,0.00009147781,0.0006295628,0.000015534013,0.00013220999,5.802448e-7,0.9721677,0.00038969665,0.01174038,0.013394578,0.0007015116],"about_ca_topic_score_codex":0.000025453064,"about_ca_topic_score_gemma":0.0020916767,"teacher_disagreement_score":0.68196166,"about_ca_system_score_codex":0.00028549656,"about_ca_system_score_gemma":0.0008213216,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W1541525032","doi":"10.1007/11527695_25","title":"Fifty-Five Solvers in Vancouver: The SAT 2004 Competition","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competition (biology); Computer science; Event (particle physics); Operations research; Mathematics","score_opus":0.008528507595670216,"score_gpt":0.2171496943903909,"score_spread":0.20862118679472066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541525032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003880607,0.0001795943,0.9887154,0.0019663805,0.0023332615,0.0003989799,0.000004828064,0.000114273644,0.0062484574],"genre_scores_gemma":[0.4163346,0.00033282363,0.57015675,0.009627001,0.0011740901,0.000031032083,0.000027081447,0.00006819408,0.0022484006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723667,0.000048571153,0.00046791259,0.0010038053,0.00076348515,0.00047956035],"domain_scores_gemma":[0.99822116,0.00039141154,0.00024477654,0.0008886709,0.00015483462,0.00009915194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006480005,0.00038076562,0.00033070135,0.0006825634,0.0002616955,0.0003778441,0.0017746666,0.00023921848,0.000111320594],"category_scores_gemma":[0.000053131305,0.00031180787,0.00010740494,0.000659824,0.00061930495,0.0007280234,0.00052251894,0.00080343586,0.00006668141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043012597,0.000018316003,0.00011633476,0.000009407286,0.0000051539328,0.000027738102,0.0010975214,0.38973603,0.0000117905765,0.02133989,0.00014839858,0.58748513],"study_design_scores_gemma":[0.00053050846,0.000079086385,0.0009378216,0.00032238624,0.0000065709673,0.000047737485,0.000001751404,0.94210774,0.00011253793,0.04650145,0.008701486,0.00065091986],"about_ca_topic_score_codex":0.00006038574,"about_ca_topic_score_gemma":0.0050999736,"teacher_disagreement_score":0.5868342,"about_ca_system_score_codex":0.0005773303,"about_ca_system_score_gemma":0.0005075574,"threshold_uncertainty_score":0.9999334},"labels":[],"label_agreement":null},{"id":"W1542640015","doi":"10.1007/978-3-540-30201-8_23","title":"A Domain Consistency Algorithm for the Stretch Constraint","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; University of Waterloo","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Benchmark (surveying); Domain (mathematical analysis); Constraint satisfaction; Constraint satisfaction problem; Algorithm; Constraint programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.014307262675304735,"score_gpt":0.23930924568274253,"score_spread":0.2250019830074378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542640015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045725387,0.00029336894,0.991691,0.0031971813,0.0019811532,0.0009440011,0.00002520451,0.00014778435,0.0017157488],"genre_scores_gemma":[0.017671043,0.000058972073,0.9800211,0.0017946408,0.00029538927,0.000032991513,0.0000073644956,0.000024369243,0.00009411295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997114,0.000023496214,0.0005155345,0.0011326076,0.0006781652,0.0005361731],"domain_scores_gemma":[0.9972907,0.0009111477,0.00028431247,0.0010469286,0.00032962268,0.0001372914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007726546,0.00043664002,0.00038592968,0.0004124089,0.00050985476,0.0006101515,0.0019348724,0.00026155156,0.00012298992],"category_scores_gemma":[0.000055617787,0.00033493465,0.00019597363,0.00041477047,0.0015890846,0.00034618456,0.00045514826,0.00055468146,0.000017068984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012129296,0.000008701443,0.0000037940895,0.000008694961,0.000011719655,0.000014039982,0.0003369137,0.010915785,0.0000061671967,0.16593629,0.000008148421,0.82274854],"study_design_scores_gemma":[0.00050478097,0.00010181164,0.00004632985,0.00016864174,0.000011401553,0.00012705947,0.0000011705315,0.6468995,0.00010283124,0.34949607,0.0021005594,0.000439836],"about_ca_topic_score_codex":0.000019343517,"about_ca_topic_score_gemma":0.00008948966,"teacher_disagreement_score":0.8223087,"about_ca_system_score_codex":0.00037670284,"about_ca_system_score_gemma":0.0014950725,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W1544695114","doi":"10.1007/3-540-44886-1_61","title":"Dueling CSP Representations: Local Search in the Primal versus Dual Constraint Graph","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Constraint satisfaction dual problem; Constraint satisfaction problem; Constraint satisfaction; Computer science; Constraint graph; Mathematical optimization; Constraint (computer-aided design); Hybrid algorithm (constraint satisfaction); Dual (grammatical number); Graph; Constraint programming; Local consistency; Constraint logic programming; Representation (politics); Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03082609765807935,"score_gpt":0.2827214531049179,"score_spread":0.25189535544683855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544695114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009891197,0.00013839391,0.9890409,0.0022104548,0.0015315256,0.0005002455,0.0000036763165,0.00007498704,0.006400881],"genre_scores_gemma":[0.5717926,0.00011412717,0.4245741,0.0031056607,0.00026123723,0.000024668272,0.000014943744,0.000030656473,0.00008200862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964808,0.00014420417,0.0005465903,0.0011538784,0.0011215727,0.0005529024],"domain_scores_gemma":[0.99755245,0.0009948432,0.00015995667,0.00097043667,0.00021609834,0.00010620268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015173749,0.0003565924,0.00030632308,0.00089472695,0.00030796693,0.00062316,0.0015168508,0.00023243025,0.00005962046],"category_scores_gemma":[0.00014402816,0.00029893802,0.00011402701,0.001088,0.001345956,0.0005338141,0.0003784673,0.0010329274,0.00002126487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001393498,0.000029305016,0.00012951667,0.000013991656,0.000009777775,0.00014621572,0.0018929145,0.3809335,0.000014040211,0.08689285,0.000023204735,0.5299008],"study_design_scores_gemma":[0.0014130389,0.00022933417,0.0008319006,0.00023652757,0.000012371729,0.00038938166,0.000020322175,0.9371318,0.00025961502,0.058036543,0.00059773045,0.0008414299],"about_ca_topic_score_codex":0.000047325964,"about_ca_topic_score_gemma":0.00026810647,"teacher_disagreement_score":0.57169366,"about_ca_system_score_codex":0.00027317615,"about_ca_system_score_gemma":0.0006973882,"threshold_uncertainty_score":0.9999463},"labels":[],"label_agreement":null},{"id":"W1547629678","doi":"10.1007/978-3-540-68155-7_11","title":"Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constructive; Constraint satisfaction problem; Knapsack problem; Constraint (computer-aided design); Heuristic; Mathematical optimization; Local search (optimization); Constraint satisfaction; Point (geometry); Mathematics; Computer science; Artificial intelligence; Process (computing)","score_opus":0.030171486859607702,"score_gpt":0.26902450178747395,"score_spread":0.23885301492786626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547629678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004416172,0.00021706463,0.99626833,0.0006743696,0.0012347309,0.0007643486,0.000018175195,0.00012590179,0.00065292005],"genre_scores_gemma":[0.12380683,0.00015674328,0.87504506,0.00044268675,0.0001525895,0.000020119367,0.000017498616,0.000023903793,0.00033457356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757314,0.00003253444,0.0004526096,0.0010302064,0.00048489496,0.0004266125],"domain_scores_gemma":[0.99808073,0.00049083907,0.00023891857,0.0005502193,0.0004970503,0.00014226006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046854874,0.00035545268,0.00036099798,0.0005555592,0.0005103597,0.0002843048,0.00069908804,0.00026243337,0.000014286972],"category_scores_gemma":[0.0001012478,0.00036046843,0.0000852869,0.00036057338,0.0011809852,0.00072869717,0.00037287155,0.00043692975,0.000007752464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015311793,0.000024267392,0.00060634466,0.00005515049,0.000016796139,0.000017401684,0.0024916674,0.15358397,0.00007206868,0.054917276,0.00006372451,0.788136],"study_design_scores_gemma":[0.00062976696,0.00007023732,0.0007362329,0.00015199781,0.000005433368,0.00020229397,7.070064e-7,0.98760504,0.00026171826,0.009600068,0.00031445397,0.0004220685],"about_ca_topic_score_codex":0.000018659506,"about_ca_topic_score_gemma":0.0000691098,"teacher_disagreement_score":0.83402103,"about_ca_system_score_codex":0.00031021948,"about_ca_system_score_gemma":0.0005646704,"threshold_uncertainty_score":0.9998847},"labels":[],"label_agreement":null},{"id":"W1548019825","doi":"10.1007/978-3-540-30201-8_5","title":"Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Local consistency; Computer science; Consistency (knowledge bases); Constraint satisfaction dual problem; Binary constraint; Constraint logic programming; Constraint programming; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.0123489719733718,"score_gpt":0.21227572460906163,"score_spread":0.19992675263568982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548019825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037476406,0.00016901924,0.9927923,0.0010379866,0.0007921853,0.0007353065,0.000014889243,0.00022912037,0.0038544156],"genre_scores_gemma":[0.6239219,0.000084262916,0.3753241,0.0005175493,0.00007445263,0.0000116591045,0.0000058700116,0.000022155524,0.000038081344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964283,0.00004599911,0.0006056281,0.0015274759,0.0008527139,0.000539877],"domain_scores_gemma":[0.9977989,0.00038043354,0.00037996477,0.0008130679,0.00036663847,0.00026096342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053847407,0.00061839406,0.00067438633,0.00075901573,0.00038404393,0.00058002264,0.00063785724,0.00034075545,0.000080573154],"category_scores_gemma":[0.00003988479,0.0005287368,0.00008723513,0.00043013034,0.0025626356,0.0009854278,0.00034008612,0.0007245884,0.000008997541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020729167,0.000012129578,0.000104628714,0.00003369659,0.00002198584,0.00008619123,0.0004552513,0.1433829,0.000033690125,0.40103808,0.0000011904187,0.45480952],"study_design_scores_gemma":[0.0037077332,0.00033825127,0.0011648125,0.001002937,0.0000425591,0.0013286247,0.0000024085518,0.5239459,0.00037436432,0.4666828,0.00005910113,0.0013504786],"about_ca_topic_score_codex":0.00013597423,"about_ca_topic_score_gemma":0.00045701055,"teacher_disagreement_score":0.6235471,"about_ca_system_score_codex":0.00039946425,"about_ca_system_score_gemma":0.001573485,"threshold_uncertainty_score":0.9997164},"labels":[],"label_agreement":null},{"id":"W1549562141","doi":"10.1109/icdar.1997.620621","title":"N-grams: a well-structured knowledge representation for recognition of graphical documents","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Sketch; Representation (politics); Domain (mathematical analysis); Variety (cybernetics); Domain knowledge; Symbol (formal); Knowledge representation and reasoning; Sketch recognition; Artificial intelligence; n-gram; Graphical model; Information retrieval; Natural language processing; Programming language; Language model; Algorithm; Mathematics","score_opus":0.03388326865611325,"score_gpt":0.2829012806629118,"score_spread":0.24901801200679857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549562141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063990895,0.000024332967,0.9803079,0.00046635722,0.0003133252,0.00031543357,0.0000035108712,0.000107832035,0.012062248],"genre_scores_gemma":[0.8816497,0.000044241115,0.117473416,0.000089887835,0.000028992961,0.000029257173,0.000019657338,0.000004570598,0.00066032197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993439,0.000035098463,0.00021217734,0.00020572673,0.00010436647,0.00009877588],"domain_scores_gemma":[0.9994851,0.00007125715,0.00008314469,0.00017473336,0.00014320065,0.00004261673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007578421,0.000065585904,0.00008804085,0.0001271682,0.000054900487,0.00004383062,0.00012581397,0.00005100835,0.00045419962],"category_scores_gemma":[0.000045431876,0.000061562314,0.00006719799,0.00034666987,0.000030107636,0.0003587426,0.000025500563,0.000037105492,0.000031239302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016251137,0.00013380234,0.002048767,0.000033225624,0.000036140875,6.0440414e-7,0.0008477854,0.00012724391,0.0013611511,0.029484095,0.007913243,0.9579977],"study_design_scores_gemma":[0.0031548059,0.00026862777,0.011295844,0.000043938384,0.00003627754,0.000031580148,0.00014427422,0.9039571,0.021619469,0.05244658,0.006568973,0.0004325176],"about_ca_topic_score_codex":0.000010069053,"about_ca_topic_score_gemma":0.00002712159,"teacher_disagreement_score":0.9575652,"about_ca_system_score_codex":0.000013764095,"about_ca_system_score_gemma":0.0000076126794,"threshold_uncertainty_score":0.49731675},"labels":[],"label_agreement":null},{"id":"W1550045328","doi":"10.3233/kes-130251","title":"Specifying and solving symbolic and numeric temporal constraints","year":2013,"lang":"en","type":"article","venue":"International Journal of Knowledge-based and Intelligent Engineering Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Representation (politics); Consistency (knowledge bases); Temporal logic; Theoretical computer science; Graph; Temporal database; Variety (cybernetics); Local consistency; Task (project management); Programming language; Constraint satisfaction; Artificial intelligence; Mathematical optimization; Data mining; Mathematics","score_opus":0.010526080493505435,"score_gpt":0.22438213876205232,"score_spread":0.2138560582685469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550045328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07860258,0.0020277728,0.9167911,0.00029155964,0.0018362093,0.00012131861,0.000001549746,0.00003879625,0.00028912292],"genre_scores_gemma":[0.99176127,0.00017978906,0.007783817,0.00002837275,0.00019779982,0.000003827017,8.253083e-7,0.000008467324,0.000035811725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990726,0.00002987698,0.00042816057,0.00015024739,0.00019333069,0.00012576392],"domain_scores_gemma":[0.99909115,0.00013498614,0.0001831156,0.00007272881,0.00036913276,0.0001489072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025073538,0.00013341212,0.00018835848,0.00034674647,0.00004298005,0.00042007325,0.00019482597,0.00004621072,0.000024048728],"category_scores_gemma":[0.000084806714,0.000119754295,0.000039477858,0.000095624724,0.000059127655,0.00046852778,0.000057455498,0.00014265993,0.000005961148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003519784,0.00021695177,0.096015856,0.00055207725,0.00075052725,0.000119878496,0.006248266,0.05269342,0.008581775,0.06593889,0.000976863,0.7678703],"study_design_scores_gemma":[0.0005647047,0.0000928708,0.011846724,0.00062879786,0.000011512407,0.0008175885,0.00029483438,0.9818511,0.00066211843,0.00007331838,0.002915084,0.00024137578],"about_ca_topic_score_codex":0.000018263461,"about_ca_topic_score_gemma":9.386135e-7,"teacher_disagreement_score":0.9291577,"about_ca_system_score_codex":0.000058286234,"about_ca_system_score_gemma":0.00005888042,"threshold_uncertainty_score":0.48834383},"labels":[],"label_agreement":null},{"id":"W1551876208","doi":"10.1007/978-3-540-24840-8_46","title":"Histogram Arc Consistency as a Value Ordering Heuristic","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Constraint satisfaction problem; Local consistency; Computer science; Consistency (knowledge bases); Heuristic; Mathematical optimization; Histogram; Constraint satisfaction; Algorithm; Variable (mathematics); Constraint (computer-aided design); Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.012639467594450947,"score_gpt":0.23458449026805703,"score_spread":0.22194502267360608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551876208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002623996,0.00027597096,0.97861683,0.0009870613,0.002149108,0.00036851983,0.0000023929188,0.00031006685,0.01726382],"genre_scores_gemma":[0.29011995,0.00008759024,0.706728,0.0022453298,0.00025267995,0.000011501186,0.000006688642,0.000042520864,0.0005057349],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965874,0.000029144689,0.00054896035,0.0013936814,0.0008753723,0.0005654745],"domain_scores_gemma":[0.99787366,0.00027675886,0.00028465246,0.0010980681,0.000249828,0.00021700223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004414938,0.00049105677,0.00045324533,0.00085798843,0.00035068943,0.0005598781,0.0017205667,0.00027285257,0.00012845737],"category_scores_gemma":[0.00018453196,0.00049958844,0.00014682837,0.00063684885,0.0008227654,0.00047583104,0.0006818289,0.00072019506,0.000114090806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002947712,0.000021494547,0.00003391661,0.000034481196,0.000009181683,0.00013255811,0.0004990025,0.14389755,0.000039973544,0.22584622,0.000006138561,0.62947655],"study_design_scores_gemma":[0.00053169084,0.00021843522,0.00021390492,0.0006374163,0.000016288821,0.0004407053,3.0359482e-7,0.4897167,0.0002335352,0.5046307,0.002311069,0.0010492497],"about_ca_topic_score_codex":0.000093143506,"about_ca_topic_score_gemma":0.00009749732,"teacher_disagreement_score":0.6284273,"about_ca_system_score_codex":0.0006663928,"about_ca_system_score_gemma":0.0016031537,"threshold_uncertainty_score":0.99974555},"labels":[],"label_agreement":null},{"id":"W1552173337","doi":"10.1007/11499107_20","title":"Constraint Metrics for Local Search","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint satisfaction problem; Computer science; Boolean satisfiability problem; Local search (optimization); Dual (grammatical number); Satisfiability; Constraint satisfaction; Theoretical computer science; Variety (cybernetics); Class (philosophy); Backtracking; Constraint (computer-aided design); Perspective (graphical); Algorithm; Artificial intelligence; Mathematics","score_opus":0.025583246936362998,"score_gpt":0.2690679519971328,"score_spread":0.2434847050607698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552173337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003720216,0.00016775224,0.9923549,0.0014645818,0.0012251398,0.0005670665,0.000012175139,0.000161462,0.004043197],"genre_scores_gemma":[0.11437324,0.0000531508,0.88318557,0.001498382,0.00040358806,0.00001127796,0.000009408907,0.00002649492,0.00043891807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968757,0.000022681132,0.0004720071,0.0011970915,0.000846517,0.0005859937],"domain_scores_gemma":[0.9977166,0.0006918647,0.00016328628,0.0008011803,0.00042756574,0.00019950344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009445831,0.0003804391,0.00038906603,0.0012366923,0.00024968287,0.00048540556,0.0017039548,0.00031121718,0.00006946891],"category_scores_gemma":[0.00010607409,0.00037121467,0.00015062858,0.00075205317,0.000984098,0.00047834733,0.0005339281,0.000584537,0.00003685764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023141674,0.000009281574,0.000010480985,0.000012894822,0.0000051766037,0.000008060585,0.00013804235,0.1558108,0.000007883865,0.054461382,0.000016218512,0.78951746],"study_design_scores_gemma":[0.00032106234,0.000109624314,0.000033515204,0.000084531894,0.0000056234053,0.000069028094,2.8610975e-7,0.9689849,0.00037827043,0.025943805,0.0036343012,0.00043504857],"about_ca_topic_score_codex":0.000007846671,"about_ca_topic_score_gemma":0.00006823929,"teacher_disagreement_score":0.81317407,"about_ca_system_score_codex":0.00047609222,"about_ca_system_score_gemma":0.00095892185,"threshold_uncertainty_score":0.999874},"labels":[],"label_agreement":null},{"id":"W1561252389","doi":"10.1007/11424918_8","title":"A Decision Theoretic Meta-reasoner for Constraint Optimization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Semantic reasoner; Computer science; Solver; Mathematical optimization; Constraint (computer-aided design); Quality (philosophy); Mathematics; Artificial intelligence; Programming language","score_opus":0.020380474342966415,"score_gpt":0.25497678958834696,"score_spread":0.23459631524538055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561252389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020577302,0.00030659797,0.9931177,0.0012691851,0.001253909,0.00080906076,0.000014823538,0.00019067511,0.0030360231],"genre_scores_gemma":[0.017450584,0.00009487901,0.98054564,0.0013085223,0.00026205037,0.00003684623,0.0000148096005,0.000032625736,0.0002540396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967182,0.000032584285,0.0006160289,0.0013651622,0.00076893985,0.00049908494],"domain_scores_gemma":[0.9970756,0.00097507064,0.00034365873,0.0009850262,0.00044551905,0.00017511421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009953352,0.0005191493,0.0006119823,0.0008114135,0.0002833409,0.00060359447,0.0015000316,0.00033332457,0.00030502948],"category_scores_gemma":[0.00023741694,0.00043598682,0.0003139727,0.00044919833,0.00071796175,0.00067140633,0.000408442,0.0003950614,0.000020736978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004704743,0.0000090462045,0.0000016362021,0.0000069313105,0.000024518464,0.0000034700224,0.00008692377,0.49157572,0.000003596906,0.06773471,0.000011147686,0.4405376],"study_design_scores_gemma":[0.0003657854,0.00008357428,0.000007615998,0.00009673539,0.00007913546,0.00006656401,1.1677917e-7,0.9025465,0.00012853116,0.094891675,0.0012700892,0.00046366977],"about_ca_topic_score_codex":0.0000032084824,"about_ca_topic_score_gemma":0.000041321127,"teacher_disagreement_score":0.44007394,"about_ca_system_score_codex":0.00028319375,"about_ca_system_score_gemma":0.0005461424,"threshold_uncertainty_score":0.9998092},"labels":[],"label_agreement":null},{"id":"W1562372552","doi":"10.1007/978-3-642-04244-7_43","title":"Efficient Generic Search Heuristics within the EMBP Framework","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Computer science; Constraint satisfaction problem; Consistency (knowledge bases); Local consistency; Constraint satisfaction; Theoretical computer science; Constraint (computer-aided design); Domain (mathematical analysis); Maximization; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.0179897506217118,"score_gpt":0.251340114659847,"score_spread":0.23335036403813522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562372552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007164795,0.00023073959,0.9923885,0.0022187356,0.0020581477,0.00037257985,0.0000028167346,0.0001633027,0.0024935242],"genre_scores_gemma":[0.1762638,0.00003895398,0.818882,0.0039053329,0.000509219,0.000004844295,0.0000031875838,0.000026854048,0.00036585185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965846,0.000063803,0.0004884885,0.0011305774,0.0012176097,0.0005149295],"domain_scores_gemma":[0.99734384,0.00056736165,0.00023650558,0.0014131141,0.00028146018,0.00015770532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010252446,0.00041338388,0.00033079137,0.0005083421,0.00049246184,0.00075994467,0.0026301374,0.00030125823,0.000034230437],"category_scores_gemma":[0.00016013265,0.00030811448,0.00011046017,0.00095418,0.00075774395,0.000122618,0.0007199596,0.0012344269,0.000060124486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014106989,0.000009720675,0.00001178611,0.0000048792044,0.0000031466259,0.000019641424,0.0005464452,0.5739968,0.0000068143436,0.04971795,0.000008417381,0.37567303],"study_design_scores_gemma":[0.00008508987,0.00007431779,0.00025688822,0.00014789417,0.000005396037,0.00007221355,3.1274683e-7,0.93358064,0.00012926068,0.06495066,0.00033260026,0.00036469873],"about_ca_topic_score_codex":0.000008945879,"about_ca_topic_score_gemma":0.000023258168,"teacher_disagreement_score":0.37530833,"about_ca_system_score_codex":0.000265953,"about_ca_system_score_gemma":0.00069787557,"threshold_uncertainty_score":0.9999371},"labels":[],"label_agreement":null},{"id":"W1568747565","doi":"10.1007/978-3-540-68155-7_17","title":"Counting Solutions of Knapsack Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Knapsack problem; Heuristics; Constraint (computer-aided design); Mathematical optimization; Simple (philosophy); Computer science; Domain (mathematical analysis); Variable (mathematics); Mathematics; Algorithm; Theoretical computer science","score_opus":0.022115423294935013,"score_gpt":0.2339985973885273,"score_spread":0.21188317409359228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568747565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026768554,0.00019316409,0.9869802,0.0003677297,0.0010930696,0.00023171917,0.000008522345,0.00011454604,0.010984306],"genre_scores_gemma":[0.38088056,0.00019478482,0.61777675,0.00066828314,0.0002024745,0.000004170124,0.000008026351,0.000025503557,0.0002394706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735284,0.00002378263,0.0005672243,0.0008478442,0.0007517659,0.00045652463],"domain_scores_gemma":[0.9980319,0.00030663292,0.00039086485,0.0007803023,0.00037788245,0.000112426904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005078258,0.00031921963,0.00040162815,0.0007421265,0.00028310952,0.00014756023,0.0013451219,0.00023626426,0.000096576034],"category_scores_gemma":[0.00010513001,0.0003272533,0.00012231052,0.00054627814,0.0018185367,0.000508687,0.00056768383,0.00048671398,0.000029792162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017510935,0.000021538519,0.00011391518,0.000025258652,0.000012491673,0.00003332564,0.00068235083,0.04820459,0.00012700605,0.03546497,0.000062071405,0.9152507],"study_design_scores_gemma":[0.0004968024,0.000120465986,0.00068438816,0.00053111085,0.000012075677,0.0004381,4.9547776e-7,0.9644462,0.0009011732,0.029860836,0.0016277275,0.00088066864],"about_ca_topic_score_codex":0.0000134977245,"about_ca_topic_score_gemma":0.00004584471,"teacher_disagreement_score":0.9162416,"about_ca_system_score_codex":0.00018463159,"about_ca_system_score_gemma":0.0009023653,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W1570285879","doi":"10.1007/s00186-007-0170-0","title":"S. Nickel and J. Puerto: Location theory: a unified approach","year":2007,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nickel; Computer science; Materials science","score_opus":0.1255455380681576,"score_gpt":0.4706686301258944,"score_spread":0.3451230920577368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570285879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018541072,0.000058422796,0.9816704,0.0005747662,0.000027841405,0.00038243757,6.3931225e-7,0.000045381894,0.015386034],"genre_scores_gemma":[0.14169176,0.000012065846,0.85771674,0.000031017073,0.0000128361335,0.000024961977,0.000002028086,0.000006172728,0.0005024373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781245,0.0008930246,0.00036772375,0.00027028171,0.00041225192,0.00024425547],"domain_scores_gemma":[0.9970965,0.0017402739,0.000025458894,0.00044725303,0.0005679879,0.00012254895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012007893,0.00008378904,0.00016469118,0.00035063367,0.0002372437,0.00016452705,0.0003257605,0.00008081947,0.00006841891],"category_scores_gemma":[0.0026805352,0.00006980538,0.000027391914,0.0010568235,0.00028931166,0.00033119848,0.00018182132,0.00022876887,0.000015691883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064645333,0.00009266958,0.000010079041,0.00004603724,0.000009062843,5.3024934e-7,0.0006646503,0.00044168453,0.0021361285,0.88351375,0.000021638934,0.113057315],"study_design_scores_gemma":[0.0003260734,0.00008499614,0.0007988541,0.00003455758,0.0000065440463,0.00003368192,0.0009902045,0.83579886,0.00868702,0.1529697,0.00013167792,0.00013784232],"about_ca_topic_score_codex":0.000010223291,"about_ca_topic_score_gemma":0.0000056886133,"teacher_disagreement_score":0.8353571,"about_ca_system_score_codex":0.000034965582,"about_ca_system_score_gemma":0.000106468164,"threshold_uncertainty_score":0.41617203},"labels":[],"label_agreement":null},{"id":"W1573717476","doi":"10.1007/3-540-47922-8_10","title":"Generalized Arc Consistency with Application to MaxCSP","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Generalization; Heuristics; Computer science; Consistency (knowledge bases); Formalism (music); Local consistency; Algorithm; Mathematical optimization; Theoretical computer science; Applied mathematics; Mathematics; Artificial intelligence; Constraint satisfaction; Probabilistic logic","score_opus":0.013145859269060213,"score_gpt":0.2248003671819673,"score_spread":0.2116545079129071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573717476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027581444,0.00008261674,0.98877776,0.0019673607,0.00047876494,0.0006087101,0.0000034846817,0.0002028014,0.007850941],"genre_scores_gemma":[0.08057329,0.000036047175,0.9148819,0.0033598386,0.00019386988,0.000033194876,0.0000072415414,0.000030436498,0.0008841854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971168,0.000022558663,0.0003911057,0.0012946364,0.0007553607,0.0004195586],"domain_scores_gemma":[0.9980111,0.00013065123,0.00020901232,0.0011493051,0.0002842554,0.00021566432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029231855,0.00038989136,0.00036056995,0.00074216904,0.00022688319,0.0003997531,0.0013876794,0.00018178388,0.00008343161],"category_scores_gemma":[0.00003000679,0.0003437438,0.00006708639,0.0007486638,0.00036279927,0.00037513376,0.00038836474,0.0003663855,0.00012296741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053445947,0.000015424313,0.000085743064,0.000012375169,0.0000075582543,0.000022379834,0.00041207613,0.09775104,0.000095782336,0.060168397,0.000034995934,0.8413889],"study_design_scores_gemma":[0.000506472,0.00021924509,0.00044406508,0.00021029297,0.000011764328,0.00016232043,1.3900035e-7,0.9571117,0.00057292485,0.03218069,0.007648987,0.0009313633],"about_ca_topic_score_codex":0.000020431313,"about_ca_topic_score_gemma":0.00012439793,"teacher_disagreement_score":0.8593607,"about_ca_system_score_codex":0.00024426688,"about_ca_system_score_gemma":0.000288035,"threshold_uncertainty_score":0.9999015},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.21099807895705755,"score_gpt":0.4285933742557623,"score_spread":0.21759529529870478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575452963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390288,0.0002397966,0.97746474,0.00298875,0.00037908982,0.00013344237,4.7991637e-7,0.00006162696,0.0033418173],"genre_scores_gemma":[0.9570758,0.0014399955,0.040601026,0.00013890241,0.00042861217,0.0000023088653,8.479052e-7,0.0000114901995,0.00030103655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752355,0.00034502527,0.0006872815,0.00019289057,0.0008900285,0.0003612088],"domain_scores_gemma":[0.99699485,0.00044339546,0.00021320119,0.0002744553,0.0018730855,0.00020098132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029899352,0.00009018095,0.00018921847,0.00073019904,0.00023261741,0.00037558185,0.0007112829,0.00007277869,0.0004856511],"category_scores_gemma":[0.0010103639,0.00007997937,0.00009865154,0.0018951597,0.00013448199,0.00070349494,0.000110247915,0.00058449595,0.00018712277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008028609,0.00011126043,0.00066498655,0.000009885238,0.000031661002,0.00018071666,0.0010413295,0.0016971371,0.00857255,0.056208145,0.0013750789,0.93002695],"study_design_scores_gemma":[0.00018225302,0.00090019824,0.0029369476,0.0004223748,0.000015233005,0.0013874851,0.001960676,0.8437591,0.055555712,0.039902873,0.05244819,0.0005289305],"about_ca_topic_score_codex":0.000018131253,"about_ca_topic_score_gemma":0.0000133235235,"teacher_disagreement_score":0.9416855,"about_ca_system_score_codex":0.0001125705,"about_ca_system_score_gemma":0.0002509718,"threshold_uncertainty_score":0.5317539},"labels":[],"label_agreement":null},{"id":"W1576080058","doi":"","title":"Construction of Boolean contact algebras","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Intersection (aeronautics); Connection (principal bundle); Relation (database); Countable set; Relation algebra; Computer science; Boolean algebras canonically defined; Interior algebra; Stone's representation theorem for Boolean algebras; Algebra over a field; Mathematics; Two-element Boolean algebra; Discrete mathematics; Pure mathematics; Jordan algebra; Algebra representation","score_opus":0.0075059736904121025,"score_gpt":0.2124836822024264,"score_spread":0.20497770851201427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576080058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022489106,0.0000053383005,0.9613234,0.00069208327,0.00019044463,0.000051238745,4.299517e-7,0.000101747144,0.015146244],"genre_scores_gemma":[0.8152111,0.000005569012,0.18460728,0.00012477403,0.000007725226,7.6725877e-7,7.4222424e-7,0.0000014200493,0.000040588835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996081,0.000008777638,0.00012473528,0.00010409926,0.00009068499,0.00006361694],"domain_scores_gemma":[0.9997148,0.0000115040675,0.000051213337,0.00014205779,0.000048681595,0.00003175173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046844816,0.000042177926,0.000059862577,0.00005943058,0.000029126128,0.000022680999,0.00010222108,0.00002370983,0.00012619227],"category_scores_gemma":[0.0000113173455,0.000039035596,0.000027662416,0.000145632,0.000029151919,0.00027454147,0.000022016431,0.000031135456,0.00002338209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010925804,0.000009644293,0.0011655787,0.0000018850144,0.0000043348214,6.373321e-7,0.00008230368,0.0004963456,0.00091700244,0.95336396,0.000023186263,0.04393402],"study_design_scores_gemma":[0.008506491,0.0007760103,0.24833342,0.00014671861,0.000037889142,0.0006555224,0.0010548288,0.05217544,0.37972474,0.30244887,0.0048396997,0.0013003579],"about_ca_topic_score_codex":0.000041565112,"about_ca_topic_score_gemma":0.000020382244,"teacher_disagreement_score":0.79272205,"about_ca_system_score_codex":0.000021612526,"about_ca_system_score_gemma":0.000056680412,"threshold_uncertainty_score":0.15918255},"labels":[],"label_agreement":null},{"id":"W1580185273","doi":"10.5772/15677","title":"The Fusion of Fuzzy Temporal Plans: Managing Uncertainty and Time in Decentralized Command and Control Systems","year":2011,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Task (project management); Computer science; Plan (archaeology); Set (abstract data type); Constraint (computer-aided design); Duration (music); Time constraint; Control (management); Key (lock); Operations research; Fuzzy logic; Real-time computing; Temporal logic; Distributed computing; Artificial intelligence; Theoretical computer science; Computer security; Engineering; Systems engineering; Programming language","score_opus":0.013778008183149103,"score_gpt":0.21162664849976895,"score_spread":0.19784864031661983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580185273","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001349953,0.0037248733,0.33787993,0.00065458025,0.001016461,0.0029927306,0.000091585796,0.00031451017,0.6519754],"genre_scores_gemma":[0.97318894,0.0005842346,0.00065956404,0.00009490203,0.000024298124,0.000020932566,0.000007889802,0.00002455224,0.025394691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989919,0.00005094639,0.000389725,0.00026107777,0.00015564672,0.00015070777],"domain_scores_gemma":[0.9991645,0.00017432739,0.00025369262,0.00028312232,0.00006761714,0.00005671135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034373364,0.00018883015,0.00030617352,0.00015171898,0.000096281976,0.000109518354,0.00023599212,0.00015223124,0.000008822983],"category_scores_gemma":[0.000011717652,0.00014313786,0.000037773745,0.000014029937,0.00020914176,0.00006079491,0.00012936248,0.00021526215,0.0000029883963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003202465,0.000016209586,0.0013046359,0.0002348448,0.00019923491,0.00006403601,0.002089083,0.000063261316,0.0014528562,0.65628415,0.00015439952,0.33781704],"study_design_scores_gemma":[0.017729959,0.0011745545,0.0027230536,0.009622638,0.00036451654,0.000956438,0.0005683914,0.2591906,0.0015039892,0.4942864,0.20800236,0.003877115],"about_ca_topic_score_codex":0.0002272161,"about_ca_topic_score_gemma":0.00030780243,"teacher_disagreement_score":0.971839,"about_ca_system_score_codex":0.000035183944,"about_ca_system_score_gemma":0.000043757253,"threshold_uncertainty_score":0.5836993},"labels":[],"label_agreement":null},{"id":"W1580645447","doi":"10.1007/978-3-642-15384-6_44","title":"Improving Communication Using 3D Animation","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Animation; XML; Lift (data mining); Process (computing); Set (abstract data type); Pipeline (software); Multimedia; Database; Computer graphics (images); World Wide Web; Programming language; Data mining","score_opus":0.01759901403166653,"score_gpt":0.2481093351883181,"score_spread":0.23051032115665157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580645447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009231908,0.00009587438,0.9958019,0.0003763607,0.0010223669,0.00028234327,0.0000018804723,0.00017033947,0.0021565605],"genre_scores_gemma":[0.066450976,0.000022987544,0.9328541,0.00043028503,0.00013641566,0.0000027891099,0.0000073931083,0.000019180214,0.00007584722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978725,0.0000327532,0.00042249024,0.00079120905,0.0005609204,0.00032012557],"domain_scores_gemma":[0.99777323,0.00020194428,0.00039465114,0.0012527211,0.00028105866,0.000096416035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069634576,0.0003003999,0.00025800214,0.0006737295,0.0004176459,0.0006474283,0.0016342001,0.00032422296,0.000047278194],"category_scores_gemma":[0.000093193245,0.00031055303,0.000065910266,0.00041700454,0.00044190115,0.0010861839,0.00076175755,0.0008453059,0.000019763385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012826887,0.000008268048,0.000036113634,0.000014640311,0.0000029170208,0.000004269058,0.0003616334,0.038101327,0.00230351,0.013082313,8.7276084e-7,0.94608283],"study_design_scores_gemma":[0.00013254459,0.000025503681,0.00010821789,0.000118428834,0.0000053123013,0.000055842505,1.0305321e-7,0.9751242,0.0012160086,0.02258822,0.00028207968,0.0003435321],"about_ca_topic_score_codex":0.000051803298,"about_ca_topic_score_gemma":0.00020258443,"teacher_disagreement_score":0.9457393,"about_ca_system_score_codex":0.00027701844,"about_ca_system_score_gemma":0.0004767654,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W1580701341","doi":"10.1007/978-3-540-68880-8_7","title":"A Meeting Scheduling Problem Respecting Time and Space","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Schedule; Computer science; Scheduling (production processes); Interval (graph theory); Subject (documents); Duration (music); Running time; Operations research; Job shop scheduling; Mathematical optimization; Theoretical computer science; Mathematics; Combinatorics; World Wide Web","score_opus":0.012875045313961527,"score_gpt":0.22634619211664286,"score_spread":0.21347114680268134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580701341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018742945,0.0003802825,0.9881224,0.0010717016,0.0003681945,0.0002802449,0.000001055875,0.00023358724,0.009355079],"genre_scores_gemma":[0.028959533,0.00013578989,0.96982056,0.0004279281,0.00022512375,0.0000029583714,0.0000016942219,0.000025340854,0.00040109004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732226,0.00003119671,0.0003984653,0.0011972492,0.00060498057,0.0004458367],"domain_scores_gemma":[0.9984462,0.00037962032,0.00028120444,0.0005637711,0.00018620859,0.0001429688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000697474,0.00035928108,0.0003479872,0.0006846214,0.00045540684,0.00052342843,0.00085879286,0.00021197884,0.000017814022],"category_scores_gemma":[0.00013846077,0.0003595036,0.00006240029,0.00050164823,0.00046173297,0.00060753804,0.0008015748,0.0006250934,0.000029222838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034895086,0.000011758274,0.00012139666,0.000028871786,0.000010054314,0.00008434543,0.0019857192,0.1957854,0.0003642879,0.0063449955,0.000013037215,0.79524666],"study_design_scores_gemma":[0.00020059862,0.00005805386,0.000089149886,0.00049654924,0.000004113181,0.00033700766,2.398308e-7,0.98585325,0.00043876257,0.011487949,0.0005395545,0.00049479154],"about_ca_topic_score_codex":0.000019046473,"about_ca_topic_score_gemma":0.000042704833,"teacher_disagreement_score":0.7947518,"about_ca_system_score_codex":0.00018977161,"about_ca_system_score_gemma":0.00040526327,"threshold_uncertainty_score":0.9998857},"labels":[],"label_agreement":null},{"id":"W1580769741","doi":"","title":"Does Representation Matter in the Planning Competition","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Satisficing; Representation (politics); Competition (biology); Computer science; Domain (mathematical analysis); Function (biology); Artificial intelligence; Mathematics; Political science","score_opus":0.036959608693018654,"score_gpt":0.2635110223734105,"score_spread":0.22655141368039186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580769741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01103005,0.0000011471559,0.8864933,0.0014620877,0.00015655343,0.0000749387,1.260953e-7,0.000043658125,0.10073814],"genre_scores_gemma":[0.9750291,0.0000010838704,0.023676256,0.0010608925,0.000010396536,0.0000065287236,0.000001676275,0.0000010791646,0.00021295315],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996474,0.00004692135,0.000081229264,0.00009713095,0.00007269033,0.000054637763],"domain_scores_gemma":[0.99978745,0.000026993474,0.0000228973,0.00014176362,0.000012451555,0.000008421088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010283217,0.000029642888,0.000026231039,0.000049700586,0.000034934925,0.00004821961,0.00013803363,0.000013218609,0.00068773946],"category_scores_gemma":[0.000004240707,0.000014816017,0.000010918238,0.00013662793,0.00001185804,0.00031924935,0.000018002125,0.000037251542,0.00007383524],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006926722,0.00006136224,0.61008084,0.000005249896,0.000004686362,0.000015895635,0.022116115,0.00066680013,0.00017355538,0.3448176,0.0019001669,0.02015081],"study_design_scores_gemma":[0.00013910283,0.000008779553,0.9697577,0.0000075492717,9.424639e-7,0.000010065296,0.0008217483,0.023143975,0.00057224487,0.005246583,0.0002282972,0.00006304777],"about_ca_topic_score_codex":0.00006686359,"about_ca_topic_score_gemma":0.00003562929,"teacher_disagreement_score":0.9639991,"about_ca_system_score_codex":0.0000061696132,"about_ca_system_score_gemma":0.0000045967713,"threshold_uncertainty_score":0.7530265},"labels":[],"label_agreement":null},{"id":"W1581425933","doi":"","title":"A general framework for scheduling in a stochastic environment","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Machine learning; Theoretical computer science; Artificial intelligence; Distributed computing; Industrial engineering; Mathematical optimization; Engineering","score_opus":0.0940925670022517,"score_gpt":0.3325678346717465,"score_spread":0.23847526766949478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581425933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094894385,0.000005478242,0.9848375,0.0032721707,0.0010426146,0.0003133658,0.0000057939965,0.000070104994,0.0009635849],"genre_scores_gemma":[0.7426237,0.000009679706,0.256803,0.000354731,0.0001247292,0.000031708743,0.000005654241,0.000006798395,0.000039994593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982842,0.000025363252,0.00056066876,0.0004592153,0.00036863502,0.0003018806],"domain_scores_gemma":[0.99911183,0.00026005728,0.0001512169,0.00024493568,0.0001340456,0.00009789449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625916,0.00016135175,0.0001457381,0.000357113,0.00007649515,0.0001939903,0.00048730097,0.00009545689,0.0002806712],"category_scores_gemma":[0.0003461442,0.00017152283,0.0000791467,0.0001811755,0.00007086791,0.0002533765,0.00008730528,0.00023092981,0.00015579975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003548926,0.00007399776,0.000042362462,0.000001285632,0.000006687847,0.0000053645263,0.0002653854,0.07786922,0.0008597723,0.7386476,0.0000022168954,0.18219063],"study_design_scores_gemma":[0.000045636156,0.000066000626,0.00064779713,0.00006584631,0.0000015646814,0.0000057585316,0.00013985073,0.7151018,0.0071285297,0.2765596,0.0000680414,0.00016960158],"about_ca_topic_score_codex":0.000022847069,"about_ca_topic_score_gemma":0.00006013638,"teacher_disagreement_score":0.73313427,"about_ca_system_score_codex":0.0001909702,"about_ca_system_score_gemma":0.00007811026,"threshold_uncertainty_score":0.6994498},"labels":[],"label_agreement":null},{"id":"W1581688077","doi":"10.1007/3-540-48035-8_56","title":"Dynamic CSPs for Interval-Based Temporal Reasoning","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Interval (graph theory); Metric (unit); Consistency (knowledge bases); Theoretical computer science; Temporal logic; Temporal database; Algorithm; Artificial intelligence; Data mining; Mathematics","score_opus":0.01543977918840671,"score_gpt":0.24701533140564233,"score_spread":0.2315755522172356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581688077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013131878,0.0001154832,0.9946178,0.0012149389,0.0016499545,0.00050863874,0.000009093336,0.00023874675,0.0016321681],"genre_scores_gemma":[0.09691087,0.000014138206,0.90096354,0.0013567602,0.000117368516,0.000018032672,0.000016516591,0.00003291794,0.0005698378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997218,0.000024090063,0.00047205357,0.0012264249,0.0005640867,0.0004953489],"domain_scores_gemma":[0.9980572,0.00036560485,0.0003027938,0.0008860679,0.00024642659,0.00014190048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054652564,0.00042077922,0.00040128824,0.0007930201,0.000259925,0.00052726915,0.0016154158,0.0002635798,0.00007078068],"category_scores_gemma":[0.00011574794,0.00041368217,0.00018133021,0.00041978643,0.00038996275,0.0004943404,0.00034147018,0.0004614646,0.00002540892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006287711,0.00001940969,0.00010157103,0.000039925053,0.00000805286,0.000019783465,0.00023025216,0.114669494,0.000019898189,0.010714504,0.00003847041,0.87413234],"study_design_scores_gemma":[0.0003507651,0.0001278661,0.00009212743,0.0003283121,0.000005936598,0.00002790226,7.7596894e-8,0.9796601,0.00011534282,0.017141256,0.0016899501,0.00046038887],"about_ca_topic_score_codex":0.000009390536,"about_ca_topic_score_gemma":0.00009285073,"teacher_disagreement_score":0.87367195,"about_ca_system_score_codex":0.00036877548,"about_ca_system_score_gemma":0.00037921176,"threshold_uncertainty_score":0.9998315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Backtracking; Algorithm; Artificial intelligence","score_opus":0.021603511987683177,"score_gpt":0.25252858205326423,"score_spread":0.23092507006558105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583185913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013975629,0.00010932463,0.9900816,0.0011282506,0.0015746664,0.00034538686,0.0000021121216,0.00012649206,0.006492394],"genre_scores_gemma":[0.19111358,0.00017791847,0.80526036,0.002410773,0.00025138998,0.000011649095,0.000009276486,0.000050271316,0.0007147582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967108,0.00007018734,0.00052299676,0.0012852772,0.00079545326,0.0006152808],"domain_scores_gemma":[0.99822927,0.00038227934,0.0001654838,0.0008737371,0.00019451065,0.0001547376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083423004,0.00038511283,0.00039128575,0.0016385427,0.00017175915,0.0004835522,0.0015855205,0.0003070295,0.000071812596],"category_scores_gemma":[0.00012531373,0.00039384072,0.00008380279,0.0015347739,0.00032525184,0.0006307797,0.0005193516,0.000957185,0.00003885996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000352478,0.00002275608,0.000967926,0.000018724026,0.0000050568915,0.00009998982,0.00047319464,0.114607796,0.000053116626,0.016846407,0.000024222218,0.86687726],"study_design_scores_gemma":[0.0005795138,0.00012232673,0.0016557629,0.00040561002,0.0000040884006,0.00012379077,4.1588058e-7,0.9417627,0.0005665313,0.052994125,0.00092666503,0.0008585099],"about_ca_topic_score_codex":0.00007251088,"about_ca_topic_score_gemma":0.00027592893,"teacher_disagreement_score":0.8660188,"about_ca_system_score_codex":0.00049071136,"about_ca_system_score_gemma":0.0006035798,"threshold_uncertainty_score":0.99985135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022796241693159934,"score_gpt":0.24354817146018765,"score_spread":0.2207519297670277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585071718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021692317,0.00008350732,0.9900547,0.0014344204,0.0014373328,0.00014226034,9.077042e-7,0.0000308058,0.004646795],"genre_scores_gemma":[0.9953919,0.000087674,0.0039356565,0.00037756344,0.00012591478,0.000002244107,0.0000029236987,0.0000024271003,0.00007366955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984139,0.000086885695,0.0008935609,0.00004161286,0.00044696993,0.00011707883],"domain_scores_gemma":[0.99829215,0.0000858903,0.0008417564,0.00018048176,0.0005348133,0.000064920925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010813267,0.00007926038,0.0001383926,0.00020383517,0.00018816271,0.0005186546,0.00043370796,0.000037937833,0.000026132246],"category_scores_gemma":[0.00008963411,0.000051221883,0.000091606635,0.00033208716,0.000023957287,0.0020597847,0.000042559604,0.00017239487,0.000084098145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010108045,0.00013056074,0.04829291,0.00014781783,0.00023955932,0.000042399697,0.017676316,0.2017949,0.000082945495,0.2936344,0.0212054,0.4166517],"study_design_scores_gemma":[0.0003403099,0.00008090967,0.001918763,0.00010296494,0.000009341686,0.002149582,0.002842019,0.2969819,0.00012306366,0.00021601602,0.6950851,0.00015001182],"about_ca_topic_score_codex":0.00003262683,"about_ca_topic_score_gemma":0.0000044414055,"teacher_disagreement_score":0.9932227,"about_ca_system_score_codex":0.000069964764,"about_ca_system_score_gemma":0.000057911857,"threshold_uncertainty_score":0.50013983},"labels":[],"label_agreement":null},{"id":"W1586168340","doi":"10.1007/978-3-540-72665-4_20","title":"Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Computer science; Constraint satisfaction; Breakout; Local consistency; Constraint graph; Bounded function; Constraint satisfaction dual problem; Graph; Mathematical optimization; Constraint (computer-aided design); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.017393515892519733,"score_gpt":0.23947411819081743,"score_spread":0.2220806022982977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586168340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010522839,0.00009900453,0.99296564,0.00036413674,0.0022604938,0.0008199274,0.0000071074155,0.00040876234,0.0029696806],"genre_scores_gemma":[0.5260998,0.00005826679,0.47228372,0.0010639718,0.0003338184,0.000012334488,0.000012663201,0.000040545703,0.00009490834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955627,0.000051662828,0.0007699778,0.0017060855,0.0010962333,0.0008133594],"domain_scores_gemma":[0.997102,0.00050712546,0.0005146067,0.0010521391,0.0004921492,0.0003319805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009770577,0.00071270164,0.0005690046,0.0011430788,0.00046790845,0.0006258619,0.0009654524,0.00050870306,0.00014165686],"category_scores_gemma":[0.000066928806,0.0006473578,0.0001484851,0.00079064164,0.0015529038,0.00072435406,0.00037196616,0.0012342727,0.000030707197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014278286,0.000016115222,0.00056088064,0.00001159325,0.000021507556,0.00008572655,0.0002566118,0.32303727,0.0000320826,0.008330688,0.0000046492837,0.6676286],"study_design_scores_gemma":[0.00092850835,0.00024464724,0.0036024288,0.00034253488,0.000018546096,0.0006210721,0.0000018282925,0.98861486,0.00022907398,0.004070848,0.00035423215,0.0009714052],"about_ca_topic_score_codex":0.00011538332,"about_ca_topic_score_gemma":0.0020888748,"teacher_disagreement_score":0.6666572,"about_ca_system_score_codex":0.00071895175,"about_ca_system_score_gemma":0.0007506428,"threshold_uncertainty_score":0.9995978},"labels":[],"label_agreement":null},{"id":"W1586942805","doi":"10.1007/978-3-540-72665-4_45","title":"Planning in Multiagent Expedition with Collaborative Design Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Representation (politics); Multi-agent system; Class (philosophy); Artificial intelligence; Greedy algorithm; Distributed computing; Theoretical computer science; Human–computer interaction; Algorithm","score_opus":0.02785952644953354,"score_gpt":0.26357435191088735,"score_spread":0.2357148254613538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586942805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016304939,0.0002072903,0.99678904,0.00016804461,0.0008353461,0.0005456117,0.0000013103524,0.00010985791,0.0013271716],"genre_scores_gemma":[0.1216878,0.000039763374,0.8770858,0.0008356026,0.00025176347,0.000015083689,0.000008235788,0.000023675299,0.00005229104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744815,0.00005098276,0.00040343957,0.0009909513,0.00063968886,0.00046680056],"domain_scores_gemma":[0.9983973,0.00048677265,0.0002571274,0.000494621,0.00024439866,0.00011978224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008123627,0.00036816412,0.00032233718,0.0009914101,0.00016869571,0.00034112605,0.00080842926,0.00026058452,0.000021051132],"category_scores_gemma":[0.000038588652,0.00033137287,0.00003429764,0.0010711672,0.00036719916,0.00065071817,0.00022642715,0.0006328693,0.0000063060056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129568525,0.000009823153,0.00011327528,0.0000037064633,0.000003237428,0.00011400162,0.0009132593,0.75629526,0.0000044730677,0.001738567,0.0000075747716,0.24078384],"study_design_scores_gemma":[0.00040497596,0.00016225963,0.0006234909,0.0004073657,0.0000029403295,0.00004217712,0.0000013025991,0.9937909,0.0001678913,0.0038319745,0.00013428064,0.00043038736],"about_ca_topic_score_codex":0.000010066624,"about_ca_topic_score_gemma":0.00014871241,"teacher_disagreement_score":0.24035345,"about_ca_system_score_codex":0.0003912622,"about_ca_system_score_gemma":0.00048820808,"threshold_uncertainty_score":0.9999138},"labels":[],"label_agreement":null},{"id":"W1588928324","doi":"10.1007/3-540-44533-1_48","title":"Consistency in General CSPs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; National Research Council Canada","funders":"","keywords":"Consistency (knowledge bases); Pairwise comparison; Local consistency; Constraint satisfaction problem; Tuple; Computer science; Weak consistency; Consistency model; Sequential consistency; Strong consistency; Constraint satisfaction; Representation (politics); Constraint (computer-aided design); Binary number; Eventual consistency; Theoretical computer science; Causal consistency; Algorithm; Mathematics; Artificial intelligence; Discrete mathematics; Statistics","score_opus":0.013041121607784405,"score_gpt":0.2299882166618353,"score_spread":0.2169470950540509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588928324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011995431,0.0001954811,0.9702675,0.000828877,0.0011382186,0.00027346914,0.0000029769506,0.00012454228,0.027049001],"genre_scores_gemma":[0.1933545,0.00030289622,0.80026776,0.004210183,0.00044410833,0.000014055473,0.000012315637,0.000044265973,0.0013499141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718136,0.000033801178,0.00052772573,0.0011624822,0.00060913304,0.00048552777],"domain_scores_gemma":[0.998566,0.00017538408,0.00015628134,0.0008722072,0.00010157644,0.00012857046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004282776,0.0003715159,0.00038982986,0.0010438961,0.00014292818,0.00036440624,0.00146894,0.00022202873,0.00020584867],"category_scores_gemma":[0.000037165762,0.00037142792,0.000094987365,0.0006514703,0.0005057726,0.0005392858,0.000371427,0.00061667635,0.000076445365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002717932,0.000014077403,0.00022661644,0.0000073748174,0.0000028388902,0.00009907251,0.00027855884,0.07779964,0.000018698402,0.037811123,0.000011920776,0.8837274],"study_design_scores_gemma":[0.00042582472,0.00007801132,0.0016645663,0.00023689705,0.0000037125078,0.00017422417,1.0245858e-7,0.83417875,0.00017164815,0.15971583,0.0026228612,0.00072754576],"about_ca_topic_score_codex":0.000045137796,"about_ca_topic_score_gemma":0.00036311417,"teacher_disagreement_score":0.88299984,"about_ca_system_score_codex":0.00027979986,"about_ca_system_score_gemma":0.0006374296,"threshold_uncertainty_score":0.99987376},"labels":[],"label_agreement":null},{"id":"W1589644135","doi":"10.1007/978-3-642-38457-8_16","title":"Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Hyperbolic tree; Set (abstract data type); Constraint (computer-aided design); Probabilistic logic; Tree (set theory); Boundary (topology); Multi-agent system; Theoretical computer science; Inference; Artificial intelligence; Mathematics; Programming language","score_opus":0.02377325258255158,"score_gpt":0.2171652799582494,"score_spread":0.19339202737569783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589644135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012429815,0.0000799089,0.99610925,0.00047970956,0.0008294307,0.0003163617,0.0000113693195,0.00009604865,0.0008349578],"genre_scores_gemma":[0.10439443,0.000100311074,0.89457947,0.000668455,0.000101589336,0.0000051958673,0.000050642942,0.000022901653,0.00007702586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980535,0.000034064073,0.0004221577,0.000780066,0.0004904734,0.00021976292],"domain_scores_gemma":[0.9983376,0.00018297033,0.00034786182,0.00049679633,0.0005367214,0.000098003205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029775413,0.00026819215,0.00028562977,0.0005978823,0.00017833439,0.00032140844,0.0005062748,0.000207639,0.00013869014],"category_scores_gemma":[0.00011183042,0.0002673523,0.000040613006,0.00055760395,0.0007685084,0.0006905067,0.00024683014,0.00026459328,0.000027420028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023966343,0.0000100375,0.00034004776,0.00004624894,0.0000052305245,0.000004900724,0.0002713232,0.003315646,0.0002735692,0.0033120196,0.000008608727,0.99240994],"study_design_scores_gemma":[0.00063047674,0.0002192349,0.0032395865,0.00064143405,0.000023046505,0.00023457097,0.0000014514685,0.86530405,0.0052356315,0.12324265,0.0004010487,0.0008267954],"about_ca_topic_score_codex":0.000020737316,"about_ca_topic_score_gemma":0.000022765118,"teacher_disagreement_score":0.99158317,"about_ca_system_score_codex":0.00014702059,"about_ca_system_score_gemma":0.00044186454,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W1591060977","doi":"10.1007/978-3-642-34487-9_79","title":"Managing Qualitative Preferences with Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Local consistency; Constraint satisfaction problem; Formalism (music); Preference; Consistency (knowledge bases); Constraint satisfaction; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02849950941814939,"score_gpt":0.2770167262743363,"score_spread":0.24851721685618694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591060977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002606801,0.00020429635,0.9811718,0.0007622289,0.0006940329,0.00030657274,0.0000045807865,0.00016696737,0.016663477],"genre_scores_gemma":[0.38264897,0.000074816584,0.61612403,0.00069416,0.00017421131,0.000009135598,0.000006591111,0.000022696893,0.00024538746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723625,0.00006147242,0.00036871422,0.0009933601,0.0008054419,0.0005347851],"domain_scores_gemma":[0.9981458,0.00044769075,0.00029439433,0.0006966382,0.00023460739,0.00018085979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008022956,0.00041626507,0.00037210158,0.00066734455,0.000224016,0.000438082,0.0013337018,0.00017818125,0.00014705208],"category_scores_gemma":[0.000037368343,0.0003425628,0.000060408154,0.0004673969,0.0014443157,0.00096822984,0.0004154545,0.0005553716,0.0000511506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034788952,0.000009944886,0.000064561245,0.000017212707,0.000012265704,0.000014965661,0.004811268,0.0081208,0.000007928984,0.049242396,0.0000036590145,0.9376915],"study_design_scores_gemma":[0.0011815111,0.0005526772,0.0009765758,0.0016292644,0.000046485762,0.00044918244,0.000024743575,0.40468892,0.0011896163,0.5849626,0.0014013114,0.0028970737],"about_ca_topic_score_codex":0.000012522507,"about_ca_topic_score_gemma":0.00009794063,"teacher_disagreement_score":0.9347944,"about_ca_system_score_codex":0.00018996572,"about_ca_system_score_gemma":0.00048557034,"threshold_uncertainty_score":0.99990267},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01220269376855133,"score_gpt":0.24193617084643781,"score_spread":0.2297334770778865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591802374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004924664,0.00016143701,0.99564254,0.00048419533,0.00050221797,0.00044342753,0.0000012529567,0.00015875185,0.0021137185],"genre_scores_gemma":[0.62548316,0.000023879475,0.37405726,0.00018199149,0.0001494092,0.000010072362,0.0000030749054,0.000014725791,0.00007639467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977319,0.000034293706,0.00026032145,0.0011575831,0.000521729,0.00029411993],"domain_scores_gemma":[0.99883205,0.00011144345,0.0002244824,0.0005157012,0.00021421832,0.00010211159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005292647,0.0003023132,0.00026529416,0.00043494292,0.0003054816,0.00043947608,0.00046016678,0.00018801044,0.0000089022005],"category_scores_gemma":[0.0000405251,0.00026385626,0.000035441837,0.0004188949,0.0006731712,0.00088762864,0.00028890683,0.0004330463,0.000004684621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009121229,0.000010368503,0.00007234032,0.000036705598,0.0000049715854,0.0000053898943,0.0007291597,0.11218879,0.00010573844,0.012531997,3.9292254e-7,0.874305],"study_design_scores_gemma":[0.0009931513,0.00049639796,0.0036386137,0.0013400555,0.00002529421,0.00067641033,0.0000011069234,0.7942363,0.0023688336,0.19486785,0.00022072732,0.0011352306],"about_ca_topic_score_codex":0.00003076614,"about_ca_topic_score_gemma":0.00006118829,"teacher_disagreement_score":0.8731698,"about_ca_system_score_codex":0.00041055554,"about_ca_system_score_gemma":0.00044817978,"threshold_uncertainty_score":0.99998134},"labels":[],"label_agreement":null},{"id":"W1592201666","doi":"","title":"Using expectation maximization to find likely assignments for solving CSP's","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Heuristic; Constraint satisfaction; Computer science; Probabilistic logic; Maximization; Constraint (computer-aided design); Local consistency; Variable (mathematics); Random variable; Convergence (economics); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.05559412058511819,"score_gpt":0.3272097459386036,"score_spread":0.2716156253534854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592201666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0133842435,0.0000026020668,0.98424697,0.00026915592,0.00036605675,0.00032095963,7.129987e-7,0.00011952155,0.0012897714],"genre_scores_gemma":[0.42571166,5.557326e-7,0.5736809,0.00031980666,0.000033718192,0.0000053901717,0.0000037919824,0.0000049977925,0.00023920811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992176,0.000009240334,0.00019968548,0.00022606997,0.00016234051,0.00018502555],"domain_scores_gemma":[0.9995274,0.000071813534,0.000067312874,0.00014054682,0.00011360233,0.000079310215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560847,0.00007646559,0.00006490262,0.00017564066,0.00015433597,0.00013136285,0.00012716795,0.00004174621,0.00005491129],"category_scores_gemma":[0.00007043256,0.00008034269,0.000029769646,0.00030138795,0.0000066090934,0.0005175601,0.000038371898,0.00002711799,0.000011954601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005696903,0.00011338826,0.011750967,0.000025934478,0.00003486108,0.00000396601,0.0043838164,0.15121162,0.088201895,0.0626431,0.0013287035,0.6802448],"study_design_scores_gemma":[0.0004681603,0.00005677817,0.031458657,0.000015469504,0.000005477762,0.0000065949016,0.00017324397,0.95002055,0.016576659,0.0005741053,0.00043069827,0.0002136255],"about_ca_topic_score_codex":0.000012161225,"about_ca_topic_score_gemma":0.000022715321,"teacher_disagreement_score":0.79880893,"about_ca_system_score_codex":0.000102013975,"about_ca_system_score_gemma":0.000036998845,"threshold_uncertainty_score":0.327628},"labels":[],"label_agreement":null},{"id":"W1599436623","doi":"10.1007/978-3-540-24840-8_58","title":"Constraint Directed Dynamic Backtracking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Backtracking; Thrashing; Computer science; Constraint learning; Look-ahead; Constraint satisfaction problem; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Algorithm; Theoretical computer science; Mathematics; Constraint logic programming; Parallel computing; Artificial intelligence","score_opus":0.010880262137369453,"score_gpt":0.23579805044388305,"score_spread":0.2249177883065136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599436623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030539682,0.00014562851,0.9879547,0.00093899475,0.0018695225,0.00035324803,0.000005936525,0.000530583,0.008170869],"genre_scores_gemma":[0.34981588,0.00006946722,0.64870155,0.001009949,0.00013549461,0.0000055830697,0.0000116554065,0.000034023815,0.00021640067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966824,0.000027096014,0.00053813815,0.0013813142,0.00079527695,0.0005757942],"domain_scores_gemma":[0.9980164,0.00025563565,0.00029192097,0.0009841631,0.00026537382,0.0001864693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048219148,0.0004918529,0.00043664975,0.0008925509,0.00026701405,0.0006164319,0.0017100608,0.0003256688,0.00018256353],"category_scores_gemma":[0.00008667632,0.00049233745,0.00013514691,0.00065634784,0.00087214133,0.000632712,0.0005625359,0.00079164054,0.00007413503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018267505,0.000014250668,0.00002870502,0.000018261648,0.0000090370795,0.00007648653,0.0003435072,0.092054754,0.00009670187,0.045893785,0.0000028363586,0.86145985],"study_design_scores_gemma":[0.00042694964,0.00007754634,0.00057895534,0.0005235011,0.000008320389,0.00019515314,2.067814e-7,0.8225268,0.0003274921,0.17418145,0.0003380426,0.0008155515],"about_ca_topic_score_codex":0.000016895501,"about_ca_topic_score_gemma":0.00015805053,"teacher_disagreement_score":0.8606443,"about_ca_system_score_codex":0.00073747715,"about_ca_system_score_gemma":0.0011607836,"threshold_uncertainty_score":0.9997528},"labels":[],"label_agreement":null},{"id":"W1602966341","doi":"10.1007/11424918_12","title":"Queuing Local Solutions in Distributed Constraint Satisfaction Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Backtracking; Queue; Local search (optimization); Constraint satisfaction problem; Queueing theory; Distributed computing; Mathematical optimization; Order (exchange); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Artificial intelligence; Computer network; Mathematics","score_opus":0.016444252347478778,"score_gpt":0.23277720445889494,"score_spread":0.21633295211141615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602966341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047018526,0.0002793957,0.9944923,0.00089036993,0.00197815,0.00048481527,0.000023099146,0.00022260437,0.0015822776],"genre_scores_gemma":[0.8985081,0.00007552009,0.10069197,0.00031455077,0.00026995907,0.000016499254,0.000024796043,0.000023293385,0.00007536368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654293,0.000064759086,0.00075348583,0.0011975333,0.0007560634,0.00068522536],"domain_scores_gemma":[0.9982131,0.00031693414,0.00030287445,0.00076959765,0.00022126328,0.00017619543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008258444,0.00044759968,0.00047203898,0.0010809827,0.00027966325,0.0005757432,0.0009367912,0.0003865401,0.000044820517],"category_scores_gemma":[0.00007596913,0.00046803086,0.000101125064,0.00079477846,0.00081671425,0.0008453999,0.00045573813,0.00089482457,0.000041439627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015499055,0.000008675924,0.00016791685,0.000010982499,0.0000038202506,0.000022886526,0.00012800911,0.4827621,0.000015040819,0.032878883,0.0000076224605,0.48399252],"study_design_scores_gemma":[0.00032705435,0.00004466823,0.002030897,0.00039550973,0.0000052007563,0.00017437019,0.0000014176991,0.98810464,0.00003413181,0.0077487486,0.00061519316,0.00051818055],"about_ca_topic_score_codex":0.00022094224,"about_ca_topic_score_gemma":0.0018406572,"teacher_disagreement_score":0.89846104,"about_ca_system_score_codex":0.001345048,"about_ca_system_score_gemma":0.00078287965,"threshold_uncertainty_score":0.99977714},"labels":[],"label_agreement":null},{"id":"W1604814605","doi":"10.1007/978-3-642-02777-2_25","title":"Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Satisfiability; Local search (optimization); Truth value; Selection (genetic algorithm); Beam search; Process (computing); Variable (mathematics); Search algorithm; Value (mathematics); Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","score_opus":0.010489421663472087,"score_gpt":0.2510907163993639,"score_spread":0.24060129473589184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604814605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007467939,0.000027357364,0.99756515,0.0003906804,0.00044452414,0.0010415115,0.0000064814576,0.000117339274,0.00033228344],"genre_scores_gemma":[0.42715502,0.0000011253758,0.5722933,0.00028703723,0.00015489387,0.00003168271,0.00001144052,0.000015262245,0.00005024541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969872,0.000036879384,0.00047715133,0.0012636533,0.0007087101,0.00052636716],"domain_scores_gemma":[0.9984928,0.0003587529,0.0001670891,0.00039248448,0.0004766393,0.00011228424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010704461,0.00032763815,0.00033262232,0.00076796464,0.00025780936,0.00035963272,0.00085363234,0.00027227568,0.00002577375],"category_scores_gemma":[0.00009817017,0.00033347704,0.00006330579,0.00082123384,0.0003739456,0.00074451976,0.00018364808,0.00062498305,0.0000041631633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008683042,0.000019442996,0.000049157523,0.000032754422,0.0000016197191,0.0000015030872,0.00014845828,0.5568424,0.00004571799,0.013850363,5.64694e-7,0.42899933],"study_design_scores_gemma":[0.0003172421,0.00017609455,0.00038583457,0.00016582909,0.0000035516316,0.000040490966,2.8612732e-7,0.8918586,0.0003315355,0.10639365,0.0000075789,0.0003193249],"about_ca_topic_score_codex":0.00004161153,"about_ca_topic_score_gemma":0.00016012548,"teacher_disagreement_score":0.42868,"about_ca_system_score_codex":0.0007610273,"about_ca_system_score_gemma":0.0016759275,"threshold_uncertainty_score":0.9999117},"labels":[],"label_agreement":null},{"id":"W16126390","doi":"10.1007/978-3-642-37198-1_4","title":"A New Crossover for Solving Constraint Satisfaction Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Crossover; Constraint satisfaction problem; Computer science; Heuristic; Constraint satisfaction; Solver; Mathematical optimization; Constraint (computer-aided design); Genetic algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.017153264294315934,"score_gpt":0.23975248087480078,"score_spread":0.22259921658048484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16126390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018106095,0.00011223383,0.9927349,0.0009512471,0.0021813738,0.0011024494,0.000006727904,0.00023047702,0.0026624831],"genre_scores_gemma":[0.04803569,0.000035072677,0.94916254,0.0009820781,0.0004397695,0.000031779466,0.000007773537,0.000036798887,0.0012685187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969364,0.000012299475,0.00055685913,0.001279182,0.0006300047,0.00058527174],"domain_scores_gemma":[0.99790853,0.00038055182,0.00036432702,0.00077717484,0.00033790106,0.00023149293],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043626223,0.00045950257,0.0004124636,0.0006055295,0.00032560987,0.0011771249,0.0010369451,0.00033533166,0.00026904343],"category_scores_gemma":[0.000101589445,0.0004464166,0.00015545398,0.00034245237,0.00039755675,0.0011149505,0.00038939426,0.0004928013,0.000071880546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026930843,0.0000046338637,0.00006522176,0.000028757533,0.000009322354,0.0000029536207,0.00036381034,0.042354513,0.00016873567,0.04112919,0.00014936899,0.9157208],"study_design_scores_gemma":[0.0007225908,0.0001451581,0.0006329459,0.00034716324,0.0000104801475,0.00009267687,2.645577e-7,0.7940536,0.0004633568,0.19991085,0.0028397297,0.0007812017],"about_ca_topic_score_codex":0.00010707724,"about_ca_topic_score_gemma":0.00030532212,"teacher_disagreement_score":0.9149396,"about_ca_system_score_codex":0.00038440165,"about_ca_system_score_gemma":0.0010558487,"threshold_uncertainty_score":0.99985975},"labels":[],"label_agreement":null},{"id":"W1617540954","doi":"10.1007/978-3-540-68155-7_26","title":"Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Key (lock); Constraint (computer-aided design); Computer science; Constraint programming; Inference; Algorithm; Constraint satisfaction problem; Satisfiability; Backtracking; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.07045167649631688,"score_gpt":0.30406401827887825,"score_spread":0.23361234178256135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1617540954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009112525,0.000059579634,0.9951699,0.00060729013,0.0027562673,0.0007817541,0.00002243529,0.00016138455,0.0003502887],"genre_scores_gemma":[0.041947905,0.000030298286,0.95525676,0.0019529286,0.00050490315,0.00000647754,0.000008465796,0.000040623843,0.0002516548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631685,0.000029693148,0.00053247344,0.0014736734,0.0008780473,0.0007692712],"domain_scores_gemma":[0.9980421,0.0003347819,0.00015861895,0.00080745324,0.0003419372,0.0003151055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060391356,0.0004761595,0.00049413333,0.001027155,0.0004184923,0.00048300545,0.0016427056,0.00023488414,0.000047568323],"category_scores_gemma":[0.00007175838,0.00049527775,0.00015659606,0.00053865294,0.0010154101,0.00070692087,0.0008223019,0.00052074884,0.00003332464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054865936,0.0000071985664,0.000007638869,0.000018463208,0.000007875482,0.000036559257,0.0004958521,0.31861365,0.00030204726,0.0025077814,0.000026510452,0.67797095],"study_design_scores_gemma":[0.00038878806,0.00012042993,0.000049255912,0.00020840253,0.000005174139,0.00038612742,5.9176034e-7,0.99117744,0.0028317438,0.003491165,0.00073137495,0.0006095215],"about_ca_topic_score_codex":0.000021725744,"about_ca_topic_score_gemma":0.000015967275,"teacher_disagreement_score":0.6773614,"about_ca_system_score_codex":0.0005047068,"about_ca_system_score_gemma":0.00086554245,"threshold_uncertainty_score":0.9997499},"labels":[],"label_agreement":null},{"id":"W1622775727","doi":"10.1109/ific.2000.862697","title":"A qualitative spatial model for information fusion and situation analysis","year":2000,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence","funders":"","keywords":"Computer science; Process (computing); Cognitive map; Spatial intelligence; Officer; Qualitative reasoning; Metric (unit); Spatial analysis; Mental mapping; Space (punctuation); Situation awareness; Artificial intelligence; Situation analysis; Cognition; Data science; Knowledge management; Operations research; Human–computer interaction; Engineering; Psychology; Operations management; Geography","score_opus":0.02082583330583607,"score_gpt":0.30042873963524575,"score_spread":0.27960290632940965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1622775727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009668542,0.0000015825898,0.9872623,0.00057054096,0.0000152352295,0.00015076638,0.0000049657733,0.00006669138,0.0022593662],"genre_scores_gemma":[0.8178712,0.000010159014,0.18143967,0.00025649506,0.000004832369,0.0000131465085,0.000039670016,9.123329e-7,0.0003639048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995654,0.000023622735,0.0001489404,0.00009801727,0.00010079831,0.00006319994],"domain_scores_gemma":[0.9997042,0.00004992062,0.000042695825,0.000088172346,0.00008377121,0.000031229723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017696741,0.000048034213,0.00006590991,0.00015574008,0.00009083021,0.0001035778,0.000050898183,0.000028206705,0.00011277724],"category_scores_gemma":[0.000018832612,0.000043935295,0.000034636014,0.00028599202,0.00001142839,0.0011154556,0.000011666724,0.000018660648,0.000010212125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013373189,0.000008011552,0.000062500934,0.000003731771,0.000028971028,1.8688546e-8,0.020199167,0.15898564,0.000018487306,0.030420868,0.00007922384,0.79018],"study_design_scores_gemma":[0.00023493398,0.000016654742,0.0015792015,8.96624e-7,0.000021895803,3.4163816e-7,0.00017688485,0.9957124,0.000025889196,0.0020486137,0.00012185659,0.000060402173],"about_ca_topic_score_codex":0.000066275235,"about_ca_topic_score_gemma":0.00017148738,"teacher_disagreement_score":0.8367268,"about_ca_system_score_codex":0.000014719646,"about_ca_system_score_gemma":0.000021065238,"threshold_uncertainty_score":0.17916293},"labels":[],"label_agreement":null},{"id":"W1626677565","doi":"10.1609/aaai.v24i1.7554","title":"Propagating Conjunctions of AllDifferent Constraints","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":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche; Australian Government","keywords":"Bipartite graph; Matching (statistics); Mathematics; Propagator; Combinatorics; 3-dimensional matching; Constraint (computer-aided design); Time complexity; Graph; Discrete mathematics","score_opus":0.04567041664019401,"score_gpt":0.2747648551204846,"score_spread":0.2290944384802906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626677565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67171043,0.0000041498324,0.27157825,0.0055888155,0.0021451993,0.0009575739,0.000014064774,0.00020953115,0.04779195],"genre_scores_gemma":[0.9888776,0.000006533382,0.010910742,0.000079982325,0.00003211046,0.000013829085,3.8353696e-7,0.0000063368157,0.0000725115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985603,0.00001229099,0.0005440499,0.0003120238,0.00036966137,0.00020167073],"domain_scores_gemma":[0.99831676,0.00008624871,0.00047592007,0.00025164973,0.00079522067,0.000074194424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264857,0.00015555727,0.0002024326,0.0001254302,0.00015530344,0.00011199002,0.0009379755,0.00008402833,0.0003151956],"category_scores_gemma":[0.0004963198,0.00011789024,0.00010114196,0.00045701544,0.00062446226,0.00028533215,0.00018234263,0.0003626268,0.000024587911],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008084334,0.00006828831,0.0007718112,0.000015552048,0.000007841917,6.807489e-8,0.0003196928,0.000027776445,0.1757304,0.72013944,0.000018374032,0.10289266],"study_design_scores_gemma":[0.000042638676,0.000114947296,0.0019629782,0.000118966665,0.000011771978,0.000011655278,0.0004361821,0.06286051,0.8736846,0.060532607,0.00003915807,0.00018399984],"about_ca_topic_score_codex":0.000015695246,"about_ca_topic_score_gemma":0.000021190786,"teacher_disagreement_score":0.6979542,"about_ca_system_score_codex":0.000015276642,"about_ca_system_score_gemma":0.00013478757,"threshold_uncertainty_score":0.48074245},"labels":[],"label_agreement":null},{"id":"W1636018584","doi":"10.1007/3-540-45578-7_78","title":"Building Negative Reduced Cost Paths Using Constraint Programming","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Constraint programming; Directed acyclic graph; Scheduling (production processes); Shortest path problem; Simple (philosophy); Set (abstract data type); Graph; Theoretical computer science; Algorithm; Mathematics; Stochastic programming; Programming language","score_opus":0.027500727639623777,"score_gpt":0.2770246021649901,"score_spread":0.2495238745253663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636018584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015149584,0.0000623229,0.9934833,0.00044848825,0.0016180212,0.0007818524,0.0000042589163,0.0002525528,0.00319769],"genre_scores_gemma":[0.10538647,0.000023522825,0.8937346,0.0004706734,0.00027189477,0.000009603578,0.000002988058,0.000030341971,0.00006994892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963154,0.000049186587,0.00060267374,0.0014676597,0.00084158586,0.00072346075],"domain_scores_gemma":[0.997772,0.00032889284,0.00043914653,0.00083239534,0.00039439648,0.0002331718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007013801,0.00053753704,0.00048632317,0.000911968,0.0004267521,0.0009613974,0.0015030681,0.00031442958,0.00006873558],"category_scores_gemma":[0.00015129113,0.0005434731,0.00013965352,0.00092161994,0.0009857783,0.00085111574,0.0007057618,0.0008124517,0.000012107556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002525759,0.000012455339,0.00002165595,0.000011334081,0.000009117258,0.00008003063,0.0005805511,0.07848563,0.00038022155,0.022081336,0.0000019904294,0.89833313],"study_design_scores_gemma":[0.0003366586,0.00007433164,0.000041425792,0.0005389192,0.000011617519,0.00039373827,0.0000012559866,0.94324654,0.0013635621,0.052202035,0.0010258141,0.0007641073],"about_ca_topic_score_codex":0.00003658654,"about_ca_topic_score_gemma":0.0000641857,"teacher_disagreement_score":0.89756906,"about_ca_system_score_codex":0.0006719218,"about_ca_system_score_gemma":0.00090744713,"threshold_uncertainty_score":0.9997017},"labels":[],"label_agreement":null},{"id":"W1641187076","doi":"10.1007/978-3-540-72397-4_26","title":"Generalizations of the Global Cardinality Constraint for Hierarchical Resources","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cardinality (data modeling); Computer science; Constraint (computer-aided design); Theoretical computer science; Algorithm; Mathematics; Data mining; Geometry","score_opus":0.026601511951052346,"score_gpt":0.2763459400708205,"score_spread":0.24974442811976813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641187076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007575723,0.00009833896,0.99317575,0.0009886312,0.0011719684,0.00046983836,0.000040240877,0.00005687188,0.00392262],"genre_scores_gemma":[0.18823387,0.000014954005,0.8099236,0.0013371495,0.0003028779,0.000008589497,0.000006828718,0.000014820861,0.00015730389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778724,0.00003955628,0.00048527727,0.00070483034,0.0006511209,0.0003319816],"domain_scores_gemma":[0.99813217,0.0003290211,0.00028349925,0.000818811,0.00033700693,0.000099479505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000732648,0.00025075182,0.00031026147,0.00022319447,0.0002681819,0.00016762437,0.0015872124,0.0002147734,0.000013870191],"category_scores_gemma":[0.0001533531,0.00019500995,0.00019974374,0.0006018353,0.0013588762,0.00016276467,0.00053523795,0.0002929796,0.0000012667944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061658366,0.00001721531,0.0011561429,0.000031671574,0.000015661824,0.0000032979194,0.00038932613,0.09622564,0.000022298675,0.37020108,0.000019384026,0.5319121],"study_design_scores_gemma":[0.00046775007,0.00010309324,0.0044547864,0.00025332885,0.000023015218,0.000100287674,5.394511e-7,0.67378473,0.00056115474,0.31433684,0.005360858,0.00055363605],"about_ca_topic_score_codex":0.000022757702,"about_ca_topic_score_gemma":0.00021190094,"teacher_disagreement_score":0.57755905,"about_ca_system_score_codex":0.00025300906,"about_ca_system_score_gemma":0.00056279986,"threshold_uncertainty_score":0.7952275},"labels":[],"label_agreement":null},{"id":"W1645899604","doi":"10.48550/arxiv.1210.3344","title":"Galois correspondence for counting quantifiers","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Closure (psychology); Mathematics; Closure operator; Galois connection; Operator (biology); Type (biology); Set (abstract data type); Partial function; Discrete mathematics; Constraint satisfaction problem; Counting problem; Closed set; Algebra over a field; Pure mathematics; Computer science","score_opus":0.09763686629699236,"score_gpt":0.20501597106864292,"score_spread":0.10737910477165055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645899604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024316235,0.00004064992,0.97159433,0.00010006844,0.0018065071,0.0003524222,0.000019635618,0.00025295204,0.00151722],"genre_scores_gemma":[0.9863649,0.00007005238,0.011462146,0.00011055334,0.00007904612,0.0000018869636,0.000022068181,0.000012948199,0.0018763948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864316,0.00006786859,0.00017377926,0.0007029467,0.00008055981,0.0003317063],"domain_scores_gemma":[0.998501,0.00019075886,0.0002657266,0.00068246905,0.00022129722,0.0001387246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035709603,0.00021465309,0.00020911195,0.00021882536,0.00020688125,0.0001635743,0.0008786252,0.00022710398,0.00008666979],"category_scores_gemma":[0.00007893797,0.00026774374,0.00017089857,0.00035153652,0.00008021546,0.0005602677,0.0005862897,0.0002920762,0.00007936004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069457645,0.00007695134,0.013881151,0.00018353423,0.0001017814,0.000035227786,0.0007046918,0.3362232,0.00013345882,0.63900465,0.0019965703,0.0075893304],"study_design_scores_gemma":[0.00036787472,0.000015629323,0.0025099576,0.0000692973,0.00004974905,0.0000052893806,0.00008556397,0.9874837,0.00010950924,0.006254085,0.002623469,0.00042587885],"about_ca_topic_score_codex":0.000048726484,"about_ca_topic_score_gemma":0.00003796754,"teacher_disagreement_score":0.96204865,"about_ca_system_score_codex":0.00017327358,"about_ca_system_score_gemma":0.00021844995,"threshold_uncertainty_score":0.99997747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010111238180972348,"score_gpt":0.1942757624426246,"score_spread":0.18416452426165225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660649481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.678568e-7,0.000011542404,0.73449314,0.00023961333,0.00011882439,0.0005441964,0.0000066124558,0.0002096383,0.26437578],"genre_scores_gemma":[0.00703756,0.00018285352,0.7679296,0.0017108015,0.00059908826,0.0003338449,0.0009945756,0.000056375266,0.22115526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.000006657209,0.00030645647,0.0002141947,0.00025527886,0.00017233014],"domain_scores_gemma":[0.9992098,0.000022481425,0.00017376753,0.00026719048,0.0002671755,0.000059589067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011511675,0.00018850346,0.00015963995,0.00031814858,0.000110475245,0.00025751203,0.00025310565,0.00016684685,0.00003462744],"category_scores_gemma":[0.000005590615,0.00015817108,0.000074879965,0.000087444096,0.000021255788,0.0011613346,0.000044448097,0.0001385485,0.000029364948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000929293,0.00000833968,0.000009772459,0.000079370555,0.00003552719,1.9385898e-7,0.00020232712,0.39076826,2.5029297e-7,0.17375074,0.0019710413,0.43316486],"study_design_scores_gemma":[0.00038873212,0.000068663896,0.0000073502692,0.00005895206,0.000013531423,0.000008556707,0.0000035396222,0.9503507,9.090589e-7,0.005629273,0.04322621,0.0002435884],"about_ca_topic_score_codex":0.000043033884,"about_ca_topic_score_gemma":0.00043923638,"teacher_disagreement_score":0.5595824,"about_ca_system_score_codex":0.000070282666,"about_ca_system_score_gemma":0.00035515317,"threshold_uncertainty_score":0.64500296},"labels":[],"label_agreement":null},{"id":"W166300487","doi":"10.1007/978-3-319-07467-2_3","title":"Variable Ordering and Constraint Propagation for Constrained CP-Nets","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint (computer-aided design); Variable (mathematics); Computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.012071528043486303,"score_gpt":0.22551783802134315,"score_spread":0.21344630997785685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166300487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001875286,0.000059365648,0.99396515,0.0009016556,0.00095947104,0.00076471054,0.000008034712,0.0001632952,0.0031595405],"genre_scores_gemma":[0.08912737,0.000015689502,0.9094343,0.0009992694,0.00017016346,0.00002143306,0.000011655568,0.000022140905,0.00019794362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976427,0.000023805951,0.00044318242,0.0010734136,0.00039740544,0.00041950698],"domain_scores_gemma":[0.9982726,0.00048909785,0.0002662362,0.00052528345,0.0003021119,0.00014468926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008063754,0.0003616241,0.00038162564,0.00048585862,0.00028367215,0.0005474306,0.00067988323,0.00024647446,0.000028887054],"category_scores_gemma":[0.00018135157,0.000355831,0.000057083427,0.0002741903,0.0007698026,0.00036606946,0.00031335565,0.00032579488,0.000004838557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003506384,0.000005299511,0.0000211811,0.000048711765,0.0000071132627,0.000003396355,0.00017341967,0.02551523,0.0002443205,0.27047473,0.000008826319,0.70349425],"study_design_scores_gemma":[0.00046220314,0.00012369904,0.000047688096,0.00023825729,0.000007847971,0.000109385284,2.3765661e-7,0.89697516,0.00043487627,0.09933507,0.001824705,0.00044089626],"about_ca_topic_score_codex":0.000009155928,"about_ca_topic_score_gemma":0.00003610964,"teacher_disagreement_score":0.8714599,"about_ca_system_score_codex":0.00013699531,"about_ca_system_score_gemma":0.0005628013,"threshold_uncertainty_score":0.9998894},"labels":[],"label_agreement":null},{"id":"W166664326","doi":"10.1007/978-3-642-38577-3_26","title":"A New GA-Based Method for Temporal Constraint Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint (computer-aided design); Computer science; Mathematical optimization; Mathematics; Geometry","score_opus":0.022641275583590956,"score_gpt":0.26634208472498494,"score_spread":0.24370080914139397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166664326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.477145e-7,0.00008035069,0.9921285,0.0026182574,0.0013629419,0.0012511987,0.000008709549,0.00023855211,0.002310669],"genre_scores_gemma":[0.0033487114,0.0000048347347,0.99369526,0.0018696826,0.00025291974,0.000032742915,0.000013421224,0.000028926186,0.0007534958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967726,0.00003686749,0.00057862955,0.0013872813,0.00065045845,0.0005741471],"domain_scores_gemma":[0.9974646,0.0006196646,0.00036588998,0.0009149602,0.00035320994,0.0002816977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000801877,0.00049390027,0.00049445406,0.00074614875,0.0002186722,0.00073700503,0.0016477951,0.00032624564,0.00021274094],"category_scores_gemma":[0.00009576955,0.00045657172,0.00018972394,0.00044293771,0.0003587504,0.00052942504,0.00031310113,0.0004835682,0.000044408822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002701245,0.000009399059,0.000018267943,0.00003197975,0.0000072805547,0.0000048850984,0.00016491987,0.10277004,0.000058599348,0.031416215,0.00016086815,0.86535484],"study_design_scores_gemma":[0.00051829807,0.00014763632,0.000028164139,0.00021376686,0.000007453806,0.000037831192,1.0481848e-7,0.88696474,0.00044088517,0.10603688,0.0050858385,0.00051839335],"about_ca_topic_score_codex":0.00008152497,"about_ca_topic_score_gemma":0.00014650558,"teacher_disagreement_score":0.86483645,"about_ca_system_score_codex":0.00025260285,"about_ca_system_score_gemma":0.0019076646,"threshold_uncertainty_score":0.9997886},"labels":[],"label_agreement":null},{"id":"W1722831725","doi":"10.1017/cbo9780511808241.012","title":"Recursion on Trees","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Recursion (computer science); Computer science; Mathematics; Programming language","score_opus":0.022495837450293744,"score_gpt":0.1901754652666727,"score_spread":0.16767962781637896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722831725","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011519563,0.000028321449,0.03941129,0.000059108173,0.00035941837,0.00019501655,0.00003597809,0.00027849042,0.95962083],"genre_scores_gemma":[0.0006523482,0.0003282834,0.0013648097,0.00013110388,0.000058229183,2.2800681e-7,0.000018835,0.000016855449,0.9974293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989215,0.0000281324,0.00012695046,0.00048567404,0.00027172104,0.00016599991],"domain_scores_gemma":[0.9989773,0.00005145828,0.00015982418,0.00058148085,0.000102945,0.00012701371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003883914,0.00024992565,0.00021385442,0.00024121143,0.00022250813,0.00004847521,0.0005587583,0.00024855084,0.000007510208],"category_scores_gemma":[0.000005425022,0.00029402642,0.00015175558,0.00001096032,0.00011694064,0.0001445316,0.00022445267,0.0003114853,0.00004867453],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001996499,0.0000057371194,6.276616e-7,0.0000068490344,0.00002497523,0.00017070971,0.000042901826,0.000043932858,0.0000060578363,0.9108688,0.063419096,0.025390333],"study_design_scores_gemma":[0.00033224115,0.00006781198,0.000052858377,0.00008868653,0.000017409313,0.000033453776,0.000003289612,0.001365499,0.000116347706,0.0000068694553,0.9975963,0.00031920694],"about_ca_topic_score_codex":0.0000193112,"about_ca_topic_score_gemma":0.0000017607136,"teacher_disagreement_score":0.9341772,"about_ca_system_score_codex":0.00016968117,"about_ca_system_score_gemma":0.00009640685,"threshold_uncertainty_score":0.9999512},"labels":[],"label_agreement":null},{"id":"W1732358269","doi":"10.1007/978-3-540-74970-7_48","title":"On Universal Restart Strategies for Backtracking Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Constraint learning; Testbed; Look-ahead; Beam stack search; Focus (optics); Robustness (evolution); Satisfiability; Mathematical optimization; Constraint satisfaction problem; Search algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Beam search; Incremental heuristic search; Local consistency","score_opus":0.03735381381327279,"score_gpt":0.28734800913557956,"score_spread":0.24999419532230677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732358269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005773153,0.0000341262,0.9871069,0.0004942794,0.0011781229,0.00041291563,0.000005285035,0.00014330514,0.010567305],"genre_scores_gemma":[0.14784907,0.000027438848,0.84950465,0.0016357258,0.00038526495,0.000004629453,0.000012110637,0.00003835633,0.00054278213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973788,0.00002002809,0.0003179392,0.0010299787,0.0007319455,0.00052130455],"domain_scores_gemma":[0.99800205,0.0007791478,0.00013177781,0.00068341,0.0002963896,0.00010719937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008428462,0.0003267541,0.00026923203,0.0009842194,0.00028908384,0.00066709745,0.0013295669,0.00025002274,0.00004120925],"category_scores_gemma":[0.00004717333,0.0003226015,0.0001012446,0.0004329564,0.00045722464,0.00070581964,0.00029517134,0.0005679024,0.000023176282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104498995,0.000008564387,0.0000064812343,0.000015065017,0.000004261536,0.000023417673,0.0003768131,0.17092565,0.00002266941,0.36293107,0.00001670991,0.46565887],"study_design_scores_gemma":[0.00037008798,0.0002797564,0.00008920541,0.00025528963,0.000004291103,0.000028015997,0.0000017063185,0.7715255,0.00036414788,0.22537896,0.0011889555,0.0005140854],"about_ca_topic_score_codex":0.000013347851,"about_ca_topic_score_gemma":0.00016659182,"teacher_disagreement_score":0.6005999,"about_ca_system_score_codex":0.0003337608,"about_ca_system_score_gemma":0.0009039913,"threshold_uncertainty_score":0.99992263},"labels":[],"label_agreement":null},{"id":"W17380902","doi":"","title":"Symmetric component caching","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decomposition; Overhead (engineering); Homogeneous space; Pruning; Computer science; Constraint (computer-aided design); Mathematical optimization; Component (thermodynamics); Decomposition method (queueing theory); Space (punctuation); Mathematics; Algorithm; Discrete mathematics","score_opus":0.09724514953681351,"score_gpt":0.32213709990082545,"score_spread":0.22489195036401194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17380902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066642766,0.0000063517577,0.9398107,0.0042105922,0.002200481,0.00014789886,0.0000039232987,0.00021630348,0.046739466],"genre_scores_gemma":[0.9801382,0.000025359881,0.018761141,0.0007552139,0.00015106311,0.000006002117,0.000009367692,0.000008479404,0.00014521142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978946,0.000048126254,0.0006198316,0.0004735661,0.0006501209,0.00031377055],"domain_scores_gemma":[0.99872774,0.00018917889,0.00020061982,0.0003396821,0.0003854008,0.00015739673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073357666,0.00018791245,0.00015596484,0.0006567199,0.00015681615,0.00038007044,0.0007812475,0.00007664354,0.0005156772],"category_scores_gemma":[0.000255489,0.00018856228,0.00009739081,0.00050991966,0.00008387331,0.00045279542,0.00015460356,0.00028783036,0.0007516315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011402826,0.000064351785,0.00007880651,0.0000010832118,0.000010009391,0.000017221437,0.00013126973,0.0012424495,0.0018410928,0.612491,0.00002632641,0.384085],"study_design_scores_gemma":[0.00010363492,0.00018487932,0.009950401,0.00011683931,0.0000071425434,0.00008290058,0.00043425692,0.7706945,0.10118208,0.11428434,0.002261775,0.000697242],"about_ca_topic_score_codex":0.00007843808,"about_ca_topic_score_gemma":0.00008355697,"teacher_disagreement_score":0.9734739,"about_ca_system_score_codex":0.00017849955,"about_ca_system_score_gemma":0.00008337457,"threshold_uncertainty_score":0.9660953},"labels":[],"label_agreement":null},{"id":"W1762042173","doi":"10.1007/11734697_10","title":"Solving Dynamic Distributed Constraint Satisfaction Problems with a Modified Weak-Commitment Search Algorithm","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint satisfaction; Constraint satisfaction problem; Asynchronous communication; Constraint (computer-aided design); Dynamic programming; Algorithm; Dynamic problem; Mathematical optimization; Distributed computing; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.012484517980597545,"score_gpt":0.2308659576215335,"score_spread":0.21838143964093595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762042173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055270637,0.00009190516,0.99477583,0.0007056095,0.00072107237,0.0009410768,0.000045796118,0.0003286041,0.0023348592],"genre_scores_gemma":[0.30945095,0.000043371412,0.6896888,0.0002267111,0.00012580585,0.000031452586,0.00009562754,0.000046990284,0.000290291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569684,0.000058874168,0.0006334336,0.0015846489,0.0012650319,0.00076118053],"domain_scores_gemma":[0.9978143,0.00024838882,0.00033717524,0.0010042712,0.00039248873,0.00020335698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063351245,0.0006276605,0.0005279169,0.00085256033,0.00044917376,0.000856042,0.001123998,0.00032039176,0.000035224923],"category_scores_gemma":[0.000019311527,0.0005597824,0.000112242364,0.00077724876,0.0009067138,0.0007137214,0.0005034568,0.00094212935,0.000017347957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028947059,0.00001739494,0.0000851537,0.000020040976,0.000013465507,0.000027440008,0.00013237783,0.40664247,0.000037434336,0.0031155415,0.0000072746116,0.5898985],"study_design_scores_gemma":[0.0005559859,0.00017239571,0.0014885286,0.00037054537,0.000012700893,0.00019980417,7.357688e-7,0.9874122,0.00012709288,0.008814697,0.00016863119,0.0006766575],"about_ca_topic_score_codex":0.0002376488,"about_ca_topic_score_gemma":0.0008331379,"teacher_disagreement_score":0.58922184,"about_ca_system_score_codex":0.0010167392,"about_ca_system_score_gemma":0.0008425759,"threshold_uncertainty_score":0.99968535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Key (lock); Salient; Set (abstract data type); Algorithm; Variety (cybernetics); Selection (genetic algorithm); Machine learning; Feature (linguistics); Artificial intelligence","score_opus":0.01973576009910112,"score_gpt":0.25015404467913993,"score_spread":0.23041828458003882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765613701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024288737,0.00029045157,0.996766,0.0002194522,0.001336083,0.0003710704,0.0000024270787,0.00015248156,0.00061916857],"genre_scores_gemma":[0.023961445,0.00009352177,0.9750083,0.0005839949,0.00012977849,0.0000054346924,0.0000026045889,0.000022551865,0.00019237585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973673,0.000032712604,0.00037469142,0.0011563847,0.0006225839,0.0004462976],"domain_scores_gemma":[0.9987058,0.00017299467,0.00027909342,0.00046694023,0.00022484778,0.00015030759],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036824652,0.00039775562,0.0003513999,0.00079571875,0.00037106933,0.0011422511,0.0007862263,0.00027091402,0.000022064683],"category_scores_gemma":[0.000046585516,0.00039318186,0.00007531726,0.0005642424,0.00043568396,0.0013284566,0.00047038987,0.0006022066,0.000011454696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012342987,0.000004895134,0.000062098756,0.000018430794,0.000009309332,0.000008842703,0.0004439786,0.035119418,0.00012498787,0.004456035,0.000009875078,0.9597409],"study_design_scores_gemma":[0.0001856058,0.00004797155,0.000493135,0.00024075489,0.000009001816,0.00020812923,4.627587e-7,0.95668346,0.0006277029,0.040868092,0.0001608589,0.00047482332],"about_ca_topic_score_codex":0.00007055855,"about_ca_topic_score_gemma":0.00010225744,"teacher_disagreement_score":0.95926607,"about_ca_system_score_codex":0.00031691088,"about_ca_system_score_gemma":0.00027018003,"threshold_uncertainty_score":0.9998947},"labels":[],"label_agreement":null},{"id":"W1767159495","doi":"10.48550/arxiv.0903.0467","title":"The Parameterized Complexity of Global Constraints","year":2009,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Australian Government","keywords":"Parameterized complexity; Bounded function; Simple (philosophy); Constraint (computer-aided design); Computational complexity theory; Symmetry (geometry); Backdoor; Computer science; Homogeneous space; Mathematics; Mathematical optimization; Algorithm","score_opus":0.01719818502322423,"score_gpt":0.24820851777255226,"score_spread":0.23101033274932803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767159495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01996853,0.00014031724,0.9668339,0.0103862705,0.000117788055,0.00036415504,0.00001958612,0.00042425652,0.0017452264],"genre_scores_gemma":[0.7717003,0.00005158973,0.22706479,0.0011069429,0.000015974034,0.000020356092,0.0000030994472,0.000004246225,0.000032682306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984427,0.00014075587,0.0004312969,0.0002830406,0.00030274602,0.00039946978],"domain_scores_gemma":[0.99858975,0.00011088474,0.00024730785,0.0007580033,0.00013363695,0.0001604261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475958,0.00018111561,0.00022751326,0.00006474871,0.00028108287,0.00020123503,0.00078758405,0.00011168453,0.000019762758],"category_scores_gemma":[0.00016827435,0.00014874674,0.00013400016,0.000573561,0.00053288555,0.00030726846,0.000110724664,0.00016482317,0.000006585657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026917885,0.00006708657,0.0047704745,0.000002763491,0.000016143831,0.000006892049,0.000062803585,0.0005290298,0.0015235245,0.7425978,0.00037015413,0.2500264],"study_design_scores_gemma":[0.0009758735,0.00026622336,0.41957295,0.00003414945,0.00001727191,0.00024566485,0.000086524786,0.45985952,0.0047835573,0.11286449,0.00086144597,0.0004323398],"about_ca_topic_score_codex":0.000428486,"about_ca_topic_score_gemma":0.00052609626,"teacher_disagreement_score":0.7517318,"about_ca_system_score_codex":0.00019790044,"about_ca_system_score_gemma":0.00021521377,"threshold_uncertainty_score":0.6065716},"labels":[],"label_agreement":null},{"id":"W1775440673","doi":"10.1007/3-540-45578-7_49","title":"GAC on Conjunctions of Constraints","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pruning; Heuristic; Simple (philosophy); Artificial intelligence; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.017093319814538988,"score_gpt":0.24099345245901407,"score_spread":0.22390013264447509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775440673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000265014,0.0000393458,0.9439302,0.0006195005,0.0015365474,0.0002479124,0.0000075659464,0.0001083003,0.053484105],"genre_scores_gemma":[0.5938871,0.00015122893,0.40149286,0.0029064752,0.00037113976,0.000009577176,0.000012940375,0.000042664928,0.0011260195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758476,0.00002450717,0.00047677167,0.0008837342,0.00069027115,0.00033996464],"domain_scores_gemma":[0.99806774,0.00035698153,0.00030136426,0.00088146824,0.0002669228,0.00012554806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038274456,0.00032914974,0.00037900094,0.0009071398,0.00015301809,0.00015871307,0.001154265,0.00022760817,0.00027146746],"category_scores_gemma":[0.00008460129,0.00031651373,0.000116283445,0.0005631824,0.0012320529,0.00031180386,0.0002878289,0.0004978589,0.00005493523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003839757,0.000024790834,0.00007595112,0.0000108959275,0.000008748543,0.000024360155,0.00016533943,0.04478701,0.000044195633,0.12917611,0.000027322652,0.82565147],"study_design_scores_gemma":[0.0013177788,0.000787787,0.0014240305,0.0011819307,0.00002725425,0.00041957162,9.75652e-7,0.7625931,0.0027763972,0.2207332,0.007042254,0.0016957431],"about_ca_topic_score_codex":0.000008614209,"about_ca_topic_score_gemma":0.00003208806,"teacher_disagreement_score":0.8239557,"about_ca_system_score_codex":0.00017423663,"about_ca_system_score_gemma":0.00050941657,"threshold_uncertainty_score":0.9999287},"labels":[],"label_agreement":null},{"id":"W1783308240","doi":"10.1007/978-3-540-74573-0_26","title":"A Probabilistic Multi-agent Scheduler Implemented in JXTA","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Computer science; Scheduling (production processes); Distributed computing; Schedule; Interval (graph theory); Multi-agent system; Constraint satisfaction problem; Graph; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.0396655249298687,"score_gpt":0.29231285016758496,"score_spread":0.25264732523771627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783308240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009447547,0.00009803878,0.99547106,0.00048501152,0.001209848,0.0006746104,0.000004262361,0.00014257203,0.0018200991],"genre_scores_gemma":[0.122019075,0.0000330426,0.8759417,0.0015035416,0.00015972942,0.000017357135,0.00001195111,0.00003277338,0.00028081922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645644,0.000036286783,0.0006946699,0.0013605196,0.00078005466,0.0006720419],"domain_scores_gemma":[0.99815154,0.00025408642,0.00024893397,0.00094804546,0.00022521942,0.00017214639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011107373,0.0004408088,0.00040193484,0.0013906051,0.00014717694,0.0003534723,0.0015812272,0.00026531678,0.000107719585],"category_scores_gemma":[0.00013879425,0.00042815268,0.0000960744,0.00092032953,0.00042370407,0.00047549774,0.0007958342,0.00072117895,0.000050455827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006282248,0.000067806795,0.00065448903,0.000038833357,0.000008407655,0.000111825124,0.00071141816,0.09831145,0.000040461815,0.030734198,0.00000840148,0.86930645],"study_design_scores_gemma":[0.00067224505,0.00007902477,0.002320808,0.00027294585,0.0000045638044,0.00005388245,3.493356e-7,0.9778574,0.00013145663,0.017075691,0.00092892256,0.0006026852],"about_ca_topic_score_codex":0.000045310186,"about_ca_topic_score_gemma":0.0013948132,"teacher_disagreement_score":0.879546,"about_ca_system_score_codex":0.00062130834,"about_ca_system_score_gemma":0.0005972299,"threshold_uncertainty_score":0.999817},"labels":[],"label_agreement":null},{"id":"W1788316346","doi":"","title":"Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment","year":2004,"lang":"en","type":"article","venue":"AI Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Local consistency; Completeness (order theory); Constraint learning; Binary constraint; Process (computing); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.019225722596182975,"score_gpt":0.2832288327520398,"score_spread":0.2640031101558568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788316346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028288987,0.00021794759,0.9938354,0.0025738943,0.00009148264,0.0023172903,0.000005243455,0.00017005976,0.0005058021],"genre_scores_gemma":[0.78720146,0.000076361895,0.21173654,0.00010756485,0.0000026360779,0.00083261967,0.000016922397,0.000008594373,0.000017296048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875563,0.00011009571,0.00058982737,0.00021034456,0.00015075126,0.00018334453],"domain_scores_gemma":[0.99767035,0.00041734788,0.00023097273,0.0015759778,0.00005326059,0.000052103114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055288104,0.00013481425,0.00029374214,0.00020444988,0.00021667349,0.00012164722,0.0010243767,0.00006810201,0.000005180284],"category_scores_gemma":[0.00014739296,0.00013527022,0.00007969988,0.00023213755,0.00013095896,0.0003750301,0.00023201384,0.00014306887,0.000027030123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005096486,0.0016829954,0.0007844015,0.100159004,0.00053454103,0.00001523341,0.016073648,0.01499924,0.0031500056,0.8515123,0.00009923438,0.010938403],"study_design_scores_gemma":[0.004006236,0.0003010866,0.00084978674,0.036773216,0.00015756408,0.00007483975,0.0019574345,0.94468325,0.00046222113,0.00979632,0.00004723925,0.0008907972],"about_ca_topic_score_codex":0.000041331878,"about_ca_topic_score_gemma":0.00028844495,"teacher_disagreement_score":0.92968404,"about_ca_system_score_codex":0.00038473585,"about_ca_system_score_gemma":0.00011374902,"threshold_uncertainty_score":0.55161595},"labels":[],"label_agreement":null},{"id":"W1792786480","doi":"10.1007/s10489-015-0708-4","title":"Variable ordering and constraint propagation for constrained CP-nets","year":2015,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"University of Regina","keywords":"Computer science; Heuristics; Mathematical optimization; Constraint (computer-aided design); Net (polyhedron); Variable (mathematics); Local consistency; Set (abstract data type); Constraint graph; Graph; Constraint satisfaction; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03251917500604437,"score_gpt":0.2549067050639846,"score_spread":0.22238753005794024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1792786480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006998267,0.000025760242,0.9858217,0.00040619186,0.00021020038,0.00054926303,0.000003426019,0.00017489714,0.012108703],"genre_scores_gemma":[0.61619306,0.0000070950473,0.38341397,0.00024249902,0.000021583794,0.000065444554,0.0000060106254,0.000005902921,0.000044447726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990437,0.000014678588,0.00024588397,0.0003417669,0.00014665471,0.00020733118],"domain_scores_gemma":[0.99928105,0.00011608044,0.00009030658,0.00020523423,0.0001663139,0.00014100013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036705023,0.00012594026,0.0001280023,0.000075246135,0.00010234624,0.00015587138,0.00019789724,0.000063384556,0.00002444187],"category_scores_gemma":[0.00011584805,0.00012711555,0.000017341838,0.00023893123,0.00013786943,0.00024464846,0.00007242293,0.00007762084,0.000017211432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008715279,0.000012751776,0.000051490173,0.00001185428,0.000007357008,5.479729e-7,0.0004204965,0.0029603257,0.001364835,0.7997944,0.000126886,0.19524038],"study_design_scores_gemma":[0.0007014005,0.00016911035,0.00011859363,0.00004023553,0.0000152331395,0.00010017664,0.00095302716,0.8235125,0.035354473,0.13059358,0.007890839,0.0005508493],"about_ca_topic_score_codex":0.000012544972,"about_ca_topic_score_gemma":0.00000499921,"teacher_disagreement_score":0.8205522,"about_ca_system_score_codex":0.00004043721,"about_ca_system_score_gemma":0.00018423118,"threshold_uncertainty_score":0.51836216},"labels":[],"label_agreement":null},{"id":"W1793630144","doi":"10.1007/978-3-319-23219-5_29","title":"Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Upper and lower bounds; Computer science; Path (computing); Mathematical optimization; Relaxation (psychology); Graph; Longest path problem; Constraint (computer-aided design); Shortest path problem; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.026279975703092668,"score_gpt":0.263332280487377,"score_spread":0.23705230478428432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793630144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027790098,0.0000829575,0.9946569,0.000188328,0.00030379614,0.00025667905,0.00000404927,0.000066144836,0.0016620934],"genre_scores_gemma":[0.60961807,0.000022673343,0.38996264,0.00024041742,0.00006030242,0.0000027477315,0.0000039373376,0.00001818262,0.00007102011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754614,0.00003826751,0.00027329262,0.00093136635,0.0008734932,0.00033745466],"domain_scores_gemma":[0.9984951,0.0001629831,0.00016285392,0.00066620583,0.0003101043,0.00020275917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006835531,0.0002975882,0.0003329251,0.0007206,0.0001178158,0.00034551928,0.000828404,0.00015328456,0.00001896443],"category_scores_gemma":[0.000025927346,0.0002445738,0.000036516034,0.0004573315,0.00078243983,0.00057764695,0.00033030915,0.00044421142,0.0000032606727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041555857,0.000037474652,0.00045243368,0.000034685123,0.000013003451,0.000051760693,0.0023897497,0.30672017,0.00006619876,0.060656983,0.0000071437453,0.6295288],"study_design_scores_gemma":[0.0005906358,0.0011398095,0.0008555174,0.0004442588,0.000008241239,0.00016268817,0.0000015796351,0.97736114,0.00039138063,0.018320508,0.0001793891,0.0005448446],"about_ca_topic_score_codex":0.000020248921,"about_ca_topic_score_gemma":0.000049662962,"teacher_disagreement_score":0.670641,"about_ca_system_score_codex":0.00013030854,"about_ca_system_score_gemma":0.0005490246,"threshold_uncertainty_score":0.99734306},"labels":[],"label_agreement":null},{"id":"W1794401605","doi":"10.1007/978-3-540-30201-8_40","title":"Improved Algorithms for the Global Cardinality Constraint","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Consistency (knowledge bases); Local consistency; Domain (mathematical analysis); Algorithm; Constraint (computer-aided design); Computer science; Range (aeronautics); Constraint satisfaction; Variable (mathematics); Constant (computer programming); Constraint satisfaction problem; Combinatorics; Discrete mathematics; Mathematics; Data mining; Artificial intelligence","score_opus":0.020860163260258958,"score_gpt":0.2659771024728263,"score_spread":0.24511693921256733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794401605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023550228,0.00021502779,0.9921998,0.0024451497,0.0025893191,0.0008564252,0.000036758727,0.0001494758,0.0015057378],"genre_scores_gemma":[0.11517746,0.000049136066,0.88189083,0.0021485365,0.0005459713,0.00003730119,0.000009111269,0.000021261192,0.000120409946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973679,0.000020485364,0.0004340083,0.0011144857,0.0005591478,0.0005039811],"domain_scores_gemma":[0.9978511,0.00041016293,0.00024555557,0.0010195487,0.0003382625,0.00013541013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078611734,0.00039607813,0.00035988365,0.00016277353,0.00041855974,0.0006070637,0.0019521443,0.00024353608,0.000027028138],"category_scores_gemma":[0.00010842518,0.00030159383,0.00021487506,0.00040836146,0.0010536966,0.00034232615,0.0005211864,0.00042060015,0.0000070251367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036877532,0.000008243756,0.000029496196,0.000014246911,0.000016539056,0.0000070369815,0.00013131146,0.05379692,0.000007668118,0.105566405,0.000006252068,0.8404122],"study_design_scores_gemma":[0.0004359635,0.000094467905,0.00029122955,0.00008760662,0.000015264974,0.00008891683,2.9426195e-7,0.7850464,0.00011951086,0.21229358,0.0011112794,0.0004154888],"about_ca_topic_score_codex":0.00006644734,"about_ca_topic_score_gemma":0.00012333263,"teacher_disagreement_score":0.8399967,"about_ca_system_score_codex":0.00075892155,"about_ca_system_score_gemma":0.0012827863,"threshold_uncertainty_score":0.9999436},"labels":[],"label_agreement":null},{"id":"W181993896","doi":"10.1007/978-3-319-07046-9_27","title":"Parallel Depth-Bounded Discrepancy Search","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Heuristics; Iterative deepening depth-first search; Bounded function; Computer science; Pruning; Depth-first search; Workload; Search algorithm; Parallel computing; Best-first search; Search tree; Beam search; Beam stack search; Massively parallel; Algorithm; Mathematics","score_opus":0.020134524521984505,"score_gpt":0.25896325006860377,"score_spread":0.23882872554661927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181993896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002143292,0.00010582171,0.98269504,0.0014003032,0.0013666432,0.00033911204,0.0000020368564,0.00024330597,0.013826294],"genre_scores_gemma":[0.10778681,0.00006592448,0.88871896,0.0015465785,0.00040721768,0.000009043472,0.000009866968,0.000035929756,0.0014196539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963545,0.000052507425,0.0004864411,0.0014341426,0.0010452418,0.00062715355],"domain_scores_gemma":[0.9976809,0.00032654856,0.00019497194,0.0013357096,0.00024113148,0.00022071118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075662945,0.00044962982,0.00043825962,0.0007603503,0.00032673066,0.0007921764,0.0022786688,0.00029133703,0.00008556173],"category_scores_gemma":[0.00007074387,0.0004184984,0.00014094818,0.00052853016,0.00069233397,0.00048675956,0.0009127095,0.00073918974,0.00014015635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033107071,0.000009616096,0.0001477009,0.000017388054,0.0000070617125,0.000023756429,0.0002990884,0.043286696,0.000012856962,0.16349357,0.00001618136,0.79268277],"study_design_scores_gemma":[0.00035521184,0.00010583992,0.00079373165,0.00018636926,0.000005740571,0.00009118284,1.259248e-7,0.87134576,0.000160656,0.12357056,0.002701791,0.00068303564],"about_ca_topic_score_codex":0.000029655403,"about_ca_topic_score_gemma":0.00027638863,"teacher_disagreement_score":0.8280591,"about_ca_system_score_codex":0.00026842387,"about_ca_system_score_gemma":0.00060110004,"threshold_uncertainty_score":0.99982667},"labels":[],"label_agreement":null},{"id":"W1826151234","doi":"10.1007/978-3-540-45072-6_21","title":"Query Pre-processing of Topological Constraints: Comparing a Composition-Based with Neighborhood-Based Approach","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Esri (Canada)","funders":"","keywords":"Composition (language); Computer science; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Art","score_opus":0.016812896622536478,"score_gpt":0.23422943290474685,"score_spread":0.21741653628221036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826151234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012842246,0.00009042859,0.99274147,0.00036976044,0.00025933894,0.00043833052,0.000005569584,0.0001557421,0.0058109416],"genre_scores_gemma":[0.5409053,0.0000014561869,0.45810738,0.00091689435,0.00002974237,0.000006603906,0.000010405445,0.000013392036,0.000008807185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967712,0.00007479129,0.00061335694,0.0012016192,0.0008667539,0.00047226145],"domain_scores_gemma":[0.99783003,0.00034856697,0.00051246415,0.0007591795,0.00038656653,0.0001631963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051790045,0.00049363385,0.00065995957,0.0006218391,0.00033651627,0.0004504744,0.0012215191,0.00028776174,0.000058875612],"category_scores_gemma":[0.000034851797,0.00041965806,0.00011684833,0.00070693396,0.0021401348,0.00038799344,0.00015998736,0.0006519929,0.000002068894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024282082,0.000103817554,0.0017931318,0.000118321754,0.00001130177,0.000023048582,0.00015751662,0.83881676,0.00007386762,0.015176692,0.00000286558,0.1436984],"study_design_scores_gemma":[0.00072979584,0.0001884551,0.00052294304,0.0005346045,0.000014276945,0.000064728774,5.9083646e-7,0.99276036,0.0008768741,0.0037659297,0.000019904448,0.00052154146],"about_ca_topic_score_codex":0.000012739855,"about_ca_topic_score_gemma":0.000020797253,"teacher_disagreement_score":0.5407769,"about_ca_system_score_codex":0.00022777745,"about_ca_system_score_gemma":0.0010921697,"threshold_uncertainty_score":0.99982554},"labels":[],"label_agreement":null},{"id":"W1835898370","doi":"10.1007/978-3-540-73580-9_19","title":"An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Motion (physics); Class (philosophy); Connection (principal bundle); Topology (electrical circuits); Construct (python library); Representation (politics); Computer science; Set (abstract data type); Mathematics; Ontology; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Geometry","score_opus":0.022753674126035708,"score_gpt":0.2645628645308652,"score_spread":0.24180919040482948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835898370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024912917,0.00003220585,0.9949113,0.00096253166,0.0006138156,0.0002501782,0.000002356541,0.00006466505,0.0029138306],"genre_scores_gemma":[0.9488824,0.000012768899,0.049415532,0.0015588377,0.00008540636,0.0000029477599,0.0000039897127,0.000010599818,0.000027539709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833244,0.00007958111,0.00031163217,0.00064819795,0.000401784,0.00022636905],"domain_scores_gemma":[0.9976052,0.0011747021,0.00025416448,0.0007181128,0.00016875498,0.000079035904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074606,0.00022121258,0.00021708412,0.00056883984,0.0002122717,0.00012524781,0.00066310697,0.0002202484,0.00003988032],"category_scores_gemma":[0.00013933743,0.00016771653,0.000054683565,0.00029171954,0.0007435778,0.00026937126,0.00008991283,0.00041688205,0.00000313891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014083216,0.000021847982,0.00005252534,0.000008211115,0.0000033545468,0.000007401872,0.00025247483,0.06815648,0.000081452075,0.37365925,0.0000023879234,0.5577405],"study_design_scores_gemma":[0.00018358244,0.0002070103,0.0031018723,0.00011203157,0.0000060607517,0.000038843496,9.1485754e-7,0.90634155,0.0007195534,0.08898807,0.000075187134,0.00022532241],"about_ca_topic_score_codex":0.000024104258,"about_ca_topic_score_gemma":0.00021317665,"teacher_disagreement_score":0.94863325,"about_ca_system_score_codex":0.00010496426,"about_ca_system_score_gemma":0.00018276277,"threshold_uncertainty_score":0.68392813},"labels":[],"label_agreement":null},{"id":"W1836420046","doi":"10.1007/3-540-45578-7_13","title":"A Filtering Algorithm for the Stretch Constraint","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constraint (computer-aided design); Pruning; Computer science; Sequence (biology); Algorithm; Filter (signal processing); Time constraint; Mathematical optimization; Mathematics; Computer vision","score_opus":0.01939056500295277,"score_gpt":0.24784964645672108,"score_spread":0.2284590814537683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836420046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003354697,0.00017047819,0.99368256,0.0015897694,0.0018509858,0.0006219491,0.000013746816,0.0001423395,0.0019247915],"genre_scores_gemma":[0.013481247,0.000113598064,0.98410016,0.0014794683,0.00049009535,0.0000307253,0.0000066543034,0.000026624064,0.00027140108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764,0.000015747932,0.0003911097,0.00094633043,0.00053088967,0.00047590866],"domain_scores_gemma":[0.9977756,0.0008033626,0.00020907228,0.00087921886,0.00022670423,0.000106037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057436345,0.00035730255,0.0002959742,0.00036640142,0.00037356655,0.0006340851,0.0018235267,0.00019292244,0.00012708092],"category_scores_gemma":[0.000059314523,0.0002775393,0.00014055333,0.00037097192,0.0007168132,0.00036181888,0.00050698034,0.00045999698,0.000012910508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4934336e-7,0.00000508906,0.000005277232,0.0000059909025,0.000008559454,0.000012565357,0.00019969244,0.019660955,0.000009791079,0.011335228,0.00001588935,0.96874],"study_design_scores_gemma":[0.00022437812,0.00006250171,0.00003827596,0.00010664062,0.0000072627595,0.00012872143,4.2027824e-7,0.9604666,0.00014001557,0.033766758,0.0047239102,0.0003345084],"about_ca_topic_score_codex":0.000012968198,"about_ca_topic_score_gemma":0.00006152897,"teacher_disagreement_score":0.9684055,"about_ca_system_score_codex":0.00019397843,"about_ca_system_score_gemma":0.00042368512,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W184568366","doi":"","title":"Dynamic Path Consistency for Interval-based Temporal Reasoning.","year":2003,"lang":"en","type":"article","venue":"Applied Informatics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Local consistency; Consistency (knowledge bases); Computer science; Path (computing); Interval (graph theory); Constraint satisfaction problem; Scheduling (production processes); Consistency model; Constraint satisfaction; Constraint (computer-aided design); Duration (music); Data consistency; Mathematical optimization; Artificial intelligence; Mathematics; Distributed computing","score_opus":0.008811627037441636,"score_gpt":0.22663239341184477,"score_spread":0.21782076637440312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184568366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011003682,0.0000057765233,0.9720792,0.00009876416,0.00019113909,0.00035297783,0.0000051783522,0.00016368789,0.026002875],"genre_scores_gemma":[0.48789865,0.0000018761172,0.51139003,0.00060664525,0.0000024403032,0.00003712555,0.000018570274,0.0000046754208,0.000039954426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991684,0.000010963551,0.00039341053,0.00009677212,0.0001412252,0.00018925397],"domain_scores_gemma":[0.99927807,0.00007973656,0.00018744801,0.00030995745,0.000077787496,0.00006703159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025881545,0.00011677162,0.00013217264,0.000087463195,0.00013051534,0.00012530664,0.000208106,0.000059030648,0.00002652934],"category_scores_gemma":[0.00006572562,0.00011196019,0.000057325,0.00019359887,0.000041753145,0.00028118043,0.00002499939,0.000075687305,0.000038756934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010943954,0.00005015111,0.00043713127,0.00011357875,0.00002274534,6.178276e-7,0.0015880576,0.0071965936,0.000032442636,0.92248535,0.0016078638,0.066454545],"study_design_scores_gemma":[0.00084384094,0.000045951725,0.00013916803,0.000019810292,0.000007443993,0.000007917251,0.00034056584,0.9823977,0.0002576453,0.0024284674,0.01330593,0.00020557843],"about_ca_topic_score_codex":0.0000014066602,"about_ca_topic_score_gemma":0.0000031890768,"teacher_disagreement_score":0.9752011,"about_ca_system_score_codex":0.000051479536,"about_ca_system_score_gemma":0.0001657476,"threshold_uncertainty_score":0.4565604},"labels":[],"label_agreement":null},{"id":"W1863779216","doi":"10.1007/bfb0025021","title":"Design efficient local search algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Local search (optimization); Guided Local Search; Constraint satisfaction problem; Mathematical optimization; Computer science; Constraint (computer-aided design); Satisfiability; Boolean satisfiability problem; Constraint satisfaction; Search algorithm; Iterated local search; Combinatorial optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.023213274401388345,"score_gpt":0.25373221083654274,"score_spread":0.2305189364351544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863779216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038613307,0.0001766566,0.994561,0.0009647799,0.0012437976,0.0004339632,0.0000020605546,0.00022022105,0.00239365],"genre_scores_gemma":[0.06109742,0.000040488816,0.93704516,0.0010024764,0.0003513505,0.0000062513263,0.0000033530384,0.0000281527,0.000425377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962504,0.000058494843,0.00045762424,0.0013825758,0.0012051638,0.00064572325],"domain_scores_gemma":[0.9979669,0.00038834626,0.0001474218,0.0009961503,0.00028014978,0.00022106734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010640168,0.00043683904,0.0003683788,0.0009194152,0.00028068136,0.0005217016,0.0020160328,0.00029506264,0.000115212635],"category_scores_gemma":[0.000030652292,0.0004142541,0.00010212629,0.0006704688,0.0008339416,0.00034426802,0.0007865609,0.00077251956,0.00015855193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014404169,0.0000091722795,0.0000017556519,0.0000034218747,0.0000024381743,0.000019214564,0.00019589547,0.50355506,0.000009190662,0.0030799585,0.0000051412962,0.49311727],"study_design_scores_gemma":[0.00021904078,0.00008891215,0.00004490854,0.00010741885,0.0000036427248,0.00009525915,1.6471856e-7,0.9926246,0.00061284733,0.0052272175,0.0005187296,0.00045727234],"about_ca_topic_score_codex":0.000011795739,"about_ca_topic_score_gemma":0.000018977751,"teacher_disagreement_score":0.49266002,"about_ca_system_score_codex":0.00054192607,"about_ca_system_score_gemma":0.00087508844,"threshold_uncertainty_score":0.9998309},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; 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","score_opus":0.009889219578066074,"score_gpt":0.18338607846667063,"score_spread":0.17349685888860455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871585472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5321909,0.0000104999845,0.4667941,0.0002685092,0.00007131486,0.0000765633,0.000015786185,0.00012016147,0.00045216264],"genre_scores_gemma":[0.9450041,0.000016761565,0.054755546,0.00012246886,0.0000104754345,5.557252e-8,0.000015054945,0.0000037662405,0.00007175826],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988852,0.00006471616,0.00012835323,0.0003597793,0.00033549304,0.00022646665],"domain_scores_gemma":[0.99932104,0.000051564144,0.00006958964,0.0002767996,0.00013016547,0.00015081512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013062214,0.000042767446,0.00018725256,0.000057414694,0.0002230123,0.00019318098,0.00050125987,0.000083930216,0.000115281],"category_scores_gemma":[0.000011245716,0.00015018927,0.00008680304,0.00029644975,0.00016780607,0.0005810638,0.0001345632,0.00012634219,0.000039570943],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035614798,0.00006199402,0.0030760309,0.000006465898,0.000018692408,0.00010025734,0.00022037099,0.0007360907,0.0015665463,0.000058590704,0.00042801193,0.9937234],"study_design_scores_gemma":[0.000637917,0.000045683755,0.85266507,0.00007327259,0.000008586896,0.000022580765,0.0002353194,0.14549866,0.000005149478,0.00062784,0.000044255667,0.00013568075],"about_ca_topic_score_codex":0.026737425,"about_ca_topic_score_gemma":0.019636083,"teacher_disagreement_score":0.99358773,"about_ca_system_score_codex":0.00009970208,"about_ca_system_score_gemma":0.00007762593,"threshold_uncertainty_score":0.998253},"labels":[],"label_agreement":null},{"id":"W1871992796","doi":"10.1007/978-3-319-10428-7_15","title":"The Balance Constraint Family","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Consistency (knowledge bases); Constraint (computer-aided design); Focus (optics); Domain (mathematical analysis); Polynomial; Local consistency; Balance (ability); Time complexity; Semantics (computer science); Upper and lower bounds; Algorithm; Decomposition; Decomposition method (queueing theory); Mathematical optimization; Theoretical computer science; Constraint satisfaction problem; Mathematics; Discrete mathematics; Artificial intelligence; Programming language","score_opus":0.011495926558907134,"score_gpt":0.22416679429028982,"score_spread":0.2126708677313827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871992796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008159155,0.0002550594,0.9797724,0.002109433,0.0024514974,0.0002754685,0.00000244475,0.00016931632,0.014956233],"genre_scores_gemma":[0.29724118,0.0004587675,0.6906968,0.008253807,0.0009636501,0.000023203114,0.00000777321,0.00006176635,0.0022930566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971983,0.000042327363,0.00045480707,0.001006318,0.0007765769,0.00052167854],"domain_scores_gemma":[0.99735415,0.00075505767,0.000270419,0.0012434965,0.000236703,0.00014016978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009816724,0.00037245374,0.00031415297,0.00029997044,0.00053528516,0.0008633723,0.0024833386,0.00021019344,0.000018864073],"category_scores_gemma":[0.00011759054,0.0002792519,0.00010834228,0.00036695442,0.0013287693,0.00025609558,0.0006173167,0.0006446427,0.0000795314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013497637,0.000002704808,0.000029386709,0.0000049369046,0.000004358232,0.000009607549,0.00009620848,0.013992247,0.00003091358,0.14039195,0.00005186085,0.8453845],"study_design_scores_gemma":[0.00023084754,0.00007287123,0.0004274498,0.00015471099,0.000004175823,0.00008181322,2.1957736e-7,0.87930846,0.000122102,0.09862799,0.020440312,0.0005290376],"about_ca_topic_score_codex":0.0000075973253,"about_ca_topic_score_gemma":0.000059734182,"teacher_disagreement_score":0.8653162,"about_ca_system_score_codex":0.000196508,"about_ca_system_score_gemma":0.00054986466,"threshold_uncertainty_score":0.99996597},"labels":[],"label_agreement":null},{"id":"W1873295757","doi":"10.1007/978-1-4899-7993-3_269-2","title":"Point-Stamped Temporal Models","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Point (geometry); Mathematics; Geometry","score_opus":0.018931855896775686,"score_gpt":0.22241907432113087,"score_spread":0.2034872184243552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873295757","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014622577,0.0003493206,0.46727982,0.000085507294,0.0013518366,0.00035700682,0.000645336,0.00013167324,0.52979803],"genre_scores_gemma":[0.003992808,0.0029646142,0.02481052,0.00007560094,0.0007900035,0.000046619898,0.00061850296,0.0001057502,0.9665956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756217,0.00005499206,0.0008413442,0.00066155416,0.00061665155,0.0002632836],"domain_scores_gemma":[0.997321,0.0001376749,0.00070945773,0.0014210809,0.00023001633,0.0001807313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003709589,0.00039099526,0.0005595487,0.0003446143,0.00006967437,0.000067042674,0.00074439024,0.00024324242,0.00027269227],"category_scores_gemma":[0.000032809618,0.00033005406,0.00015842025,0.00006453497,0.000094142866,0.001145679,0.00032560102,0.00022375108,0.00023974392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006520253,0.000012484075,0.00002495233,0.00015760222,0.000055993452,0.000030314151,0.00010174545,0.00020731319,0.000012980102,0.9775931,0.01108603,0.01071092],"study_design_scores_gemma":[0.0012116646,0.00011837142,0.0000152272,0.0022326303,0.000078524434,0.0001268281,0.00003598772,0.03455112,0.000018150446,0.015597019,0.9445357,0.0014787844],"about_ca_topic_score_codex":0.000067704204,"about_ca_topic_score_gemma":0.00002856502,"teacher_disagreement_score":0.96199614,"about_ca_system_score_codex":0.00008428853,"about_ca_system_score_gemma":0.0003316289,"threshold_uncertainty_score":0.9999151},"labels":[],"label_agreement":null},{"id":"W1873730544","doi":"10.1007/11527862_20","title":"A Qualitative Spatio-temporal Abstraction of a Disaster Space","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Abstraction; Computer science; Representation (politics); Motion (physics); Set (abstract data type); Traverse; Space (punctuation); Artificial intelligence; Human–computer interaction; Qualitative reasoning; Programming language; Geography","score_opus":0.02429685343336524,"score_gpt":0.2966705149862963,"score_spread":0.2723736615529311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873730544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023719313,0.000072293195,0.99233216,0.0012187802,0.00085950614,0.0002951119,0.00000778982,0.00008884517,0.004888329],"genre_scores_gemma":[0.46649516,0.000023275446,0.5323481,0.0003148329,0.00022188398,0.0000051208885,0.000012436443,0.000019297133,0.000559879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736476,0.000053044165,0.00057745026,0.00089761405,0.00078729796,0.00031982522],"domain_scores_gemma":[0.9979439,0.0003811827,0.00053940987,0.00072630116,0.00029940004,0.00010981806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007152098,0.0003447296,0.0004001372,0.0007334474,0.00011234097,0.000202261,0.00092353765,0.00022680558,0.00012332974],"category_scores_gemma":[0.00007780824,0.00033244587,0.0001205021,0.00045019886,0.00055911,0.00088148244,0.0003161531,0.00046547438,0.000036217752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001610581,0.00004315024,0.00010815921,0.00004325684,0.00001714127,0.000014099844,0.01357503,0.07716665,0.000077378914,0.043398205,0.000028502762,0.8655123],"study_design_scores_gemma":[0.0007761893,0.0003214675,0.0008772208,0.00062925485,0.000019397596,0.00009229822,0.000012025993,0.89218354,0.0017140718,0.0986451,0.0035287691,0.0012006743],"about_ca_topic_score_codex":0.000044591958,"about_ca_topic_score_gemma":0.00043923964,"teacher_disagreement_score":0.86431164,"about_ca_system_score_codex":0.00025123605,"about_ca_system_score_gemma":0.0004338758,"threshold_uncertainty_score":0.99991274},"labels":[],"label_agreement":null},{"id":"W18803657","doi":"10.1111/j.1600-0625.2008.00791.x","title":"Algorithms for the Satisfiability Problem","year":2018,"lang":"en","type":"book","venue":"Experimental Dermatology","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Literal (mathematical logic); Boolean satisfiability problem; Negation; Satisfiability; Maximum satisfiability problem; Mathematics; Set (abstract data type); Discrete mathematics; Variable (mathematics); Combinatorics; Conjunctive normal form; Algorithm; Boolean function; Computer science; Programming language","score_opus":0.021680286438889692,"score_gpt":0.2853754746308191,"score_spread":0.2636951881919294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18803657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004738263,0.001048717,0.85775,0.0020689813,0.0016191513,0.0013553316,0.000024186133,0.00023956699,0.1358893],"genre_scores_gemma":[0.009221324,0.00013112149,0.5162231,0.0047928584,0.0011393204,0.0019083989,0.00031529568,0.00013914873,0.46612948],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998697,0.00006544305,0.00033438895,0.0004822,0.00016486741,0.00025614264],"domain_scores_gemma":[0.9987675,0.00030703752,0.00018255471,0.0005930625,0.000088997665,0.000060858187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117045834,0.0002370354,0.00027013896,0.000067645735,0.00028198122,0.000099932906,0.00065793056,0.00024802328,0.00027480006],"category_scores_gemma":[0.000015655987,0.00018421693,0.00014179239,0.00005807657,0.00032245525,0.00016549937,0.00023864067,0.00015456483,0.0001362262],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016400201,0.00007597962,0.000040928877,0.000056490062,0.00013511161,0.000012008374,0.0013688981,0.000021512375,0.00010202047,0.32428694,0.6342322,0.039651513],"study_design_scores_gemma":[0.0008176917,0.00014931851,0.00007209816,0.000030293955,0.00002533519,0.00070211303,0.00006750193,0.058576267,0.0052576475,0.02117873,0.9125772,0.00054581935],"about_ca_topic_score_codex":0.0000051031857,"about_ca_topic_score_gemma":0.000009184932,"teacher_disagreement_score":0.341527,"about_ca_system_score_codex":0.00016308091,"about_ca_system_score_gemma":0.0002634033,"threshold_uncertainty_score":0.75121486},"labels":[],"label_agreement":null},{"id":"W1885171832","doi":"10.1007/b138783","title":"Research and Development in Intelligent Systems XXI","year":2005,"lang":"en","type":"book","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Portsmouth; University of Aberdeen; Nottingham Trent University; University of Brighton; Trent University; Robert Gordon University","keywords":"Systems engineering; Computer science; Cognitive science; Engineering; Psychology","score_opus":0.07715320258396854,"score_gpt":0.3153376785153027,"score_spread":0.23818447593133416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885171832","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007041632,0.00040841228,0.41972333,0.00022082392,0.00024366449,0.00032467427,4.3235298e-7,0.00006789945,0.57900375],"genre_scores_gemma":[0.0010013223,0.0003480249,0.032340113,0.00005643787,0.00007041011,0.000027069294,0.000010282393,0.000009972428,0.9661364],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987694,0.000045579916,0.00028578675,0.00034147775,0.00036582423,0.00019191473],"domain_scores_gemma":[0.99944013,0.000096531534,0.0000424373,0.00022220446,0.00012457107,0.00007415118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000610213,0.00011202017,0.00014279934,0.0005055458,0.00006631914,0.00022462974,0.00025913978,0.00014381176,0.00010183988],"category_scores_gemma":[0.0000089120385,0.00010479383,0.000009646001,0.00012736252,0.000048772356,0.00012719688,0.00022734646,0.0003049069,0.00017821661],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021265068,0.000028240402,0.00010942655,0.00007142674,0.000014674589,0.000017405684,0.0008804053,0.00092081295,7.9959597e-7,0.4275968,0.0189344,0.5514235],"study_design_scores_gemma":[0.00011866138,0.00002501779,0.0002880679,0.00017602561,5.198157e-7,0.000022822776,0.00006284497,0.020439865,0.000021528514,0.00056061236,0.9780647,0.0002193411],"about_ca_topic_score_codex":0.000020152329,"about_ca_topic_score_gemma":0.0002625093,"teacher_disagreement_score":0.9591303,"about_ca_system_score_codex":0.0004156566,"about_ca_system_score_gemma":0.0007111301,"threshold_uncertainty_score":0.4273368},"labels":[],"label_agreement":null},{"id":"W188981234","doi":"","title":"A Naive Theory of Dimension for Qualitative Spatial Relations","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mereology; Dimension (graph theory); Ontology; Space (punctuation); Dimension theory (algebra); Connection (principal bundle); Computer science; Mathematics; Spatial intelligence; Spatial relation; Formal ontology; Algebra over a field; Calculus (dental); Theoretical computer science; Pure mathematics; Topology (electrical circuits); Artificial intelligence; Epistemology; Geometry; Combinatorics; Process ontology; Semantic Web","score_opus":0.05642780505362581,"score_gpt":0.29597235371172687,"score_spread":0.23954454865810104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188981234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029670326,0.000003891698,0.98415405,0.00010975388,0.000111281865,0.00015122803,0.0000023160176,0.00004836582,0.012452056],"genre_scores_gemma":[0.7425994,7.041415e-7,0.25689238,0.000038697257,0.0000039501338,0.0000079458305,0.0000018218874,0.0000017191812,0.000453331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995723,0.00007270887,0.00013161302,0.00010523559,0.00006177728,0.00005639469],"domain_scores_gemma":[0.9994362,0.0002308057,0.00006903227,0.00011968714,0.00012180036,0.000022473698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024800803,0.000039416307,0.000057112175,0.0000580633,0.00004828621,0.000005717118,0.00008093141,0.000024782617,0.000235925],"category_scores_gemma":[0.00008665527,0.000033566525,0.00003609817,0.000091448775,0.000037103055,0.0001895378,0.000025742722,0.000022300965,0.000012022184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001576121,0.000020295349,0.00016749752,0.0000019281163,0.000008276988,5.989241e-8,0.020354563,0.000030391238,0.00014101245,0.9595564,0.000106117004,0.019597698],"study_design_scores_gemma":[0.0016300011,0.00070502213,0.041462425,0.00003688835,0.00003353979,0.0000062436275,0.009224139,0.2205893,0.022346117,0.7032509,0.00031367198,0.0004017644],"about_ca_topic_score_codex":0.00004339687,"about_ca_topic_score_gemma":0.000025370015,"teacher_disagreement_score":0.7396324,"about_ca_system_score_codex":0.000008975272,"about_ca_system_score_gemma":0.00003245342,"threshold_uncertainty_score":0.25832134},"labels":[],"label_agreement":null},{"id":"W1891844195","doi":"10.1109/pacrim.1993.407253","title":"Solving logic problems with object-oriented constraint logic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint logic programming; Concurrent constraint logic programming; Logic programming; Constraint programming; Computer science; Constraint satisfaction; Programming language; Constraint satisfaction problem; Theoretical computer science; Consistency (knowledge bases); Constraint (computer-aided design); Computational logic; Local consistency; Functional logic programming; Object (grammar); Inductive programming; Programming paradigm; Description logic; Mathematics; Artificial intelligence; Mathematical optimization","score_opus":0.023980542398885946,"score_gpt":0.22163441612377754,"score_spread":0.1976538737248916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891844195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005089857,0.00003993365,0.9620127,0.0013831896,0.0001289967,0.00036472827,4.0386465e-7,0.0006357605,0.034925297],"genre_scores_gemma":[0.6182793,0.00001307632,0.3805108,0.00047220627,0.000017782102,0.0000261818,0.00000208166,0.0000064852507,0.00067214447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878937,0.000038962862,0.00021827321,0.0003881799,0.0002400491,0.00032514095],"domain_scores_gemma":[0.99934614,0.000044565917,0.000096488344,0.0002838188,0.00012244434,0.00010656509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013768012,0.00015491054,0.00013270957,0.00011005032,0.00018186611,0.00022128965,0.00022244081,0.000055189314,0.0006616258],"category_scores_gemma":[0.00002931736,0.00011472714,0.000040145864,0.0005190955,0.000116530806,0.00043849903,0.000068816575,0.00013317769,0.00008669574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036004267,0.0001930738,0.004566438,0.00003077454,0.000039589795,0.000049446673,0.0015977377,0.0056079547,0.00026614356,0.47895476,0.00042839316,0.5082621],"study_design_scores_gemma":[0.0015442909,0.00060332334,0.0017862099,0.00009938043,0.000018054032,0.0005604447,0.0006005294,0.9817074,0.00039397692,0.0020020113,0.00986981,0.0008145829],"about_ca_topic_score_codex":0.000016611628,"about_ca_topic_score_gemma":0.000059172842,"teacher_disagreement_score":0.97609943,"about_ca_system_score_codex":0.00004650667,"about_ca_system_score_gemma":0.00003038354,"threshold_uncertainty_score":0.72443384},"labels":[],"label_agreement":null},{"id":"W191106913","doi":"10.5591/978-1-57735-516-8/ijcai11-112","title":"The multi-inter-distance constraint","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Scheduling (production processes); Constraint (computer-aided design); Computer science; Constraint programming; Propagator; Mathematical optimization; Algorithm; Local consistency; Constraint satisfaction; Mathematics; Probabilistic logic; Artificial intelligence; Stochastic programming","score_opus":0.17250492896936367,"score_gpt":0.3139362700267007,"score_spread":0.14143134105733704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191106913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034465018,0.0000103077255,0.95450145,0.004435367,0.0023769098,0.00020670216,0.000009520907,0.00020028981,0.03791479],"genre_scores_gemma":[0.96376747,0.00008988456,0.034965154,0.0005335045,0.00007036611,0.00003796044,0.00000385353,0.000009870213,0.00052192825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801683,0.0000914161,0.0006285181,0.0005104499,0.0004303926,0.0003224152],"domain_scores_gemma":[0.9984405,0.00013562721,0.00024325209,0.0005410558,0.0005072403,0.0001323331],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041610695,0.00022060351,0.00014741861,0.00014552244,0.00031536643,0.0004918325,0.0013374389,0.0000726067,0.0008490894],"category_scores_gemma":[0.00028044728,0.00017340593,0.00012102059,0.00022011205,0.00039177705,0.00042209835,0.00017981749,0.0002944054,0.0008406757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019723035,0.000074268166,0.00007968457,8.2897617e-7,0.000017597711,0.000011272146,0.0004901296,0.000057143396,0.00026733766,0.70124406,0.000060814044,0.29767713],"study_design_scores_gemma":[0.00013195511,0.0002065984,0.001861941,0.00012607398,0.000008076434,0.00007256969,0.0014300287,0.7343075,0.05406854,0.20016217,0.006965105,0.0006593964],"about_ca_topic_score_codex":0.00005947501,"about_ca_topic_score_gemma":0.00027747787,"teacher_disagreement_score":0.96342283,"about_ca_system_score_codex":0.00010518101,"about_ca_system_score_gemma":0.00014396015,"threshold_uncertainty_score":0.9999373},"labels":[],"label_agreement":null},{"id":"W194540509","doi":"","title":"A Modeling for the Total Tardiness SMSDST Problem Using Constraint Programming.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec","funders":"","keywords":"Tardiness; Constraint programming; Computer science; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Concurrent constraint logic programming; Constraint logic programming; Programming language; Job shop scheduling; Stochastic programming; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","score_opus":0.1200230154725008,"score_gpt":0.34616627917207793,"score_spread":0.22614326369957713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194540509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094220145,0.00000376845,0.98185265,0.00456352,0.0022390103,0.0005651997,0.000013781072,0.00012996666,0.0012101028],"genre_scores_gemma":[0.88361925,0.0000055026303,0.115870185,0.00014414103,0.0002112572,0.00008546425,0.000007031337,0.000009508149,0.00004769015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984654,0.000026016643,0.00043275658,0.00043314236,0.00037670927,0.0002659507],"domain_scores_gemma":[0.9985967,0.00016868961,0.00012241543,0.0003219307,0.0007071781,0.00008307422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042427648,0.00018125716,0.00012797055,0.00013510739,0.00031226798,0.0007114011,0.00084355864,0.00008615825,0.00023183484],"category_scores_gemma":[0.00020362128,0.00014546809,0.00011021737,0.0002071206,0.00017639186,0.00038596475,0.00011140329,0.00032535786,0.000034438763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001842289,0.000040604646,0.000011099714,0.0000025169306,0.000017344488,0.0000012047756,0.00021501454,0.09124373,0.003913176,0.61849034,0.000003992481,0.28604257],"study_design_scores_gemma":[0.000040866686,0.000041106312,0.000012299628,0.000025858479,0.000006847022,0.00003654994,0.0002674717,0.9645073,0.003587562,0.031103197,0.00019337454,0.00017757578],"about_ca_topic_score_codex":0.00009795476,"about_ca_topic_score_gemma":0.00017036572,"teacher_disagreement_score":0.8741972,"about_ca_system_score_codex":0.000048520535,"about_ca_system_score_gemma":0.00022092846,"threshold_uncertainty_score":0.6860058},"labels":[],"label_agreement":null},{"id":"W1956292792","doi":"10.1007/978-3-540-72665-4_19","title":"Managing Conditional and Composite CSPs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Local consistency; Variable (mathematics); Constraint satisfaction problem; Mathematical optimization; Constraint (computer-aided design); A priori and a posteriori; Variable elimination; Constraint programming; Constraint satisfaction; Mathematics; Artificial intelligence; Stochastic programming; Probabilistic logic","score_opus":0.015318566796119681,"score_gpt":0.2457880747256831,"score_spread":0.23046950792956342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956292792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025293108,0.00017633461,0.9878194,0.0010796078,0.00075981906,0.00018347136,0.000004171536,0.00013091606,0.009821012],"genre_scores_gemma":[0.13607682,0.00011886949,0.859158,0.0038632476,0.0003227471,0.000003371569,0.000021551226,0.00002645578,0.0004089612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978093,0.000014983183,0.0003252891,0.0008971609,0.0005989965,0.00035428198],"domain_scores_gemma":[0.9988151,0.00027227652,0.00016172198,0.0004637499,0.00014204276,0.00014509443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000491217,0.00029585575,0.00025950634,0.0008352393,0.00025896527,0.00045042599,0.000786335,0.00017330697,0.000046082092],"category_scores_gemma":[0.000018615663,0.0003013151,0.00005328682,0.00032501173,0.0006232822,0.0005308077,0.0005533559,0.0004604782,0.000023358642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025535019,0.0000069194384,0.00019711282,0.000015929229,0.000006715215,0.000059880756,0.0002072777,0.024450451,0.000040226034,0.08983792,0.00001020144,0.8851648],"study_design_scores_gemma":[0.0002850068,0.000053450767,0.0017074512,0.00017495066,0.000005979145,0.00026567176,1.3868085e-7,0.7362208,0.00028282808,0.2591516,0.0013280251,0.00052409497],"about_ca_topic_score_codex":0.0000075743637,"about_ca_topic_score_gemma":0.00004266962,"teacher_disagreement_score":0.8846407,"about_ca_system_score_codex":0.00015240427,"about_ca_system_score_gemma":0.00016853207,"threshold_uncertainty_score":0.9999439},"labels":[],"label_agreement":null},{"id":"W1964840444","doi":"10.1080/0952813021000028621","title":"A case study in the meta-reasoning procedure ND","year":2003,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Case-based reasoning; Artificial intelligence","score_opus":0.06558557338037674,"score_gpt":0.34294391481825426,"score_spread":0.2773583414378775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964840444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5638318,0.00030558254,0.4330084,0.0005209704,0.00033124362,0.00037444333,3.496647e-7,0.000016148853,0.0016110437],"genre_scores_gemma":[0.98968494,0.0000028440095,0.009996548,0.0002599239,0.000035017347,0.000012673077,5.225332e-8,0.0000052211212,0.0000028067968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980776,0.0004808627,0.00062374247,0.00019031108,0.00043451527,0.00019297302],"domain_scores_gemma":[0.9991346,0.00025445316,0.00018067459,0.0002111787,0.000112456415,0.000106636086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015657302,0.00014117814,0.00023356914,0.00011954793,0.00013610229,0.00022304239,0.0004285593,0.00004286594,0.000484326],"category_scores_gemma":[0.0004250734,0.000086147615,0.00014888353,0.00045848283,0.0002115815,0.00035641546,0.000041309686,0.0003181945,0.000010629542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021877084,0.00073973887,0.00018287783,0.0000011015743,0.000056029578,0.0016975241,0.009738346,0.0005972329,0.0006670036,0.98324245,0.000007631397,0.0030481555],"study_design_scores_gemma":[0.00050851464,0.0039224857,0.00011378447,0.000064305066,0.0004172236,0.06736706,0.24572091,0.088100165,0.32158163,0.2712002,0.00012196473,0.0008817366],"about_ca_topic_score_codex":0.000009687342,"about_ca_topic_score_gemma":0.000012841963,"teacher_disagreement_score":0.7120423,"about_ca_system_score_codex":0.00004790997,"about_ca_system_score_gemma":0.00009780402,"threshold_uncertainty_score":0.530303},"labels":[],"label_agreement":null},{"id":"W1965405625","doi":"10.5539/cis.v5n6p33","title":"A Preference-Aware Interactive System for Online Shopping","year":2012,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Preference; Set (abstract data type); Product (mathematics); Constraint (computer-aided design); Preference elicitation; Order (exchange); Human–computer interaction","score_opus":0.03257750808246417,"score_gpt":0.2662129463307546,"score_spread":0.23363543824829042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965405625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007959662,0.000007977907,0.98954016,0.00017184883,0.00094152946,0.00021049296,0.0000072896964,0.00013380163,0.0010272535],"genre_scores_gemma":[0.86929613,0.000005759797,0.13020259,0.00040144476,0.000067730965,0.000011607209,0.000008725844,0.0000012120179,0.0000047790704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.000012144974,0.00022283515,0.00012315054,0.00019873735,0.00021734007],"domain_scores_gemma":[0.9992534,0.000060237056,0.0001134726,0.00016155187,0.00028297445,0.00012835485],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003683844,0.000079343336,0.00008192391,0.00025213626,0.00027207693,0.00042203988,0.00030040622,0.000024146162,0.000003031612],"category_scores_gemma":[0.000028116265,0.000068923364,0.000021534537,0.00042708567,0.00007920279,0.016541075,0.00018281305,0.000052915,0.000012328343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068494405,0.000024339402,0.0015617297,0.000075179225,0.000005993464,6.493424e-8,0.005274146,0.0011403186,0.0000604096,0.13652302,0.0002481116,0.8550798],"study_design_scores_gemma":[0.00023820197,0.00003499608,0.021456506,0.000039787377,0.0000018880122,0.00003171151,0.00026540103,0.972579,0.00018987931,0.000020949201,0.005028262,0.000113401074],"about_ca_topic_score_codex":0.0000017371572,"about_ca_topic_score_gemma":3.7387676e-7,"teacher_disagreement_score":0.9714387,"about_ca_system_score_codex":0.00006972256,"about_ca_system_score_gemma":0.00007992788,"threshold_uncertainty_score":0.9972141},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014236189236115571,"score_gpt":0.232626912351096,"score_spread":0.21839072311498042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970251068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005865746,0.0000020172877,0.7709891,0.0006421804,0.00005761206,0.00023608029,0.0000039750435,0.00025885494,0.22194442],"genre_scores_gemma":[0.46032584,0.000012113584,0.5371585,0.00101996,0.00003222503,0.000063296524,0.00001755456,0.000017040064,0.0013534855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000009267192,0.0002085039,0.00020726814,0.00024774155,0.00015502206],"domain_scores_gemma":[0.99936974,0.00006122335,0.00006146347,0.00040382822,0.000013224606,0.00009052608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090322545,0.00011742305,0.000108256216,0.00005635973,0.00013405562,0.00011508129,0.00027036984,0.00004484815,0.00065770146],"category_scores_gemma":[0.000012355525,0.00010638846,0.000034688976,0.00022218,0.00004402862,0.00013765508,0.000029239696,0.00008689388,0.00075878616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018144024,0.000066382934,0.00001785432,0.000014320438,0.00001530456,0.0000013986427,0.0012126599,0.0032540765,0.00059910485,0.93287873,0.0010505817,0.06088778],"study_design_scores_gemma":[0.001247025,0.00010106838,0.0017932559,0.000104738,0.00003717002,0.000020943195,0.00029277508,0.63928527,0.005722895,0.33520246,0.01528555,0.0009068433],"about_ca_topic_score_codex":9.4857313e-7,"about_ca_topic_score_gemma":8.814382e-7,"teacher_disagreement_score":0.6360312,"about_ca_system_score_codex":0.00003070031,"about_ca_system_score_gemma":0.00002856469,"threshold_uncertainty_score":0.97529143},"labels":[],"label_agreement":null},{"id":"W1972237262","doi":"10.1007/s10601-012-9136-9","title":"Using dual presolving reductions to reformulate cumulative constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Solver; Computer science; Constraint programming; Dual (grammatical number); Benchmark (surveying); Integer programming; Scheduling (production processes); Variable (mathematics); Linear programming; Domain (mathematical analysis); Constraint (computer-aided design); State variable; Computational complexity theory; Mathematics; Algorithm; Stochastic programming","score_opus":0.044537481272602576,"score_gpt":0.2950699864660795,"score_spread":0.2505325051934769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972237262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07143907,0.000011124978,0.9050222,0.0019293185,0.00086214044,0.000788924,0.000014291101,0.00038295833,0.019549936],"genre_scores_gemma":[0.80848753,0.0000028634888,0.19065414,0.00047222967,0.00007301996,0.000026585383,0.000004590402,0.000013857688,0.0002652054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998101,0.00008880089,0.00045788052,0.00055821886,0.0003042822,0.0004898424],"domain_scores_gemma":[0.9985577,0.000091091715,0.00014804845,0.0005062099,0.0003360148,0.00036092062],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021759653,0.00024148935,0.00023154133,0.00029874622,0.00034832442,0.00035888513,0.00035157413,0.0001547502,0.001861299],"category_scores_gemma":[0.00019747137,0.00024540912,0.00009062245,0.0005958164,0.00044939911,0.0012462977,0.00021572018,0.00028122132,0.0005296689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008760704,0.00013979194,0.0014536968,0.000024727615,0.00017159998,0.000046278532,0.0047823964,0.023723552,0.049691033,0.17071426,0.0023553085,0.7468886],"study_design_scores_gemma":[0.0026397605,0.00021087064,0.06903057,0.00041772373,0.00007443603,0.0019501556,0.0023086981,0.89545244,0.008027924,0.01416733,0.003220373,0.0024997036],"about_ca_topic_score_codex":0.00007039496,"about_ca_topic_score_gemma":0.000008289808,"teacher_disagreement_score":0.8717289,"about_ca_system_score_codex":0.00016175114,"about_ca_system_score_gemma":0.00023916682,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028551314387704696,"score_gpt":0.23668618833064242,"score_spread":0.20813487394293773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978526866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033309052,0.000002917181,0.98961985,0.0009504818,0.00017658986,0.0001388716,0.0000013689634,0.00019585952,0.008580984],"genre_scores_gemma":[0.6516907,0.0000050352087,0.34644267,0.00074235006,0.000023487006,0.000013656338,9.371301e-7,0.0000032099326,0.001077898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956495,0.000012344403,0.000075736425,0.0001711048,0.000074214135,0.000101668826],"domain_scores_gemma":[0.9996311,0.000023311652,0.000022550537,0.00018918616,0.000074179814,0.000059660942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004521374,0.000052750565,0.0000473074,0.000044257944,0.00007564674,0.00006706072,0.00016296859,0.000027508047,0.00036643606],"category_scores_gemma":[0.000008858867,0.000047639092,0.000027256698,0.0000896666,0.000008567172,0.00043774786,0.000016100208,0.000023816117,0.000062173596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000131922,0.000021100683,0.000008501186,6.8155043e-7,0.0000025947104,4.6411844e-7,0.00018146838,0.0002662517,0.0004010137,0.8972196,0.00066770177,0.10122933],"study_design_scores_gemma":[0.00019584036,0.00010930167,0.000092781556,0.0000011400153,0.0000015140704,0.0000042218553,0.000032321183,0.9872848,0.0015309023,0.010262347,0.00040602457,0.000078854886],"about_ca_topic_score_codex":0.0000068673176,"about_ca_topic_score_gemma":0.000019725676,"teacher_disagreement_score":0.9870185,"about_ca_system_score_codex":0.000015083278,"about_ca_system_score_gemma":0.000006271202,"threshold_uncertainty_score":0.40122178},"labels":[],"label_agreement":null},{"id":"W1979684104","doi":"10.1007/s10852-008-9100-2","title":"Principles for the Design of Large Neighborhood Search","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Set (abstract data type); Constraint programming; Scheduling (production processes); Job shop scheduling; Constraint (computer-aided design); Mathematics; Stochastic programming; Schedule","score_opus":0.07347995078575735,"score_gpt":0.2978228350086319,"score_spread":0.22434288422287452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979684104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002671607,0.00016348797,0.9978026,0.0015323089,0.00004114764,0.000112540634,8.655001e-7,0.0000072799885,0.000072571216],"genre_scores_gemma":[0.28185266,0.0001389303,0.71787405,0.00005485877,0.000042264757,7.553152e-7,6.638528e-8,0.0000024189883,0.00003401237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923867,0.000035162895,0.00034732386,0.000067666035,0.00020282951,0.00010832174],"domain_scores_gemma":[0.99893606,0.0005881926,0.00015348852,0.00010161419,0.0001682896,0.000052366326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655906,0.000057562596,0.0001546806,0.000051851686,0.0000796433,0.000055312048,0.00018740803,0.000029410463,0.0000049604564],"category_scores_gemma":[0.00006837616,0.000033690085,0.00006284262,0.00007947073,0.000023230736,0.00014707055,0.000016955722,0.000097101765,4.3213177e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014256005,0.00010932606,0.000004240241,0.000026724898,0.000025111147,0.0000015696272,0.00082038215,0.5458834,0.00004996797,0.37993735,0.000015381265,0.07311229],"study_design_scores_gemma":[0.00027909188,0.00015346838,0.0000173841,0.000047525125,0.000012664463,0.00004608241,0.000052922293,0.9426462,0.00025279165,0.05640943,0.000045446584,0.00003700024],"about_ca_topic_score_codex":1.236303e-7,"about_ca_topic_score_gemma":1.4242251e-8,"teacher_disagreement_score":0.3967628,"about_ca_system_score_codex":0.0000066926386,"about_ca_system_score_gemma":0.000042265114,"threshold_uncertainty_score":0.13738418},"labels":[],"label_agreement":null},{"id":"W1979831715","doi":"10.1016/j.tcs.2005.02.004","title":"Computing unsatisfiable<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-SAT instances with few occurrences per variable","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Mathematics; Function (biology); Combinatorics; Variable (mathematics); Discrete mathematics; Exponential function; Exponential time hypothesis; Time complexity; Mathematical analysis","score_opus":0.011480185867683814,"score_gpt":0.2327873710725958,"score_spread":0.221307185204912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979831715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43808833,0.00004885755,0.55634063,0.00044722346,0.0005993101,0.00005094037,0.000005178838,0.0001959512,0.004223597],"genre_scores_gemma":[0.76861787,0.000023683446,0.23012966,0.0009462879,0.00023401271,0.000012886845,0.0000066221205,0.000018631343,0.000010321509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964684,0.00011387546,0.0005001186,0.00096378016,0.0011419324,0.00081187004],"domain_scores_gemma":[0.99795943,0.00045187597,0.00029627976,0.00080102246,0.00015706467,0.00033430543],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013587658,0.00030711072,0.00021676492,0.00017595569,0.0010600445,0.0012322861,0.0015545319,0.00016386356,0.00015401108],"category_scores_gemma":[0.00011485401,0.00030229668,0.000116456744,0.0010861426,0.0021594192,0.0015648638,0.00083859224,0.00040074333,0.00038659893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026852525,0.000055621407,0.00006148568,0.000029743425,0.00002151892,0.000018369048,0.00088235876,0.019756507,0.00010470113,0.95576686,0.00008720539,0.023188777],"study_design_scores_gemma":[0.0003803981,0.0003001358,0.00021352177,0.00018839372,0.000024671624,0.00019347921,0.00007438609,0.9921981,0.001525758,0.0039917766,0.0005422042,0.0003671492],"about_ca_topic_score_codex":0.000037965492,"about_ca_topic_score_gemma":0.000027462362,"teacher_disagreement_score":0.9724416,"about_ca_system_score_codex":0.000034570963,"about_ca_system_score_gemma":0.0006167982,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W1981334977","doi":"10.1007/s10472-010-9191-0","title":"Tradeoffs in the empirical evaluation of competing algorithm designs","year":2010,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Parameterized complexity; Set (abstract data type); Algorithm design; Integer programming","score_opus":0.4438438458895254,"score_gpt":0.4265607545525879,"score_spread":0.017283091336937506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981334977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1115069,0.000033022072,0.88558364,0.0020738777,0.00007070565,0.00015915988,0.0000013718985,0.000007408319,0.00056393957],"genre_scores_gemma":[0.8431685,0.00002416379,0.15667671,0.0001112228,0.000012756882,0.0000039061274,4.873261e-7,0.0000017781197,4.954032e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990137,0.00007835488,0.00038330883,0.00010647101,0.00033181766,0.00008631959],"domain_scores_gemma":[0.99898016,0.0004240109,0.00014730726,0.00017652406,0.0002509347,0.000021060108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025733092,0.000057340672,0.00010788265,0.00007336949,0.00004093775,0.000039840135,0.00022269359,0.000036067104,0.000021465698],"category_scores_gemma":[0.0003997238,0.000042898846,0.000030718646,0.00023674016,0.00009943855,0.00012483165,0.000027973232,0.000099290395,0.0000016668067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010118174,0.00018002033,0.00007261263,0.000013712827,0.0000044121716,4.8300103e-7,0.009374819,0.00067525887,0.0014922208,0.21373151,0.000011754858,0.7744422],"study_design_scores_gemma":[0.000014775777,0.000034481516,0.00031472306,0.000022767581,0.0000053736317,0.000007675992,0.002060658,0.8733056,0.023080321,0.10108292,0.000020814497,0.00004989564],"about_ca_topic_score_codex":0.0000114781815,"about_ca_topic_score_gemma":0.00002769324,"teacher_disagreement_score":0.87263036,"about_ca_system_score_codex":0.0000015745494,"about_ca_system_score_gemma":0.000040153558,"threshold_uncertainty_score":0.17493641},"labels":[],"label_agreement":null},{"id":"W1982958309","doi":"10.1016/j.jlap.2014.02.006","title":"Discrete dualities for some algebras with relations","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Binary relation; Representation (politics); Scope (computer science); Syllogism; Existentialism; Algebra over a field; Mathematics; Field (mathematics); Binary number; Pure mathematics; Computer science; Discrete mathematics; Epistemology; Arithmetic; Programming language; Philosophy","score_opus":0.03290005820379674,"score_gpt":0.34062278974519333,"score_spread":0.3077227315413966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982958309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008696669,0.00014898868,0.98888236,0.0018486162,0.0001281766,0.00012430335,2.4591085e-7,0.000020862237,0.00014978675],"genre_scores_gemma":[0.1295263,0.0000172005,0.8701483,0.00017490883,0.00006645311,0.000008480481,4.3719885e-7,0.0000037176512,0.00005421892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988854,0.0002755135,0.00039390646,0.00014472395,0.00013892289,0.00016153583],"domain_scores_gemma":[0.998597,0.0009018434,0.00024463006,0.00008744814,0.0000786566,0.000090409245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891238,0.00009097613,0.00021991183,0.00013212301,0.00009807443,0.000136736,0.00014627095,0.00004602541,0.000009961921],"category_scores_gemma":[0.000523919,0.00005799587,0.000060080096,0.00019163867,0.00008635604,0.0004932709,0.00004075124,0.00017053467,2.8131518e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128977035,0.00001787002,0.0015445651,0.000011064681,0.000010729798,0.0000026343976,0.00023654192,0.0001454868,0.000044900244,0.37126407,0.0000071295517,0.62670213],"study_design_scores_gemma":[0.0027761164,0.001958326,0.020616272,0.00024270966,0.000057846697,0.0006294305,0.0006272101,0.0683379,0.0006604126,0.8798345,0.023754401,0.0005048933],"about_ca_topic_score_codex":0.00000128907,"about_ca_topic_score_gemma":0.000002428993,"teacher_disagreement_score":0.6261972,"about_ca_system_score_codex":0.00001517812,"about_ca_system_score_gemma":0.000030901992,"threshold_uncertainty_score":0.2365003},"labels":[],"label_agreement":null},{"id":"W1983531822","doi":"10.1007/s11590-014-0828-5","title":"On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computational intelligence; Euclidean geometry; Mathematical optimization; Mathematics; Computer science; Artificial intelligence","score_opus":0.10348452853156816,"score_gpt":0.2886102378094453,"score_spread":0.18512570927787714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983531822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007454974,0.0000024826795,0.96809375,0.022331713,0.00021863286,0.00047026857,0.000014564646,0.00013904496,0.0012745437],"genre_scores_gemma":[0.38910443,0.0000031282882,0.6072199,0.0034012217,0.0000721105,0.000053313353,0.00004243936,0.000017833614,0.0000856284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984058,0.0002151725,0.0004261091,0.00037567274,0.0002875071,0.00028975014],"domain_scores_gemma":[0.99841774,0.0006240058,0.00031600508,0.00042291978,0.00015254751,0.000066808665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007851807,0.0001697378,0.00021013602,0.00013916717,0.0005220009,0.00013869774,0.00046067178,0.00006139755,0.00015949369],"category_scores_gemma":[0.00044287695,0.00014120202,0.000119849305,0.00040812758,0.00025470436,0.00046022967,0.00010012132,0.00012842756,0.000011781162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021012811,0.000037612048,0.00018077275,0.000011677452,0.000014960636,1.0433198e-7,0.00028350507,0.9287043,0.00025416576,0.06650166,0.003194901,0.00079532684],"study_design_scores_gemma":[0.00035634777,0.00008203961,0.0007122887,0.000028312663,0.00001066827,0.0000020543212,0.00002125568,0.9974992,0.0002697782,0.00038392135,0.00046880066,0.00016531715],"about_ca_topic_score_codex":0.0000062944105,"about_ca_topic_score_gemma":0.000003174045,"teacher_disagreement_score":0.38164946,"about_ca_system_score_codex":0.00007733026,"about_ca_system_score_gemma":0.000055733097,"threshold_uncertainty_score":0.5758051},"labels":[],"label_agreement":null},{"id":"W1984260661","doi":"10.1093/iwc/iwt060","title":"Natural Language-based Representation of User Preferences","year":2013,"lang":"en","type":"article","venue":"Interacting with Computers","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Preference; Representation (politics); Human–computer interaction; Natural language; Artificial intelligence; Exploratory research; Natural (archaeology); Basis (linear algebra); Machine learning","score_opus":0.010011962789484453,"score_gpt":0.25293761657291375,"score_spread":0.24292565378342929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984260661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3238623,0.0000064530677,0.6742497,0.00041201932,0.00081389607,0.00012995282,2.6486615e-7,0.00010530093,0.0004200599],"genre_scores_gemma":[0.8148853,3.1153266e-7,0.18489398,0.0001471575,0.000016869126,0.0000066494545,0.0000037115153,0.000003596467,0.00004238104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992989,0.00005243785,0.0001759626,0.00019804161,0.00016865661,0.000106046],"domain_scores_gemma":[0.998979,0.00043874563,0.00018110136,0.00021733536,0.00014976379,0.000034080265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004652078,0.00008288185,0.00010270961,0.000113803006,0.000039552335,0.00014819295,0.00024296103,0.00001875942,0.000057117424],"category_scores_gemma":[0.00007236939,0.00006558631,0.000032518165,0.00024307802,0.000029729617,0.0007552355,0.000045984718,0.00009734684,0.000016683714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005666707,0.00013570656,0.06851228,0.000068307236,0.00012983479,0.000016503322,0.008261164,0.06628539,0.0077934247,0.001863482,0.004245414,0.8426318],"study_design_scores_gemma":[0.00044387233,0.00008627163,0.05364707,0.00022644026,0.0000048051447,0.000018416684,0.00038674608,0.93673795,0.0082104355,0.000028023054,0.000055613487,0.00015435871],"about_ca_topic_score_codex":0.00024638348,"about_ca_topic_score_gemma":0.000024691686,"teacher_disagreement_score":0.8704526,"about_ca_system_score_codex":0.000020161873,"about_ca_system_score_gemma":0.0000338786,"threshold_uncertainty_score":0.26745322},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05189737654584579,"score_gpt":0.29738629103301784,"score_spread":0.24548891448717206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984853564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057806052,0.000010916709,0.9404442,0.0007069555,0.00019448578,0.000101237965,0.000002479107,0.00007244054,0.0006612394],"genre_scores_gemma":[0.98891675,0.00004196765,0.010824395,0.00012943945,0.000037657966,0.000003557601,0.0000037853088,0.000004809631,0.0000376481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989676,0.00004008409,0.00034966916,0.00022350992,0.00023139654,0.00018777305],"domain_scores_gemma":[0.9993275,0.00008068798,0.00007876271,0.0002564258,0.00018689546,0.000069761976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883961,0.00008786216,0.00012306363,0.000108549735,0.00008542923,0.00006629685,0.00036193372,0.000043445467,0.0001586185],"category_scores_gemma":[0.00009104061,0.000087247325,0.000041091094,0.00046764172,0.00015841324,0.000237102,0.00010034769,0.00009530167,0.00016877629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001739539,0.00005878888,0.0039642733,0.000014516184,0.000006502678,0.000009593444,0.00060188794,0.0026636107,0.0023305945,0.18149917,0.000020126987,0.8088135],"study_design_scores_gemma":[0.000036939207,0.00017497121,0.031472836,0.00006165062,0.0000073160127,0.00007438603,0.0004710605,0.87349504,0.070851214,0.022241404,0.000764386,0.00034880982],"about_ca_topic_score_codex":0.000052862913,"about_ca_topic_score_gemma":0.00008575604,"teacher_disagreement_score":0.9311107,"about_ca_system_score_codex":0.000025916164,"about_ca_system_score_gemma":0.000103799386,"threshold_uncertainty_score":0.35578427},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020425664974452595,"score_gpt":0.2517280324831861,"score_spread":0.2313023675087335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985398779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07441075,0.00003636268,0.9186096,0.0018006178,0.0011848621,0.00015649827,0.00001464267,0.00008135402,0.0037052708],"genre_scores_gemma":[0.9935686,0.00003400165,0.0058731954,0.00019911179,0.0002571547,0.000005416622,0.000023189168,0.0000038278345,0.000035520712],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99753845,0.000115497634,0.0010025161,0.00010858546,0.0010761106,0.00015882938],"domain_scores_gemma":[0.9972719,0.00019777431,0.0008344107,0.00015495832,0.0013779768,0.00016300153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047115627,0.00013488808,0.00023373228,0.0007332496,0.00017162062,0.000298888,0.0006278071,0.00012680673,0.00007035023],"category_scores_gemma":[0.00013724864,0.00010213641,0.00013267889,0.0004750939,0.00012074881,0.0028392056,0.00006597519,0.00030467642,0.000046846748],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031023598,0.00023205996,0.76082873,0.00003111113,0.00093846075,0.00016671911,0.005692558,0.04109318,0.00006635941,0.14426078,0.0021054903,0.044274334],"study_design_scores_gemma":[0.0040366873,0.0008405524,0.86060095,0.00024102202,0.000045279612,0.0046705906,0.0008329977,0.1131073,0.00014588096,0.00091328844,0.013945778,0.0006196448],"about_ca_topic_score_codex":0.0000886105,"about_ca_topic_score_gemma":0.00000881958,"teacher_disagreement_score":0.9191578,"about_ca_system_score_codex":0.00007172952,"about_ca_system_score_gemma":0.00019509997,"threshold_uncertainty_score":0.41650018},"labels":[],"label_agreement":null},{"id":"W1986513311","doi":"10.4018/jitwe.2007040102","title":"A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities","year":2007,"lang":"en","type":"article","venue":"International Journal of Information Technology and Web Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Probabilistic logic; Schedule; Java; Scheduling (production processes); Distributed computing; Constraint satisfaction problem; Constraint satisfaction; Mathematical optimization; Interval (graph theory); Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.00509655015707133,"score_gpt":0.20618321985815646,"score_spread":0.20108666970108513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986513311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084266685,0.000021569282,0.9138745,0.00094930484,0.0005864449,0.000080473365,0.0000030163967,0.00011881048,0.00009919137],"genre_scores_gemma":[0.89717937,0.000014129059,0.10268871,0.00008713674,0.000021979256,0.0000022087606,0.0000016543177,0.000002543026,0.0000022550396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999149,0.000008959871,0.0004629085,0.000071473136,0.00020926319,0.00009839207],"domain_scores_gemma":[0.99930173,0.00006177027,0.000256678,0.000072577495,0.00025527074,0.00005194789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043651552,0.00009664539,0.00011239409,0.001153831,0.000041309748,0.00010103451,0.0001609415,0.00009546326,0.0000043872305],"category_scores_gemma":[0.00011808232,0.0000894297,0.000032986114,0.000120276985,0.000054034183,0.0008992072,0.000046528163,0.00019901585,0.0000020255895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012705245,0.000058825455,0.038386196,0.00015186629,0.00020081748,0.00006083334,0.0013552601,0.04620695,0.0011334211,0.36950794,0.000047812147,0.542763],"study_design_scores_gemma":[0.0014498953,0.00018200689,0.026079096,0.0002655725,0.0000072016264,0.0008873353,0.0008829369,0.9674286,0.0011874593,0.00016229085,0.0013008686,0.00016668535],"about_ca_topic_score_codex":0.0000027224066,"about_ca_topic_score_gemma":0.000004346559,"teacher_disagreement_score":0.9212217,"about_ca_system_score_codex":0.00012376411,"about_ca_system_score_gemma":0.000051433446,"threshold_uncertainty_score":0.36468372},"labels":[],"label_agreement":null},{"id":"W1993219802","doi":"10.1007/s10489-012-0338-z","title":"Managing dynamic CSPs with preferences","year":2012,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.014786381637546928,"score_gpt":0.2379034059180823,"score_spread":0.22311702428053537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993219802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029594884,0.000054588887,0.9592338,0.00020669386,0.000149287,0.00012280258,3.1414245e-7,0.00017819645,0.03709484],"genre_scores_gemma":[0.9149368,0.000055764234,0.08468241,0.00018452808,0.000017098877,0.00002046947,0.000001728115,0.0000051040274,0.00009611581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922866,0.000012240338,0.00012877803,0.00020757412,0.00017105562,0.00025167485],"domain_scores_gemma":[0.9995073,0.000045709916,0.000058682814,0.0002746183,0.00002790449,0.00008579184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012719116,0.00010396447,0.00007880418,0.00007423327,0.000093395305,0.000083772095,0.0003489742,0.000030096602,0.000113808244],"category_scores_gemma":[0.000004535977,0.00008494488,0.000015176549,0.00031877356,0.00005532137,0.0004243281,0.00007475219,0.000094147246,0.00022136135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044416533,0.000023306824,0.0016568976,0.0000067253586,0.000009335761,5.657422e-7,0.00083465554,0.0019031353,0.00016578399,0.26738083,0.000028225899,0.7279861],"study_design_scores_gemma":[0.00059950544,0.00034659903,0.061654806,0.00018771064,0.00007217601,0.00026706225,0.0039560464,0.7205976,0.08164551,0.11406678,0.013572193,0.0030339996],"about_ca_topic_score_codex":0.000007114883,"about_ca_topic_score_gemma":0.00001124741,"teacher_disagreement_score":0.9119773,"about_ca_system_score_codex":0.000029106006,"about_ca_system_score_gemma":0.000023358105,"threshold_uncertainty_score":0.34639516},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012769188734151954,"score_gpt":0.24341795040036762,"score_spread":0.23064876166621567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993886628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010285641,0.00003195388,0.98519105,0.0009982694,0.0002201065,0.000096757576,6.9586315e-7,0.00008869259,0.0030868272],"genre_scores_gemma":[0.8869597,0.000004817036,0.11272438,0.00027627157,0.000029649702,7.972748e-7,4.0636198e-7,0.0000012395049,0.0000027588524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893093,0.000044088094,0.00022503005,0.00028188998,0.000325168,0.0001929212],"domain_scores_gemma":[0.99917704,0.00020669396,0.0000711274,0.00027588676,0.00017449561,0.0000947552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007210198,0.000080864746,0.00012263426,0.00015795867,0.00018851235,0.00019798412,0.00047986011,0.00002723378,0.0000148317695],"category_scores_gemma":[0.00010815173,0.000068664456,0.000018774192,0.00070275017,0.00086953305,0.00050461676,0.00016265905,0.000073801246,0.000005368766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.968395e-7,0.000014316919,0.00008787848,0.0000029005366,8.1234873e-7,0.0000010297853,0.00013235974,0.0025374067,0.0003391601,0.95622617,0.0000043203117,0.040652666],"study_design_scores_gemma":[0.00011183188,0.00012041338,0.0053543504,0.000021088277,0.0000022254303,0.000022850832,0.000007413964,0.941218,0.00019909715,0.052845687,0.00000943404,0.00008761976],"about_ca_topic_score_codex":0.0000031242407,"about_ca_topic_score_gemma":3.0405027e-7,"teacher_disagreement_score":0.9386806,"about_ca_system_score_codex":0.00001775109,"about_ca_system_score_gemma":0.00006418047,"threshold_uncertainty_score":0.32038307},"labels":[],"label_agreement":null},{"id":"W1995010312","doi":"10.1142/9781860947322_0033","title":"FASTER SOLUTION TO THE MAXIMUM QUARTET CONSISTENCY PROBLEM WITH CONSTRAINT PROGRAMMING","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint programming; Consistency (knowledge bases); Constraint (computer-aided design); Local consistency; Computer science; Constraint satisfaction; Constraint logic programming; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.012227612971096482,"score_gpt":0.22210611751564235,"score_spread":0.20987850454454587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995010312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060083537,0.000008385527,0.94709826,0.034976475,0.000075389304,0.0005277385,8.0930505e-7,0.00022958612,0.016482513],"genre_scores_gemma":[0.5588497,0.0000010064614,0.43931648,0.0013426694,0.000035654157,0.000039779785,0.0000014945382,0.0000042634847,0.00040898056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999037,0.000040840387,0.00019391473,0.00027012674,0.0002127865,0.0002453208],"domain_scores_gemma":[0.999405,0.000031015574,0.00005663315,0.00030387373,0.00011015078,0.00009328492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021142197,0.000112138085,0.00008469192,0.0000663718,0.00020529407,0.00025339273,0.00023898327,0.000031571555,0.00012001377],"category_scores_gemma":[0.000008768991,0.00006860145,0.000031297826,0.000300812,0.00007818162,0.0003743958,0.000057850113,0.000088479756,0.00016230792],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045751904,0.00002975139,0.00038852362,0.0000034693535,0.000010926536,0.0000015666848,0.0009986768,0.0021128398,0.00006570697,0.048806187,0.00094330084,0.9466345],"study_design_scores_gemma":[0.0025779146,0.001189651,0.008576138,0.00015728864,0.000052092433,0.0009850389,0.0032338228,0.45675415,0.0015141292,0.0015949503,0.5218745,0.0014903493],"about_ca_topic_score_codex":0.000025949912,"about_ca_topic_score_gemma":0.00086700235,"teacher_disagreement_score":0.9451441,"about_ca_system_score_codex":0.000045040575,"about_ca_system_score_gemma":0.00009712114,"threshold_uncertainty_score":0.2797486},"labels":[],"label_agreement":null},{"id":"W1995572890","doi":"10.1260/147807708787523321","title":"Reinterpreting Rasmi Domes with Geometric Constraints: A Case of Goal-Seeking in Parametric Systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Architectural Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Parametric statistics; Constraint (computer-aided design); Dome (geology); Geometry; Computer science; Generator (circuit theory); Class (philosophy); Parametric design; Class diagram; Parametric model; Projection (relational algebra); Mathematics; Algorithm; Artificial intelligence; Geology; Programming language","score_opus":0.011463309443816603,"score_gpt":0.2554156843681533,"score_spread":0.24395237492433672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995572890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5104544,0.00009639714,0.48869,0.00011026775,0.00040516353,0.00006044741,0.0000010770324,0.000014921475,0.00016729848],"genre_scores_gemma":[0.93509537,0.000013200238,0.06474315,0.000038771013,0.00009666189,5.0580275e-7,6.746389e-7,0.0000072030043,0.0000044829744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979889,0.00015090493,0.0009015699,0.00019498402,0.0005608294,0.00020283597],"domain_scores_gemma":[0.99733406,0.0008660817,0.0009868764,0.00012694024,0.00060667814,0.000079388265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006478313,0.00014671277,0.00031418688,0.0020438405,0.00007756305,0.00010310621,0.0005904714,0.000039583272,0.00000854148],"category_scores_gemma":[0.00050093944,0.0001189413,0.000110418,0.0012092817,0.00014997397,0.00035451548,0.00014159092,0.0003642261,9.537488e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011989794,0.00008040855,0.08351566,0.00003505613,0.00021718942,0.00846957,0.003789001,0.6277204,0.0004187094,0.0014761589,0.000011069841,0.27414688],"study_design_scores_gemma":[0.0021304,0.00032852942,0.030016162,0.0008727407,0.00001264674,0.21289875,0.0005940912,0.7523771,0.0003600359,0.000113599934,0.000018583096,0.00027738474],"about_ca_topic_score_codex":0.00012490888,"about_ca_topic_score_gemma":0.00001300522,"teacher_disagreement_score":0.42464092,"about_ca_system_score_codex":0.00014743798,"about_ca_system_score_gemma":0.00015289643,"threshold_uncertainty_score":0.48502854},"labels":[],"label_agreement":null},{"id":"W1996117093","doi":"10.1007/s10489-008-0120-4","title":"Logic-based interpretation of geometrically observable changes occurring in dynamic scenes","year":2008,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Observable; Axiom; Formalism (music); Interpretation (philosophy); Computer vision; Artificial intelligence; Sequence (biology); Theoretical computer science; Algorithm; Geometry; Mathematics; Physics","score_opus":0.031045179733889847,"score_gpt":0.2592747555759014,"score_spread":0.22822957584201156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996117093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028271148,0.00006901026,0.9699239,0.0001439501,0.00010485706,0.00016827487,0.0000010737338,0.000076869976,0.0012408796],"genre_scores_gemma":[0.9227792,0.00007715965,0.07677245,0.00032778524,0.000004178799,0.000020885516,0.0000030901124,0.000004519442,0.000010724753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904424,0.000022573064,0.00028176344,0.0002786965,0.0001984723,0.00017426291],"domain_scores_gemma":[0.9993384,0.00015931459,0.00012811109,0.0002522673,0.00008113122,0.00004081448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017048446,0.00010623997,0.00015672961,0.0003926483,0.000050906852,0.000021585543,0.00038935017,0.00005628545,0.000041804],"category_scores_gemma":[0.000074968964,0.000108219305,0.000029985827,0.0012367115,0.00007755151,0.0001551582,0.00006733603,0.00009945422,0.000023890623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044704007,0.00016427896,0.016246626,0.000066317465,0.000010878987,0.000012517266,0.0015116382,0.2944725,0.004797247,0.04694191,0.0000205183,0.6357109],"study_design_scores_gemma":[0.0001066522,0.000056186298,0.012467746,0.000038366463,0.00000192374,0.0000057407515,0.000065561995,0.9630517,0.022418035,0.001571929,0.000054616736,0.00016157661],"about_ca_topic_score_codex":0.000035464716,"about_ca_topic_score_gemma":0.00007173206,"teacher_disagreement_score":0.89450806,"about_ca_system_score_codex":0.00006319517,"about_ca_system_score_gemma":0.000065670094,"threshold_uncertainty_score":0.44130552},"labels":[],"label_agreement":null},{"id":"W1996357025","doi":"10.1007/s10601-014-9178-2","title":"The salesman and the tree: the importance of search in CP","year":2014,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Generalization; Mathematical optimization; Computer science; Heuristic; Graph; Mathematics; Theoretical computer science","score_opus":0.01036059648106432,"score_gpt":0.23661172094358165,"score_spread":0.22625112446251733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996357025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31354606,0.0005349555,0.55165184,0.06067232,0.00068902766,0.0012331592,0.0000054434117,0.000107330634,0.07155989],"genre_scores_gemma":[0.9987145,0.00006181931,0.0008189951,0.00031191757,0.00001486014,0.000007364123,3.342959e-7,0.0000022864317,0.00006790609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991834,0.00021120843,0.00018835574,0.00013522837,0.00014781755,0.000133992],"domain_scores_gemma":[0.99874943,0.0007593429,0.000067656765,0.00035539537,0.000042479125,0.000025670477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012908578,0.00006034206,0.00008482264,0.000026080452,0.00017556867,0.00008150726,0.00040628025,0.00002486288,0.00001589527],"category_scores_gemma":[0.00016806011,0.000028276922,0.000027692122,0.00018790629,0.001336327,0.00007988609,0.00009288812,0.00012948686,0.000004135789],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007112587,0.0000049743007,0.022032013,0.0000026992145,0.000006118708,6.5331744e-7,0.000822408,0.000068986315,0.00003158162,0.5403609,0.00007380246,0.43658876],"study_design_scores_gemma":[0.0034591542,0.00005101754,0.6655223,0.000053931908,0.000011488624,0.0001043797,0.0012265965,0.29488882,0.00042241666,0.030719373,0.0032988195,0.00024171038],"about_ca_topic_score_codex":0.000012158517,"about_ca_topic_score_gemma":0.00035935038,"teacher_disagreement_score":0.68516845,"about_ca_system_score_codex":0.000008912946,"about_ca_system_score_gemma":0.00005559049,"threshold_uncertainty_score":0.49237528},"labels":[],"label_agreement":null},{"id":"W1997128923","doi":"10.1142/s0218001403002654","title":"Extending Dual Arc Consistency","year":2003,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Local consistency; Constraint satisfaction problem; Constraint (computer-aided design); Consistency (knowledge bases); Mathematics; Dual (grammatical number); Binary number; Encoding (memory); Compatibility (geochemistry); Representation (politics); Constraint satisfaction; Transformation (genetics); Binary constraint; Algorithm; Computer science; Theoretical computer science; Artificial intelligence; Discrete mathematics; Arithmetic","score_opus":0.08097431746610843,"score_gpt":0.304642231906121,"score_spread":0.22366791444001255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997128923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04815909,0.0000672764,0.9476299,0.0011542973,0.0018318221,0.000046359044,0.0000061073524,0.000020041476,0.0010850946],"genre_scores_gemma":[0.9856202,0.0002165213,0.013503272,0.0005034006,0.00013183459,0.0000014185563,0.0000027766491,0.000004601854,0.000015997763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998776,0.00009249032,0.00053192815,0.000152759,0.00033355033,0.00011324417],"domain_scores_gemma":[0.99882895,0.00012668749,0.00031127362,0.00007273521,0.00056525896,0.00009510326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041848904,0.00009454843,0.0001138823,0.00026243425,0.00007309126,0.00025170128,0.00020140194,0.00004032775,0.00043183353],"category_scores_gemma":[0.00025453928,0.000090157664,0.00007435121,0.00011749815,0.00006883761,0.00058261113,0.000033273194,0.00014945873,0.00006321351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085153,0.000055210443,0.00083954463,0.000002416854,0.000032452328,0.000070161645,0.00031090362,0.00006454387,0.0009326794,0.016516086,0.000023791576,0.9811437],"study_design_scores_gemma":[0.0009779243,0.00080556044,0.007136261,0.00085077126,0.00009551102,0.012545588,0.0042684623,0.061681308,0.23595764,0.6658571,0.008279538,0.0015443491],"about_ca_topic_score_codex":0.000005641537,"about_ca_topic_score_gemma":0.000009328557,"teacher_disagreement_score":0.97959936,"about_ca_system_score_codex":0.000033907218,"about_ca_system_score_gemma":0.0000647282,"threshold_uncertainty_score":0.47282743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018661322335568324,"score_gpt":0.2543906495361,"score_spread":0.2357293272005317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997649256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065025456,0.00002557919,0.9127021,0.019267054,0.0012732117,0.00056892686,0.000009192897,0.00003617836,0.001092315],"genre_scores_gemma":[0.95752954,0.000007039313,0.041830532,0.00040100559,0.00013528868,0.0000076529495,5.613283e-7,0.000004915047,0.000083446284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991379,0.0000577072,0.00032542087,0.00009776814,0.0002606063,0.00012063808],"domain_scores_gemma":[0.99883145,0.00013527407,0.00041094716,0.00044576987,0.00014186921,0.000034672663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039662112,0.000080338476,0.00010717969,0.00008159974,0.000121585515,0.00010093907,0.00064184767,0.00003178303,0.00002825206],"category_scores_gemma":[0.00018917667,0.00005011807,0.00013667259,0.00013512539,0.000038121914,0.00020543704,0.00009313627,0.00012506302,0.0000032441137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017715173,0.00028597462,0.033347845,0.00006902106,0.00021379728,0.000012174524,0.0014410649,0.10536935,0.0095921345,0.43128294,0.0646893,0.35351926],"study_design_scores_gemma":[0.006776102,0.0012944392,0.24752308,0.00048839016,0.000119223754,0.0010216936,0.00029909448,0.072747536,0.013737904,0.606491,0.048845794,0.00065567554],"about_ca_topic_score_codex":0.000011529434,"about_ca_topic_score_gemma":0.000029060966,"teacher_disagreement_score":0.8925041,"about_ca_system_score_codex":0.000093079616,"about_ca_system_score_gemma":0.00008531069,"threshold_uncertainty_score":0.20437557},"labels":[],"label_agreement":null},{"id":"W1998941980","doi":"10.1109/icicisys.2009.5358396","title":"Towards tractable reasoning on temporal projection problems","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Projection (relational algebra); Computer science; Pairwise comparison; Simple (philosophy); Theoretical computer science; Representation (politics); Graph; Decision problem; Mathematics; Artificial intelligence; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.016148135016697856,"score_gpt":0.24805024030009623,"score_spread":0.23190210528339839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998941980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025279494,0.000004752743,0.86254877,0.002457052,0.0001856123,0.00017617589,2.0687752e-7,0.00042406868,0.13167544],"genre_scores_gemma":[0.8942378,0.000005338656,0.10359672,0.0006326301,0.000035538415,0.000005397321,0.0000026950709,0.000002740131,0.0014811439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933714,0.000022066906,0.00012425838,0.00021501236,0.00016460265,0.00013694467],"domain_scores_gemma":[0.9996847,0.0000077063805,0.00004703426,0.00017048018,0.000044039716,0.0000460562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014604656,0.00007602484,0.000065849854,0.00009508619,0.000099972836,0.00015185229,0.00012434405,0.00003980432,0.000077970646],"category_scores_gemma":[0.000019930929,0.00006492824,0.00002941222,0.00029436385,0.0000072283433,0.00054144167,0.000010915514,0.00008374496,0.000037505906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061431056,0.000091014685,0.0008029712,0.0000030688066,0.0000038892636,0.000002526962,0.00035764862,0.0035026993,0.0004355896,0.1432361,0.0014601176,0.85009825],"study_design_scores_gemma":[0.0008400139,0.0008151857,0.06699207,0.000068343805,0.000005174821,0.00007962662,0.000077515026,0.9056366,0.005650581,0.0063315495,0.01301886,0.00048446184],"about_ca_topic_score_codex":0.00006205052,"about_ca_topic_score_gemma":0.000020900383,"teacher_disagreement_score":0.90213394,"about_ca_system_score_codex":0.000045010216,"about_ca_system_score_gemma":0.00006056812,"threshold_uncertainty_score":0.26476967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011428856346251785,"score_gpt":0.21373178073579346,"score_spread":0.20230292438954167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999823208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007680342,0.00002989808,0.96264106,0.00082514953,0.000112088,0.00008127707,2.1221767e-7,0.00037679405,0.028253153],"genre_scores_gemma":[0.71949726,0.000020617044,0.27755776,0.00035347344,0.000020535284,0.0000050307935,9.295761e-7,0.0000059081917,0.0025384633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926716,0.000025735308,0.00012230243,0.00025271118,0.00016327054,0.00016880073],"domain_scores_gemma":[0.9995077,0.000030652864,0.000046838042,0.00029010224,0.000048646718,0.00007604554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007882024,0.00008869747,0.000077459066,0.00008787312,0.00012695312,0.00012941615,0.00017704975,0.000030891282,0.0007993817],"category_scores_gemma":[0.00001783738,0.000072087336,0.000021742298,0.00033780685,0.00002418883,0.00059663015,0.000054836713,0.000080274534,0.00011291361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002022363,0.00029712322,0.0075736335,0.000031216958,0.00007957774,0.00022874825,0.0043133865,0.007720389,0.0076372684,0.19056907,0.006274257,0.7752551],"study_design_scores_gemma":[0.000600145,0.00016464708,0.014476662,0.000056930498,0.000007730551,0.00017262982,0.00013655503,0.97835404,0.0035813702,0.00014338641,0.0019589227,0.00034699295],"about_ca_topic_score_codex":0.000015959242,"about_ca_topic_score_gemma":0.00004448549,"teacher_disagreement_score":0.9706336,"about_ca_system_score_codex":0.000028568747,"about_ca_system_score_gemma":0.000016658478,"threshold_uncertainty_score":0.8752669},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Variance (accounting); Mathematics; Statistics; Combinatorics; Economics","score_opus":0.009707701948663027,"score_gpt":0.2248565767065913,"score_spread":0.21514887475792827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000977215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023586737,0.000006138533,0.4926222,0.033503596,0.00006057104,0.00024550306,0.0000028667514,0.0002358529,0.44973654],"genre_scores_gemma":[0.9161146,0.0000050830968,0.070871435,0.011672304,0.000050715214,0.000041110496,7.833562e-7,0.000010887341,0.0012330598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917704,0.0000646366,0.00015940283,0.00020543986,0.00021385227,0.0001796484],"domain_scores_gemma":[0.9990738,0.00032790686,0.000050509814,0.0004651052,0.000017996766,0.000064688065],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013036585,0.000098824494,0.00012380502,0.000024836625,0.00012140187,0.00014312186,0.00036089667,0.000016624559,0.0016813261],"category_scores_gemma":[0.00005722577,0.00006358808,0.0000509578,0.000290233,0.00020145775,0.00012927878,0.00002644457,0.000109888555,0.0012337533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067798883,0.000090790585,0.000054581298,0.0000037749367,0.000018283921,0.000008470587,0.00056789315,0.0004843267,0.000030001906,0.7861922,0.0030798793,0.20946303],"study_design_scores_gemma":[0.00032766367,0.00029424543,0.012835594,0.00006327418,0.000015833895,0.000028193548,0.000114042254,0.42721635,0.0001486977,0.533468,0.025007538,0.00048055378],"about_ca_topic_score_codex":0.000011976211,"about_ca_topic_score_gemma":0.0000022343422,"teacher_disagreement_score":0.8925279,"about_ca_system_score_codex":0.000019779394,"about_ca_system_score_gemma":0.000018533354,"threshold_uncertainty_score":0.9995439},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03257880984352848,"score_gpt":0.2623488479533102,"score_spread":0.22977003810978172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001157763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001941645,0.000110990026,0.9970385,0.00056002365,0.000052383,0.00010201871,0.0000023104542,0.000018596993,0.00017355941],"genre_scores_gemma":[0.18490043,0.000039806997,0.8149064,0.00005720218,0.00005695827,0.000002098161,7.7504126e-7,0.0000055839832,0.00003073211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990492,0.00002246369,0.0003701047,0.00013799411,0.000244825,0.00017543793],"domain_scores_gemma":[0.99940336,0.000107849395,0.00011070988,0.000085035594,0.00014730565,0.00014574599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061168,0.00009442324,0.00021267596,0.00007278996,0.00009898767,0.00013153125,0.00015646992,0.000056692264,0.000004176144],"category_scores_gemma":[0.000023342282,0.00007384953,0.00008510029,0.000077714685,0.00009380087,0.00023273216,0.000028985869,0.00016640934,8.171748e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067090255,0.00011622981,0.0000014631787,0.000056639994,0.000026601987,0.000004081021,0.0005900221,0.83813477,0.00011140496,0.10155726,0.00003944267,0.059355382],"study_design_scores_gemma":[0.0006535512,0.00009710074,5.373603e-7,0.00004524051,0.000009629301,0.00031396988,0.00012867701,0.95605594,0.00040496181,0.04217558,0.000029771607,0.00008504048],"about_ca_topic_score_codex":0.0000018340927,"about_ca_topic_score_gemma":3.5060886e-8,"teacher_disagreement_score":0.1829588,"about_ca_system_score_codex":0.000037686663,"about_ca_system_score_gemma":0.00008260143,"threshold_uncertainty_score":0.30114964},"labels":[],"label_agreement":null},{"id":"W2001495051","doi":"10.5555/982792.982810","title":"Exponential bounds for DPLL below the satisfiability threshold","year":2004,"lang":"en","type":"article","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"DPLL algorithm; Backtracking; Satisfiability; Exponential function; Mathematics; Discrete mathematics; Combinatorics; Algorithm; Computer science; Mathematical analysis; Phase-locked loop","score_opus":0.021603653878168445,"score_gpt":0.297042496951902,"score_spread":0.27543884307373356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001495051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037114132,0.000028577891,0.9462072,0.013512291,0.00046105043,0.00030272885,0.000001403507,0.00014055769,0.002232037],"genre_scores_gemma":[0.9512291,0.0000057745083,0.047784917,0.0004672496,0.00007358858,0.000033940534,0.0000025537804,0.0000052875985,0.00039761243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.00001831946,0.00011244763,0.00021839717,0.0001501006,0.00016715884],"domain_scores_gemma":[0.9993902,0.000060958228,0.000047494694,0.0003984059,0.000057047328,0.000045888388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023540416,0.000079921585,0.00007235495,0.000027509006,0.00024547582,0.00015338392,0.0002923483,0.000038513852,0.000057165602],"category_scores_gemma":[0.00004447234,0.000060511484,0.0000625712,0.00016247905,0.00007076961,0.00020479088,0.00006677986,0.000071519535,0.000021133836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039209208,0.00014513572,0.0032022495,0.00003083751,0.000045612385,0.0000034647753,0.013612297,0.027099574,0.003061612,0.856956,0.0041640815,0.091639906],"study_design_scores_gemma":[0.01054126,0.00080657814,0.19089934,0.000101998165,0.00010062986,0.00014708616,0.0025993632,0.34805906,0.028969916,0.3084115,0.107263215,0.0021000374],"about_ca_topic_score_codex":0.00007389638,"about_ca_topic_score_gemma":0.00015802802,"teacher_disagreement_score":0.91411495,"about_ca_system_score_codex":0.000057909467,"about_ca_system_score_gemma":0.000095749005,"threshold_uncertainty_score":0.24675867},"labels":[],"label_agreement":null},{"id":"W2003757888","doi":"10.1016/j.artint.2013.02.002","title":"Constraint propagation as information maximization","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Constraint satisfaction dual problem; Maximization; Constraint (computer-aided design); Constraint satisfaction; Mathematics; Local consistency; Constraint logic programming; Tuple; Predicate (mathematical logic); Computation; Mathematical optimization; Semantics (computer science); Computer science; Theoretical computer science; Algorithm; Constraint programming; Artificial intelligence; Discrete mathematics","score_opus":0.020297814730055125,"score_gpt":0.2455150153078151,"score_spread":0.22521720057775999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003757888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00506476,0.000003885264,0.9832853,0.0026497068,0.00037978383,0.00042588342,8.6805676e-7,0.00025958713,0.007930222],"genre_scores_gemma":[0.96323365,0.000011469466,0.03590124,0.0007067184,0.0000322309,0.000049046048,0.000016879638,0.000003771274,0.000044964505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989498,0.000043406726,0.00040740002,0.0001808509,0.0002375963,0.0001809016],"domain_scores_gemma":[0.9991312,0.000046567035,0.00014084407,0.00025181004,0.00034522163,0.000084372325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015814455,0.00010669636,0.00007936286,0.00015699142,0.00015475384,0.0005228494,0.00026079628,0.00006365246,0.000897909],"category_scores_gemma":[0.00019029374,0.000105560306,0.000035362504,0.000455164,0.00007520119,0.0032632353,0.000055275403,0.00009154292,0.0045421477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012639209,0.000011963942,0.00006731763,0.000002722038,0.0000023647838,3.0934117e-7,0.00040447898,0.0033133095,0.00036827594,0.41084316,0.00008774294,0.5848971],"study_design_scores_gemma":[0.000028472383,0.00006484957,0.0009555072,0.000013233203,0.0000031622083,0.000024935356,0.0004648736,0.8388101,0.034633312,0.12397118,0.0008027941,0.00022759612],"about_ca_topic_score_codex":0.00013335419,"about_ca_topic_score_gemma":0.000011280038,"teacher_disagreement_score":0.9581689,"about_ca_system_score_codex":0.000049547503,"about_ca_system_score_gemma":0.00008855707,"threshold_uncertainty_score":0.9962329},"labels":[],"label_agreement":null},{"id":"W2005254071","doi":"10.1142/s0218213007003254","title":"SOLVING INCREMENTAL SATISFIABILITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Satisfiability; Computer science; Completeness (order theory); Boolean satisfiability problem; Propositional calculus; Conjunctive normal form; Approximation algorithm; True quantified Boolean formula; Propositional formula; Mathematical optimization; Upper and lower bounds; Mathematics; Theoretical computer science; Algorithm; Propositional variable","score_opus":0.05154072613426004,"score_gpt":0.3305258114139577,"score_spread":0.2789850852796977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005254071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044815455,0.00002142452,0.94950044,0.0013903128,0.002502776,0.00006754977,0.000002272811,0.000031458443,0.0016683021],"genre_scores_gemma":[0.9142984,0.00001894003,0.085036285,0.0002794789,0.00034670095,4.969557e-7,0.0000013270424,0.000004350735,0.000014001942],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980223,0.000044353586,0.00089641823,0.00015750583,0.0006994966,0.00017988666],"domain_scores_gemma":[0.9981779,0.00031715955,0.00042887297,0.00015278267,0.000813212,0.000110109075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016118151,0.000101077894,0.00013206097,0.00030015648,0.00006893597,0.00035973924,0.0008858152,0.00005145758,0.0003233505],"category_scores_gemma":[0.00058540015,0.00009626986,0.00012622525,0.00022410438,0.00007611702,0.0014197387,0.000119135046,0.00020460316,0.00005042114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047305253,0.00007439597,0.0017053494,0.0000011940057,0.000039284118,0.000058432954,0.00046298854,0.0013590774,0.005868081,0.084008634,0.00006400834,0.9063113],"study_design_scores_gemma":[0.0004893356,0.0007840145,0.06378627,0.0002617942,0.000043893237,0.0018234841,0.003366802,0.13056348,0.6065891,0.18453427,0.006597644,0.0011599159],"about_ca_topic_score_codex":0.00001827372,"about_ca_topic_score_gemma":0.000056565696,"teacher_disagreement_score":0.9051513,"about_ca_system_score_codex":0.00019586344,"about_ca_system_score_gemma":0.00012327044,"threshold_uncertainty_score":0.39257708},"labels":[],"label_agreement":null},{"id":"W2005308601","doi":"10.1145/1570256.1570304","title":"Learning and using hyper-heuristics for variable and value ordering in constraint satisfaction problems","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Heuristic; Hyper-heuristic; Constraint satisfaction; Local consistency; Artificial intelligence; Variable (mathematics); ENCODE; Theoretical computer science; Mathematical optimization; Machine learning; Mathematics","score_opus":0.015465743516569009,"score_gpt":0.24833955944899877,"score_spread":0.23287381593242976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005308601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065407835,0.000029283541,0.93326557,0.00019438291,0.000063296146,0.00020115505,4.532273e-7,0.000071226015,0.0007668183],"genre_scores_gemma":[0.64347297,0.00003137574,0.35639605,0.000063330786,0.000008007235,0.0000017107134,6.52906e-7,0.0000025063841,0.000023402034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940413,0.000024581504,0.00015896848,0.00021133658,0.000062258885,0.00013870755],"domain_scores_gemma":[0.999737,0.00007665503,0.000047618967,0.000056020206,0.000038777725,0.00004392661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019953468,0.000078268786,0.00009723132,0.000095702766,0.00012239214,0.00014313722,0.000031427637,0.00004507672,0.000008033489],"category_scores_gemma":[0.00007198979,0.00008097095,0.000008633677,0.00014861386,0.000025897749,0.0002934713,0.000023516122,0.0000847589,2.2436754e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070471865,0.000020674846,0.054434765,0.000047330515,0.0000074343498,0.0000015068356,0.0007235219,0.13345313,0.009767993,0.20093787,0.0000069602015,0.6005918],"study_design_scores_gemma":[0.00041898456,0.00007233867,0.018356455,0.000029535693,0.000003771838,0.000052127212,0.00008690601,0.9760627,0.000080029975,0.0045057875,0.0002161639,0.00011516164],"about_ca_topic_score_codex":0.00007573082,"about_ca_topic_score_gemma":0.000027398788,"teacher_disagreement_score":0.8426096,"about_ca_system_score_codex":0.00003080364,"about_ca_system_score_gemma":0.000038692862,"threshold_uncertainty_score":0.33018997},"labels":[],"label_agreement":null},{"id":"W2005628931","doi":"10.1109/micai.2006.43","title":"Skolem Functions and Herbrand Universes in a Tree Generalization of First Order Logic","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Generalization; Computer science; Fragment (logic); Set (abstract data type); Semantics (computer science); XML; Programming language; First-order logic; Theoretical computer science; Mathematics; Algorithm; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.008636386267034037,"score_gpt":0.19753544831579692,"score_spread":0.1888990620487629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005628931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01925148,0.000024227274,0.95857704,0.0006603173,0.000052809286,0.00006544412,7.5900624e-7,0.000041391355,0.021326518],"genre_scores_gemma":[0.97093844,0.000026015803,0.027608288,0.00004795003,0.000008449263,0.000001738744,0.000005164837,0.0000018805858,0.0013620533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996534,0.000015764539,0.00010744232,0.00011254613,0.000054758926,0.00005610574],"domain_scores_gemma":[0.99980694,0.00002011562,0.000031702428,0.000080592195,0.00004712408,0.000013530145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000037233567,0.00004280541,0.000054543394,0.00011277206,0.000042563137,0.000024300442,0.00004492217,0.000025429661,0.00008540452],"category_scores_gemma":[0.0000067753767,0.000039470662,0.000009997292,0.00038822458,0.000026288739,0.00022508179,0.000020726275,0.000018862072,0.0000018704438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014183125,0.00018344395,0.3230428,0.000033643344,0.000011611119,0.0000062829185,0.0004461769,0.18173274,0.001260976,0.4457449,0.0023808973,0.04514233],"study_design_scores_gemma":[0.0011332929,0.00004323619,0.17510782,0.0000144916585,0.0000053114954,0.000011160947,0.000121341414,0.81879234,0.0003691636,0.0022928163,0.001956108,0.00015292346],"about_ca_topic_score_codex":0.00038180445,"about_ca_topic_score_gemma":0.0048342366,"teacher_disagreement_score":0.951687,"about_ca_system_score_codex":0.0000133798985,"about_ca_system_score_gemma":0.000016761333,"threshold_uncertainty_score":0.26976174},"labels":[],"label_agreement":null},{"id":"W2005924051","doi":"10.1007/s10601-005-0552-y","title":"An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint","year":2005,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; Cardinality (data modeling); Constraint programming; Consistency (knowledge bases); Constraint (computer-aided design); Benchmark (surveying); Computer science; Mathematical optimization; Constraint logic programming; Constraint satisfaction; Algorithm; Mathematics; Stochastic programming; Artificial intelligence; Probabilistic logic; Data mining","score_opus":0.017217442439509133,"score_gpt":0.2827290062673527,"score_spread":0.2655115638278436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005924051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013437726,0.00015766626,0.9889217,0.002371466,0.0007856713,0.0006207196,0.00014852462,0.00027225,0.0053782435],"genre_scores_gemma":[0.79364675,0.000007907354,0.20529017,0.00080062187,0.00015596132,0.000048352722,0.0000119471015,0.0000066709376,0.00003164349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982297,0.00010250862,0.00039905217,0.0005261975,0.00031404785,0.000428538],"domain_scores_gemma":[0.99841285,0.00023467664,0.00013887836,0.0007097028,0.0002829944,0.0002209005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006771307,0.00022053899,0.00021700536,0.00004748986,0.00054572895,0.00037465204,0.00067650987,0.00010051233,0.00017458721],"category_scores_gemma":[0.00008850335,0.00017799337,0.00018034515,0.00029142332,0.000987372,0.00027798637,0.000074857635,0.00013411515,0.000040450468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027229949,0.00006250749,0.0004088037,0.0000032320227,0.00003636848,0.0000029318953,0.00015507557,0.0027876876,0.000016138902,0.11966555,0.00019317404,0.87666583],"study_design_scores_gemma":[0.0010464785,0.00007746796,0.00684962,0.0000139557715,0.000039665632,0.00028686688,0.00038743805,0.97870386,0.00012187595,0.0014250848,0.0107077155,0.00033995943],"about_ca_topic_score_codex":0.00001747357,"about_ca_topic_score_gemma":0.000037174967,"teacher_disagreement_score":0.9759162,"about_ca_system_score_codex":0.00020914522,"about_ca_system_score_gemma":0.0004471512,"threshold_uncertainty_score":0.7258359},"labels":[],"label_agreement":null},{"id":"W2009545310","doi":"10.1007/s10479-008-0439-6","title":"Introduction to the special volume on constraint programming, artificial intelligence, and operations research","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Computer science; Volume (thermodynamics); Constraint (computer-aided design); Constraint programming; Operations research; Artificial intelligence; Mathematical optimization; Programming language; Mathematics; Stochastic programming","score_opus":0.28803532810644444,"score_gpt":0.44133032527962474,"score_spread":0.1532949971731803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009545310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10798947,0.000071258786,0.51446325,0.36990672,0.00071811146,0.0025917212,0.000027452326,0.00009888044,0.0041331127],"genre_scores_gemma":[0.9742017,0.00026525167,0.020880824,0.00026546392,0.0022749177,0.00019658978,0.000017481358,0.000011251408,0.0018865428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996904,0.00068215415,0.00041231792,0.00049549574,0.0010576161,0.00044837568],"domain_scores_gemma":[0.9966667,0.00018937187,0.000013991561,0.0006129835,0.0023409463,0.00017600504],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034728085,0.00010884168,0.00013502578,0.00079526444,0.0020803798,0.0005242902,0.00052835495,0.00007240483,0.00042862093],"category_scores_gemma":[0.001451377,0.00008773209,0.00004290131,0.002108971,0.0008556587,0.0004762155,0.00024242874,0.0005755937,0.00032800916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030176252,0.00024672574,0.00006502847,0.000005469808,0.000019097166,0.0000063643256,0.0045778654,0.1094593,0.00041624423,0.5522716,0.03705291,0.29584923],"study_design_scores_gemma":[0.00023271149,0.0029246737,0.00661258,0.0000698908,0.0000054559673,0.00020062573,0.005030851,0.69472164,0.021606818,0.0034583027,0.26454234,0.00059415365],"about_ca_topic_score_codex":0.00025193163,"about_ca_topic_score_gemma":0.001279264,"teacher_disagreement_score":0.8662122,"about_ca_system_score_codex":0.000042009273,"about_ca_system_score_gemma":0.0004659559,"threshold_uncertainty_score":0.99921876},"labels":[],"label_agreement":null},{"id":"W2012388794","doi":"10.3166/ria.20.31-62","title":"Abstraction de réseaux de contraintes","year":2006,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Abstraction; Computer science; Constraint (computer-aided design); Simple (philosophy); Solver; Theoretical computer science; Variable (mathematics); Constraint satisfaction problem; Mathematics; Artificial intelligence; Programming language; Epistemology","score_opus":0.03174281118606292,"score_gpt":0.2714733735190063,"score_spread":0.23973056233294338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012388794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047708033,0.0015150517,0.950783,0.013707761,0.0017326766,0.00024071164,0.000011686184,0.00018519841,0.027053075],"genre_scores_gemma":[0.92506707,0.0004531556,0.044801153,0.00048575475,0.0006457918,0.000020510777,0.000013245086,0.000025667807,0.028487671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780077,0.0001604693,0.0006110025,0.0005018799,0.00019169519,0.0007341645],"domain_scores_gemma":[0.9985981,0.0003070245,0.0002169757,0.0004530621,0.00023774197,0.00018708021],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00074608333,0.00024269067,0.00021589617,0.00014855014,0.00030215483,0.0004443624,0.00038460494,0.000228601,0.001815951],"category_scores_gemma":[0.00018519333,0.00030169488,0.0001734522,0.0005486027,0.00026499937,0.0006622635,0.00006470689,0.00036799104,0.0011510176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009905113,0.0002083964,0.0012433156,0.000061918676,0.000014233982,0.00006096186,0.0010552447,0.39695582,0.00412497,0.3641147,0.0041909413,0.22795959],"study_design_scores_gemma":[0.000058607948,0.00006256512,0.0023252063,0.00014233452,0.000023145394,0.00042112058,0.00046234738,0.8984064,0.030083986,0.028431414,0.039277457,0.00030544703],"about_ca_topic_score_codex":0.0016887818,"about_ca_topic_score_gemma":0.00043553652,"teacher_disagreement_score":0.92029625,"about_ca_system_score_codex":0.0004094644,"about_ca_system_score_gemma":0.00036041316,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W2013181989","doi":"10.1016/s0304-3975(02)00317-1","title":"A probabilistic analysis of randomly generated binary constraint satisfaction problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Probabilistic logic; Binary number; Constraint (computer-aided design); Constraint satisfaction; Complexity of constraint satisfaction; Mathematics; Probabilistic analysis of algorithms; Computer science; Constraint satisfaction dual problem; Algorithm; Combinatorics; Theoretical computer science; Local consistency; Statistics; Arithmetic","score_opus":0.011029752993038324,"score_gpt":0.23533883175807763,"score_spread":0.2243090787650393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013181989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09640519,0.000012662108,0.9010689,0.00019015567,0.0002985479,0.00027480008,0.0000027617873,0.00012624693,0.001620722],"genre_scores_gemma":[0.897389,0.000005258531,0.102475494,0.00010094613,0.000009462151,0.000009581648,0.000001942658,0.0000040143595,0.000004304647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770236,0.00025558326,0.00046686444,0.0006531795,0.00057229283,0.00034970843],"domain_scores_gemma":[0.9983747,0.00023715751,0.00016195064,0.00063622615,0.00040070133,0.00018924022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016620738,0.00016777795,0.00034166404,0.0006618063,0.00024833146,0.00020596202,0.0005480415,0.000056254834,0.00020912196],"category_scores_gemma":[0.00024277072,0.00014227554,0.00012694072,0.0047802776,0.0022205743,0.000472811,0.0001336134,0.0001292388,0.000009990493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005972367,0.000043098902,0.0009061726,0.0000071055274,0.000049444094,0.000002226712,0.0002494746,0.06580717,0.0017912744,0.91709906,0.0000051753254,0.014033821],"study_design_scores_gemma":[0.00047519268,0.00011373299,0.013811229,0.0000140501925,0.00008204856,0.000022282895,0.0000072694475,0.9648373,0.0015785904,0.018858049,0.000014422062,0.00018581911],"about_ca_topic_score_codex":0.00000814954,"about_ca_topic_score_gemma":0.0000065399913,"teacher_disagreement_score":0.89903015,"about_ca_system_score_codex":0.00007583969,"about_ca_system_score_gemma":0.00026828435,"threshold_uncertainty_score":0.81817985},"labels":[],"label_agreement":null},{"id":"W2014670151","doi":"10.1016/j.ijar.2010.01.016","title":"Comparison of tightly and loosely coupled decision paradigms in multiagent expedition","year":2010,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Testbed; Work (physics); Computer security; Computer network","score_opus":0.013951466320880892,"score_gpt":0.31788246211007326,"score_spread":0.30393099578919236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014670151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55884504,0.00004733499,0.4400372,0.00017361405,0.000696033,0.00004297363,9.2017797e-7,0.000007888052,0.00014901729],"genre_scores_gemma":[0.831118,0.00005539825,0.16873774,0.000017274822,0.00006245994,0.0000011520704,0.0000018446823,0.0000036401677,0.0000025214858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878824,0.00002568992,0.0005405722,0.00012098515,0.00043558818,0.000088955174],"domain_scores_gemma":[0.9988578,0.0001585797,0.0005195121,0.00009105627,0.00030994485,0.00006313033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043200635,0.00008012511,0.00017983395,0.000304291,0.000027714636,0.00009723897,0.00032190292,0.000053959244,0.00002981402],"category_scores_gemma":[0.000193446,0.00007208912,0.00004712163,0.000117787546,0.000042062733,0.0005943737,0.000064716885,0.00022678525,0.0000011046673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030921592,0.00063383265,0.23515767,0.000026951431,0.00012537459,0.00010783636,0.0060444777,0.0135028185,0.0474315,0.10576767,0.00014729668,0.59074533],"study_design_scores_gemma":[0.0012678595,0.00006723431,0.07461881,0.0002005745,0.0000057917346,0.0002657493,0.00014785578,0.91570264,0.0057491167,0.0016517326,0.00021763083,0.00010498423],"about_ca_topic_score_codex":0.0000124919425,"about_ca_topic_score_gemma":0.000023741597,"teacher_disagreement_score":0.90219986,"about_ca_system_score_codex":0.000037532962,"about_ca_system_score_gemma":0.00005760691,"threshold_uncertainty_score":0.2939709},"labels":[],"label_agreement":null},{"id":"W2014945369","doi":"10.3138/carto.43.3.155","title":"Toward Self-Generalizing Objects and On-the-Fly Map Generalization","year":2008,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Generalization; Cartographic generalization; Computer science; Process (computing); Artificial intelligence; On the fly; Task (project management); Feature (linguistics); Mathematics; Engineering; Programming language","score_opus":0.02032859333801944,"score_gpt":0.2513505008070553,"score_spread":0.23102190746903584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014945369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08453264,0.00031243905,0.88837594,0.022579184,0.0026858845,0.0007885516,0.000020712598,0.00024270725,0.0004619177],"genre_scores_gemma":[0.9851806,0.0035380372,0.0038057123,0.0070192665,0.00024354894,0.000061043735,0.0000959623,0.00001177918,0.000044044835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983869,0.00010773882,0.00052058935,0.00018055635,0.00059219665,0.00021197363],"domain_scores_gemma":[0.9982775,0.00018459113,0.00039259827,0.00018861529,0.00084912626,0.000107561485],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007305298,0.00019061755,0.00012605781,0.0006472727,0.0013206656,0.000855367,0.00047477253,0.00009267241,0.000014956407],"category_scores_gemma":[0.00014329754,0.00012955054,0.00012556507,0.0005105904,0.00014915179,0.0016120123,0.0000973655,0.00018885975,0.0000041263665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008208716,0.0000685904,0.01332367,0.00004034612,0.00035143786,0.0000059477584,0.011605405,0.004126229,0.00011287201,0.93922263,0.008675767,0.022385018],"study_design_scores_gemma":[0.0039793593,0.00051581534,0.034711078,0.00016478513,0.00011435847,0.0027245504,0.0018754802,0.6804752,0.00070215145,0.028821345,0.24485461,0.0010612886],"about_ca_topic_score_codex":0.000017751066,"about_ca_topic_score_gemma":0.000011247659,"teacher_disagreement_score":0.9104013,"about_ca_system_score_codex":0.000031262356,"about_ca_system_score_gemma":0.00008043465,"threshold_uncertainty_score":0.9999795},"labels":[],"label_agreement":null},{"id":"W201624245","doi":"","title":"Arc Consistency for CP-Nets under Constraints","year":2012,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Consistency (knowledge bases); Outcome (game theory); Net (polyhedron); Local consistency; Computer science; Space (punctuation); Constraint (computer-aided design); Arc (geometry); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Mathematical economics","score_opus":0.10202610607452199,"score_gpt":0.38118972655745226,"score_spread":0.27916362048293025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201624245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004070991,0.00021190551,0.9610913,0.026576795,0.0010677701,0.0008465919,0.000016094698,0.00017143595,0.0059471293],"genre_scores_gemma":[0.973394,0.0001018725,0.022657776,0.0023168141,0.000398489,0.00011856156,0.000008047319,0.000013992751,0.0009904933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792105,0.00022070596,0.00020508688,0.0002644739,0.00062292017,0.00076577556],"domain_scores_gemma":[0.9978451,0.0009180735,0.000047518697,0.00055317057,0.00042899107,0.00020715101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030376136,0.00012246035,0.00012839814,0.000047487854,0.0008716668,0.00022582246,0.0006437558,0.00009255354,0.00019655531],"category_scores_gemma":[0.0001991878,0.00008994716,0.0001900816,0.00049730844,0.0007812156,0.0005469615,0.00025006765,0.00043286837,0.0001073364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016275682,0.00010455248,0.0019000933,0.000047461108,0.00014085823,8.7897746e-7,0.007029105,0.000324312,0.0016123434,0.75857383,0.16473122,0.065519035],"study_design_scores_gemma":[0.0072083063,0.00060490344,0.07180312,0.00019435152,0.00009163993,0.00032876755,0.01604874,0.38882613,0.0121707525,0.14408754,0.3563519,0.002283836],"about_ca_topic_score_codex":0.000017377026,"about_ca_topic_score_gemma":0.000005720709,"teacher_disagreement_score":0.969323,"about_ca_system_score_codex":0.00013384268,"about_ca_system_score_gemma":0.0003196392,"threshold_uncertainty_score":0.67042446},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014238369515591863,"score_gpt":0.25047419273828225,"score_spread":0.23623582322269038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018508868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06560889,0.0000021525727,0.93103236,0.002120095,0.0006201944,0.00019099226,1.4549607e-7,0.00015601536,0.00026915496],"genre_scores_gemma":[0.27488315,0.0000011046643,0.7248589,0.0001751844,0.000056890014,0.000010670844,5.0385853e-7,0.000003429355,0.000010207158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986442,0.000028932858,0.00026307898,0.00043361957,0.0003688321,0.00026133657],"domain_scores_gemma":[0.9989355,0.000041048002,0.00008080452,0.00068194175,0.00015231379,0.00010839573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379511,0.000102780934,0.00011098627,0.00022025673,0.00019143641,0.0009869114,0.0009394075,0.000031118292,0.000081563034],"category_scores_gemma":[0.000043141124,0.00009517264,0.000018667391,0.0011105554,0.00023326697,0.0026311914,0.0002517739,0.000105232975,0.00015073722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1529069e-7,0.00024142824,0.00089395663,0.000024269457,0.0000025325933,0.000003493207,0.005400152,0.04996397,0.000643765,0.14778481,0.00059857965,0.79444265],"study_design_scores_gemma":[0.00009146928,0.000035651137,0.004507522,0.000007586438,4.7761876e-7,0.000032077896,0.000016409198,0.9794263,0.00023408407,0.015446427,0.000084263665,0.00011770053],"about_ca_topic_score_codex":0.0000147341925,"about_ca_topic_score_gemma":0.000007830573,"teacher_disagreement_score":0.9294624,"about_ca_system_score_codex":0.00007993904,"about_ca_system_score_gemma":0.00010750723,"threshold_uncertainty_score":0.95168084},"labels":[],"label_agreement":null},{"id":"W2019631532","doi":"10.1007/s00012-012-0211-2","title":"Remarks on contact relations on Boolean algebras","year":2012,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Relation (database); Binary relation; Relation algebra; Stone's representation theorem for Boolean algebras; Algebra over a field; Free Boolean algebra; Representation (politics); Complete Boolean algebra; Interior algebra; Boolean algebras canonically defined; Algebraic number; Space (punctuation); Boolean algebra; Representation theorem; Pure mathematics; Two-element Boolean algebra; Discrete mathematics; Algebra representation; Jordan algebra; Computer science; Mathematical analysis","score_opus":0.010235003382887445,"score_gpt":0.21886437829490615,"score_spread":0.20862937491201872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019631532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05289796,0.0000514094,0.54700816,0.008216678,0.001831391,0.00044416366,0.00001638233,0.00088646956,0.38864735],"genre_scores_gemma":[0.9921074,0.000013049377,0.0046743625,0.0014838671,0.000081888335,0.000002287336,0.00001821838,0.00001138329,0.0016075409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99902767,0.00008791994,0.00014383497,0.00023960332,0.00023230008,0.00026867932],"domain_scores_gemma":[0.999072,0.00017526318,0.00008504316,0.00044630023,0.00004799029,0.00017338291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015219576,0.0001376145,0.00010727565,0.00021737494,0.00019625541,0.00007005101,0.00026937324,0.00008349557,0.0005655652],"category_scores_gemma":[0.000058567566,0.00013858304,0.00007257438,0.00034742279,0.00003086879,0.00090020633,0.000052477677,0.00017636668,0.0006790429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010130789,0.000060259466,0.0026173014,0.0000011829022,0.000020861724,0.0000045842385,0.00064569805,0.00021522849,0.000052058815,0.9729755,0.008829517,0.014567659],"study_design_scores_gemma":[0.0054592034,0.0013882646,0.5457178,0.00029183968,0.00014527506,0.00010886573,0.0015355303,0.04710328,0.0058851903,0.013009973,0.376687,0.0026678273],"about_ca_topic_score_codex":0.00003464562,"about_ca_topic_score_gemma":0.000017164173,"teacher_disagreement_score":0.9599655,"about_ca_system_score_codex":0.00013912472,"about_ca_system_score_gemma":0.000047072645,"threshold_uncertainty_score":0.87279487},"labels":[],"label_agreement":null},{"id":"W2020066471","doi":"10.1142/s0218213008004187","title":"PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Constraint learning; Constraint satisfaction problem; Scheduling (production processes); Constraint satisfaction; Schedule; Mathematical optimization; Portfolio; Look-ahead; Limit (mathematics); Theoretical computer science; Algorithm; Local consistency; Artificial intelligence; Mathematics","score_opus":0.11473468997736803,"score_gpt":0.33893927159231463,"score_spread":0.2242045816149466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020066471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03783125,0.000024149998,0.9587816,0.0020986372,0.0008319589,0.00011785395,0.000004448741,0.000024791962,0.0002853166],"genre_scores_gemma":[0.8593645,0.00006606372,0.13989806,0.00021239405,0.00038986935,0.0000033152455,0.0000025563807,0.0000071897975,0.000056056793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853694,0.000027435843,0.0005524883,0.00015339113,0.0005722516,0.00015748209],"domain_scores_gemma":[0.9975816,0.00023126518,0.00028429242,0.00012004476,0.0016981671,0.00008463612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035600955,0.00009994011,0.00014209781,0.00028383278,0.00010674034,0.00022405619,0.00071346026,0.000040544768,0.000091173344],"category_scores_gemma":[0.00019260478,0.00008220232,0.00010722714,0.00020780931,0.00008806563,0.0011574371,0.000043344626,0.00014233596,0.00001838672],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025967747,0.00014569955,0.001851596,0.000004623549,0.00013234014,0.00022889493,0.0011706359,0.050280046,0.0017142247,0.08989841,0.00026550316,0.8540484],"study_design_scores_gemma":[0.0009945764,0.0021582192,0.013520548,0.0004593708,0.00006293269,0.012089679,0.0018887995,0.6015646,0.31712285,0.038151078,0.0106750615,0.0013123074],"about_ca_topic_score_codex":0.000007203743,"about_ca_topic_score_gemma":0.00001263077,"teacher_disagreement_score":0.85273606,"about_ca_system_score_codex":0.00006376539,"about_ca_system_score_gemma":0.0002736404,"threshold_uncertainty_score":0.33521134},"labels":[],"label_agreement":null},{"id":"W2020249752","doi":"10.1093/ietisy/e91-d.2.231","title":"Survey Propagation as \"Probabilistic Token Passing\"","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Security token; Probabilistic logic; Constraint (computer-aided design); Simple (philosophy); Token passing; Variable (mathematics); Power (physics); Local consistency; Constraint satisfaction problem; Theoretical computer science; Computer network; Artificial intelligence; Mathematics","score_opus":0.023230105775647148,"score_gpt":0.22870106977660773,"score_spread":0.20547096400096057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020249752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010756372,0.00001615588,0.98350936,0.0002800862,0.000646865,0.0003670589,0.000014638537,0.00023528992,0.0041741678],"genre_scores_gemma":[0.9984513,0.000059540016,0.0008273716,0.00023108872,0.000013575417,0.00004653857,0.000024709785,0.0000040756977,0.00034178403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887246,0.00012493483,0.000420896,0.00014614774,0.0002962051,0.00013938392],"domain_scores_gemma":[0.9991818,0.00010873586,0.00014897379,0.00023311019,0.00022545147,0.00010192093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034786478,0.00012262614,0.0001271935,0.00023426578,0.00046914734,0.00028114294,0.00012652691,0.000078140685,0.000036104273],"category_scores_gemma":[0.00004243081,0.00011463136,0.000033104057,0.00038320813,0.000054238757,0.0021816585,0.0000033179579,0.00012329509,0.00020059255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001590721,0.0003244945,0.0038879858,0.00040609777,0.00014028272,0.000011779135,0.019095918,0.34342507,0.000108339256,0.071248285,0.002378879,0.5588138],"study_design_scores_gemma":[0.0008630596,0.00016027641,0.034247793,0.000051932304,0.000008922192,0.00034663398,0.0003407777,0.95594084,0.00011145673,0.000060714665,0.0075204372,0.0003471321],"about_ca_topic_score_codex":0.0003055529,"about_ca_topic_score_gemma":0.00004116437,"teacher_disagreement_score":0.9876949,"about_ca_system_score_codex":0.000068225745,"about_ca_system_score_gemma":0.000119860175,"threshold_uncertainty_score":0.46745312},"labels":[],"label_agreement":null},{"id":"W2020799200","doi":"10.1007/s10489-010-0246-z","title":"Conditional and composite temporal CSPs","year":2010,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Local consistency; Computer science; Constraint satisfaction problem; Constraint (computer-aided design); A priori and a posteriori; Constraint satisfaction; Variable (mathematics); Mathematical optimization; Consistency (knowledge bases); Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.008336895547539443,"score_gpt":0.2289900651502894,"score_spread":0.22065316960274997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020799200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016615186,0.0000062520717,0.9728446,0.00045169966,0.00021178518,0.00009460427,0.0000023085797,0.00011465917,0.009658924],"genre_scores_gemma":[0.91268367,0.0000071837635,0.08679599,0.0004141635,0.000030324922,0.000009442629,0.000009036383,0.0000031395589,0.000047042395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999406,0.0000065748072,0.00013207516,0.00022361525,0.00012139498,0.00011037679],"domain_scores_gemma":[0.9996022,0.000058531314,0.000044118726,0.00018258324,0.000037557296,0.000074995056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000931382,0.00007749853,0.000066461136,0.00005561314,0.00011026352,0.00010589623,0.00020726623,0.000045851684,0.00018788928],"category_scores_gemma":[0.000008566244,0.00007707188,0.000015143131,0.00013720352,0.000117006675,0.0001753586,0.000077839766,0.0001604444,0.000113782975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002265102,0.00001402167,0.0027945589,0.0000025230313,0.000003912572,0.0000015075357,0.00012253696,0.00017793242,0.008337326,0.89024556,0.00014666948,0.098151185],"study_design_scores_gemma":[0.0005854325,0.00011298598,0.09332736,0.000020375348,0.000017956483,0.0004456491,0.00022120932,0.29972038,0.23184632,0.33614093,0.03616896,0.0013924643],"about_ca_topic_score_codex":0.000008174626,"about_ca_topic_score_gemma":0.000014869025,"teacher_disagreement_score":0.8960685,"about_ca_system_score_codex":0.0000057090983,"about_ca_system_score_gemma":0.000026224636,"threshold_uncertainty_score":0.31429002},"labels":[],"label_agreement":null},{"id":"W2022150528","doi":"10.1007/s10288-004-0057-3","title":"Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Bounding overwatch; Mathematical optimization; CONTEST; Polarization (electrochemistry); Frequency assignment; Computer science; Assignment problem; Mathematics; Algorithm; Artificial intelligence","score_opus":0.01363488760412227,"score_gpt":0.24705524196518353,"score_spread":0.23342035436106126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022150528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003899344,0.00004931876,0.9898759,0.0045990017,0.000060992814,0.00057401456,0.0000029536402,0.00006038907,0.00087805756],"genre_scores_gemma":[0.8553477,0.000012361393,0.14407453,0.00026979935,0.000043486856,0.000043040447,0.0000025026563,0.000005247887,0.00020134113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938965,0.000016801214,0.00010338621,0.00018673507,0.00015434403,0.0001491053],"domain_scores_gemma":[0.99965197,0.00006883425,0.000042122963,0.000119699595,0.000073727526,0.00004363278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018692516,0.000071837225,0.000053681,0.00004213186,0.0002548699,0.00022239143,0.00012017242,0.000027751717,0.00004124876],"category_scores_gemma":[0.000023918821,0.000047256053,0.000013221674,0.00012818376,0.00009820744,0.0003462755,0.000025752757,0.000057726622,0.0000035819996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003214371,0.0001073306,0.021381108,0.000089255904,0.0000709816,0.0000025632864,0.0030959595,0.0049375086,0.005470413,0.32237235,0.00042774348,0.64201266],"study_design_scores_gemma":[0.0051602176,0.0010673204,0.08774534,0.00037649568,0.00009784988,0.00037100856,0.0011057782,0.877745,0.0074358196,0.006758037,0.010881258,0.0012558931],"about_ca_topic_score_codex":0.0000060969633,"about_ca_topic_score_gemma":0.000049360744,"teacher_disagreement_score":0.87280744,"about_ca_system_score_codex":0.000039685674,"about_ca_system_score_gemma":0.0001363034,"threshold_uncertainty_score":0.21445256},"labels":[],"label_agreement":null},{"id":"W2023759104","doi":"10.1007/pl00007190","title":"Constraint Satisfaction Methods for Applications in Engineering","year":2000,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Constraint satisfaction problem; Local consistency; Constraint (computer-aided design); Constraint satisfaction; Computer science; Mathematical optimization; Consistency (knowledge bases); Constraint logic programming; Mathematics; Artificial intelligence","score_opus":0.006510027227191836,"score_gpt":0.24286116791493187,"score_spread":0.23635114068774005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023759104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025602884,0.000024732366,0.99619967,0.00014372944,0.00020150386,0.00041604548,0.000001484722,0.00037134095,0.00008118187],"genre_scores_gemma":[0.17465867,0.000006578148,0.8251167,0.00003498055,0.000029859617,0.00012140387,0.0000050076274,0.000012882155,0.000013935322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.00001371292,0.00018988665,0.00027359696,0.00007591425,0.00021576975],"domain_scores_gemma":[0.9993854,0.0002620077,0.000029324789,0.00022171513,0.000028832947,0.000072678544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016119349,0.00014467328,0.00014181303,0.00019600574,0.00004348554,0.00008320739,0.00016684918,0.00004524288,0.00001873161],"category_scores_gemma":[0.0000129139535,0.00014644174,0.000037998805,0.0004147134,0.000012667446,0.00026764968,0.000015169812,0.00010997387,0.0000037535888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020588361,0.0000071145905,0.00036978282,0.000019154926,0.0000106724065,6.856114e-7,0.00012366544,0.73108304,0.00020101551,0.010517314,0.000011157786,0.25765434],"study_design_scores_gemma":[0.0003920109,0.000031884498,0.014371821,0.000041532567,0.0000035224446,0.000021753085,0.000005926853,0.9789167,0.0002322584,0.000031947366,0.005754215,0.00019640227],"about_ca_topic_score_codex":0.0000109046,"about_ca_topic_score_gemma":0.00000413217,"teacher_disagreement_score":0.2574579,"about_ca_system_score_codex":0.00007954436,"about_ca_system_score_gemma":0.00003690972,"threshold_uncertainty_score":0.5971721},"labels":[],"label_agreement":null},{"id":"W2024398882","doi":"10.1109/ccece.2012.6334937","title":"Approximating user preferences in online store systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Order (exchange); Set (abstract data type); Product (mathematics); Filter (signal processing); Recommender system; World Wide Web","score_opus":0.031251572666839145,"score_gpt":0.2590528243038898,"score_spread":0.22780125163705067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024398882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08991474,0.00006591274,0.90207374,0.00012198311,0.00042622068,0.00011546867,7.825944e-7,0.00012732839,0.007153801],"genre_scores_gemma":[0.8954232,0.0000035640896,0.10414492,0.00005365179,0.000037958376,0.000005576194,0.0000024515882,0.000001819581,0.00032688928],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994797,0.000036770616,0.00014964268,0.000095386975,0.00010198756,0.00013648598],"domain_scores_gemma":[0.9997433,0.00002673283,0.000042768344,0.00012252109,0.0000211753,0.000043544656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017558024,0.000049292572,0.00006460133,0.000067922585,0.000026885189,0.00006263565,0.0001318422,0.000027567357,0.000041842406],"category_scores_gemma":[0.000020976759,0.000039863146,0.000010548691,0.00017985953,0.000008490789,0.00062829064,0.000043160602,0.000054092558,0.000017793884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000144867,0.0001646924,0.549785,0.000037575526,0.000007966462,8.2174756e-7,0.0025258022,0.0068151588,0.00009667417,0.3384518,0.0004050425,0.10170799],"study_design_scores_gemma":[0.00021710838,0.000013386602,0.15772206,0.000033308224,0.0000013907963,0.000011424547,0.0008318898,0.83931935,0.00006227797,0.00009386984,0.0015314652,0.00016246538],"about_ca_topic_score_codex":0.00007386401,"about_ca_topic_score_gemma":0.00007089391,"teacher_disagreement_score":0.8325042,"about_ca_system_score_codex":0.000023335993,"about_ca_system_score_gemma":0.0000171909,"threshold_uncertainty_score":0.1625572},"labels":[],"label_agreement":null},{"id":"W2024632301","doi":"","title":"Multidimensional Mereotopology with Betweenness ∗","year":2012,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Betweenness centrality; Dimension (graph theory); Space (punctuation); Extension (predicate logic); Containment (computer programming); Mathematics; Incidence (geometry); Position (finance); Computer science; Theoretical computer science; Intrinsic dimension; Topology (electrical circuits); Pure mathematics; Algebra over a field; Artificial intelligence; Geometry; Combinatorics","score_opus":0.010676773195102558,"score_gpt":0.22691628390526977,"score_spread":0.21623951071016723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024632301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022403575,0.000008035666,0.96613055,0.000808339,0.0001887719,0.000046322024,1.7274452e-7,0.00011200337,0.010302253],"genre_scores_gemma":[0.78573215,8.968629e-7,0.21357696,0.00027861373,0.000025857651,0.0000027360404,0.0000011342597,0.0000017074618,0.00037994608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996133,0.000019781304,0.00005821134,0.00008787081,0.00008084158,0.00014001466],"domain_scores_gemma":[0.99972063,0.00003554023,0.000020066298,0.00012210137,0.00003174791,0.000069908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007146594,0.000046235196,0.000047305075,0.00003883038,0.000052923053,0.000010664771,0.00007264467,0.000021322425,0.0004041158],"category_scores_gemma":[0.000004612966,0.000032803382,0.000010840142,0.00010908056,0.00003050855,0.00036857228,0.00003682796,0.000034796874,0.00012114945],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003381383,0.000046762532,0.15474173,0.0000016081179,0.000014121539,0.0000013500093,0.00028505162,0.00023331867,0.00018559373,0.7999763,0.00047889832,0.04403191],"study_design_scores_gemma":[0.0016695024,0.00014688271,0.8811604,0.000011292397,0.000016529102,0.00026890007,0.00021928352,0.08034878,0.0069438424,0.00062953675,0.027920749,0.00066431507],"about_ca_topic_score_codex":0.000013563844,"about_ca_topic_score_gemma":0.000009808258,"teacher_disagreement_score":0.79934675,"about_ca_system_score_codex":0.000009055592,"about_ca_system_score_gemma":0.000017875009,"threshold_uncertainty_score":0.44247845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Mathematical optimization","score_opus":0.028871452360921798,"score_gpt":0.2837969058946502,"score_spread":0.25492545353372836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025473159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15128475,0.00014367112,0.8460975,0.0022563054,0.00011899527,0.00008083607,1.7070796e-7,0.00000688627,0.00001086706],"genre_scores_gemma":[0.511256,0.00006718138,0.48855802,0.00007161316,0.000041224223,0.0000015076067,5.0574663e-8,0.000002857329,0.0000015889301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920404,0.000035825236,0.0003230477,0.00012119543,0.00018141615,0.000134462],"domain_scores_gemma":[0.99909705,0.00046196446,0.0002206985,0.00008790578,0.000047089565,0.000085269654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761483,0.00007342865,0.00014676135,0.00014682402,0.00008491743,0.00004827068,0.000085836065,0.000059600385,0.000011664495],"category_scores_gemma":[0.00062651216,0.000066019486,0.000047108824,0.00010430514,0.00006290593,0.0003960899,0.00003847445,0.00027382554,0.0000016990612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115703726,0.00015618894,0.0036319029,0.000027931734,0.000040203144,0.00013882814,0.0030303497,0.6718939,0.0005558111,0.30479506,0.0000061473297,0.015607958],"study_design_scores_gemma":[0.0009167529,0.00017263512,0.003770546,0.00017627885,0.000014612421,0.0016881899,0.0002678622,0.9532118,0.00012188453,0.03948605,0.00003417372,0.00013920406],"about_ca_topic_score_codex":4.5094455e-7,"about_ca_topic_score_gemma":2.4269733e-7,"teacher_disagreement_score":0.3599712,"about_ca_system_score_codex":0.00004596685,"about_ca_system_score_gemma":0.000101550984,"threshold_uncertainty_score":0.26921967},"labels":[],"label_agreement":null},{"id":"W2025557943","doi":"10.3846/1648715x.2014.941432","title":"AN INTERACTIVE DECISION SUPPORT METHOD FOR REAL ESTATE MANAGEMENT IN A MULTI-CRITERIA FRAMEWORK – REMIND","year":2014,"lang":"en","type":"article","venue":"International Journal of Strategic Property Management","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Action plan; Stock (firearms); Tabu search; Operations research; Real estate; Decision support system; Plan (archaeology); Property management; Decision maker; Action (physics); Order (exchange); Process management; Risk analysis (engineering); Business; Artificial intelligence; Finance; Economics; Mathematics; Engineering","score_opus":0.052764510024558314,"score_gpt":0.37996046429046215,"score_spread":0.32719595426590387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025557943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020600446,0.0000021338046,0.9830213,0.0007650144,0.0012793083,0.0003662826,0.000003197833,0.000026091026,0.01247661],"genre_scores_gemma":[0.2775038,0.00026269798,0.7217439,0.00022463979,0.00006866181,0.00002106236,0.0000059185795,0.00000928105,0.0001600731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812675,0.00013147363,0.0006836961,0.00033431963,0.0005247991,0.00019894497],"domain_scores_gemma":[0.9987513,0.00011750505,0.00038928835,0.00025723185,0.0003837882,0.00010087455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013025422,0.00016557705,0.00020489679,0.0005424585,0.000047088743,0.00039481258,0.0010501966,0.000053410087,0.00007187833],"category_scores_gemma":[0.00003122289,0.000119969496,0.00009774404,0.0001800417,0.000022735216,0.0009888749,0.00015859818,0.00017937204,0.000007841473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032944023,0.0002962894,0.0001128722,0.000020137528,0.00017880532,0.00014775794,0.00068509846,0.0066612544,0.00011186753,0.03432007,0.00014751882,0.9569889],"study_design_scores_gemma":[0.0037626529,0.0006224829,0.006329974,0.000360595,0.000037360278,0.00013955943,0.00130074,0.9481813,0.00019529733,0.03175065,0.006985117,0.0003342823],"about_ca_topic_score_codex":0.000031148793,"about_ca_topic_score_gemma":0.000035767738,"teacher_disagreement_score":0.9566546,"about_ca_system_score_codex":0.00021218589,"about_ca_system_score_gemma":0.00004042085,"threshold_uncertainty_score":0.4892214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08292401402696233,"score_gpt":0.30074126066290946,"score_spread":0.21781724663594715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026753685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06922815,0.0000369744,0.9256728,0.0024022018,0.00048797514,0.00007422088,8.3323437e-7,0.00004890446,0.0020478822],"genre_scores_gemma":[0.86337656,0.0000062166064,0.13584135,0.0005378395,0.00022531905,1.03708885e-7,3.1048825e-7,0.0000057221737,0.0000065746017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986017,0.00017758223,0.00047181506,0.0001678714,0.0003405268,0.00024054068],"domain_scores_gemma":[0.9987704,0.00031587514,0.0004555109,0.00021832275,0.00015150443,0.00008837064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007539427,0.0001237056,0.00016916892,0.00013976062,0.00053809804,0.00020497182,0.00046084492,0.000042112322,0.00008416779],"category_scores_gemma":[0.00011039975,0.00009359844,0.00010964713,0.00031166407,0.0003228826,0.00028943253,0.0001156947,0.00041913392,0.000012956526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008367515,0.00006198309,0.001999977,0.0000095763635,0.000047624697,0.000013306516,0.0011981213,0.38850734,0.0010243368,0.09780629,0.00008086906,0.50924224],"study_design_scores_gemma":[0.00037426886,0.000038282535,0.0073388503,0.00011235379,0.0000063594816,0.00040202867,0.000108955835,0.98885405,0.00058814883,0.0016369935,0.0004188393,0.00012086387],"about_ca_topic_score_codex":0.0000023398554,"about_ca_topic_score_gemma":0.0000029662406,"teacher_disagreement_score":0.7941484,"about_ca_system_score_codex":0.000085881016,"about_ca_system_score_gemma":0.00013105529,"threshold_uncertainty_score":0.41386697},"labels":[],"label_agreement":null},{"id":"W2027450089","doi":"10.1145/937555.937557","title":"Variable independence for first-order definable constraints","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Quantifier elimination; Constraint (computer-aided design); Mathematics; Independence (probability theory); Time complexity; Variable (mathematics); Dimension (graph theory); Polynomial; Projection (relational algebra); Arity; Set (abstract data type); Algorithm; Computer science; Mathematical optimization; Discrete mathematics; Combinatorics","score_opus":0.024980196717759057,"score_gpt":0.25370818891009106,"score_spread":0.228727992192332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027450089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000752152,0.000014903329,0.9934899,0.0014626641,0.0004819384,0.00038279762,0.000026417341,0.00019952888,0.0038666287],"genre_scores_gemma":[0.36268148,0.0000051772013,0.63616914,0.0008154932,0.000008246566,0.00007676371,0.000011923642,0.000007815524,0.00022399591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861306,0.00006510896,0.00028000653,0.0004473346,0.00031594132,0.00027855308],"domain_scores_gemma":[0.99826175,0.0007918558,0.00008883615,0.00036485636,0.0003941657,0.00009856363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966771,0.0001741315,0.00015186281,0.00018519677,0.000556242,0.0001446565,0.00040082113,0.0001142865,0.00065554574],"category_scores_gemma":[0.00021261652,0.00018194084,0.000081027334,0.0006168529,0.000093070135,0.0004311559,0.0000071740246,0.00017989732,0.000093053925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005742659,0.00008738163,0.00003668909,0.000008347233,0.000017829781,0.000001257527,0.000040705472,0.5293209,0.000005853951,0.46010518,0.00009844692,0.010271642],"study_design_scores_gemma":[0.0014519575,0.00020221432,0.000730899,0.000024598363,0.000020851534,0.00013597545,0.000056594774,0.3191902,0.00018175175,0.6721962,0.0054041217,0.00040463533],"about_ca_topic_score_codex":0.000007670992,"about_ca_topic_score_gemma":0.0000130990165,"teacher_disagreement_score":0.36260626,"about_ca_system_score_codex":0.000086494576,"about_ca_system_score_gemma":0.00033241414,"threshold_uncertainty_score":0.7419332},"labels":[],"label_agreement":null},{"id":"W2027807244","doi":"10.1109/time.2011.27","title":"Verification of Time Ontologies with Points and Intervals","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data mining","score_opus":0.022441199799941018,"score_gpt":0.20321595730253167,"score_spread":0.18077475750259064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027807244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039397493,0.000005960979,0.9338151,0.0001893894,0.000019126235,0.000048889535,2.4076553e-7,0.00006668622,0.02645708],"genre_scores_gemma":[0.7859457,0.000006111982,0.21384265,0.000037740574,8.753653e-7,0.0000011523983,3.033133e-7,8.561558e-7,0.00016457484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9997723,0.00001187266,0.00006431478,0.00007969352,0.000038075243,0.000033704848],"domain_scores_gemma":[0.9997944,0.000011597941,0.000036396275,0.00010851524,0.000035421832,0.000013629782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049988023,0.000027872373,0.000042765103,0.000031229247,0.000011793874,0.000010163455,0.00007055713,0.000012578678,0.00013488157],"category_scores_gemma":[0.000008932025,0.000020282581,0.0000056308295,0.000055205674,0.000036406975,0.00020190289,0.00002209436,0.000012857789,0.0000108606855],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054548833,0.00010765536,0.07930661,0.000026846403,0.00004894636,0.0000029980417,0.0073405686,0.000024150244,0.003384957,0.4626184,0.00036648623,0.44671783],"study_design_scores_gemma":[0.0006171508,0.00039948657,0.8805923,0.000035547142,0.000010145845,0.000047609265,0.00023163129,0.06522851,0.046502564,0.0059436955,0.00016259975,0.00022876119],"about_ca_topic_score_codex":0.000030993288,"about_ca_topic_score_gemma":0.000018734847,"teacher_disagreement_score":0.8012857,"about_ca_system_score_codex":0.0000030426029,"about_ca_system_score_gemma":0.000009029745,"threshold_uncertainty_score":0.14768586},"labels":[],"label_agreement":null},{"id":"W2032636061","doi":"10.1007/s10458-011-9172-7","title":"A negotiation framework for linked combinatorial optimization problems","year":2011,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Negotiation; Pareto principle; Computer science; Mathematical optimization; Space (punctuation); Scheduling (production processes); Multi-objective optimization; Combinatorial optimization; Pareto optimal; Operations research; Mathematics; Algorithm; Machine learning; Law","score_opus":0.06030290389340378,"score_gpt":0.26632870243759305,"score_spread":0.20602579854418926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032636061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016696361,0.000085355474,0.9926186,0.000088110704,0.003618152,0.0014101322,0.000009302943,0.00024282864,0.00025785883],"genre_scores_gemma":[0.7118708,0.00006046599,0.28741574,0.00010426601,0.00010701683,0.0002007259,0.000029755316,0.000019023852,0.00019223381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986569,0.00007451565,0.00042522885,0.00043101844,0.00015793258,0.0002543704],"domain_scores_gemma":[0.9990821,0.000054232427,0.00028098366,0.00029679292,0.00015248524,0.00013339637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027888492,0.00018560291,0.00021038677,0.00012110533,0.0002622811,0.00023851791,0.00022444066,0.00016489685,0.000030015199],"category_scores_gemma":[0.000057553512,0.00017882016,0.00006387105,0.0001620799,0.000029822677,0.0004617252,0.000069036476,0.0000888932,0.0000127861085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006166081,0.0010186903,0.015880812,0.0004799373,0.00032457433,0.0000105955205,0.0236057,0.2339273,0.00012679432,0.6695105,0.0007140328,0.054339398],"study_design_scores_gemma":[0.0012040124,0.000102715654,0.0062020337,0.00005651707,0.000020691286,0.000008559285,0.00009928778,0.9896084,0.000021220469,0.000561714,0.0018774704,0.0002373763],"about_ca_topic_score_codex":0.00013722271,"about_ca_topic_score_gemma":0.000004784154,"teacher_disagreement_score":0.7556811,"about_ca_system_score_codex":0.000080923,"about_ca_system_score_gemma":0.000059403963,"threshold_uncertainty_score":0.72920746},"labels":[],"label_agreement":null},{"id":"W2036792519","doi":"10.1145/2001576.2001640","title":"Heuristic techniques for variable and value ordering in CSPs","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Heuristics; Mathematical optimization; Heuristic; Computer science; Constraint (computer-aided design); Variable (mathematics); Hill climbing; Constraint satisfaction; Random variable; Local consistency; Mathematics; Algorithm; Artificial intelligence; Statistics","score_opus":0.02049977995498006,"score_gpt":0.23030256291433618,"score_spread":0.20980278295935612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036792519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042087655,0.0000058994465,0.97935575,0.00006455868,0.00004604239,0.00011900046,2.5448995e-7,0.000114563525,0.019873075],"genre_scores_gemma":[0.24759403,0.000006856579,0.75214523,0.0001112412,0.0000042938686,0.00001211187,2.605075e-7,0.000001960712,0.00012398878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970204,0.000007895302,0.00007664388,0.0001138602,0.000027068612,0.00007251011],"domain_scores_gemma":[0.99983555,0.000029062126,0.000014818996,0.00008178917,0.000019127563,0.000019678651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110026675,0.000035698107,0.000043795553,0.000058391324,0.000026931642,0.00002799486,0.000068765694,0.000021156284,0.0000349069],"category_scores_gemma":[0.000026484247,0.000033696568,0.0000059347917,0.000101285266,0.000010112028,0.00017994748,0.000034966026,0.000022965578,9.934906e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031081884,0.000017892531,0.0034396925,0.00001420139,0.0000021828516,9.287988e-7,0.00036502458,0.000056608318,0.00026435344,0.9070102,0.00009160198,0.08873423],"study_design_scores_gemma":[0.0005040637,0.00012857805,0.019468278,0.000039969964,0.000004455218,0.000028934215,0.000059393435,0.86854637,0.00807963,0.09903273,0.0038031999,0.0003044041],"about_ca_topic_score_codex":0.00008755816,"about_ca_topic_score_gemma":0.000022808774,"teacher_disagreement_score":0.86848974,"about_ca_system_score_codex":0.000008369421,"about_ca_system_score_gemma":0.000016398995,"threshold_uncertainty_score":0.13741061},"labels":[],"label_agreement":null},{"id":"W2036886966","doi":"10.1504/ijista.2006.009909","title":"Speaking with spatial relations","year":2006,"lang":"en","type":"article","venue":"International Journal of Intelligent Systems Technologies and Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Spatial relation; Computer science; Bridging (networking); Theoretical computer science; Spatial analysis; Set (abstract data type); Natural language; Artificial intelligence; Fuzzy set; Natural language processing; Mathematics; Fuzzy logic; Discrete mathematics; Programming language","score_opus":0.007654160615642923,"score_gpt":0.22981383765663554,"score_spread":0.22215967704099263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036886966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027577314,0.00041628827,0.99277276,0.0022356848,0.00022965178,0.00016484749,0.0000037120149,0.00014786712,0.001271451],"genre_scores_gemma":[0.9779682,0.00015706828,0.021627245,0.000015041439,0.00012236314,0.000024422876,0.0000032369885,0.0000048469883,0.00007754914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907917,0.000012511709,0.00041009078,0.00013484922,0.0002768211,0.00008653569],"domain_scores_gemma":[0.99885184,0.00006586669,0.0004078896,0.00016089773,0.00049211545,0.000021423844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012697268,0.00008628366,0.000111321635,0.0003041957,0.00008653443,0.00021225489,0.0005006022,0.000057621233,0.0000062313115],"category_scores_gemma":[0.000022045971,0.00006632724,0.000037670052,0.0002018634,0.00007845721,0.00031181038,0.00007770274,0.00013227494,0.0000073165493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009366808,0.00007961224,0.007836616,0.000006172863,0.00008069886,0.000014885104,0.00006155425,0.012618643,0.00036979126,0.59475684,0.0004889128,0.38367692],"study_design_scores_gemma":[0.0025789405,0.00070296775,0.028187357,0.00086399104,0.00014336847,0.00805985,0.011123983,0.16615061,0.014579484,0.070952915,0.6951222,0.0015343443],"about_ca_topic_score_codex":0.0001396508,"about_ca_topic_score_gemma":0.00006388586,"teacher_disagreement_score":0.9752105,"about_ca_system_score_codex":0.00007203419,"about_ca_system_score_gemma":0.00004630197,"threshold_uncertainty_score":0.2704746},"labels":[],"label_agreement":null},{"id":"W2036975612","doi":"10.1007/978-3-540-74970-7_52","title":"Solution Counting Algorithms for Constraint-Centered Search Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Benchmark (surveying); Computer science; Exploit; Constraint (computer-aided design); Key (lock); Inference; Counting problem; Constraint programming; Search algorithm; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.052600282241201765,"score_gpt":0.2967685776612226,"score_spread":0.24416829542002083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036975612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010556503,0.000097458564,0.9937517,0.000544101,0.002309692,0.00064382557,0.000021974769,0.0001857344,0.002434945],"genre_scores_gemma":[0.03623941,0.000039130282,0.961995,0.0009275382,0.0005038334,0.0000070668625,0.000026700918,0.000031462874,0.00022982268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966012,0.000023309505,0.00059187185,0.0011855945,0.0008669935,0.00073099945],"domain_scores_gemma":[0.99766356,0.00059903914,0.00026296388,0.0006843491,0.0006181114,0.0001719878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001494325,0.00040003535,0.00038104522,0.0008613082,0.0004014954,0.0005829333,0.0013196658,0.0003292097,0.000028959115],"category_scores_gemma":[0.00014502018,0.0004183466,0.0001350581,0.00044735792,0.00078693056,0.00045778838,0.00047451156,0.0006008985,0.000018808332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060129955,0.000018084032,0.000056848832,0.000038670565,0.000009309801,0.000020248654,0.0002637316,0.018611431,0.00005970829,0.02498015,0.000021036272,0.9559148],"study_design_scores_gemma":[0.00043057877,0.00012282777,0.00008126961,0.00020291013,0.000007245401,0.00008612329,4.0938707e-7,0.9809648,0.00043154877,0.015956193,0.0012469443,0.0004691776],"about_ca_topic_score_codex":0.000016140628,"about_ca_topic_score_gemma":0.000079605656,"teacher_disagreement_score":0.96235335,"about_ca_system_score_codex":0.00042928502,"about_ca_system_score_gemma":0.00070193683,"threshold_uncertainty_score":0.99982685},"labels":[],"label_agreement":null},{"id":"W2037086109","doi":"10.1109/icpp.2013.20","title":"A Dynamic Moldable Job Scheduling Based Parallel SAT Solver","year":2013,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Solver; Boolean satisfiability problem; Tree (set theory); Scheduling (production processes); Job shop scheduling; Theoretical computer science; Mathematical optimization; Mathematics; Programming language; Schedule","score_opus":0.008871722527134177,"score_gpt":0.21856094098238035,"score_spread":0.20968921845524618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037086109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010073241,0.000011511468,0.9796809,0.0024787486,0.00015191443,0.00014815744,2.3272236e-7,0.0002622172,0.007193083],"genre_scores_gemma":[0.5039461,0.0000022734164,0.49406698,0.0008603927,0.0000043563055,0.000012698444,0.0000018473393,0.000003394427,0.0011019144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931675,0.000019895991,0.00013328933,0.0002149397,0.00013591768,0.00017917641],"domain_scores_gemma":[0.9995146,0.000035465884,0.0000340958,0.00026871212,0.000068970054,0.000078155215],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007347957,0.0000831585,0.0000742837,0.000078800804,0.00008820584,0.00021361587,0.00021654466,0.000041845324,0.0017242853],"category_scores_gemma":[0.0000152985,0.00007302788,0.000041458203,0.00018931853,0.000019979865,0.0006280998,0.000051732564,0.000066179804,0.00086567283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007123508,0.00013755161,0.022295255,0.000036826794,0.000047974565,0.000010380683,0.00042058583,0.6430756,0.005492042,0.099026054,0.0055277036,0.22392295],"study_design_scores_gemma":[0.0002443002,0.000010151631,0.012376625,0.000005290386,0.0000013428909,0.0000028609359,0.000016742006,0.9860354,0.00007080352,0.0009419247,0.00018778846,0.0001067682],"about_ca_topic_score_codex":0.00010651944,"about_ca_topic_score_gemma":0.000052911266,"teacher_disagreement_score":0.4938729,"about_ca_system_score_codex":0.00003439264,"about_ca_system_score_gemma":0.00006119506,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W2037159075","doi":"10.1145/1244002.1244082","title":"Solving conditional and composite constraint satisfaction problems","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint satisfaction; Constraint (computer-aided design); Computer science; A priori and a posteriori; Mathematical optimization; Variable (mathematics); Process (computing); Local consistency; Mathematics; Artificial intelligence","score_opus":0.011169180119684494,"score_gpt":0.2321089691269916,"score_spread":0.22093978900730712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037159075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01899558,0.00001583121,0.9692918,0.00066151674,0.00015094646,0.00011786324,0.0000015925056,0.00019291628,0.010571942],"genre_scores_gemma":[0.8955413,0.000008761655,0.10393973,0.0004037884,0.0000210164,0.0000020105988,0.000005806562,0.0000028214554,0.0000747806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992935,0.000015694905,0.0001815594,0.00020126607,0.0001559286,0.0001520493],"domain_scores_gemma":[0.9995936,0.000095074196,0.000055775785,0.00010168543,0.000064613414,0.00008923813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027583132,0.00007897436,0.000070774026,0.000105441075,0.00015151447,0.00012728175,0.00006187093,0.000042140382,0.00015298162],"category_scores_gemma":[0.000011962928,0.00007644789,0.000020276842,0.00012996137,0.00008053711,0.0004573279,0.000043495726,0.00007814331,0.000019059522],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037567308,0.000019449568,0.085907154,0.000012543987,0.000019384135,0.000007772185,0.00035814178,0.0008344748,0.0077319536,0.60608315,0.00026807224,0.29875413],"study_design_scores_gemma":[0.0006787546,0.00004837445,0.9041947,0.00002011701,0.000005663015,0.0003666974,0.00011495964,0.08062808,0.002250232,0.010318358,0.001088394,0.00028563937],"about_ca_topic_score_codex":0.00003779061,"about_ca_topic_score_gemma":0.0001372232,"teacher_disagreement_score":0.8765457,"about_ca_system_score_codex":0.000032979562,"about_ca_system_score_gemma":0.000026804004,"threshold_uncertainty_score":0.31174546},"labels":[],"label_agreement":null},{"id":"W2037783464","doi":"10.1145/1057387.1057389","title":"Dealing with incomplete knowledge on CLP( <i>FD</i> ) variable domains","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Patient Safety Institute","keywords":"Computer science; Local consistency; Consistency (knowledge bases); Semantics (computer science); Domain (mathematical analysis); Set (abstract data type); Answer set programming; Theoretical computer science; Constraint programming; Programming language; Constraint logic programming; Constraint (computer-aided design); Constraint satisfaction; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.014240703262559305,"score_gpt":0.2645974458612206,"score_spread":0.25035674259866125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037783464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004110262,0.00026463697,0.99168015,0.0005212112,0.00016348777,0.0003546604,0.0000065112467,0.00035150046,0.002547598],"genre_scores_gemma":[0.8519796,0.00003114916,0.14721698,0.00013236629,0.00006867175,0.000059761092,0.000003938589,0.000015284415,0.00049221184],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893194,0.00006262409,0.00022010237,0.00035172122,0.0001835024,0.0002500875],"domain_scores_gemma":[0.9991539,0.00014540971,0.00007559036,0.0004496116,0.00006128107,0.00011419655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023495247,0.00017106518,0.00017293163,0.00015211635,0.00036927452,0.00032802703,0.0002398434,0.00006823683,0.000018142917],"category_scores_gemma":[0.000007760182,0.00013860707,0.000038575417,0.00029634443,0.000041740084,0.000262553,0.000009020526,0.0001740302,0.000023126993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020586995,0.0001259865,0.00011104224,0.000049255243,0.0000555491,0.000008804505,0.0013120715,0.020919507,0.0001165135,0.029494211,0.000021847736,0.94776464],"study_design_scores_gemma":[0.00684343,0.0028960155,0.0014050517,0.0016303747,0.00022593483,0.0012912627,0.006285525,0.40416998,0.0017435984,0.00038402926,0.57051295,0.0026118364],"about_ca_topic_score_codex":0.000115006624,"about_ca_topic_score_gemma":0.00015683795,"teacher_disagreement_score":0.94515276,"about_ca_system_score_codex":0.000051086354,"about_ca_system_score_gemma":0.00003360173,"threshold_uncertainty_score":0.5652232},"labels":[],"label_agreement":null},{"id":"W2039256019","doi":"10.5220/0005210200870098","title":"Introducing the Φ-Descriptor - A Most Versatile Relative Position Descriptor","year":2015,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Position (finance); Artificial intelligence; Categorization; Histogram; Pattern recognition (psychology); Basis (linear algebra); Computer science; Computer vision; Strengths and weaknesses; Texture (cosmology); Boundary (topology); Image (mathematics); Mathematics; Geometry","score_opus":0.023293844000146502,"score_gpt":0.2290978164908825,"score_spread":0.205803972490736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039256019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023697126,0.000027251766,0.9715559,0.0072233356,0.00088932243,0.00017066683,0.0000013542514,0.0002118331,0.017550638],"genre_scores_gemma":[0.86420244,0.0000042553293,0.13174216,0.001760398,0.0001556502,0.000016404243,0.000008226837,0.0000083600025,0.0021021103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991528,0.000091571266,0.00015234381,0.00023380785,0.00022381492,0.0001456976],"domain_scores_gemma":[0.9992942,0.000053449137,0.00006220412,0.00032578327,0.00017164896,0.00009267329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030291258,0.00008796974,0.00007221936,0.0000625091,0.00015989931,0.00020745145,0.00025646397,0.000037932754,0.00012153501],"category_scores_gemma":[0.00015015282,0.00006202644,0.00002955064,0.00037149247,0.000048161168,0.0010923777,0.00009054761,0.000112096655,0.00015234441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036837646,0.00008346201,0.0017067016,0.000005585975,0.00006789233,0.000008999631,0.017367126,0.00869116,0.0023016206,0.74206823,0.1263409,0.10132151],"study_design_scores_gemma":[0.0014463312,0.00033203076,0.0040985146,0.000030895877,0.000029408899,0.000096554126,0.002653266,0.95046085,0.0028832082,0.012493042,0.024982857,0.0004930226],"about_ca_topic_score_codex":0.00011869367,"about_ca_topic_score_gemma":0.000039628114,"teacher_disagreement_score":0.9417697,"about_ca_system_score_codex":0.00014192215,"about_ca_system_score_gemma":0.0001259079,"threshold_uncertainty_score":0.25293648},"labels":[],"label_agreement":null},{"id":"W2039339012","doi":"10.1080/13875860801930407","title":"Managing Temporal Constraints with Preferences","year":2008,"lang":"en","type":"article","venue":"Spatial Cognition and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.02341417044691574,"score_gpt":0.23615226624618707,"score_spread":0.21273809579927133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039339012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051045787,0.000010262744,0.9432839,0.00043680897,0.0000872585,0.00014408663,0.0000020077712,0.00016696204,0.004822918],"genre_scores_gemma":[0.96985453,0.000028439703,0.029808182,0.00021549597,0.00002355672,0.000008114703,0.00003875283,0.0000037665313,0.000019164283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932826,0.000044762735,0.00013353507,0.00021852471,0.00017398647,0.0001009336],"domain_scores_gemma":[0.99964666,0.0000336421,0.00008036066,0.000056706896,0.00012162169,0.000061016548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056846315,0.0000906508,0.000082362174,0.000102876074,0.000231154,0.00008463793,0.00005648321,0.00002992089,0.000039559727],"category_scores_gemma":[0.0000072215785,0.00008237927,0.000014280193,0.00016234153,0.00014025668,0.0004013782,0.000023745051,0.0000646822,0.000013530272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029387376,0.000038515183,0.0072417515,0.000015053705,0.000020406882,0.000024496232,0.0010737753,0.0014135815,0.00007798716,0.004075757,0.000058538768,0.98593074],"study_design_scores_gemma":[0.002819618,0.0005223977,0.17238033,0.00010507852,0.000028952052,0.00073948293,0.00031076325,0.8001796,0.00083565817,0.021269962,0.00019552991,0.0006126414],"about_ca_topic_score_codex":0.000040135124,"about_ca_topic_score_gemma":0.000059723698,"teacher_disagreement_score":0.9853181,"about_ca_system_score_codex":0.000009590845,"about_ca_system_score_gemma":0.00005546093,"threshold_uncertainty_score":0.3359329},"labels":[],"label_agreement":null},{"id":"W2039928111","doi":"10.1080/09528131003713002","title":"A framework to support qualitative reasoning about COAs in a dynamic spatial environment","year":2010,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Qualitative reasoning; Action (physics); Spatial intelligence; Space (punctuation); Human–computer interaction; Model-based reasoning; Conceptual framework; Artificial intelligence; Data science; Knowledge representation and reasoning; Epistemology","score_opus":0.022001612163320552,"score_gpt":0.35960123399109456,"score_spread":0.33759962182777403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039928111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19254173,0.000017101112,0.8052976,0.0009751949,0.0006280158,0.0001329923,0.0000017138665,0.000013776211,0.00039186026],"genre_scores_gemma":[0.8373714,0.000007741865,0.16228104,0.000250651,0.00006832458,0.000007012528,5.828973e-7,0.000008150674,0.0000050714557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802387,0.0001734573,0.0007729085,0.0002658058,0.00048977084,0.00027421134],"domain_scores_gemma":[0.9989072,0.00031370396,0.00021522869,0.00023078418,0.000078192745,0.00025488177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009888879,0.0001602459,0.0002422599,0.00019625209,0.00007984663,0.00014342356,0.0004983793,0.0001132319,0.0015350794],"category_scores_gemma":[0.00043375406,0.00014463897,0.000107142485,0.00024554,0.00037758294,0.00029066493,0.00015388883,0.000617173,0.000119879725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010954394,0.00023997866,0.000051693798,0.0000012330681,0.000008002756,0.000038308437,0.015828567,0.0006314903,0.03995165,0.8874552,0.0000044622493,0.05567987],"study_design_scores_gemma":[0.00015337345,0.0017871418,0.00044715023,0.00015438684,0.000011182903,0.00020605579,0.010267167,0.13294221,0.42571893,0.42763788,0.00015081174,0.00052372075],"about_ca_topic_score_codex":0.000017244603,"about_ca_topic_score_gemma":0.000025718886,"teacher_disagreement_score":0.6448297,"about_ca_system_score_codex":0.00012225652,"about_ca_system_score_gemma":0.00008933023,"threshold_uncertainty_score":0.99937767},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018257081431443906,"score_gpt":0.25007981886063524,"score_spread":0.23182273742919132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041091076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09331795,0.00006873457,0.8532039,0.048932936,0.002094164,0.00003966565,1.322286e-7,0.000017827393,0.0023246715],"genre_scores_gemma":[0.93484324,0.00003104404,0.06388153,0.0007341535,0.00009774676,1.2681623e-7,1.4089547e-8,0.0000018251062,0.0004103368],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996086,0.00003300158,0.00013884222,0.000033941178,0.00013464974,0.000050987324],"domain_scores_gemma":[0.99935055,0.00003394886,0.0001367453,0.00038375388,0.0000675328,0.000027479122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782736,0.000028337921,0.0000501896,0.000042928383,0.0000380855,0.000054357803,0.0012007977,0.000012743511,0.000045709505],"category_scores_gemma":[0.0003320935,0.000016860888,0.00006969013,0.00014979982,0.000014471137,0.00021954419,0.00023589827,0.000096709744,0.000009786433],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035753234,0.00013971834,0.060057417,0.000007143003,0.00009831308,0.000099204924,0.0015572575,0.0075784023,0.0020843663,0.015263396,0.037191346,0.8758877],"study_design_scores_gemma":[0.0023273495,0.00039366964,0.62239486,0.00023014171,0.00006312824,0.012060542,0.00021939594,0.10391854,0.003392344,0.12819314,0.12639828,0.0004086067],"about_ca_topic_score_codex":0.0000011448018,"about_ca_topic_score_gemma":0.000002297674,"teacher_disagreement_score":0.8754791,"about_ca_system_score_codex":0.00002141729,"about_ca_system_score_gemma":0.000031891886,"threshold_uncertainty_score":0.22314009},"labels":[],"label_agreement":null},{"id":"W2041308874","doi":"10.1109/ictai.2012.19","title":"SAT with Global Constraints","year":2012,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Usability; Computer science; Constraint satisfaction problem; Boolean satisfiability problem; Representation (politics); Constraint (computer-aided design); Theoretical computer science; Constraint satisfaction; Constraint programming; Problem solver; Programming language; Mathematical optimization; Computational science; Human–computer interaction; Artificial intelligence; Mathematics","score_opus":0.009343176268817418,"score_gpt":0.22679202397961432,"score_spread":0.2174488477107969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041308874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026108485,0.0000082807,0.8938154,0.00044474335,0.00015264655,0.00004333882,7.8094524e-7,0.00014955744,0.10277439],"genre_scores_gemma":[0.79420435,8.6540985e-7,0.20524871,0.0004013052,0.000018374063,0.00000127781,8.6193046e-7,0.0000010122051,0.00012326508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995912,0.000012339767,0.000057464822,0.00008665929,0.00010220757,0.00015015695],"domain_scores_gemma":[0.9997159,0.000010746971,0.000019358162,0.00013473081,0.00002617376,0.00009305367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006053433,0.00004985407,0.000041116527,0.0000147478895,0.000039871567,0.00004713078,0.00010206783,0.000018761468,0.00040721722],"category_scores_gemma":[0.0000052616438,0.000036782956,0.000012195241,0.00016019627,0.00005308811,0.00047265316,0.000028513572,0.000024430954,0.00018451069],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017312203,0.000024591485,0.14882913,0.0000013068081,0.00000821004,0.0000013409062,0.00009921933,0.000052132516,0.000014251464,0.5287294,0.0006302508,0.32160845],"study_design_scores_gemma":[0.0015206939,0.000119300945,0.9346338,0.000019313959,0.000014755242,0.0008685045,0.000273543,0.04525914,0.0007538274,0.0016793327,0.014170266,0.0006875357],"about_ca_topic_score_codex":0.0000050643625,"about_ca_topic_score_gemma":0.0000118508115,"teacher_disagreement_score":0.7915935,"about_ca_system_score_codex":0.000025655834,"about_ca_system_score_gemma":0.000031955333,"threshold_uncertainty_score":0.44587427},"labels":[],"label_agreement":null},{"id":"W2041745502","doi":"10.1016/j.disopt.2010.08.004","title":"Generalized resolution search","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Resolution (logic); Mathematics; Mathematical optimization; Branch and bound; Flexibility (engineering); Process (computing); Guided Local Search; Algorithm; Search algorithm; Computer science; Artificial intelligence","score_opus":0.011816408719509652,"score_gpt":0.2546175475482703,"score_spread":0.24280113882876067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041745502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004244527,0.000008267522,0.9873836,0.0013608208,0.0006043422,0.00016975799,0.0000026837354,0.00029359572,0.005932389],"genre_scores_gemma":[0.37308958,0.000029702593,0.62611467,0.00019157307,0.00008361483,0.000013287509,0.00007173539,0.000011426206,0.00039440749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.00006247719,0.00019186328,0.00029931637,0.00024403723,0.00019985017],"domain_scores_gemma":[0.9992739,0.000023093491,0.00006128454,0.00039788382,0.0001484319,0.00009540353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023044967,0.000106409374,0.00008753308,0.00014867671,0.00020210409,0.00022194548,0.00028406532,0.000093493436,0.00037994696],"category_scores_gemma":[0.00005654201,0.00010542213,0.000047805195,0.00044260695,0.000047792924,0.00077744445,0.00008047161,0.0001768784,0.000044749482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006647,0.000015805035,0.00048855075,0.0000033076658,0.000006343714,0.0000015402544,0.00022562301,0.8628638,0.0021424233,0.12124784,0.00029747427,0.012700655],"study_design_scores_gemma":[0.00031893933,0.000015243349,0.0011254238,0.0000030191502,0.0000032320008,0.000011231493,0.000013980407,0.9965625,0.0008374019,0.00022138855,0.0007495973,0.00013807816],"about_ca_topic_score_codex":0.000024691471,"about_ca_topic_score_gemma":0.000025420182,"teacher_disagreement_score":0.36884505,"about_ca_system_score_codex":0.000023446115,"about_ca_system_score_gemma":0.000064158055,"threshold_uncertainty_score":0.42989898},"labels":[],"label_agreement":null},{"id":"W2045071513","doi":"10.1145/509907.509941","title":"Models and thresholds for random constraint satisfaction problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Limiting; Constraint satisfaction problem; Class (philosophy); Constraint (computer-aided design); Constraint satisfaction; Mathematics; Computer science; Theoretical computer science; Mathematical optimization; Discrete mathematics; Statistics; Artificial intelligence; Probabilistic logic","score_opus":0.03993014091947588,"score_gpt":0.2331580747989203,"score_spread":0.19322793387944442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045071513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020695196,0.000065317,0.98622936,0.0014421602,0.00014127613,0.00042517667,0.000002405381,0.0001831004,0.00944171],"genre_scores_gemma":[0.8998114,0.00010090493,0.09939882,0.00025558568,0.000016829244,0.000040870033,0.0000012003965,0.000004408122,0.0003699861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935985,0.000015767133,0.00015936162,0.0002308488,0.000098271514,0.00013592606],"domain_scores_gemma":[0.9996134,0.000076106386,0.000044402856,0.00014637521,0.00005517795,0.0000645615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012509436,0.00008525423,0.00009887977,0.000066678804,0.000119600394,0.00014189791,0.00007192286,0.000047977333,0.00014938941],"category_scores_gemma":[0.000013382006,0.00007537684,0.000034716315,0.00009319449,0.000047511698,0.00063053257,0.000026555832,0.000044525194,0.0000070499395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006796001,0.000020928677,0.0018885372,0.00001973001,0.000018615783,5.963657e-7,0.0006406999,0.016221762,0.00025605955,0.4282022,0.0015310412,0.551193],"study_design_scores_gemma":[0.0013227126,0.00003488073,0.0007976948,0.0000060725647,0.000003878776,0.000034774384,0.000022411456,0.9828294,0.00006881126,0.014290239,0.0004791055,0.00011004107],"about_ca_topic_score_codex":0.000016363152,"about_ca_topic_score_gemma":0.00005236812,"teacher_disagreement_score":0.96660763,"about_ca_system_score_codex":0.00001657667,"about_ca_system_score_gemma":0.000009495366,"threshold_uncertainty_score":0.30737785},"labels":[],"label_agreement":null},{"id":"W2045132403","doi":"10.5555/777092.777194","title":"A mixture-model for the behaviour of SLS algorithms for SAT","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Exponential function; Markov chain; Algorithm; Computer science; Process (computing); Class (philosophy); Mathematics; Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.05030984904877013,"score_gpt":0.27690798690377405,"score_spread":0.22659813785500393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045132403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011702049,0.000032614174,0.99647915,0.0023456467,0.00014500169,0.00038179377,0.0000115280345,0.00004408439,0.00044315093],"genre_scores_gemma":[0.36354816,0.0000137712195,0.6321169,0.0004355132,0.000025736012,0.00007210991,0.000002371767,0.0000045978118,0.0037808055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957895,0.0000051141224,0.00012117642,0.00012107926,0.00007870737,0.00009499772],"domain_scores_gemma":[0.9995209,0.00013170738,0.000046393903,0.0001872119,0.000090815185,0.000022947472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099723344,0.000050686565,0.00006252879,0.00002888651,0.00007915415,0.0000345443,0.00020274761,0.000029335011,0.000049389022],"category_scores_gemma":[0.000022029204,0.000033879376,0.00007063978,0.00007710311,0.00002050236,0.00012358776,0.000023078017,0.00002303209,0.000002617288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000779556,0.00010607288,0.000522658,0.000019745554,0.000032287677,1.9730489e-7,0.0018651542,0.0288756,0.00030524845,0.13350329,0.024096569,0.81066537],"study_design_scores_gemma":[0.0002759245,0.000026444732,0.00027653732,0.0000018258318,0.000007744736,0.0000020902953,0.000016272596,0.99738944,0.00044464183,0.00083428423,0.000676238,0.000048537197],"about_ca_topic_score_codex":0.000005591488,"about_ca_topic_score_gemma":0.000019781974,"teacher_disagreement_score":0.96851385,"about_ca_system_score_codex":0.000008464751,"about_ca_system_score_gemma":0.000012020037,"threshold_uncertainty_score":0.13815609},"labels":[],"label_agreement":null},{"id":"W2045324891","doi":"10.1016/j.disc.2004.10.012","title":"Isotone relations revisited","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Mathematics; Property (philosophy); Characterization (materials science); Fixed point; Product (mathematics); Discrete mathematics; Fixed-point theorem; Combinatorics; Epistemology","score_opus":0.011928744731955357,"score_gpt":0.24924527298086396,"score_spread":0.23731652824890861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045324891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010270438,0.00003745146,0.9607755,0.0026525191,0.000045153512,0.00012565409,0.0000025646414,0.00022718821,0.0351069],"genre_scores_gemma":[0.2657935,0.00001820485,0.7316795,0.00028571137,0.000048198708,0.000008708986,0.000009002754,0.000008462711,0.0021487353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993365,0.000017038245,0.00022742782,0.00014347833,0.00015703216,0.000118526594],"domain_scores_gemma":[0.9993838,0.000056737033,0.00008623691,0.00036682218,0.00005058737,0.00005583667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012869085,0.00008060749,0.000095802665,0.00007410744,0.00010041686,0.00010397911,0.00021511571,0.000037278187,0.00031297168],"category_scores_gemma":[0.00006751914,0.00007330235,0.000047211477,0.0002683036,0.000022696286,0.0004050184,0.00005993716,0.00007198972,0.00054856314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.098293e-7,0.000049927672,0.00025109042,0.00001953571,0.000016244325,0.0000015446375,0.0020970746,0.0018703173,0.00020139692,0.9601834,0.0040326016,0.03127626],"study_design_scores_gemma":[0.0002556597,0.000015447848,0.0012714437,0.00004323237,0.000012785337,0.000028323195,0.000085857966,0.96651435,0.0002869561,0.01258646,0.018678235,0.00022123806],"about_ca_topic_score_codex":6.26952e-7,"about_ca_topic_score_gemma":0.0000031928598,"teacher_disagreement_score":0.964644,"about_ca_system_score_codex":0.00002991633,"about_ca_system_score_gemma":0.000020581108,"threshold_uncertainty_score":0.7050852},"labels":[],"label_agreement":null},{"id":"W20473298","doi":"10.1038/ncb2058","title":"Application du PNET à l'algorithme d'allocation des ressources de MacLeod et Petersen, et analyse de la valeur acquise en contexte d'interdépendance des chemins","year":2010,"lang":"en","type":"article","venue":"Nature Cell Biology","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Political science","score_opus":0.003627746467004969,"score_gpt":0.2666861186790706,"score_spread":0.2630583722120656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20473298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4188881,0.00014581246,0.57812256,0.0005690567,0.00013788475,0.00011317057,0.000009029495,0.00012189304,0.0018925187],"genre_scores_gemma":[0.8994613,0.00023213649,0.099132985,0.00095544267,0.00007098706,0.000019785213,0.000057456888,0.00000970477,0.000060194725],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99874395,0.00035578696,0.00019000462,0.0003900886,0.000076395976,0.0002437473],"domain_scores_gemma":[0.9988784,0.00040264407,0.00014812057,0.00033199677,0.00014486467,0.00009396218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455198,0.00015415241,0.00014346727,0.00012077917,0.00015934116,0.00009903312,0.00045413044,0.00044662206,0.000026705957],"category_scores_gemma":[0.00025094592,0.0001457495,0.000060219918,0.00024852823,0.00033851212,0.00023824374,0.00009106117,0.0006361935,0.000013423487],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027491904,0.00009926823,0.035281584,0.000032108957,0.000030453533,0.000005633913,0.005341364,0.00069217023,0.8018046,0.012062004,0.00014136072,0.14448193],"study_design_scores_gemma":[0.0016283103,0.00018162478,0.4159252,0.000050021343,0.00006797186,0.00038215646,0.0003455453,0.2696122,0.26377267,0.013384517,0.033839893,0.0008098781],"about_ca_topic_score_codex":0.00007030622,"about_ca_topic_score_gemma":0.0004111066,"teacher_disagreement_score":0.53803194,"about_ca_system_score_codex":0.00006737145,"about_ca_system_score_gemma":0.000081222715,"threshold_uncertainty_score":0.5943492},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005996719707171033,"score_gpt":0.22160962294414435,"score_spread":0.21561290323697332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047467760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.314379,0.0029124452,0.6772009,0.002473271,0.0004632635,0.0006627478,0.000011735864,0.00019313343,0.0017034872],"genre_scores_gemma":[0.9569929,0.0006382672,0.041939545,0.00027991703,0.00007761501,0.000006756823,0.0000031167203,0.0000058565315,0.00005597995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918824,0.00004054911,0.00020182863,0.00026502743,0.00012655949,0.00017780164],"domain_scores_gemma":[0.9996022,0.00010464252,0.000051169365,0.00013423854,0.000022368418,0.0000853724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497027,0.0001315614,0.00021023669,0.00013916564,0.000115156734,0.00015482352,0.000108586966,0.00005737435,0.00002661591],"category_scores_gemma":[0.000025358884,0.00010468557,0.000037257083,0.0001458161,0.00006816487,0.00034376158,0.000058244594,0.000105130384,9.3218455e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011449998,0.000009977838,0.002953678,0.000010400109,0.000015904823,0.000006974883,0.00068424427,0.0012114361,0.00013663911,0.017647527,0.00010574231,0.977103],"study_design_scores_gemma":[0.04240464,0.000108604305,0.11718741,0.00004546648,0.000023243905,0.00031958445,0.00015564117,0.8058005,0.0009096539,0.021969747,0.010426752,0.00064875814],"about_ca_topic_score_codex":0.00004060765,"about_ca_topic_score_gemma":0.00010754398,"teacher_disagreement_score":0.9764542,"about_ca_system_score_codex":0.000010416044,"about_ca_system_score_gemma":0.000019265059,"threshold_uncertainty_score":0.42689535},"labels":[],"label_agreement":null},{"id":"W2050154860","doi":"10.1111/1467-9671.00132","title":"Handling Grammatical Errors, Ambiguity and Impreciseness in GIS Natural Language Queries","year":2003,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Executable; Ambiguity; Natural language; Natural language user interface; Query language; Parsing; RDF query language; Natural language processing; Artificial intelligence; Query expansion; Web query classification; Information retrieval; Web search query; Programming language; Search engine","score_opus":0.009359019516030484,"score_gpt":0.24946096061299164,"score_spread":0.24010194109696115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050154860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18744455,0.00015846115,0.81104344,0.00037752689,0.00029684923,0.00012075355,0.0000025659745,0.00007405066,0.00048178053],"genre_scores_gemma":[0.96500015,0.00004838971,0.034752276,0.000041060153,0.0000048159213,0.000014474176,0.0000016089467,0.0000047651392,0.00013243625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919105,0.000091804584,0.00021216586,0.00021926984,0.000112197355,0.00017354169],"domain_scores_gemma":[0.99965376,0.00008108422,0.000026836193,0.000171026,0.000020875614,0.000046423644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020953955,0.00009665346,0.00013022467,0.00018615858,0.000087699984,0.000081577695,0.00009737906,0.0000628304,0.00008239614],"category_scores_gemma":[0.00004150471,0.00009900986,0.000030012327,0.0004473786,0.00007013873,0.00041878675,0.0000057201473,0.00020899656,0.0000033032854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043221848,0.00033967532,0.024622642,0.0001192915,0.00003816859,0.00009330666,0.024439521,0.0150083685,0.003627769,0.036450405,0.000019177594,0.89519846],"study_design_scores_gemma":[0.004815742,0.00011216198,0.26451927,0.00024412376,0.00003797918,0.00036841896,0.0053209085,0.7038426,0.01204348,0.0056277593,0.0016850794,0.0013824739],"about_ca_topic_score_codex":0.0003472639,"about_ca_topic_score_gemma":0.004255828,"teacher_disagreement_score":0.893816,"about_ca_system_score_codex":0.000058377995,"about_ca_system_score_gemma":0.000046500176,"threshold_uncertainty_score":0.4037505},"labels":[],"label_agreement":null},{"id":"W2051509629","doi":"10.1109/icpr.2010.71","title":"Automated Quality Assurance for Document Logical Analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xerox (Canada)","funders":"Seventh Framework Programme","keywords":"Computer science; Information retrieval; Document Structure Description; Quality assurance; Quality (philosophy); Document image processing; Homogeneous; Document layout analysis; Document processing; Document management system; Image (mathematics); Artificial intelligence; World Wide Web; XML; Image segmentation; Engineering","score_opus":0.01958294894583518,"score_gpt":0.3234415987748135,"score_spread":0.3038586498289783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051509629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012444414,0.0000010259399,0.9821512,0.0017006,0.00021371372,0.00010743552,0.0000018663932,0.00062913884,0.0027505658],"genre_scores_gemma":[0.697896,7.0492206e-7,0.30154905,0.0002297702,0.000010167021,0.000011126003,0.0000045455536,9.624888e-7,0.00029766883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999377,0.000026988753,0.00016782721,0.0002056286,0.00011676791,0.0001057955],"domain_scores_gemma":[0.99942154,0.00013262425,0.000052965454,0.00025221912,0.00008695205,0.000053688203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030926664,0.00005445696,0.00010309275,0.00007200291,0.00006985475,0.00011582434,0.00018439711,0.000043101514,0.0003528542],"category_scores_gemma":[0.00008078866,0.000043290795,0.00009046211,0.00042884194,0.000019422016,0.00020458584,0.000029714663,0.000050205428,0.000018177663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008044556,0.00007274962,0.02653976,0.0000090927315,0.00019741827,9.850137e-7,0.00012570106,0.0076860073,0.0033479657,0.8920294,0.0025172834,0.067465566],"study_design_scores_gemma":[0.00019561536,0.000012106136,0.21287046,3.9212216e-7,0.000017448458,0.0000011105689,0.000004584732,0.7830005,0.0005237584,0.0013565492,0.0019218808,0.000095583724],"about_ca_topic_score_codex":0.000030271596,"about_ca_topic_score_gemma":0.00040998767,"teacher_disagreement_score":0.89067286,"about_ca_system_score_codex":0.000009373223,"about_ca_system_score_gemma":0.000026216703,"threshold_uncertainty_score":0.3863506},"labels":[],"label_agreement":null},{"id":"W2051870742","doi":"10.1016/j.ins.2003.07.013","title":"Fuzzy semantics for direction relations between composite regions","year":2003,"lang":"en","type":"article","venue":"Information Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Relation (database); Fuzzy logic; Semantics (computer science); Spatial relation; Simple (philosophy); Computer science; Cardinal direction; Metric (unit); Artificial intelligence; Theoretical computer science; Mathematics; Algebra over a field; Data mining; Pure mathematics; Programming language; Geography; Engineering; Epistemology","score_opus":0.03183254085158612,"score_gpt":0.2774897033615613,"score_spread":0.24565716250997519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051870742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016202715,0.000008055173,0.9543048,0.0019928326,0.0003897026,0.00021635639,0.0000059835606,0.00016786125,0.041294105],"genre_scores_gemma":[0.8412709,0.0000071350582,0.15821603,0.0002763755,0.00002158612,0.000021743477,0.000014308129,0.0000017793818,0.00017011147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991337,0.000041715968,0.00030163658,0.00012262157,0.00024615292,0.0001541479],"domain_scores_gemma":[0.99925613,0.00018704702,0.00017624689,0.00014818984,0.00017483502,0.000057542555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058893656,0.00007319115,0.00007774358,0.00026587353,0.000736627,0.00039804805,0.00022288885,0.00004560766,0.000010658943],"category_scores_gemma":[0.00019112322,0.000068606496,0.000046242392,0.00081991183,0.00009571946,0.0037976955,0.00002057411,0.000053042295,0.00007504566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.733659e-7,0.000008307123,0.012910575,0.0000069315865,0.0000068614227,4.4463963e-8,0.0009811552,0.009224592,0.000028686938,0.94665104,0.0018778959,0.028303126],"study_design_scores_gemma":[0.0014772955,0.00025902494,0.12823635,0.00007136019,0.000042454016,0.00006056171,0.0010833615,0.35988754,0.00245413,0.13891612,0.3665888,0.00092299154],"about_ca_topic_score_codex":0.000008113388,"about_ca_topic_score_gemma":0.000007631203,"teacher_disagreement_score":0.83965063,"about_ca_system_score_codex":0.000037047204,"about_ca_system_score_gemma":0.00011423299,"threshold_uncertainty_score":0.56656134},"labels":[],"label_agreement":null},{"id":"W2053009572","doi":"10.1007/s00186-010-0331-4","title":"On generalized balanced optimization problems","year":2010,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bottleneck; Mathematical optimization; Mathematics; Time complexity; Polynomial; Optimization problem; Computational complexity theory; Computer science; Algorithm","score_opus":0.10040407256373958,"score_gpt":0.46222535305356693,"score_spread":0.36182128048982737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053009572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032864935,0.0000042787815,0.9855482,0.0016534668,0.00013722837,0.00047137236,0.0000019872482,0.00007734539,0.008819612],"genre_scores_gemma":[0.043908417,0.000008006991,0.95547587,0.000059825412,0.000023862185,0.000102549384,0.0000044746894,0.00000982783,0.00040718928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978953,0.0006549955,0.0003873573,0.00029314324,0.0005305016,0.0002386993],"domain_scores_gemma":[0.9976879,0.0009228335,0.000031720807,0.00064527354,0.0005973648,0.000114931536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032452256,0.00009945183,0.0001912104,0.0003404432,0.00025374134,0.0002171385,0.0004975999,0.000100777776,0.0010944655],"category_scores_gemma":[0.0027267102,0.00008196241,0.0000539362,0.00081310264,0.00016934038,0.00031763085,0.0001297804,0.0004239603,0.000056689212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003193802,0.00012232648,0.000004264827,0.000020312073,0.0000070444676,3.5708183e-7,0.00023104927,0.18319634,0.02235978,0.7771891,0.0000801869,0.016786078],"study_design_scores_gemma":[0.00025260053,0.000073202325,0.00003330322,0.000019369394,0.0000018776109,0.000006417657,0.000014957248,0.946156,0.010867008,0.04238769,0.000103607286,0.000083939485],"about_ca_topic_score_codex":0.00000832378,"about_ca_topic_score_gemma":0.000010666474,"teacher_disagreement_score":0.76295966,"about_ca_system_score_codex":0.000022264703,"about_ca_system_score_gemma":0.00011944547,"threshold_uncertainty_score":0.9998187},"labels":[],"label_agreement":null},{"id":"W2056710678","doi":"10.1007/bf03037573","title":"From eager to lazy constrained data acquisition: A general framework","year":2001,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Patient Safety Institute","keywords":"Computer science; Lazy evaluation; Programming language; Functional programming","score_opus":0.05510647354240323,"score_gpt":0.3076926848245852,"score_spread":0.252586211282182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056710678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04366596,0.0000367793,0.9474041,0.006092374,0.0014782781,0.00018398468,0.000012657121,0.00032283788,0.00080301915],"genre_scores_gemma":[0.36426744,0.00000537034,0.6281772,0.004089576,0.0030161722,0.0000015398447,0.00020405676,0.00000947762,0.00022916231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827665,0.000091047994,0.00036984743,0.00069811154,0.00030551074,0.00025880776],"domain_scores_gemma":[0.998483,0.00011276696,0.000115323666,0.0009482372,0.00011153232,0.00022916475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023501251,0.00016985787,0.00016232843,0.000120839715,0.00029228264,0.0005760576,0.0007221228,0.00010244391,0.00048134025],"category_scores_gemma":[0.00010011403,0.00018803612,0.000038150225,0.00056746026,0.000020399535,0.0005847722,0.00042119462,0.00014778902,0.0001748207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009504846,0.000044600874,0.0019746502,0.0000022461447,0.00004288623,0.000029824289,0.0017512518,0.13851811,0.0070790434,0.030842539,0.040558405,0.7791469],"study_design_scores_gemma":[0.0003425629,0.00002951414,0.0021613135,0.000023926123,0.0000068156914,0.000022704853,0.00002450175,0.98665774,0.00050679565,0.0009780307,0.009003441,0.00024264537],"about_ca_topic_score_codex":0.00013829065,"about_ca_topic_score_gemma":0.00005035708,"teacher_disagreement_score":0.84813964,"about_ca_system_score_codex":0.000051363924,"about_ca_system_score_gemma":0.0001744759,"threshold_uncertainty_score":0.7667891},"labels":[],"label_agreement":null},{"id":"W2058170847","doi":"10.1145/1810891.1810914","title":"Constraint satisfaction problems and global cardinality constraints","year":2010,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint satisfaction; Constraint (computer-aided design); Set (abstract data type); Mathematics; Local consistency; Mathematical optimization; Constraint logic programming; Complexity of constraint satisfaction; Backtracking; Computer science; Constraint programming","score_opus":0.03179045529978212,"score_gpt":0.28164370821130946,"score_spread":0.24985325291152735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058170847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6209995,0.00046950157,0.15479048,0.17741495,0.002216316,0.0018536894,0.00015665978,0.0005382602,0.041560642],"genre_scores_gemma":[0.8100886,0.00003905934,0.1897631,0.00008383814,0.0000058732894,0.000009452461,0.0000018173051,0.000002049099,0.0000062273184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992453,0.00012024867,0.00023621172,0.00016011015,0.00013629693,0.00010183357],"domain_scores_gemma":[0.98765266,0.00015051429,0.00017025763,0.011826378,0.00014710137,0.00005308488],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003429816,0.00008316868,0.00010920198,0.00002901844,0.00026846508,0.00006777173,0.0063683153,0.0000628344,0.000020982645],"category_scores_gemma":[0.0020334215,0.000068286034,0.000057668716,0.00026849326,0.001048207,0.00023055536,0.006005117,0.00022910332,0.0000041859903],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017343248,0.000045337856,0.2331157,0.000016019387,0.000038197326,1.092083e-7,0.00041139056,0.000072647665,0.004001103,0.49815327,0.0005623035,0.26358217],"study_design_scores_gemma":[0.00037055806,0.000018804098,0.8370629,0.00002981752,0.000021729025,0.00012908266,0.00010322837,0.00573556,0.00040703523,0.15408628,0.0018745987,0.00016038632],"about_ca_topic_score_codex":0.00013156752,"about_ca_topic_score_gemma":0.0006119335,"teacher_disagreement_score":0.6039472,"about_ca_system_score_codex":0.000025670992,"about_ca_system_score_gemma":0.000094418814,"threshold_uncertainty_score":0.9990077},"labels":[],"label_agreement":null},{"id":"W2059768731","doi":"10.1023/b:aire.0000007179.60276.39","title":"Reasoning with Numeric and Symbolic Time Information","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint satisfaction problem; Qualitative reasoning; Tabu search; Constraint satisfaction; Constraint satisfaction dual problem; Metric (unit); Constraint (computer-aided design); Scheduling (production processes); Constraint programming; Theoretical computer science; Local consistency; Mathematical optimization; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.014527732238881166,"score_gpt":0.24809795245565738,"score_spread":0.2335702202167762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059768731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028161946,0.0039519398,0.9892372,0.000598441,0.000057180052,0.00024212987,3.716375e-7,0.00008502939,0.0055460846],"genre_scores_gemma":[0.5613497,0.110389076,0.3201238,0.0076747457,0.000060598624,0.00012505552,0.0000205719,0.000028495822,0.00022799596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999286,0.000064303735,0.00025710315,0.00013612826,0.0001275635,0.00012890702],"domain_scores_gemma":[0.9995237,0.000036261034,0.00010083908,0.00019105068,0.000084242034,0.000063890126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029804144,0.00008794913,0.00013416375,0.000053787116,0.000096017444,0.00012376432,0.000108892316,0.000021258023,0.00016468504],"category_scores_gemma":[0.00014662705,0.000071747934,0.000021559668,0.00049079186,0.000038720787,0.0008876367,0.00001872336,0.00006333699,0.0004247452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.0746277e-7,0.0000052785967,0.000060858973,0.000067572066,0.0000036199494,6.734963e-7,0.00010548006,0.00008623574,0.000008962277,0.21669446,0.00004650941,0.78291976],"study_design_scores_gemma":[0.00023749722,0.0007800917,0.002289179,0.0128378095,0.00025903332,0.0018426316,0.0006449618,0.5057795,0.014764684,0.040485527,0.41675457,0.0033244928],"about_ca_topic_score_codex":0.000006270507,"about_ca_topic_score_gemma":0.0000025203606,"teacher_disagreement_score":0.77959526,"about_ca_system_score_codex":0.000015517566,"about_ca_system_score_gemma":0.000052853382,"threshold_uncertainty_score":0.5459382},"labels":[],"label_agreement":null},{"id":"W2062540065","doi":"10.1007/s10601-013-9140-8","title":"View-based propagation of decomposable constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Propagator; Constraint (computer-aided design); Decomposition; Local consistency; Simple (philosophy); Decomposition method (queueing theory); Code (set theory)","score_opus":0.011620119285205061,"score_gpt":0.22887508763400452,"score_spread":0.21725496834879945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062540065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01637473,0.000020138368,0.96396434,0.00092767115,0.00031607083,0.00056485314,0.00000741796,0.0001915207,0.017633272],"genre_scores_gemma":[0.9073935,0.000003886761,0.09216635,0.00031661202,0.000015042781,0.000033019816,0.000010829899,0.00000749459,0.00005324659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986414,0.000083927735,0.00043409728,0.00032149153,0.0002620375,0.00025709116],"domain_scores_gemma":[0.99879295,0.00011929696,0.00021745729,0.0004024926,0.00033400132,0.00013381038],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022308985,0.00015846582,0.00021200882,0.00017266285,0.000087040076,0.00011299199,0.00038043124,0.00008466564,0.00268695],"category_scores_gemma":[0.00009987126,0.00015508756,0.00008088694,0.00036134175,0.00062005676,0.0005777942,0.000053036045,0.00011019386,0.0003012465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003071744,0.00011239256,0.005308622,0.00005187748,0.000026673915,0.000004462165,0.00016724753,0.0008118472,0.0105017265,0.066639416,0.00081530935,0.9155573],"study_design_scores_gemma":[0.0050418954,0.00036478735,0.087809175,0.0004386121,0.0000453102,0.00020422584,0.00037959495,0.7929216,0.09611066,0.013097631,0.0020734356,0.0015130795],"about_ca_topic_score_codex":0.0000148693925,"about_ca_topic_score_gemma":0.0000041256985,"teacher_disagreement_score":0.91404426,"about_ca_system_score_codex":0.00004051045,"about_ca_system_score_gemma":0.00029867626,"threshold_uncertainty_score":0.99822474},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05440909133257375,"score_gpt":0.293218237044864,"score_spread":0.23880914571229023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062671967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10624969,0.00011099328,0.8907408,0.0005283755,0.00077109947,0.00021423117,0.0000011368315,0.000012625324,0.0013710397],"genre_scores_gemma":[0.9075145,0.0000029616021,0.09234968,0.000069165515,0.000051070387,0.0000023891143,8.160926e-8,0.000001778276,0.000008367743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985802,0.0001378821,0.0004802995,0.0002261437,0.00037480504,0.00020066225],"domain_scores_gemma":[0.9992278,0.000172186,0.00017346597,0.00013125471,0.0001988239,0.00009645084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027594266,0.00009277017,0.0002426959,0.00022020993,0.0001974216,0.00038531006,0.00036274915,0.000043370015,0.0000060602288],"category_scores_gemma":[0.000027118844,0.00006938839,0.00007090343,0.00041327497,0.00018587841,0.0006696031,0.00005067446,0.00011502876,4.5965797e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003993714,0.00020268171,0.1376455,0.00027959014,0.000030290004,0.0000273215,0.0025957006,0.013758213,0.000082249186,0.8041597,0.0006712522,0.04050759],"study_design_scores_gemma":[0.0011930146,0.00090010953,0.05915838,0.00024545848,0.000006208176,0.0006248533,0.00035816355,0.92588294,0.00017807233,0.010702087,0.0005141361,0.00023656228],"about_ca_topic_score_codex":0.0000067369574,"about_ca_topic_score_gemma":0.00002341101,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.00005639738,"about_ca_system_score_gemma":0.00023369698,"threshold_uncertainty_score":0.3715554},"labels":[],"label_agreement":null},{"id":"W2065446266","doi":"10.1016/s0004-3702(01)00119-9","title":"A comparison of point-based approaches to qualitative temporal reasoning","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semantic reasoner; Computer science; Graph; Theoretical computer science; Heuristic; Point (geometry); Artificial intelligence; Mathematics","score_opus":0.30808437359377266,"score_gpt":0.3989348752321367,"score_spread":0.09085050163836406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065446266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03505759,0.0000150457945,0.96121764,0.0019963249,0.0001419913,0.00016735203,0.0000015519245,0.000087646105,0.0013148718],"genre_scores_gemma":[0.8207944,6.9624e-7,0.179027,0.0001218471,0.000017136123,0.000009892142,0.000002891578,0.00000436632,0.000021764828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987328,0.00013327399,0.00043812642,0.00028632442,0.00022732197,0.00018216472],"domain_scores_gemma":[0.9991851,0.0001940205,0.00014449879,0.00028067338,0.000100595185,0.00009510282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046700003,0.00010475776,0.00017843618,0.00015967754,0.00009196312,0.0000728161,0.00032541036,0.00004164398,0.00007637628],"category_scores_gemma":[0.0002116858,0.000106534535,0.00005524757,0.000758908,0.00007856626,0.0002485794,0.00005678901,0.00008830518,0.00008402113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055849672,0.00021782985,0.0077266544,0.000010211418,0.000012027689,0.0000036102651,0.02998817,0.07183792,0.00078961445,0.5197497,0.000088338646,0.3695201],"study_design_scores_gemma":[0.000024998053,0.00016886453,0.00046941862,0.00003811103,0.0000040580776,0.0000027708115,0.007185714,0.9129878,0.06905611,0.009651261,0.0002157989,0.00019505434],"about_ca_topic_score_codex":0.00012373504,"about_ca_topic_score_gemma":0.0001858713,"teacher_disagreement_score":0.8411499,"about_ca_system_score_codex":0.000032306514,"about_ca_system_score_gemma":0.00007103555,"threshold_uncertainty_score":0.43443522},"labels":[],"label_agreement":null},{"id":"W2071500750","doi":"10.1145/2739482.2764898","title":"Empirical Scaling Analyser","year":2015,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Analyser; Scaling; Solver; Heuristic; Empirical research; Key (lock); Time complexity; Computational complexity theory; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.08652012247492252,"score_gpt":0.3297659059274811,"score_spread":0.2432457834525586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071500750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036578719,0.000005362283,0.9580095,0.0021214008,0.0001332725,0.000017762279,5.034567e-8,0.00014128529,0.035913497],"genre_scores_gemma":[0.802952,7.108425e-7,0.19528794,0.0010383677,0.00002297188,8.323206e-7,6.077346e-7,0.0000014002229,0.0006951589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996356,0.000017559698,0.000068916095,0.00010250724,0.00011071168,0.000064746135],"domain_scores_gemma":[0.9997016,0.000012634487,0.000012885106,0.0001306801,0.000054637298,0.0000875559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011181283,0.000030346719,0.00003687628,0.000045551187,0.000021881642,0.000067294844,0.00011288348,0.000017500455,0.00007622661],"category_scores_gemma":[0.00002816059,0.000024797357,0.000017570454,0.000215434,0.000009085125,0.00022260718,0.00004145758,0.000027895914,0.00013858068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007657636,0.0001008635,0.23174223,0.000003625209,0.000039578794,0.000023747689,0.0028965625,0.034532268,0.00012957845,0.15693967,0.07699936,0.49658483],"study_design_scores_gemma":[0.00025322675,0.000014763774,0.0151456585,0.0000014828112,0.0000023407658,0.000015185834,0.00007791981,0.970493,0.00029635485,0.0022512346,0.011340726,0.00010808918],"about_ca_topic_score_codex":0.000008293415,"about_ca_topic_score_gemma":0.000007278966,"teacher_disagreement_score":0.93596077,"about_ca_system_score_codex":0.000016603593,"about_ca_system_score_gemma":0.00004425072,"threshold_uncertainty_score":0.17812206},"labels":[],"label_agreement":null},{"id":"W2072384654","doi":"10.1007/s10601-007-9026-8","title":"A Constraint-Based Autonomous 3D Camera System","year":2007,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Exploit; Computer science; Constraint (computer-aided design); Cinematography; Solver; Constraint satisfaction problem; Digital camera; Constraint satisfaction; Smart camera; Simple (philosophy); Computer vision; Artificial intelligence; Computer graphics (images); Real-time computing; Engineering; Programming language; Computer security","score_opus":0.011346852216264703,"score_gpt":0.23404778957776173,"score_spread":0.22270093736149704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072384654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028260096,0.000025221363,0.9154866,0.00034975712,0.00084629486,0.00028319456,0.000012078891,0.00084902,0.079321854],"genre_scores_gemma":[0.8869795,8.74783e-7,0.11229827,0.0005701875,0.00005810901,0.000008308433,0.0000081100825,0.0000121441235,0.00006448062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981108,0.00006425595,0.00049157074,0.00049907167,0.00031632942,0.0005179736],"domain_scores_gemma":[0.99860424,0.00021403054,0.00018221901,0.00053946825,0.00017411538,0.00028593608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076494913,0.0002328615,0.00023874262,0.00028009742,0.00020700712,0.00018869886,0.00048472034,0.00013890772,0.00030699768],"category_scores_gemma":[0.00007609571,0.00024379398,0.00010901413,0.00044629892,0.00050019496,0.00029020736,0.00006439014,0.0002110842,0.0002544905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010548914,0.00005965008,0.0020226946,0.000044606266,0.00003493065,0.00031130962,0.0002784656,0.00066647783,0.0014242976,0.22178629,0.0001852156,0.7731755],"study_design_scores_gemma":[0.010006765,0.0004716332,0.034525372,0.0007150206,0.000121232464,0.0056677167,0.0034690686,0.90047526,0.020280618,0.0006894101,0.019779678,0.003798201],"about_ca_topic_score_codex":0.000015552134,"about_ca_topic_score_gemma":0.000018315095,"teacher_disagreement_score":0.8998088,"about_ca_system_score_codex":0.00022224507,"about_ca_system_score_gemma":0.00048473035,"threshold_uncertainty_score":0.99416304},"labels":[],"label_agreement":null},{"id":"W2075882455","doi":"10.1142/s0218213004001673","title":"A HOPFIELD-TYPE NEURAL NETWORK BASED MODEL FOR TEMPORAL CONSTRAINTS","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Mathematical optimization; Artificial neural network; Constraint (computer-aided design); Hopfield network; Scheduling (production processes); Type (biology); Constraint satisfaction problem; Process (computing); Property (philosophy); Artificial intelligence; Mathematics","score_opus":0.08868863193232461,"score_gpt":0.3315453067197102,"score_spread":0.2428566747873856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075882455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033664485,0.000029632156,0.9886613,0.0050970567,0.0024986262,0.00015706859,0.000008190951,0.00003609956,0.00014557496],"genre_scores_gemma":[0.77167696,0.000011738631,0.22698165,0.0009489333,0.0003534357,0.0000030728377,0.000005104468,0.000006530054,0.000012562435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983915,0.000029403014,0.00072402833,0.000185287,0.00045745683,0.00021230613],"domain_scores_gemma":[0.9979462,0.00019431942,0.00042006542,0.00014580158,0.0011827664,0.00011085619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045938944,0.00013214072,0.00017696223,0.00018773817,0.000087370514,0.00037688215,0.000814214,0.00007440998,0.00008364872],"category_scores_gemma":[0.00036856244,0.00012552219,0.00018654585,0.00021755509,0.00010477572,0.0008680132,0.00004941977,0.00018878658,0.000013431167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089804635,0.0000494009,0.00005796908,0.000001444295,0.000027429252,0.000018041448,0.00013566078,0.70915514,0.00017766537,0.062128816,0.0001028662,0.22805579],"study_design_scores_gemma":[0.0001680237,0.00015578949,0.0000430843,0.000043798846,0.000008548026,0.00007940193,0.000046558755,0.9293423,0.0024512978,0.067357205,0.00017168267,0.00013227599],"about_ca_topic_score_codex":0.0000063006355,"about_ca_topic_score_gemma":0.000043565607,"teacher_disagreement_score":0.76831055,"about_ca_system_score_codex":0.00011128734,"about_ca_system_score_gemma":0.0005130438,"threshold_uncertainty_score":0.51186466},"labels":[],"label_agreement":null},{"id":"W2076508696","doi":"10.1016/j.tcs.2005.11.008","title":"Efficient transitive closure of sparse matrices over closed semirings","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transitive closure; Semiring; Transitive relation; Closure (psychology); Transitive reduction; Kleene algebra; Mathematics; Data structure; Sparse matrix; Combinatorics; Computer science; Discrete mathematics; Algorithm; Programming language","score_opus":0.005652773324240412,"score_gpt":0.2308221720461556,"score_spread":0.2251693987219152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076508696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21903092,0.000017421473,0.7776124,0.00082944124,0.00019854384,0.00012302266,0.0000021230617,0.000109562556,0.0020765772],"genre_scores_gemma":[0.82308704,0.0000038289395,0.17654009,0.00029898272,0.00005928176,0.0000017437005,3.3581344e-7,0.000004015798,0.0000046518953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810475,0.00006959432,0.00031182298,0.00049963914,0.00066627905,0.00034792957],"domain_scores_gemma":[0.9989286,0.00015666606,0.00010213458,0.0004349794,0.00020338401,0.00017425799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008126767,0.00014635744,0.0001842729,0.00023128529,0.00018355092,0.00014977342,0.0009638992,0.000049379436,0.0001240719],"category_scores_gemma":[0.000032013504,0.000125394,0.000079648846,0.0011472891,0.0015536936,0.00033409722,0.00025272585,0.00013499707,0.000035250538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009148631,0.000069747795,0.0001909454,0.0000064998217,0.000003860387,0.0000028726995,0.0010904606,0.02942936,0.0012107139,0.90006965,0.000019778035,0.067896955],"study_design_scores_gemma":[0.00032894895,0.00008352429,0.007352962,0.000028245671,0.000005519383,0.00002132044,0.00000765453,0.98172486,0.007175139,0.0030315025,0.00007446316,0.00016583753],"about_ca_topic_score_codex":0.0000025846205,"about_ca_topic_score_gemma":0.0000010509799,"teacher_disagreement_score":0.95229554,"about_ca_system_score_codex":0.000055213077,"about_ca_system_score_gemma":0.00011553675,"threshold_uncertainty_score":0.5724649},"labels":[],"label_agreement":null},{"id":"W2076905458","doi":"10.1016/j.jal.2012.02.001","title":"Reasoning about visibility","year":2012,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary relation; Computer science; Domain (mathematical analysis); Visibility; Sequence (biology); Modal logic; Algorithm; Modal; Polynomial; Firewall (physics); Theoretical computer science; Time complexity; Mathematics; Discrete mathematics; Geometry","score_opus":0.015345888575778484,"score_gpt":0.25432082142577206,"score_spread":0.23897493284999358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076905458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03168842,0.00011078691,0.93931764,0.00028813444,0.0004846897,0.000051376603,1.673877e-7,0.000032024822,0.02802678],"genre_scores_gemma":[0.8639013,0.000015404674,0.13564317,0.00029312496,0.0001308688,5.223587e-7,1.3198812e-7,0.000001964956,0.000013498126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993492,0.000019386694,0.00024348815,0.00006763621,0.00017854627,0.00014177801],"domain_scores_gemma":[0.999401,0.00004273711,0.0002465201,0.00013838132,0.00006822274,0.00010314536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062215986,0.000057281788,0.000109321234,0.00006931475,0.000054408087,0.00005049903,0.00020381871,0.00003686995,0.000084414474],"category_scores_gemma":[0.000035589263,0.000044453132,0.00005147129,0.00015692002,0.000020236104,0.00037594477,0.000040236853,0.00013929371,0.000025067564],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003729479,0.00015864875,0.013547562,0.000011629733,0.000032740143,0.000006264828,0.001501315,0.0033688706,0.0022832484,0.70537746,0.0011063435,0.2725686],"study_design_scores_gemma":[0.0031045738,0.0003624104,0.83957756,0.00009419049,0.00007579924,0.0011177639,0.00075772137,0.034578007,0.008023645,0.08258309,0.028766695,0.0009585689],"about_ca_topic_score_codex":4.9835734e-7,"about_ca_topic_score_gemma":3.1631564e-7,"teacher_disagreement_score":0.8322129,"about_ca_system_score_codex":0.000043799297,"about_ca_system_score_gemma":0.000037763653,"threshold_uncertainty_score":0.18127462},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017762250527346056,"score_gpt":0.24741021446436245,"score_spread":0.2296479639370164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076946745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035752453,0.000040713545,0.9592411,0.0031351408,0.00010273866,0.00014404127,0.0000020003426,0.00006953243,0.0015122836],"genre_scores_gemma":[0.98451793,0.000091389586,0.01505792,0.00031453054,0.0000058934684,0.0000016388258,0.0000067216793,7.2576046e-7,0.0000032570645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.000031772808,0.00026997895,0.00006688283,0.00012417028,0.000071473114],"domain_scores_gemma":[0.99953574,0.00006052597,0.00017512332,0.000074168696,0.00011738669,0.00003705882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017519596,0.00006212114,0.00006926864,0.00007454691,0.00019901508,0.00019941172,0.000050967108,0.000029010096,0.0000027838832],"category_scores_gemma":[0.00002840045,0.000049655624,0.000015037566,0.00012856691,0.00016657483,0.001086296,0.000019374342,0.000050785024,0.0000025740658],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037322093,0.0000022993536,0.0004122739,0.000004029826,0.000002588119,3.8251653e-8,0.0005293504,0.0005560817,0.000021745343,0.22171587,0.00005092119,0.7767011],"study_design_scores_gemma":[0.00041273647,0.000079611804,0.4422566,0.000011677832,0.0000035076544,0.00003480892,0.00034321428,0.5223083,0.0001160484,0.033729836,0.0006145247,0.000089137706],"about_ca_topic_score_codex":0.000015607664,"about_ca_topic_score_gemma":0.000011081273,"teacher_disagreement_score":0.94876546,"about_ca_system_score_codex":0.000012787635,"about_ca_system_score_gemma":0.000027091774,"threshold_uncertainty_score":0.20248976},"labels":[],"label_agreement":null},{"id":"W2078196199","doi":"10.1109/5992.919266","title":"Challenges in mathematical computing","year":2001,"lang":"en","type":"article","venue":"Computing in Science & Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Mathematical model; Data science; Algorithm; Mathematics","score_opus":0.03849938075170856,"score_gpt":0.2714442866441763,"score_spread":0.23294490589246775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078196199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22602473,0.00010186496,0.7701546,0.0003092175,0.00028913355,0.00008251176,2.6661768e-8,0.00019140566,0.0028465313],"genre_scores_gemma":[0.8910787,0.000029462113,0.10882456,0.000026405458,0.000031314798,9.896406e-7,1.0134992e-7,0.0000054406605,0.0000030027172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843615,0.000019468347,0.00032474688,0.0004424298,0.0003085103,0.00046868695],"domain_scores_gemma":[0.99935776,0.00016839344,0.00004943969,0.0002952102,0.000042662083,0.00008651427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013472496,0.00012381405,0.00016068888,0.0005938762,0.00008200698,0.00015913663,0.00069136074,0.00003855634,0.0000049435434],"category_scores_gemma":[0.00026654312,0.00013433555,0.000024246734,0.0016950022,0.00006796277,0.0005244965,0.00028689377,0.00020275112,0.000015589932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.999356e-7,0.00003046361,0.008546162,0.000011643774,7.640286e-7,0.000034717188,0.0021529617,0.72793144,0.0007106777,0.12811531,0.00000100322,0.13246438],"study_design_scores_gemma":[0.00014946415,0.0000080832,0.0953958,0.0001226794,2.768549e-7,0.00007395093,0.00007192089,0.9035707,0.00010768977,0.00029183997,0.00007081269,0.00013677235],"about_ca_topic_score_codex":0.000004222975,"about_ca_topic_score_gemma":0.000008328749,"teacher_disagreement_score":0.66505396,"about_ca_system_score_codex":0.00015095668,"about_ca_system_score_gemma":0.00006437587,"threshold_uncertainty_score":0.5478045},"labels":[],"label_agreement":null},{"id":"W2082779900","doi":"10.1007/s10601-012-9119-x","title":"Improved filtering for weighted circuit constraints","year":2012,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Relaxation (psychology); Constraint satisfaction problem; Computer science; Travelling salesman problem; Search tree; Linear programming relaxation; Bounding overwatch; Domain (mathematical analysis); Context (archaeology); Mathematical optimization; Solver; Tree (set theory); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Constraint logic programming; Routing (electronic design automation); Lagrangian relaxation; Integer programming; Mathematics; Probabilistic logic; Search algorithm; Artificial intelligence; Stochastic programming","score_opus":0.028373339513326462,"score_gpt":0.25406665282411695,"score_spread":0.22569331331079048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082779900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032418196,0.00004492961,0.9832955,0.00033758438,0.0013891199,0.0005082748,0.00003501841,0.00034290802,0.010804816],"genre_scores_gemma":[0.9010993,0.000006118435,0.09798452,0.00051249267,0.00015823089,0.000059655868,0.000017457149,0.000015055169,0.0001471288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984956,0.0000445782,0.00034316367,0.00034926148,0.00015774404,0.00060966343],"domain_scores_gemma":[0.99885976,0.0001797576,0.00014020967,0.00039750934,0.00013619261,0.00028656315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038931897,0.00020879685,0.00020916494,0.00014518366,0.00019770079,0.00014916528,0.0003936805,0.00011748121,0.0007039347],"category_scores_gemma":[0.00012508151,0.00021789508,0.00012249054,0.00022764025,0.00035815858,0.0007954943,0.000089678855,0.00012971975,0.000069871145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056244216,0.00006855388,0.0017183261,0.000027875798,0.000049821556,0.0000022807965,0.00064115267,0.0000064143933,0.011194613,0.1689758,0.0005266523,0.8167829],"study_design_scores_gemma":[0.026315456,0.0009730595,0.0792232,0.00070010714,0.00036885423,0.0024331305,0.0026722192,0.61934245,0.13126616,0.052244373,0.07501241,0.009448552],"about_ca_topic_score_codex":0.000002029139,"about_ca_topic_score_gemma":0.0000017708232,"teacher_disagreement_score":0.89785755,"about_ca_system_score_codex":0.00006997109,"about_ca_system_score_gemma":0.00013371135,"threshold_uncertainty_score":0.88855034},"labels":[],"label_agreement":null},{"id":"W2083081391","doi":"10.1007/s10601-013-9143-5","title":"Introduction to the special issue on constraint modelling and reformulation","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Computer science; Management science; Engineering; Mechanical engineering","score_opus":0.013945866611072541,"score_gpt":0.2255223947929468,"score_spread":0.21157652818187428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083081391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009325516,0.0000047936546,0.9309878,0.04209158,0.0011685665,0.00059179304,0.0000030415852,0.00012227494,0.015704686],"genre_scores_gemma":[0.9557531,0.000013078377,0.036946665,0.0016211972,0.005174263,0.000035226156,0.000006265056,0.000009087869,0.00044114047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989863,0.000050200324,0.00021841514,0.0003551474,0.00019418218,0.00019573398],"domain_scores_gemma":[0.9993155,0.00005882368,0.00006447617,0.00032750686,0.000116967814,0.00011671048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002205049,0.00012681764,0.00010194755,0.00011549962,0.00022080181,0.00027412787,0.00019149545,0.000055339846,0.001280229],"category_scores_gemma":[0.000061294646,0.00009587172,0.000028588303,0.00022263391,0.0001572516,0.00040903382,0.000061957806,0.00013962701,0.0007459131],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036905433,0.00001322552,0.00005814452,0.00000280222,0.000008448302,8.8965567e-7,0.0007032607,0.030762069,0.00010627828,0.06956516,0.010970733,0.8878053],"study_design_scores_gemma":[0.00070844014,0.00018244944,0.006478159,0.000042172396,0.000011826882,0.00015567047,0.00062609033,0.8401665,0.00091582787,0.0071852864,0.14299415,0.0005334484],"about_ca_topic_score_codex":0.000015686368,"about_ca_topic_score_gemma":0.0000074685986,"teacher_disagreement_score":0.9464276,"about_ca_system_score_codex":0.00005235295,"about_ca_system_score_gemma":0.00003962847,"threshold_uncertainty_score":0.9996327},"labels":[],"label_agreement":null},{"id":"W2087891847","doi":"10.1145/2463372.2463479","title":"pEvoSAT","year":2013,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Permutation (music); Conjunctive normal form; Computer science; Pruning; Boolean satisfiability problem; Maximum satisfiability problem; Domain (mathematical analysis); Satisfiability; Encoding (memory); Representation (politics); Genetic algorithm; Theoretical computer science; Disjunctive normal form; Boolean expression; Algorithm; Boolean function; Mathematics; Artificial intelligence; Machine learning","score_opus":0.004739752721063097,"score_gpt":0.1804057805599425,"score_spread":0.1756660278388794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087891847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012397433,0.000001953971,0.90140027,0.00286332,0.00009304971,0.00003911877,1.8382435e-8,0.00014231382,0.09422022],"genre_scores_gemma":[0.8165624,0.0000023455725,0.17917281,0.00090233196,0.000010237371,0.000005074113,2.5175228e-7,0.0000010171693,0.0033435358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.0000050591157,0.00003823811,0.000064028674,0.000044133943,0.00004885864],"domain_scores_gemma":[0.99982655,0.000008654872,0.0000075311873,0.0001059833,0.000024523328,0.000026743228],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000015989443,0.000020724101,0.000018047716,0.000021204129,0.00002284493,0.000080048885,0.00009345411,0.000009210448,0.0019406914],"category_scores_gemma":[0.0000045555926,0.000016749056,0.000009426712,0.00007223195,0.0000057833054,0.00035997687,0.000025167774,0.000015066156,0.0012934142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.302454e-8,0.000007574337,0.0025901587,8.1088257e-7,0.000002070142,4.003982e-7,0.00009775594,0.00011547731,0.0003941826,0.44628963,0.01944173,0.53106016],"study_design_scores_gemma":[0.00026825335,0.000025477399,0.16524857,0.0000027094268,9.3815174e-7,0.000024334711,0.00005103649,0.7964306,0.0016812868,0.016594665,0.019454053,0.00021810566],"about_ca_topic_score_codex":0.00002522628,"about_ca_topic_score_gemma":0.000003657712,"teacher_disagreement_score":0.81532264,"about_ca_system_score_codex":0.000004559528,"about_ca_system_score_gemma":0.000007826165,"threshold_uncertainty_score":0.9994842},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011163201346677422,"score_gpt":0.23511345542789475,"score_spread":0.22395025408121733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092520161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09607591,0.000005626883,0.89758366,0.000560933,0.0003550904,0.00009384772,6.409378e-8,0.00013051504,0.0051943786],"genre_scores_gemma":[0.74763787,0.000004151887,0.2520613,0.00026277345,0.000019997105,0.0000045813517,2.1246866e-7,0.0000022636655,0.0000068223308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.000043749154,0.00022951246,0.00044355553,0.00040380325,0.00037643846],"domain_scores_gemma":[0.9993365,0.00008211182,0.00003457507,0.00031695762,0.00007978896,0.00015009314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836393,0.00010346385,0.00010922264,0.00031250762,0.00022397743,0.00024792957,0.0009770647,0.000030314764,0.00007014469],"category_scores_gemma":[0.000035995494,0.00009404594,0.00002209985,0.0015940361,0.0006656058,0.0005997237,0.00041778816,0.000118820484,0.00006395295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027043184,0.000023968,0.002488123,0.0000010250783,8.206798e-7,0.00001504867,0.00042943878,0.0011349564,0.00008213061,0.84877354,0.0000047758117,0.14704348],"study_design_scores_gemma":[0.00045236122,0.0000645412,0.06693605,0.00003731313,0.0000010440343,0.000081229584,0.000011857795,0.8699444,0.0021996943,0.059109114,0.00082984404,0.00033255797],"about_ca_topic_score_codex":0.0000026853618,"about_ca_topic_score_gemma":0.000006498279,"teacher_disagreement_score":0.86880946,"about_ca_system_score_codex":0.000088359106,"about_ca_system_score_gemma":0.00014382531,"threshold_uncertainty_score":0.3835082},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05216442578228685,"score_gpt":0.2959712926665272,"score_spread":0.24380686688424036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092928619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050553214,0.00006731369,0.94783205,0.00053651945,0.0006551452,0.000098090895,6.7983785e-7,0.0000113881115,0.00024562847],"genre_scores_gemma":[0.8379368,0.000006440936,0.16191658,0.000031246225,0.00010277701,2.8875704e-7,1.4214807e-7,0.0000011177466,0.0000046057175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989802,0.000081396516,0.00045820445,0.0001031364,0.00025975384,0.00011728739],"domain_scores_gemma":[0.9988148,0.0002675012,0.00044834873,0.000099403274,0.00030164822,0.00006826389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030637907,0.00005818349,0.00013736449,0.00012253146,0.00035035767,0.00020604,0.00039022742,0.00002537649,5.001001e-7],"category_scores_gemma":[0.0000127458725,0.000035585617,0.000051185372,0.00022115833,0.00026934495,0.00062036363,0.000035929937,0.000048691152,1.5743576e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040230494,0.000037158574,0.006811649,0.000055521275,0.000022818207,0.0000029844962,0.0017569618,0.0041899597,0.00053891685,0.8003106,0.00017025773,0.18606295],"study_design_scores_gemma":[0.0004290729,0.0007453417,0.050276026,0.00008491796,0.000007035124,0.00033823398,0.00062893564,0.94161123,0.0005718319,0.0046368386,0.0005727578,0.00009778817],"about_ca_topic_score_codex":0.000006337062,"about_ca_topic_score_gemma":0.000029099127,"teacher_disagreement_score":0.93742126,"about_ca_system_score_codex":0.000019483314,"about_ca_system_score_gemma":0.0000846955,"threshold_uncertainty_score":0.26947033},"labels":[],"label_agreement":null},{"id":"W2092974662","doi":"10.1016/j.artint.2009.07.001","title":"Stonian p-ortholattices: A new approach to the mereotopology<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mi mathvariant=\"italic\">RT</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math>","year":2009,"lang":"lv","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Toronto","funders":"","keywords":"Scroll; Computer graphics (images); Computer science; Artificial intelligence; Mathematics; Philosophy; Theology","score_opus":0.03425697352376484,"score_gpt":0.26916251627399984,"score_spread":0.234905542750235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092974662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5354584,0.0005578533,0.41191655,0.006201847,0.0041567395,0.0002503168,0.00017456927,0.0003933406,0.0408904],"genre_scores_gemma":[0.97607315,0.00033610716,0.018131252,0.0034877353,0.0011199994,0.00018072384,0.00016526807,0.0001375476,0.00036819206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939567,0.00032042188,0.0014676319,0.0015492688,0.0012927128,0.0014132896],"domain_scores_gemma":[0.99556804,0.00063963205,0.00096795656,0.0019242072,0.00018100164,0.00071918656],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014883882,0.00064300775,0.00033319168,0.00031121384,0.0015303107,0.0016887977,0.002005948,0.0008763477,0.004516817],"category_scores_gemma":[0.00080118806,0.0008477444,0.0006980502,0.0013777073,0.0008270655,0.0012811386,0.0008436389,0.0010518383,0.0039767837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028206993,0.00028909976,0.00001220678,0.00009545961,0.00022967803,0.00017976634,0.00623024,0.015375627,0.0005532347,0.92414373,0.0059395283,0.046669375],"study_design_scores_gemma":[0.0002174379,0.000678841,0.00011780747,0.0002771929,0.0003199803,0.0005333327,0.002208495,0.9197358,0.0680211,0.0019196346,0.005107915,0.00086249044],"about_ca_topic_score_codex":0.0015180414,"about_ca_topic_score_gemma":0.002153612,"teacher_disagreement_score":0.9222241,"about_ca_system_score_codex":0.000031724165,"about_ca_system_score_gemma":0.0010661324,"threshold_uncertainty_score":0.99976957},"labels":[],"label_agreement":null},{"id":"W2096009621","doi":"10.1109/time.2004.1314421","title":"Probabilistic temporal interval networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Interval (graph theory); Interval temporal logic; Local consistency; Computer science; Constraint (computer-aided design); Relation (database); Representation (politics); Constraint satisfaction problem; Mathematics; Algorithm; Theoretical computer science; Artificial intelligence; Temporal logic; Data mining; Combinatorics","score_opus":0.011533985819311818,"score_gpt":0.22476789418364812,"score_spread":0.2132339083643363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096009621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001504902,0.0000055868663,0.9892888,0.0013318642,0.00027414144,0.000075006785,9.462224e-8,0.00022967569,0.0072899363],"genre_scores_gemma":[0.9040598,0.0000014759414,0.095317364,0.0003857454,0.000025907379,0.0000035115536,0.0000013874889,0.0000021159842,0.00020268135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.000010577437,0.00010197912,0.00014639314,0.00007197378,0.00009861911],"domain_scores_gemma":[0.99972427,0.000010683756,0.00002294762,0.00016587619,0.000030351976,0.000045891946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006698085,0.000050297054,0.000048130412,0.00003162385,0.000042365333,0.00008396741,0.00016466367,0.000024861287,0.00008873886],"category_scores_gemma":[0.0000145716685,0.000043139986,0.00002615486,0.00015668788,0.000022468888,0.00024456345,0.000053886964,0.00005202173,0.00004443393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021104038,0.00003989923,0.0014287111,0.0000031070601,0.000005784261,0.000006962654,0.00016374871,0.2748707,0.000007121353,0.6487427,0.0003605537,0.07436862],"study_design_scores_gemma":[0.00057816214,0.00007360819,0.009325246,0.000015783682,0.0000025521626,0.000047423993,0.000020825168,0.96935976,0.00006688775,0.019068737,0.0012406717,0.00020036075],"about_ca_topic_score_codex":0.00002883584,"about_ca_topic_score_gemma":0.000075076816,"teacher_disagreement_score":0.9025549,"about_ca_system_score_codex":0.000036490546,"about_ca_system_score_gemma":0.0000406123,"threshold_uncertainty_score":0.17591976},"labels":[],"label_agreement":null},{"id":"W2097890626","doi":"10.1109/focs.2004.66","title":"The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Satisfiability; Conjecture; Boolean satisfiability problem; Constraint (computer-aided design); Mathematics; Class (philosophy); Complexity of constraint satisfaction; Discrete mathematics; Backtracking; Maximum satisfiability problem; Resolution (logic); Combinatorics; Computer science; Algorithm; Boolean function; Local consistency; Artificial intelligence; Statistics","score_opus":0.011109684609581123,"score_gpt":0.24079612023871408,"score_spread":0.22968643562913296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097890626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005216788,0.000022338485,0.981724,0.0062069,0.00052798854,0.0012410926,0.000004773934,0.00032159418,0.0047344817],"genre_scores_gemma":[0.80498356,0.00004061986,0.19444892,0.00025405883,0.000047984482,0.00011161007,0.0000040041314,0.000008617332,0.0001006114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985034,0.000051776264,0.00041735312,0.00041490988,0.00027851513,0.00033404105],"domain_scores_gemma":[0.9987228,0.00033924272,0.00016043236,0.00046814283,0.00020347993,0.00010590547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007969009,0.00017198166,0.00016637941,0.00006685771,0.0006349989,0.00051070336,0.0003024961,0.00008597758,0.000068434485],"category_scores_gemma":[0.00010173825,0.0001218634,0.00013663585,0.00025176516,0.00015177493,0.0007356291,0.00006403162,0.00015858984,0.000021535858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008122658,0.00004975489,0.0016463349,0.000015970003,0.000048281483,0.0000015997146,0.0002885777,0.015134695,0.0012487313,0.53039527,0.0003323338,0.45075724],"study_design_scores_gemma":[0.02774851,0.00097006944,0.11375831,0.00012566648,0.00012646557,0.00046720696,0.0011475285,0.18149832,0.015145324,0.6422676,0.014706778,0.0020382132],"about_ca_topic_score_codex":0.00023665543,"about_ca_topic_score_gemma":0.0014773002,"teacher_disagreement_score":0.7997668,"about_ca_system_score_codex":0.00017479656,"about_ca_system_score_gemma":0.0003237251,"threshold_uncertainty_score":0.49694452},"labels":[],"label_agreement":null},{"id":"W2098533844","doi":"","title":"Conditional and Composite Constraints with Preferences.","year":2008,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Mathematical optimization; Computer science; Semiring; Constraint programming; Constraint logic programming; Projection (relational algebra); Preference; Set (abstract data type); Constraint satisfaction problem; Variable (mathematics); Mathematics; Algorithm; Artificial intelligence; Stochastic programming; Discrete mathematics","score_opus":0.015364107518832805,"score_gpt":0.20368088745493737,"score_spread":0.18831677993610457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098533844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04988197,0.0000064506785,0.9252898,0.00041131792,0.000026828031,0.000060299142,0.000002324028,0.00010332161,0.024217658],"genre_scores_gemma":[0.9129178,0.00001171175,0.08656292,0.00030685143,0.0000056604827,0.0000025830939,0.0000054529046,0.0000012802083,0.00018574685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995996,0.000012362958,0.00006644041,0.00014095631,0.000109356355,0.0000712944],"domain_scores_gemma":[0.999767,0.00002929332,0.000023462175,0.00007805461,0.000045972425,0.000056204422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000024539348,0.000052207186,0.000052316456,0.000038966326,0.00011435574,0.000036073383,0.000069518035,0.000017509936,0.00024808833],"category_scores_gemma":[0.0000024595524,0.000040173985,0.0000071914997,0.000083287254,0.00023234228,0.00026868176,0.00002365057,0.000038939725,0.00001612591],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014302875,0.00007757149,0.27631512,0.000009551061,0.00005132724,0.00006826961,0.0009318391,0.0008785755,0.0004230176,0.63103217,0.0017807024,0.08841758],"study_design_scores_gemma":[0.0013844518,0.00012966311,0.9483793,0.000015410289,0.0000052445375,0.0023880193,0.000053273325,0.04149301,0.0011288158,0.0037803906,0.0009075181,0.0003349363],"about_ca_topic_score_codex":0.0000051813845,"about_ca_topic_score_gemma":0.000008030711,"teacher_disagreement_score":0.86303586,"about_ca_system_score_codex":0.0000060375255,"about_ca_system_score_gemma":0.00005067074,"threshold_uncertainty_score":0.27163932},"labels":[],"label_agreement":null},{"id":"W2099395836","doi":"10.1109/tai.1991.167123","title":"Searching for a minimal finite state automaton (FSA)","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristics; Pruning; Automaton; Computer science; Finite-state machine; Tree (set theory); Search algorithm; Theoretical computer science; State (computer science); Algorithm; Process (computing); Mathematics; Combinatorics; Programming language","score_opus":0.03038841623358071,"score_gpt":0.24984913614067447,"score_spread":0.21946071990709376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099395836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00377844,0.0000074892096,0.98445237,0.0015891774,0.000116240764,0.00013364815,0.0000018694022,0.0002774158,0.009643354],"genre_scores_gemma":[0.60205394,0.000010704188,0.39261982,0.0005825382,0.000020477311,0.000016033135,0.0000017170132,0.000005756405,0.0046889903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994462,0.000018086826,0.00011002582,0.00016391184,0.00010462744,0.00015712787],"domain_scores_gemma":[0.9995997,0.0001343594,0.000027923052,0.00014358833,0.000037506332,0.000056914603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101953236,0.00005540561,0.000055303626,0.00007652645,0.000095876516,0.00013987938,0.00015164357,0.000016897915,0.00025261575],"category_scores_gemma":[0.000040529496,0.000051439005,0.000035502264,0.00013754352,0.000014455239,0.0003276867,0.000042433792,0.000040566218,0.00007876422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036370047,0.00003870645,0.00033467085,0.000014551143,0.0000117574145,0.0000070556243,0.0016995203,0.006985601,0.00020831279,0.06725199,0.0038054003,0.9196388],"study_design_scores_gemma":[0.00023092201,0.000032768803,0.00062177517,0.0000035283879,8.2111524e-7,0.00000917411,0.000010899632,0.99150896,0.0003069355,0.000744218,0.0064562927,0.00007369488],"about_ca_topic_score_codex":0.0000069389816,"about_ca_topic_score_gemma":0.00001339432,"teacher_disagreement_score":0.98452336,"about_ca_system_score_codex":0.0000142583185,"about_ca_system_score_gemma":0.00001308055,"threshold_uncertainty_score":0.27659655},"labels":[],"label_agreement":null},{"id":"W2099452584","doi":"10.1007/s10601-015-9193-y","title":"Lagrangian bounds from decision diagrams","year":2015,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Lagrangian relaxation; Influence diagram; Travelling salesman problem; Diagram; Constraint (computer-aided design); Relaxation (psychology); Mathematical optimization; Representation (politics); Constraint programming; Computer science; Lagrangian; Combinatorial optimization; Mathematics; Applied mathematics; Decision tree; Artificial intelligence; Stochastic programming","score_opus":0.02494302236139297,"score_gpt":0.25400062977385135,"score_spread":0.22905760741245837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099452584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027083965,0.00006094087,0.9546786,0.00063078816,0.0011130912,0.00010275104,0.000010458412,0.00025267754,0.01606673],"genre_scores_gemma":[0.9004493,0.0000072361286,0.098961465,0.00040292184,0.00006925645,0.0000045254124,0.000015095174,0.0000059989607,0.00008420789],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989545,0.000045183384,0.00020115523,0.00031283,0.0002868856,0.0001994529],"domain_scores_gemma":[0.99903566,0.00012261464,0.00006283395,0.0003924539,0.00012044092,0.00026597444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021293962,0.00011756653,0.00012351436,0.00008714008,0.00007733356,0.00024600406,0.0003916397,0.00007848734,0.00026802017],"category_scores_gemma":[0.00017874266,0.0001126741,0.000054417855,0.00026831593,0.00016340577,0.00043334867,0.00009956993,0.000100428304,0.0004584243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004793776,0.000025001096,0.0054542352,6.752668e-7,0.000011250527,0.000020710171,0.00053479214,0.0000959114,0.0000805089,0.020687532,0.0024183043,0.9706663],"study_design_scores_gemma":[0.012788529,0.00044728763,0.23815751,0.00031514696,0.00008231917,0.00042349228,0.0019860922,0.29676166,0.0030518665,0.29893598,0.14397176,0.0030783613],"about_ca_topic_score_codex":0.000036627946,"about_ca_topic_score_gemma":0.00006857652,"teacher_disagreement_score":0.96758795,"about_ca_system_score_codex":0.000056861227,"about_ca_system_score_gemma":0.00017485429,"threshold_uncertainty_score":0.58922696},"labels":[],"label_agreement":null},{"id":"W2100448711","doi":"10.1109/tai.1993.634010","title":"Meta-COOP: An AI tool with embedding rules, frames and numerical computing in an object-oriented environment","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Workstation; Knowledge representation and reasoning; Representation (politics); Embedding; Unix; Object-oriented programming; Object (grammar); Knowledge-based systems; Theoretical computer science; Programming language; Artificial intelligence; Operating system","score_opus":0.023304929050536046,"score_gpt":0.24372270337368868,"score_spread":0.22041777432315263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100448711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11905884,0.000034530996,0.88004446,0.0002861094,0.000029584946,0.00011311437,7.117405e-7,0.000107287444,0.00032533985],"genre_scores_gemma":[0.74318296,0.000006955647,0.25631616,0.0004273596,0.000010482605,0.0000037848843,0.000002858219,0.000005013395,0.000044462442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989754,0.00008393265,0.00018946796,0.00037935813,0.00018740472,0.00018446681],"domain_scores_gemma":[0.9995569,0.000039879025,0.000050622184,0.00024161716,0.000016174065,0.0000948158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001318086,0.00012755665,0.00017431569,0.000090970585,0.00010091402,0.00016140913,0.00012400262,0.00004080771,0.00039066817],"category_scores_gemma":[0.0000061950127,0.000100647056,0.000021367225,0.00016208299,0.000041299605,0.00079987996,0.00006491516,0.00012191804,0.000011420328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023085997,0.0006822341,0.08859822,0.000016934011,0.00024350398,0.000071284,0.009275651,0.17184763,0.00028944365,0.05095437,0.00011654071,0.6778811],"study_design_scores_gemma":[0.00029466685,0.00012274501,0.021351377,0.0000040114046,0.000019772615,0.000024313724,0.00009810467,0.9775599,0.00006837979,0.000045877467,0.0002521812,0.00015862001],"about_ca_topic_score_codex":0.000036734487,"about_ca_topic_score_gemma":0.000019577801,"teacher_disagreement_score":0.80571234,"about_ca_system_score_codex":0.000033990353,"about_ca_system_score_gemma":0.000008576203,"threshold_uncertainty_score":0.42775425},"labels":[],"label_agreement":null},{"id":"W2100656533","doi":"10.1109/cdc.2004.1428684","title":"Distributed diagnosis under global consistency","year":2004,"lang":"en","type":"article","venue":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Consistency (knowledge bases); Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.02142032377185009,"score_gpt":0.26220725473543055,"score_spread":0.24078693096358045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100656533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0727717,0.00014465026,0.9163013,0.0043660635,0.0025084382,0.0007343703,0.0002478168,0.0004000314,0.0025256006],"genre_scores_gemma":[0.98373055,0.0006613275,0.0113821225,0.0037311553,0.00015161814,0.00011739471,0.000030046906,0.00002535298,0.00017045553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597675,0.00017107624,0.00090110133,0.0012753548,0.0008952369,0.0007804675],"domain_scores_gemma":[0.9966228,0.0004641825,0.00035235772,0.0010848423,0.00082509697,0.0006506937],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041238347,0.000633322,0.0007330145,0.00023787418,0.0005162784,0.0008118856,0.00091409154,0.00037431103,0.00036304494],"category_scores_gemma":[0.00034390198,0.0005816762,0.00026057952,0.00076026033,0.00033644066,0.00076265103,0.00009917689,0.00034905024,0.0007797935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092582003,0.001972428,0.010032683,0.00006987924,0.00042786603,0.00035054018,0.0004465682,0.051046453,0.0047107004,0.3468499,0.016972454,0.5661947],"study_design_scores_gemma":[0.06703553,0.0041418225,0.14913557,0.0020512638,0.000570951,0.000836672,0.00075817615,0.55538374,0.004274703,0.19336742,0.01507581,0.0073683416],"about_ca_topic_score_codex":0.00016338076,"about_ca_topic_score_gemma":0.00028037486,"teacher_disagreement_score":0.9109588,"about_ca_system_score_codex":0.00043712955,"about_ca_system_score_gemma":0.0007808481,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W2100720213","doi":"10.1142/s0218213008003765","title":"OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Waterloo","funders":"International Business Machines Corporation; Intel Corporation","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Suite; Parallel computing; Optimizing compiler; Constraint programming; Schedule; Algorithm; Mathematical optimization; Dynamic priority scheduling; Programming language; Two-level scheduling; Mathematics","score_opus":0.09098479028904376,"score_gpt":0.3335965103387119,"score_spread":0.24261172004966813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100720213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24289286,0.000023802413,0.7543805,0.00062991056,0.0017798223,0.00021668206,0.0000053244416,0.000041123032,0.000029961708],"genre_scores_gemma":[0.6319713,0.000022740185,0.36744538,0.00006380275,0.00047263392,0.0000054624597,0.0000024494182,0.000008483615,0.00000775969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978829,0.000044168504,0.0009774795,0.00025886303,0.00059154263,0.00024505472],"domain_scores_gemma":[0.99707836,0.00025225573,0.00070663996,0.00013098949,0.0017095212,0.00012221477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004757637,0.00017139202,0.00022249343,0.00040273395,0.00022888687,0.0003598559,0.00069825293,0.00009022366,0.000043272245],"category_scores_gemma":[0.00089256087,0.00017105552,0.0001922281,0.00029702016,0.00017621937,0.0015759275,0.00007064255,0.00023913282,0.000010335065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239909,0.00011107401,0.00053250097,0.000009011669,0.00008953213,0.000047164045,0.001130033,0.40386698,0.0038631323,0.005401807,0.0000097435095,0.584815],"study_design_scores_gemma":[0.00031452946,0.00021322283,0.00016920816,0.00013751975,0.000021039754,0.0024609426,0.0009942205,0.9294207,0.06341325,0.001270628,0.0012900623,0.0002946834],"about_ca_topic_score_codex":0.000011756664,"about_ca_topic_score_gemma":0.00000803412,"teacher_disagreement_score":0.58452034,"about_ca_system_score_codex":0.00017912837,"about_ca_system_score_gemma":0.0004069254,"threshold_uncertainty_score":0.69754416},"labels":[],"label_agreement":null},{"id":"W2101380104","doi":"10.7771/1932-6246.1142","title":"Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover","year":2012,"lang":"en","type":"article","venue":"The Journal of Problem Solving","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex cover; Edge cover; Vertex (graph theory); Euclidean geometry; Computer science; Graph; Cover (algebra); Combinatorics; Covering problems; Independent set; Set (abstract data type); Mathematics; Mathematical optimization; Theoretical computer science","score_opus":0.0199978733259338,"score_gpt":0.23973870670562694,"score_spread":0.21974083337969313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101380104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45249304,0.00022466408,0.5329442,0.0015309567,0.0012062374,0.0003854237,7.87252e-7,0.00008114659,0.011133567],"genre_scores_gemma":[0.9864794,0.00007873744,0.012797663,0.0002913755,0.00011361803,0.0000012757303,2.4064403e-7,0.000009453619,0.00022823394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987922,0.000090358764,0.00039666975,0.00008429253,0.00035496196,0.00028156865],"domain_scores_gemma":[0.99900573,0.000073186326,0.00042874605,0.00024778553,0.00013842026,0.00010610788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014617059,0.00012133615,0.00014866346,0.00015511527,0.00034897984,0.000105558865,0.00052695966,0.000040118448,0.00007579403],"category_scores_gemma":[0.000021571681,0.00008077334,0.00007952808,0.00025036404,0.000044923283,0.0012803668,0.00008227159,0.00032091312,0.000053274816],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017672402,0.0012022399,0.13634421,0.0005693758,0.0006593927,0.000019728304,0.08575016,0.36310178,0.07342493,0.05614812,0.043244652,0.23935868],"study_design_scores_gemma":[0.005926478,0.003118547,0.75119305,0.0030732274,0.00029910088,0.0018748111,0.0010538957,0.19958432,0.012483456,0.010679269,0.008782998,0.0019308568],"about_ca_topic_score_codex":0.0000052017263,"about_ca_topic_score_gemma":0.0000012963651,"teacher_disagreement_score":0.61484885,"about_ca_system_score_codex":0.0000649213,"about_ca_system_score_gemma":0.00005097808,"threshold_uncertainty_score":0.3293841},"labels":[],"label_agreement":null},{"id":"W2102573817","doi":"10.1145/2528401","title":"The expressibility of functions on the boolean domain, with applications to counting CSPs","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Unary operation; Counting problem; Boolean function; clone (Java method); Set (abstract data type); Complexity of constraint satisfaction; Bipartite graph; Function (biology); Binary number; Arity","score_opus":0.013455872453286045,"score_gpt":0.23035774983965002,"score_spread":0.21690187738636396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102573817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15536954,0.000025524132,0.75561816,0.08604601,0.00028734762,0.0005282789,0.0000015891469,0.000015889305,0.002107641],"genre_scores_gemma":[0.9808163,0.000004982014,0.018116754,0.0007633312,0.00006725054,0.000019929414,5.309023e-8,0.0000033428746,0.00020806157],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99927807,0.00007833797,0.00023106176,0.000071615636,0.0002596819,0.000081250415],"domain_scores_gemma":[0.997921,0.00039099794,0.00032301966,0.0010411338,0.00028738327,0.00003646356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211174,0.000050194703,0.000062967316,0.000027689768,0.00038431623,0.0001247054,0.0013603056,0.000014375478,0.000027879214],"category_scores_gemma":[0.0003162163,0.000019558374,0.000057068173,0.00025479015,0.00007005919,0.00017910407,0.00019604727,0.00015066104,0.000013894028],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020585158,0.0005933904,0.05528592,0.000038952563,0.0004627714,0.0000018497178,0.008595886,0.08006842,0.025659576,0.24195293,0.20910758,0.37802687],"study_design_scores_gemma":[0.0015011185,0.0007135222,0.6918157,0.0003778792,0.00010068212,0.0002720831,0.0065277596,0.01585762,0.009354864,0.1458454,0.12711367,0.00051973906],"about_ca_topic_score_codex":0.000009228548,"about_ca_topic_score_gemma":0.000018352805,"teacher_disagreement_score":0.8254467,"about_ca_system_score_codex":0.000030357798,"about_ca_system_score_gemma":0.00006218745,"threshold_uncertainty_score":0.29558885},"labels":[],"label_agreement":null},{"id":"W2102910550","doi":"10.1017/s0269888913000283","title":"Visuo: A model of visuospatial instantiation of quantitative magnitudes","year":2013,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Python (programming language); Computer science; Artificial intelligence; Brightness; Qualitative reasoning; Cognitive psychology; Natural language processing; Psychology; Programming language","score_opus":0.02140722942719867,"score_gpt":0.2619179148465781,"score_spread":0.24051068541937945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102910550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022350566,0.010861139,0.9855182,0.00020014378,0.00009232365,0.0003368167,0.0000013725771,0.000050372582,0.00070457783],"genre_scores_gemma":[0.91578734,0.0062950547,0.07777882,0.00003536977,0.000011230092,0.00003712795,0.0000018752316,0.000009013742,0.000044163313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938846,0.00003429936,0.00029843187,0.00009749467,0.00010082737,0.00008047308],"domain_scores_gemma":[0.9992997,0.00010058031,0.00012766615,0.00023017262,0.00021850718,0.000023391978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022938602,0.00008331339,0.0001948201,0.00005894913,0.000020643736,0.000012668738,0.000256772,0.000019976944,0.000036474525],"category_scores_gemma":[0.00014084957,0.00006068183,0.000059747883,0.00034321166,0.000024323506,0.00024393159,0.000061265884,0.000059328027,0.000027928927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034092416,0.00015898311,0.00016402303,0.007443481,0.000107735716,2.3824833e-7,0.0029654915,0.13368832,0.01920639,0.4495349,0.00065880246,0.38606822],"study_design_scores_gemma":[0.0000731987,0.000024069646,0.000939553,0.0009259774,0.000014738774,0.0000010593116,0.0000041911876,0.99688715,0.00078157365,0.00016702172,0.00011245066,0.00006902048],"about_ca_topic_score_codex":0.0000073160672,"about_ca_topic_score_gemma":0.0000027014398,"teacher_disagreement_score":0.9135523,"about_ca_system_score_codex":0.000015170625,"about_ca_system_score_gemma":0.000046690653,"threshold_uncertainty_score":0.24745332},"labels":[],"label_agreement":null},{"id":"W2103552898","doi":"","title":"Local Search Characteristics of Incomplete SAT Procedures","year":2000,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maxima and minima; Weighting; Descent (aeronautics); Local search (optimization); Computer science; Linear search; Mathematical optimization; Algorithm; Mathematics; Engineering","score_opus":0.012292109940220593,"score_gpt":0.2369542296033821,"score_spread":0.22466211966316152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103552898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05354223,0.0000034885907,0.9356789,0.00057428563,0.00004032665,0.00006815537,0.0000021586102,0.000079974656,0.0100105],"genre_scores_gemma":[0.9754684,0.000014749499,0.02361426,0.00019666753,0.00001062597,0.0000013279886,0.0000033163365,0.000002296298,0.00068835175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994794,0.00001909266,0.00014308006,0.000120332676,0.0001424266,0.000095667456],"domain_scores_gemma":[0.99970424,0.00002288426,0.000020517808,0.00015430755,0.00005617038,0.000041859243],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000068248555,0.000048152084,0.00007441868,0.000046287038,0.000036265894,0.000031537576,0.00017445239,0.000023489445,0.0014185905],"category_scores_gemma":[0.000007943408,0.000042516465,0.000021441778,0.00016654088,0.000054003212,0.00015247827,0.000031386495,0.000043711094,0.00010746628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007397101,0.000031378655,0.004426198,0.000021281294,0.0000062020617,0.0000020984276,0.0002732713,0.0010616593,0.00036291723,0.025879806,0.00023229659,0.9676955],"study_design_scores_gemma":[0.00036782792,0.00009218769,0.41947046,0.00002623011,0.00000343263,0.000040154977,0.000046769077,0.5740177,0.0024144775,0.000559306,0.0027544573,0.0002069914],"about_ca_topic_score_codex":0.000020925092,"about_ca_topic_score_gemma":0.000015694592,"teacher_disagreement_score":0.9674885,"about_ca_system_score_codex":0.000011867027,"about_ca_system_score_gemma":0.00007016335,"threshold_uncertainty_score":0.99949425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019293890705295347,"score_gpt":0.28413377684716695,"score_spread":0.2648398861418716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104290979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024906587,0.000025436564,0.97264236,0.00074792013,0.0001620928,0.00033340487,0.00004018288,0.00034733184,0.00079465774],"genre_scores_gemma":[0.68760324,0.000021410682,0.31202632,0.00017163712,0.000020133068,0.000014048683,0.000021161584,0.000007457021,0.00011459013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984469,0.000054696913,0.00046651423,0.000504991,0.00021570372,0.00031123593],"domain_scores_gemma":[0.9989468,0.00022260584,0.00011193,0.00036983317,0.0002311292,0.00011769033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018123246,0.00017825165,0.00022732555,0.00024682228,0.0002606487,0.00027783032,0.00040158816,0.00010206615,0.0016760556],"category_scores_gemma":[0.00017989875,0.00018395335,0.00015869895,0.0015174911,0.00011979465,0.00027135474,0.000032096246,0.00013990399,0.000093734816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021837128,0.00003955368,0.0001516773,0.000009861627,0.00013957996,0.000004337381,0.0006048332,0.17982155,0.0007817317,0.071997896,0.000012591067,0.74641454],"study_design_scores_gemma":[0.000023565475,0.00004714685,0.00019069224,0.000012515175,0.000092762675,0.000010861493,0.000108519314,0.95655006,0.0041041495,0.03838088,0.00025543588,0.00022342245],"about_ca_topic_score_codex":0.00006233496,"about_ca_topic_score_gemma":0.0003906713,"teacher_disagreement_score":0.7767285,"about_ca_system_score_codex":0.000062428866,"about_ca_system_score_gemma":0.00012764332,"threshold_uncertainty_score":0.9992365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008842868261025316,"score_gpt":0.24587778483772346,"score_spread":0.23703491657669815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104749823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029988,0.000001227883,0.9314801,0.00078083115,0.00013795654,0.000034384695,1.7571088e-8,0.00018290961,0.06438376],"genre_scores_gemma":[0.60707676,8.198058e-7,0.3898621,0.0009397455,0.000022884264,6.0372093e-7,2.776317e-7,0.0000017967283,0.0020949978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996427,0.000003577138,0.00006781643,0.000103933686,0.0000787089,0.000103219434],"domain_scores_gemma":[0.9997781,0.000028573182,0.000011906362,0.00008635841,0.00002948085,0.00006558607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017759035,0.000030619634,0.000027871443,0.00006487158,0.00005473928,0.000050385675,0.000100540405,0.000015070482,0.00016247443],"category_scores_gemma":[0.000027131333,0.000028657194,0.0000133098265,0.00019323225,0.0000044590224,0.00013488265,0.00004370443,0.000043280794,0.00025238006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016855272,0.0000076262663,0.0028331326,8.2608756e-7,0.0000026081373,0.000004473474,0.0009963354,0.0064122626,0.00094141223,0.12642135,0.0010506694,0.86132765],"study_design_scores_gemma":[0.0009303344,0.00041128512,0.25208274,0.000022279104,0.000005351046,0.000083927975,0.0013920586,0.45606324,0.02183157,0.0027593097,0.26348585,0.0009320701],"about_ca_topic_score_codex":0.000009683136,"about_ca_topic_score_gemma":0.000035418187,"teacher_disagreement_score":0.86039555,"about_ca_system_score_codex":0.00001360909,"about_ca_system_score_gemma":0.000011028858,"threshold_uncertainty_score":0.32439196},"labels":[],"label_agreement":null},{"id":"W2105084236","doi":"10.1109/icci.1992.227654","title":"Reduction of constraint networks based on local consistency","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Constraint satisfaction problem; Consistency (knowledge bases); Constraint (computer-aided design); Local consistency; Constraint satisfaction; Reduction (mathematics); Class (philosophy); Computer science; Mathematical optimization; Theoretical computer science; Constraint programming; Artificial intelligence; Mathematics","score_opus":0.011102400259269275,"score_gpt":0.21739669781231943,"score_spread":0.20629429755305015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105084236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021309331,0.0000066876637,0.9213933,0.00027857223,0.00034104616,0.00008268872,3.4335295e-7,0.00007452282,0.07760977],"genre_scores_gemma":[0.93912303,0.0000030079693,0.060544185,0.00022686228,0.000006963022,0.0000025754034,0.0000012333022,0.0000025191612,0.000089619665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993319,0.00006969392,0.00018729345,0.00017529404,0.00012953507,0.00010628946],"domain_scores_gemma":[0.9995115,0.000054469754,0.00006633216,0.00023392326,0.00008185474,0.000051962343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017405125,0.00006989649,0.00008765728,0.00008078732,0.00004959612,0.000022616896,0.00008458905,0.000048106172,0.00029517038],"category_scores_gemma":[0.000033431195,0.00006421056,0.000044753433,0.00023724661,0.00013224209,0.00009975051,0.0000072994676,0.000067618275,0.0000081458375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039437878,0.00004731524,0.00023877835,0.0000034856782,0.000004496971,0.0000013019871,0.000024720797,0.24408454,0.00007901495,0.66897297,0.0002411906,0.086298265],"study_design_scores_gemma":[0.00036313728,0.000082782935,0.00062084006,0.000014437557,0.0000028195175,0.000026662437,0.000081510065,0.9949704,0.0027319216,0.00063391443,0.00037155356,0.00010006221],"about_ca_topic_score_codex":0.000007412182,"about_ca_topic_score_gemma":0.000003715492,"teacher_disagreement_score":0.93890995,"about_ca_system_score_codex":0.000030731837,"about_ca_system_score_gemma":0.00010921339,"threshold_uncertainty_score":0.32319087},"labels":[],"label_agreement":null},{"id":"W2105786826","doi":"10.1016/j.artint.2009.06.005","title":"Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Satisfiability; Mathematics; Combinatorics; Discrete mathematics; Boolean satisfiability problem; Statistics","score_opus":0.07382149957098402,"score_gpt":0.3191596025939583,"score_spread":0.2453381030229743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105786826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071742125,0.000067401124,0.9219006,0.004927071,0.0004355488,0.00031789747,0.000019739742,0.00020198988,0.00038766308],"genre_scores_gemma":[0.9212042,0.00006361213,0.07836339,0.0002597341,0.00006303961,0.000005462574,0.00001919678,0.0000038123494,0.000017545963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982305,0.0001559461,0.00048156278,0.0006872198,0.00021681453,0.00022791736],"domain_scores_gemma":[0.998171,0.00036829372,0.00009953896,0.0011329664,0.00010650556,0.00012175069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650838,0.00014860957,0.00018948587,0.000090243026,0.00021983145,0.00027973767,0.0006066258,0.000078135534,0.00015611638],"category_scores_gemma":[0.0005412989,0.00014199762,0.000039478662,0.0004085093,0.00017285901,0.001082694,0.00015543039,0.00017466256,0.000043531356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027300692,0.00012226663,0.0005822358,0.0000033618837,0.000007697235,0.0000019800389,0.0003007279,0.00014002125,0.0007904887,0.0361278,0.00013416234,0.96176195],"study_design_scores_gemma":[0.00012437598,0.00015173836,0.013415316,0.00001628736,0.000021666554,0.000047828304,0.00016465828,0.7225596,0.012297113,0.24956746,0.0012323086,0.00040169543],"about_ca_topic_score_codex":0.000048665526,"about_ca_topic_score_gemma":0.00009223941,"teacher_disagreement_score":0.9613603,"about_ca_system_score_codex":0.000030348596,"about_ca_system_score_gemma":0.000065219756,"threshold_uncertainty_score":0.57904947},"labels":[],"label_agreement":null},{"id":"W2105930785","doi":"10.1007/s00453-004-1081-6","title":"Solving Systems of Difference Constraints Incrementally with Bidirectional Search","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Theory of computation; Computer science; Heuristic; Bounded function; Heuristics; Local search (optimization); Algorithm; Search algorithm; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.013275735814220962,"score_gpt":0.2265882630989717,"score_spread":0.21331252728475075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105930785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03854633,0.000025335888,0.9592017,0.00018932892,0.00018777917,0.00014657946,0.0000061627484,0.00008941645,0.001607373],"genre_scores_gemma":[0.90550655,0.0000065534277,0.09436393,0.00003153446,0.000023826404,0.000006506966,0.000003685618,0.00000455746,0.00005288288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.0000317339,0.00017858428,0.00021603766,0.00032251677,0.00015590721],"domain_scores_gemma":[0.99950206,0.000043930202,0.00006918532,0.00018076388,0.00013891446,0.00006514316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012868314,0.000088095934,0.000116091716,0.00010723198,0.000087933746,0.00006827289,0.00021736106,0.000034809138,0.00003264827],"category_scores_gemma":[0.000010207922,0.00007680674,0.000024510517,0.0002751867,0.00015358327,0.0001904866,0.000059116977,0.000089738714,0.000010917962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049238624,0.0004976013,0.020646786,0.00014738606,0.00030972212,0.00007996831,0.0026005106,0.0619442,0.029863833,0.4017618,0.00008652323,0.48201242],"study_design_scores_gemma":[0.009804262,0.0015825514,0.2678335,0.0011859305,0.00007170845,0.0021135733,0.0017865608,0.6131732,0.09681962,0.0032322826,0.000395894,0.0020009186],"about_ca_topic_score_codex":0.00018829478,"about_ca_topic_score_gemma":0.00001746583,"teacher_disagreement_score":0.86696017,"about_ca_system_score_codex":0.00007379162,"about_ca_system_score_gemma":0.00022158126,"threshold_uncertainty_score":0.3132088},"labels":[],"label_agreement":null},{"id":"W2106378021","doi":"10.1016/j.dam.2004.06.026","title":"Numerical representation of PQI interval orders","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Interval (graph theory); Mathematics; Preference; Intersection (aeronautics); Representation (politics); Order (exchange); Combinatorics; Set (abstract data type); Discrete mathematics; Statistics; Computer science","score_opus":0.016052980249342323,"score_gpt":0.2692880239622094,"score_spread":0.2532350437128671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106378021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037381535,0.000003954469,0.974783,0.0005330748,0.000047353515,0.00014681931,0.0000010616085,0.0000962242,0.02065038],"genre_scores_gemma":[0.59930533,0.0000034473733,0.40055114,0.00007054932,0.000016362372,0.000008676624,0.000003707619,0.000005216575,0.000035578367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920493,0.000009305404,0.00030176804,0.00016489609,0.0002072742,0.00011182614],"domain_scores_gemma":[0.9993753,0.00006674145,0.00015539603,0.00031781252,0.000040888524,0.00004385914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088712724,0.00008629916,0.00015450554,0.00006487373,0.000036093013,0.000039926254,0.0002369723,0.000036903042,0.000091307586],"category_scores_gemma":[0.000030038156,0.000079603225,0.000052556697,0.00026992202,0.00003914178,0.00018372708,0.00006247974,0.000061250415,0.000050313727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007237518,0.00011408227,0.00009683623,0.000061864295,0.00003364856,7.2696264e-7,0.003859181,0.009878828,0.003026767,0.85581183,0.00059561897,0.12651338],"study_design_scores_gemma":[0.0006266536,0.000035323483,0.00054065505,0.000030963452,0.000020189062,0.000014380169,0.0006093676,0.9574035,0.022545727,0.016989607,0.00090696616,0.0002766564],"about_ca_topic_score_codex":0.0000034760967,"about_ca_topic_score_gemma":0.0000021939838,"teacher_disagreement_score":0.94752467,"about_ca_system_score_codex":0.000020697733,"about_ca_system_score_gemma":0.000020771973,"threshold_uncertainty_score":0.32461253},"labels":[],"label_agreement":null},{"id":"W2107677855","doi":"10.1109/icpr.1988.28438","title":"Interpreting the straight line using angular relations","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Consistency (knowledge bases); Space (punctuation); Interpretation (philosophy); Line (geometry); Computer science; Artificial intelligence; Algorithm; Mathematics; Geometry; Programming language","score_opus":0.01761585526243401,"score_gpt":0.24916929777779587,"score_spread":0.23155344251536186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107677855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022204889,0.000018330982,0.948445,0.0009031297,0.00017509228,0.000060736584,2.2208349e-7,0.000084121806,0.04809288],"genre_scores_gemma":[0.77944994,0.0000013806878,0.2194359,0.00034208864,0.000010290647,0.0000010567012,4.323456e-7,0.0000025184258,0.00075638463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995398,0.000060731098,0.00011496408,0.00011414336,0.0000831825,0.00008720736],"domain_scores_gemma":[0.99964267,0.000059982824,0.00003655639,0.00019479328,0.000040344126,0.00002562826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018239356,0.00004744516,0.00003658318,0.0000381448,0.00017831252,0.00010057647,0.00013090899,0.000022491815,0.0006100623],"category_scores_gemma":[0.00008243773,0.000032808784,0.000027401216,0.0002410071,0.000023209288,0.00024799083,0.000025717622,0.000070121365,0.000023149456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0285332e-7,0.000013295169,0.0017206097,0.0000010693261,0.00001005305,0.0000017244935,0.00068575906,0.03297648,0.00080507016,0.9441705,0.00033287975,0.019282212],"study_design_scores_gemma":[0.00009325478,0.000008352485,0.0007808701,0.000007863167,0.000004006608,0.00003509281,0.000102441045,0.990827,0.0010078237,0.0022413284,0.00480539,0.000086547145],"about_ca_topic_score_codex":0.000006376583,"about_ca_topic_score_gemma":0.000013154852,"teacher_disagreement_score":0.9578506,"about_ca_system_score_codex":0.000020975656,"about_ca_system_score_gemma":0.000042735046,"threshold_uncertainty_score":0.6679754},"labels":[],"label_agreement":null},{"id":"W2108685822","doi":"10.1109/ccece.2005.1557171","title":"A dynamic extension of the asynchronous weak-commitment search algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Asynchronous communication; Extension (predicate logic); Constraint (computer-aided design); Constraint satisfaction problem; Dynamic problem; Algorithm; Constraint satisfaction; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.007167076469041336,"score_gpt":0.2284214677379135,"score_spread":0.22125439126887217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108685822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004022056,0.000022629438,0.9834309,0.0011553372,0.00018921806,0.0001407911,0.0000011115216,0.000060467464,0.01097745],"genre_scores_gemma":[0.7832327,0.000006660902,0.2152914,0.00008601211,0.000007894589,0.0000029578857,0.0000015130248,0.0000031753136,0.0013676919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.00004175019,0.00013899736,0.00015109657,0.00020741306,0.000105960586],"domain_scores_gemma":[0.9995068,0.000024995616,0.000038717528,0.00034168584,0.00006859868,0.000019257988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111167756,0.000056317796,0.00006269219,0.00004595402,0.0000814545,0.00003177603,0.00023757841,0.000025474385,0.00006357318],"category_scores_gemma":[0.0000036246443,0.000037426915,0.000045373123,0.00023602207,0.00004275096,0.00010637502,0.00012240927,0.00005388328,0.000014870807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012184375,0.00010033582,0.0011728955,0.000005399981,0.000007264011,0.0000015532951,0.00008994111,0.012978834,0.0017730318,0.05049957,0.0006685433,0.9327014],"study_design_scores_gemma":[0.00018324445,0.000021465365,0.070419125,0.000007827767,0.0000021340418,0.000015369178,0.000023768729,0.9263122,0.0015929495,0.0010451649,0.00031598224,0.000060740513],"about_ca_topic_score_codex":0.00024929384,"about_ca_topic_score_gemma":0.00010597441,"teacher_disagreement_score":0.9326407,"about_ca_system_score_codex":0.00004847146,"about_ca_system_score_gemma":0.00005279951,"threshold_uncertainty_score":0.15262252},"labels":[],"label_agreement":null},{"id":"W2108687116","doi":"10.1007/978-3-540-85958-1_32","title":"Exploiting Decomposition in Constraint Optimization Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; Bounding overwatch; Search tree; Recursion (computer science); Component (thermodynamics); Decomposition; Mathematical optimization; Tree (set theory); Decomposition method (queueing theory); Tree decomposition; Constraint (computer-aided design); Branch and bound; Depth-first search; Algorithm; Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence","score_opus":0.017851611222918996,"score_gpt":0.24075462219781338,"score_spread":0.22290301097489437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108687116","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059483606,0.00013159626,0.9924421,0.00056795863,0.00083133637,0.00051536557,0.000002821044,0.00019530463,0.005254068],"genre_scores_gemma":[0.1771506,0.0002775517,0.8216033,0.0006916975,0.00014999024,0.000018070856,0.000022446895,0.000030210462,0.000056133238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968939,0.00004605751,0.00069069955,0.0011919555,0.00067894266,0.000498486],"domain_scores_gemma":[0.99844843,0.00024043249,0.00033583838,0.0006249963,0.00022152474,0.00012879731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005415296,0.00041203896,0.00039992738,0.0012873651,0.00023673031,0.00036621085,0.0010416874,0.0002919029,0.00004558537],"category_scores_gemma":[0.00006526951,0.0004412878,0.00008852251,0.00074740715,0.0005193086,0.0009970495,0.0003944342,0.0006409905,0.000017653741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014731515,0.000014286868,0.0000885317,0.000012407232,0.0000022977508,0.000038195285,0.00055677537,0.72299,0.000028748054,0.0024914662,0.000004106465,0.27377176],"study_design_scores_gemma":[0.00036310742,0.000063695,0.00016815343,0.00045068515,0.0000024771603,0.00022217866,4.0084058e-7,0.9882269,0.00016987274,0.0097495485,0.00009221045,0.0004907574],"about_ca_topic_score_codex":0.000021600155,"about_ca_topic_score_gemma":0.00011301695,"teacher_disagreement_score":0.273281,"about_ca_system_score_codex":0.00051042956,"about_ca_system_score_gemma":0.0005343039,"threshold_uncertainty_score":0.9998039},"labels":[],"label_agreement":null},{"id":"W2109015525","doi":"10.1613/jair.2155","title":"Consistency and Random Constraint Satisfaction Models","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Local consistency; Constraint satisfaction; Constraint satisfaction dual problem; Constraint learning; Computer science; Constraint (computer-aided design); Consistency (knowledge bases); Robustness (evolution); Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.14172274926718278,"score_gpt":0.3914333672345828,"score_spread":0.2497106179674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109015525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036594756,0.00019453163,0.9597119,0.0011395141,0.0003680653,0.00014310417,6.158327e-7,0.000018251832,0.0018292657],"genre_scores_gemma":[0.96080273,0.0003378758,0.03868393,0.000040708786,0.000110650995,8.8145543e-7,1.492704e-7,0.0000047993976,0.000018277959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777275,0.00019445704,0.000749132,0.00018536356,0.000764938,0.00033332966],"domain_scores_gemma":[0.9973785,0.0008800818,0.00020955926,0.00017650171,0.0011253587,0.00022997452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006257093,0.00009117843,0.00019068585,0.0006379364,0.0002611245,0.00026050306,0.0002569686,0.000082599494,0.00006825866],"category_scores_gemma":[0.0005316299,0.000079627695,0.00007362041,0.0006024985,0.0003864942,0.0008558912,0.00007971521,0.0005189006,0.000015425772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008940301,0.000029506105,0.0003658843,0.0000061926794,0.00001522924,0.000044017623,0.00073001895,0.0015941666,0.0025942673,0.22520171,0.000041695046,0.7692879],"study_design_scores_gemma":[0.00043669876,0.00079893915,0.0051271836,0.00016432535,0.000017755217,0.0015744552,0.007080268,0.44330996,0.037830606,0.50286156,0.00040973234,0.0003884789],"about_ca_topic_score_codex":0.000051973435,"about_ca_topic_score_gemma":0.00013628876,"teacher_disagreement_score":0.924208,"about_ca_system_score_codex":0.00009803104,"about_ca_system_score_gemma":0.00028615573,"threshold_uncertainty_score":0.3247123},"labels":[],"label_agreement":null},{"id":"W2109117475","doi":"10.1109/ictai.2007.38","title":"On Portfolios for Backtracking Search in the Presence of Deadlines","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Look-ahead; Constraint learning; Testbed; Mathematical optimization; Scheduling (production processes); Schedule; Portfolio; Limit (mathematics); Beam stack search; Constraint satisfaction; Constraint satisfaction problem; Satisfiability; Theoretical computer science; Search algorithm; Algorithm; Mathematics; Artificial intelligence; Local consistency","score_opus":0.03205481278515062,"score_gpt":0.3142591896383012,"score_spread":0.2822043768531506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109117475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039744023,0.0000039773613,0.9539454,0.00062044914,0.000059701913,0.00017723763,3.1704403e-7,0.000015544074,0.005433376],"genre_scores_gemma":[0.9597102,0.0000023752925,0.039937135,0.00024993042,0.0000117490445,0.000002751091,4.777078e-7,0.0000012595057,0.000084138686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952036,0.000017201237,0.00012762056,0.00009546462,0.00013867611,0.00010067294],"domain_scores_gemma":[0.9992925,0.0004667018,0.000024739882,0.00014641165,0.00005622226,0.000013424487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092837,0.0000322977,0.000039889852,0.00008667934,0.000027538214,0.000023467714,0.00022352024,0.000017975968,0.000019922061],"category_scores_gemma":[0.00007142324,0.0000216049,0.000019725807,0.00024734534,0.00001785367,0.00011738384,0.00001724992,0.000040674942,0.0000020604643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017751376,0.00006366693,0.00917282,0.000013111329,0.0000028557079,0.0000034559234,0.0012424494,0.0076818718,0.0004179933,0.7544134,0.0004077564,0.22656284],"study_design_scores_gemma":[0.00097554544,0.00024599358,0.28673393,0.00005918895,0.0000029453554,0.00002440163,0.0009816017,0.67858505,0.020575332,0.0107142525,0.0008757017,0.00022605354],"about_ca_topic_score_codex":0.000023968458,"about_ca_topic_score_gemma":0.00011799155,"teacher_disagreement_score":0.91996616,"about_ca_system_score_codex":0.000006659746,"about_ca_system_score_gemma":0.000022244374,"threshold_uncertainty_score":0.08810223},"labels":[],"label_agreement":null},{"id":"W2109734774","doi":"10.1109/focs.2008.70","title":"A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems","year":2008,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Constraint (computer-aided design); Random variable; Closure (psychology); Constraint satisfaction; Discrete mathematics; Constant (computer programming); Complexity of constraint satisfaction; Set (abstract data type); Resolution (logic); Computational complexity theory; Domain (mathematical analysis); Constraint satisfaction dual problem; Constraint graph; Combinatorics; Local consistency; Computer science; Algorithm; Statistics; Artificial intelligence","score_opus":0.04980244377209592,"score_gpt":0.25376083923778725,"score_spread":0.20395839546569133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109734774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036537768,0.000033819528,0.9910308,0.00145438,0.0002097167,0.00083776045,0.0000067372653,0.00012153283,0.0026514535],"genre_scores_gemma":[0.9311301,0.000055628054,0.06852021,0.00012110792,0.000022318842,0.0000580848,0.0000036948402,0.0000039257043,0.00008491374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991351,0.00006728154,0.00027887558,0.00018979346,0.00018730602,0.00014166345],"domain_scores_gemma":[0.99903095,0.0003383533,0.00014561471,0.0002807898,0.00016631663,0.00003797037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003774385,0.00009026478,0.00013467937,0.000061488085,0.00031108537,0.000029698389,0.00018831715,0.000042662454,0.00009384487],"category_scores_gemma":[0.00007419351,0.00006050961,0.0000933706,0.00020832318,0.0004549803,0.00025025694,0.00003687504,0.000069717025,0.0000042870893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079296355,0.00004385987,0.004393736,0.00002368617,0.00005104516,6.104169e-7,0.0011160005,0.007993683,0.0010697399,0.91314024,0.0010425275,0.07104559],"study_design_scores_gemma":[0.003094133,0.000102774226,0.08579185,0.000019910278,0.00001667639,0.000112713045,0.0001252292,0.8858962,0.0014494141,0.021585722,0.0016211341,0.00018425989],"about_ca_topic_score_codex":0.00014748238,"about_ca_topic_score_gemma":0.00015848504,"teacher_disagreement_score":0.92747635,"about_ca_system_score_codex":0.000031526524,"about_ca_system_score_gemma":0.00008355894,"threshold_uncertainty_score":0.24675103},"labels":[],"label_agreement":null},{"id":"W2110254595","doi":"10.1016/j.dam.2005.05.009","title":"Resolution complexity of random constraint satisfaction problems: Another half of the story","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Constraint satisfaction problem; Resolution (logic); Constraint (computer-aided design); Constraint satisfaction; Combinatorics; Mathematical optimization; Statistics; Artificial intelligence; Computer science; Geometry; Probabilistic logic","score_opus":0.025823883426195713,"score_gpt":0.23554820806666535,"score_spread":0.20972432464046964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110254595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00826367,0.00002134241,0.9810605,0.0009935694,0.000079378035,0.00056245405,0.000010174491,0.0000657868,0.008943113],"genre_scores_gemma":[0.80442256,0.000007532567,0.19544357,0.000051643412,0.000014773046,0.000015596335,0.000002079335,0.0000076152282,0.000034613233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989156,0.000049403658,0.00042576157,0.00016743682,0.0003094965,0.00013231074],"domain_scores_gemma":[0.9988701,0.00010003083,0.00045195103,0.00047133194,0.00007879915,0.000027835507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003980842,0.00012157282,0.00022936921,0.00006428656,0.00010158633,0.000021235139,0.00026324592,0.000062863975,0.00006712222],"category_scores_gemma":[0.00003520436,0.000090805304,0.000089959576,0.00021532104,0.0003722833,0.00014266379,0.000083841944,0.00012086568,0.0000072642933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136133785,0.000078669655,0.00011058447,0.00015832964,0.000037407724,6.639013e-8,0.0030199543,0.009156034,0.016142018,0.9427826,0.00016940218,0.028331323],"study_design_scores_gemma":[0.0069158804,0.0001060824,0.0185194,0.0004608549,0.0001477028,0.000046110952,0.0018283837,0.7944045,0.064390935,0.109326355,0.0029781635,0.0008755999],"about_ca_topic_score_codex":0.000016458896,"about_ca_topic_score_gemma":0.00009657297,"teacher_disagreement_score":0.8334562,"about_ca_system_score_codex":0.0000516024,"about_ca_system_score_gemma":0.00006084752,"threshold_uncertainty_score":0.3702933},"labels":[],"label_agreement":null},{"id":"W2111537628","doi":"10.1109/pacrim.1991.160755","title":"An intelligent basis for design","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CAD; Computer science; Expert system; Backtracking; Constraint (computer-aided design); Knowledge base; Process (computing); Dependency (UML); Software engineering; Object (grammar); Human–computer interaction; Computer Aided Design; Systems engineering; Engineering drawing; Artificial intelligence; Engineering; Programming language; Operating system","score_opus":0.06633627167629459,"score_gpt":0.26788232687482905,"score_spread":0.20154605519853447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111537628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044371107,0.0000070948445,0.99597996,0.00077826285,0.00011549839,0.00012385163,3.1065457e-7,0.00014260382,0.0028080244],"genre_scores_gemma":[0.23787603,0.000011313857,0.7609611,0.00048316128,0.00001532254,0.000012116451,3.8173653e-7,0.0000022297115,0.0006383475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996605,0.00001740006,0.00007061478,0.00012407493,0.000051477502,0.00007594165],"domain_scores_gemma":[0.9996916,0.000053156386,0.000014665307,0.00015929587,0.00003562894,0.00004563086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008049813,0.000036920585,0.000033406603,0.000040645795,0.000051054147,0.00007501601,0.0001458029,0.000017049495,0.0007648731],"category_scores_gemma":[0.000016947552,0.00003278298,0.000019992247,0.0000911992,0.0000073455412,0.00026003944,0.000009239192,0.000014823012,0.000059307124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011227903,0.00003904434,0.000080322076,0.0000014214845,0.0000036411402,3.5923915e-7,0.00034829997,0.0069960956,0.00016772996,0.095704265,0.003995606,0.8926621],"study_design_scores_gemma":[0.000053178897,0.000054666012,0.00013041387,0.0000010041476,9.793757e-7,0.0000024644544,0.0000151282675,0.9938694,0.002220638,0.000767832,0.0028302958,0.000053972923],"about_ca_topic_score_codex":0.0000022999327,"about_ca_topic_score_gemma":0.000003387181,"teacher_disagreement_score":0.9868733,"about_ca_system_score_codex":0.000013301445,"about_ca_system_score_gemma":0.0000056585213,"threshold_uncertainty_score":0.8374824},"labels":[],"label_agreement":null},{"id":"W2112165609","doi":"10.1007/978-3-0346-0436-9_2","title":"Semialgebras and Semitensor Product","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Product (mathematics); Computer science; Mathematics; Geometry","score_opus":0.008009364188040156,"score_gpt":0.19359361198483718,"score_spread":0.18558424779679702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112165609","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016428105,0.00009659796,0.13780737,0.0014948815,0.00057915074,0.00020243487,0.0000029932214,0.0002816513,0.85951847],"genre_scores_gemma":[0.0009754817,0.00017635396,0.09043889,0.0005918573,0.0001882955,0.000002937321,0.000008448719,0.000019292753,0.90759844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991766,0.000004498393,0.00015348977,0.00041572523,0.00014820152,0.00010148902],"domain_scores_gemma":[0.9993256,0.000022240307,0.000082547354,0.00040682033,0.000083690305,0.00007910217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007968383,0.00016817244,0.00014748528,0.0001101048,0.00007333743,0.00013272546,0.00018507791,0.0001776315,0.0008918554],"category_scores_gemma":[0.000017785886,0.0001509333,0.000038769456,0.000020722722,0.00007123155,0.00017581982,0.00012566806,0.0003118863,0.00012426081],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.650597e-7,0.0000022157135,0.000020878464,0.000010537181,0.000012958061,0.0000054959323,0.0000496135,0.0000016385062,0.00024573438,0.80833393,0.0015550284,0.18976122],"study_design_scores_gemma":[0.00032535865,0.000043926215,0.0007322795,0.00006514317,0.000029989973,0.00030088017,0.0000023961131,0.0028840422,0.0012694574,0.06564049,0.9278021,0.00090396317],"about_ca_topic_score_codex":0.0000049054215,"about_ca_topic_score_gemma":0.000029947334,"teacher_disagreement_score":0.92624706,"about_ca_system_score_codex":0.000012169027,"about_ca_system_score_gemma":0.00006357414,"threshold_uncertainty_score":0.9765191},"labels":[],"label_agreement":null},{"id":"W2113824002","doi":"10.1109/time.2006.13","title":"Efficient Heuristics for Solving Probabilistic Interval Algebra Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Heuristics; Probabilistic logic; Interval (graph theory); Enhanced Data Rates for GSM Evolution; Computer science; Product (mathematics); Algorithm; Mathematical optimization; Theoretical computer science; Algebra over a field; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.009152635054731838,"score_gpt":0.21943675112179484,"score_spread":0.210284116067063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113824002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017523067,0.000016033122,0.99441683,0.00029536433,0.00047691655,0.00024895056,0.0000010586391,0.00021684392,0.0025756806],"genre_scores_gemma":[0.80462897,5.897996e-7,0.19474481,0.00014375812,0.00008826939,0.000016790447,0.0000054778325,0.000005255071,0.0003660986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992965,0.00001161241,0.00019636605,0.00021706847,0.00009519155,0.00018325765],"domain_scores_gemma":[0.99950975,0.00012499094,0.000052026233,0.00018118176,0.00009499403,0.000037035035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013840712,0.00008138549,0.00008181422,0.000046767145,0.00010572377,0.00014492363,0.00017844011,0.000036469177,0.0000337977],"category_scores_gemma":[0.00004340901,0.00007409616,0.000051286686,0.00014527599,0.000028476023,0.000052866366,0.00006300218,0.000048618916,0.00000802064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021353037,0.000032919994,0.00019270614,0.0000071904205,0.0000026248867,7.7105796e-7,0.000023845985,0.6590673,0.000014236493,0.32057777,0.0015503727,0.018528154],"study_design_scores_gemma":[0.0001789837,0.000025095032,0.0013045416,0.000007363975,0.0000037201714,0.00000577536,0.0000050076383,0.9950231,0.00002933186,0.0028751474,0.00044404337,0.000097914926],"about_ca_topic_score_codex":0.000016174883,"about_ca_topic_score_gemma":0.000038226764,"teacher_disagreement_score":0.80287665,"about_ca_system_score_codex":0.000045742065,"about_ca_system_score_gemma":0.000029020008,"threshold_uncertainty_score":0.3021554},"labels":[],"label_agreement":null},{"id":"W2114259120","doi":"10.1109/isre.2001.948597","title":"Geographic problem frames","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Specifier; Set (abstract data type); Geographic information system; Theoretical computer science; Geography; Artificial intelligence; Programming language; Cartography","score_opus":0.012315579198716358,"score_gpt":0.19942469179950884,"score_spread":0.18710911260079247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114259120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050807756,0.000030590178,0.8916502,0.0025565033,0.00007932597,0.00004983329,1.5473522e-7,0.0002781903,0.10484711],"genre_scores_gemma":[0.7482032,0.000046404308,0.24840148,0.0008009317,0.000013520474,0.000005013285,3.239618e-7,0.0000022355382,0.0025268516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999644,0.000009784137,0.00006729172,0.00011580121,0.000080827565,0.00008229514],"domain_scores_gemma":[0.99976563,0.000013065218,0.00001633745,0.00014742863,0.000023081591,0.0000344331],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000033160155,0.000038092465,0.000032961354,0.00006650809,0.000049379265,0.00008019421,0.00013559432,0.000021377327,0.0012451626],"category_scores_gemma":[0.0000043826253,0.00003272714,0.000022818085,0.00021317221,0.000015312346,0.00025187872,0.000028478455,0.00003771477,0.00020880296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7100203e-7,0.00003327629,0.011503832,0.0000029219113,0.0000068766094,0.0000024650078,0.0002507689,0.00040389228,0.00003985407,0.39926693,0.0057144854,0.5827745],"study_design_scores_gemma":[0.00031182676,0.000046376696,0.023204014,0.0000075220246,0.0000026702523,0.00003276501,0.000022815748,0.92329174,0.00021852019,0.009746995,0.04285871,0.00025606106],"about_ca_topic_score_codex":0.000007511135,"about_ca_topic_score_gemma":0.0000070647147,"teacher_disagreement_score":0.92288786,"about_ca_system_score_codex":0.0000036915694,"about_ca_system_score_gemma":0.0000027345168,"threshold_uncertainty_score":0.9996678},"labels":[],"label_agreement":null},{"id":"W2115590028","doi":"10.1109/tai.1994.346460","title":"Minimal forward checking","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Constraint (computer-aided design); Constraint satisfaction problem; Computer science; Domain (mathematical analysis); Constraint satisfaction; Variable (mathematics); Random variable; Mathematical optimization; Selection (genetic algorithm); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.02179393184471366,"score_gpt":0.21717521769511422,"score_spread":0.19538128585040057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115590028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010802711,0.000010565703,0.87193245,0.0014977263,0.00012194826,0.000026568949,8.009673e-8,0.00015874773,0.12517162],"genre_scores_gemma":[0.8611837,0.000007429772,0.1354046,0.0004929317,0.000020169833,0.0000016141673,1.8612414e-7,0.0000016946819,0.0028876783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966824,0.0000065135023,0.00006605039,0.00010345221,0.00007514769,0.00008056679],"domain_scores_gemma":[0.9998027,0.000012618539,0.00001576645,0.000118722186,0.000017606806,0.000032574113],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000033878234,0.000034170076,0.000032665972,0.000036772206,0.000043542906,0.00006485784,0.00011929294,0.000016339314,0.0012782229],"category_scores_gemma":[0.00000997422,0.000031082338,0.00002096355,0.00012211564,0.000008677931,0.00025822714,0.000032306383,0.000026602303,0.0002464292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6744395e-7,0.000025095744,0.00318835,0.000002530756,0.0000062700215,0.000004889949,0.0005828738,0.00031406488,0.00024346626,0.15749246,0.009894348,0.82824516],"study_design_scores_gemma":[0.00016941776,0.000016702728,0.005174288,0.0000024012472,0.0000010771104,0.000018564844,0.000018784782,0.9769357,0.0007016339,0.00033399125,0.016527591,0.000099851146],"about_ca_topic_score_codex":0.000002276578,"about_ca_topic_score_gemma":0.0000035537348,"teacher_disagreement_score":0.9766216,"about_ca_system_score_codex":0.000009179648,"about_ca_system_score_gemma":0.0000032741998,"threshold_uncertainty_score":0.99963474},"labels":[],"label_agreement":null},{"id":"W2119666703","doi":"10.1007/s10339-003-0002-y","title":"A formal model for structuring local perceptions of environmental space","year":2004,"lang":"en","type":"article","venue":"Cognitive Processing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Perception; Computer science; Constraint (computer-aided design); Structuring; Space (punctuation); Identification (biology); Point (geometry); Artificial intelligence; Theoretical computer science; Mathematics; Ecology; Psychology","score_opus":0.012974273185178232,"score_gpt":0.24766682590615297,"score_spread":0.23469255272097472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119666703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0899411,0.000021253763,0.90955144,0.000072010174,0.000022611923,0.00013536112,0.00001537678,0.000038292797,0.00020252701],"genre_scores_gemma":[0.8619377,0.0000024804272,0.13795978,0.000048637445,0.000011313443,0.000011883195,0.0000055754717,0.0000048560864,0.000017802058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999474,0.0000051287734,0.00011978416,0.00016345755,0.00009855235,0.000139117],"domain_scores_gemma":[0.99977994,0.000013878125,0.00006951383,0.000049616374,0.0000484924,0.000038556278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050733077,0.00007146783,0.000073885494,0.00006221009,0.00017226486,0.00004031514,0.00008366654,0.000030908417,0.000009294457],"category_scores_gemma":[0.000014066645,0.00007459977,0.000037704784,0.00007289669,0.00009438223,0.0007469312,0.000050334755,0.000051760373,0.000001951392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013867878,0.000041884716,0.00040601534,0.00004685959,0.0000074012773,5.4807003e-7,0.0051000477,0.058342572,0.0027649787,0.0040567173,4.719219e-7,0.92921865],"study_design_scores_gemma":[0.0007350548,0.000038364615,0.0058819205,0.000071771894,0.000011138041,0.000013301757,0.0010204839,0.9826044,0.0042800005,0.0052421573,0.0000010949296,0.00010033452],"about_ca_topic_score_codex":9.473225e-7,"about_ca_topic_score_gemma":0.0000048817615,"teacher_disagreement_score":0.9291183,"about_ca_system_score_codex":0.000051064617,"about_ca_system_score_gemma":0.000092283866,"threshold_uncertainty_score":0.30420902},"labels":[],"label_agreement":null},{"id":"W2121441589","doi":"10.1609/aimag.v30i1.2174","title":"Agents, Bodies, Constraints, Dynamics, and Evolution","year":2009,"lang":"en","type":"article","venue":"AI Magazine","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theme (computing); Constraint (computer-aided design); Dynamics (music); Computer science; Artificial intelligence; Constraint satisfaction problem; Association (psychology); Intelligent agent; Management science; Cognitive science; Engineering; Epistemology; Psychology; World Wide Web; Philosophy","score_opus":0.008000819366642754,"score_gpt":0.2331126536950781,"score_spread":0.22511183432843535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121441589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012658588,0.00010361,0.9743379,0.010392757,0.00019306551,0.00009933001,0.000007479608,0.00018570504,0.013414332],"genre_scores_gemma":[0.9777042,0.00005129081,0.019770715,0.0018565431,0.000024902078,0.0000014353535,0.000014603446,0.0000023200541,0.0005739523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99935406,0.000023148195,0.00013934447,0.00022307411,0.00011119451,0.00014916192],"domain_scores_gemma":[0.99961644,0.0000121898665,0.000044586366,0.00019262785,0.0000589794,0.00007519505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008868437,0.00008987488,0.00008704851,0.00005681923,0.00008370575,0.00009436587,0.00012251294,0.000042994077,0.000079412],"category_scores_gemma":[0.000027379489,0.00009232985,0.000021911334,0.00014611064,0.000077544915,0.0003767027,0.000038514652,0.00007077859,0.00006690367],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023250286,0.000022949496,0.007418971,0.0000031345942,0.0000058906703,0.000007494881,0.000053366573,0.000094787545,0.00004921509,0.54064333,0.0048158173,0.4468827],"study_design_scores_gemma":[0.0004893278,0.00007793123,0.5836368,0.00001364535,0.00000699199,0.00010324171,0.000014539429,0.3957025,0.000011726706,0.017134,0.0026177496,0.00019152237],"about_ca_topic_score_codex":0.000006113842,"about_ca_topic_score_gemma":0.00006044746,"teacher_disagreement_score":0.9764384,"about_ca_system_score_codex":0.00009371712,"about_ca_system_score_gemma":0.00004176746,"threshold_uncertainty_score":0.3765102},"labels":[],"label_agreement":null},{"id":"W2122823240","doi":"10.1504/ijids.2014.061771","title":"Distributed constraint satisfaction with multiply sectioned constraint networks","year":2014,"lang":"en","type":"article","venue":"International Journal of Information and Decision Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Computer science; Constraint satisfaction; Tree (set theory); Mathematical optimization; Local consistency; Constraint satisfaction dual problem; Exponential function; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.009775489382197544,"score_gpt":0.2573593206537106,"score_spread":0.24758383127151304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122823240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038180333,0.000013231173,0.9587691,0.0011173293,0.001051696,0.00007153243,0.000005010072,0.000034396006,0.0007573792],"genre_scores_gemma":[0.86320597,0.000065828244,0.13611092,0.0005508478,0.00005873658,0.0000012707965,0.0000036042209,0.0000015212863,0.0000013206638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998175,0.00004064201,0.00067235087,0.00012429504,0.000860794,0.00012689867],"domain_scores_gemma":[0.99772537,0.00037032773,0.00069093244,0.00009578515,0.0009889925,0.00012857956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011382727,0.00011311016,0.00014846235,0.00048117596,0.00020920079,0.000828364,0.00039194676,0.00005547862,0.000049380284],"category_scores_gemma":[0.00037068193,0.000080358215,0.000052966934,0.00036928238,0.0002722599,0.0036207526,0.00006462957,0.00014845959,0.0000071921263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006249519,0.00001277979,0.008458245,0.0000013684192,0.000025413046,0.0000025237869,0.00023270668,0.06186429,0.000019630874,0.046209194,0.0002465248,0.88286483],"study_design_scores_gemma":[0.002281141,0.00041601225,0.100116745,0.000117464435,0.000009240068,0.0018354179,0.0007385615,0.8837857,0.00009874296,0.005312919,0.00505557,0.00023245419],"about_ca_topic_score_codex":0.000015773985,"about_ca_topic_score_gemma":0.00002598586,"teacher_disagreement_score":0.8826324,"about_ca_system_score_codex":0.00005886298,"about_ca_system_score_gemma":0.00014999569,"threshold_uncertainty_score":0.7987933},"labels":[],"label_agreement":null},{"id":"W2122972087","doi":"10.1109/icsmc.2008.4811823","title":"Managing uncertain temporal relations using a probabilistic Interval Algebra","year":2008,"lang":"en","type":"article","venue":"Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Probabilistic logic; Constraint (computer-aided design); Constraint satisfaction problem; Constraint satisfaction; Interval (graph theory); Computer science; Probabilistic relevance model; Theoretical computer science; Local consistency; Mathematical optimization; Algorithm; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Combinatorics","score_opus":0.08891067161601814,"score_gpt":0.28969763249307323,"score_spread":0.2007869608770551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122972087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5506957,0.00016248829,0.34131202,0.00475828,0.0033252623,0.0025199393,0.000078381054,0.0013461006,0.095801815],"genre_scores_gemma":[0.9853502,0.0005312473,0.010317226,0.00026792032,0.00032367976,0.00018204757,0.00002974143,0.000060849514,0.0029370796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945085,0.000048069058,0.0014121631,0.0017271483,0.0013945801,0.00090950646],"domain_scores_gemma":[0.9943116,0.00009786983,0.0010535498,0.0003390607,0.0036772825,0.0005206399],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006516601,0.0009035095,0.0008306151,0.00086105283,0.000791443,0.0025256898,0.0018122576,0.00041887432,0.00026389828],"category_scores_gemma":[0.00025359215,0.00092181977,0.00016827618,0.00073482003,0.0006597543,0.0025274695,0.00045353765,0.00089670985,0.00010555264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111636284,0.00024015094,0.027552137,0.00031353583,0.0001909041,0.000040995066,0.008258334,0.00038340117,0.0028482205,0.95280606,0.0013344011,0.0059202467],"study_design_scores_gemma":[0.0011136325,0.00035919558,0.0026774483,0.0012288347,0.000068383,0.0008617472,0.0041135564,0.9680469,0.0003236292,0.018504383,0.0014163957,0.0012858828],"about_ca_topic_score_codex":0.00023968461,"about_ca_topic_score_gemma":0.000032912187,"teacher_disagreement_score":0.9676635,"about_ca_system_score_codex":0.00043174744,"about_ca_system_score_gemma":0.00072553963,"threshold_uncertainty_score":0.99932325},"labels":[],"label_agreement":null},{"id":"W2124556825","doi":"10.1109/time.2000.856579","title":"A formalization of structured temporal objects and repetition","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Formalism (music); Parameterized complexity; Temporal logic; Regular polygon; Repetition (rhetorical device); Theoretical computer science; Algorithm; Mathematics","score_opus":0.010041756043876108,"score_gpt":0.19135386286849806,"score_spread":0.18131210682462195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124556825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015933968,0.000020589063,0.9742607,0.00022593747,0.000074131385,0.00006956448,6.0482137e-7,0.00007236131,0.009342134],"genre_scores_gemma":[0.94937056,0.00002083875,0.05036686,0.00007020246,0.000005637189,9.631243e-7,0.0000021001583,0.0000012656637,0.00016158508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996777,0.000012032521,0.00010004981,0.00009076106,0.00007390686,0.000045545265],"domain_scores_gemma":[0.99978536,0.00000808997,0.000048706228,0.000096671174,0.000039502418,0.00002166383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000036518446,0.000034163124,0.000042945616,0.000058119083,0.000030281415,0.000026349147,0.000042868163,0.000022338894,0.0001928483],"category_scores_gemma":[0.000013359654,0.00003083855,0.00001033088,0.00013735692,0.000016164027,0.000359645,0.00001964506,0.000016987306,0.000001984398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068612453,0.000054745313,0.041554306,0.0000640134,0.000019033054,0.0000033522454,0.0040086857,0.001528518,0.0034943947,0.52746934,0.0014019661,0.42039475],"study_design_scores_gemma":[0.00047772977,0.00006644379,0.033201344,0.000012023081,0.0000033218223,0.00003958906,0.00006757087,0.9580072,0.004800509,0.0028255438,0.00038085875,0.0001178673],"about_ca_topic_score_codex":0.00000939196,"about_ca_topic_score_gemma":0.000028331098,"teacher_disagreement_score":0.95647866,"about_ca_system_score_codex":0.000005542432,"about_ca_system_score_gemma":0.000004279121,"threshold_uncertainty_score":0.21115535},"labels":[],"label_agreement":null},{"id":"W2124579409","doi":"10.1109/icsmc.1998.726704","title":"Fuzzy-neural tuned genetic algorithm applied to large-space constraint satisfaction","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Artificial neural network; Convergence (economics); Constraint (computer-aided design); Genetic algorithm; Computer science; Fuzzy logic; Algorithm; Constraint satisfaction; Process (computing); Operator (biology); Mathematical optimization; Constraint satisfaction problem; Artificial intelligence; Mathematics; Machine learning","score_opus":0.012751646139590164,"score_gpt":0.21698942192774565,"score_spread":0.2042377757881555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124579409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040586633,0.000017425971,0.9698056,0.0021475174,0.00045758352,0.00035818387,0.0000052074806,0.00046772018,0.022682095],"genre_scores_gemma":[0.6540032,0.000011644142,0.34433153,0.0011353273,0.000048552734,0.000022131895,0.0000018428955,0.000008702455,0.00043709928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998583,0.00004041839,0.0002628408,0.000460139,0.00029473513,0.00035883053],"domain_scores_gemma":[0.9991903,0.000046454606,0.00006711224,0.0003982224,0.00007448015,0.00022344105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010448179,0.00017973325,0.00015810855,0.00018082518,0.00017771007,0.00020122273,0.00022851535,0.00007547829,0.0011173445],"category_scores_gemma":[0.000018548595,0.00017880868,0.000056651483,0.0004932539,0.00003595214,0.0002510913,0.000103931714,0.0001236648,0.00068300514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017213391,0.00003139494,0.000763693,0.0000030563635,0.00001219706,0.000007729624,0.00043203216,0.003191577,0.0007596814,0.028482143,0.0023687896,0.963946],"study_design_scores_gemma":[0.0011932034,0.000108917055,0.08105645,0.000008292203,0.000011994532,0.00011968485,0.00025045316,0.9102397,0.0010464843,0.0017470648,0.003583889,0.0006338507],"about_ca_topic_score_codex":0.00003059733,"about_ca_topic_score_gemma":0.00006231972,"teacher_disagreement_score":0.96331215,"about_ca_system_score_codex":0.00007123717,"about_ca_system_score_gemma":0.000019849764,"threshold_uncertainty_score":0.9997958},"labels":[],"label_agreement":null},{"id":"W2125143886","doi":"10.5194/gmd-6-1591-2013","title":"An approach to computing direction relations between separated object groups","year":2013,"lang":"en","type":"article","venue":"Geoscientific model development","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Object (grammar); Spatial relation; Gestalt psychology; Computation; Spatial intelligence; Object relations theory; Group (periodic table); Computer science; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Expression (computer science); Point (geometry); Mathematics; Pattern recognition (psychology); Theoretical computer science; Geometry; Algorithm; Psychology","score_opus":0.024132977050416216,"score_gpt":0.24394498633393263,"score_spread":0.2198120092835164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125143886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1097311,0.0000029914418,0.8843406,0.00013686286,0.0004147681,0.00045813678,0.000002943405,0.00038727015,0.0045253285],"genre_scores_gemma":[0.56977725,1.9806302e-7,0.42889225,0.00007381018,0.000015158678,0.00003751579,0.000072136616,0.000006317551,0.0011253617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805576,0.00007566382,0.00040176034,0.00070650293,0.00040901813,0.00035129412],"domain_scores_gemma":[0.998955,0.000024952813,0.000098077704,0.00043675138,0.0002329032,0.00025230204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005800861,0.0001656439,0.00014439283,0.00035485125,0.00069572043,0.0006120492,0.00042725579,0.000070502196,0.00003682536],"category_scores_gemma":[0.000020039739,0.00016851474,0.00003293736,0.0010422396,0.000029754461,0.00088916696,0.00014716081,0.00011563628,0.00044706836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001159954,0.00013542885,0.006151696,0.000009448253,0.000020527676,2.8781656e-7,0.0069843098,0.8065613,0.0009769402,0.0043604732,0.0029780245,0.17182042],"study_design_scores_gemma":[0.000101753285,0.000007058798,0.10947839,0.00000802949,0.0000026721705,0.0000023064815,0.000042327316,0.88917214,0.00024023275,0.00028478005,0.00044662622,0.0002136986],"about_ca_topic_score_codex":0.00005053695,"about_ca_topic_score_gemma":0.0000117157115,"teacher_disagreement_score":0.46004614,"about_ca_system_score_codex":0.00018198317,"about_ca_system_score_gemma":0.0002180658,"threshold_uncertainty_score":0.6871832},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11459982372095619,"score_gpt":0.3476652843411281,"score_spread":0.23306546062017192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125336041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007964488,0.000013728925,0.9436952,0.012700483,0.0003265194,0.00019170762,0.0000053288263,0.00014326884,0.034959275],"genre_scores_gemma":[0.9621134,0.000026525795,0.036238614,0.0012914517,0.00010510487,0.000021147336,0.0000066258353,0.000004910748,0.00019221581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842227,0.00007768898,0.00039814474,0.00036734887,0.000524693,0.00020983414],"domain_scores_gemma":[0.999227,0.000108310174,0.00008696192,0.00018315946,0.00031904588,0.00007555398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038548175,0.00013063887,0.00012282266,0.00031317078,0.00009213348,0.00018463802,0.00043050578,0.00007813715,0.0007465421],"category_scores_gemma":[0.0001938194,0.00013598366,0.000044272187,0.0005435183,0.000059614325,0.00049127784,0.00005111668,0.00018779766,0.0006811395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081701855,0.000056519177,0.00006331361,7.5035587e-7,0.0000017248937,0.0000011601952,0.00013933753,0.0183187,0.0003856324,0.7184158,0.00006182664,0.26254708],"study_design_scores_gemma":[0.000058168618,0.000037084552,0.0015273268,0.000016965692,8.460962e-7,0.000004765955,0.000035190966,0.8696401,0.012864075,0.114318065,0.0012959742,0.00020141211],"about_ca_topic_score_codex":0.000021141013,"about_ca_topic_score_gemma":0.00033905488,"teacher_disagreement_score":0.9541489,"about_ca_system_score_codex":0.00015565068,"about_ca_system_score_gemma":0.00024571078,"threshold_uncertainty_score":0.8754898},"labels":[],"label_agreement":null},{"id":"W2125861280","doi":"10.48550/arxiv.1301.3864","title":"Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Probabilistic logic; Local consistency; Constraint (computer-aided design); Generalization; Consistency (knowledge bases); Reasoning system; Connection (principal bundle); Computer science; Theoretical computer science; Artificial intelligence; Mathematics; Mathematical optimization; Constraint satisfaction","score_opus":0.03614158244470897,"score_gpt":0.1783213174494765,"score_spread":0.14217973500476752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125861280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49729508,0.000014304605,0.49786115,0.00022713061,0.00011197454,0.0004878894,0.000003333596,0.00029048513,0.0037086634],"genre_scores_gemma":[0.9939307,0.0000147959745,0.0057198224,0.00006416153,0.00002808803,0.000003416093,0.0000060116154,0.000009213478,0.00022380437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986345,0.0001344199,0.0002108163,0.00064760144,0.00007804737,0.0002945999],"domain_scores_gemma":[0.9987771,0.00026366542,0.00015643875,0.00037103353,0.00021895129,0.00021282762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023219119,0.00018655638,0.00021372641,0.00015879645,0.00031301897,0.000200544,0.00024447322,0.00009875283,0.00010743086],"category_scores_gemma":[0.00033423057,0.00020677099,0.00005746516,0.0005281092,0.000316914,0.0007950905,0.00014503057,0.00018668495,0.000056411776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076580045,0.000037354257,0.042319495,0.000047598696,0.00005296453,0.000033856806,0.00038438546,0.017432693,0.00009844116,0.9262284,0.00007241911,0.013284701],"study_design_scores_gemma":[0.00085584377,0.000118706885,0.07049356,0.00011920366,0.00006560932,0.00007958651,0.00041281013,0.88443935,0.000043801832,0.042811107,0.00010332562,0.0004570979],"about_ca_topic_score_codex":0.00018123526,"about_ca_topic_score_gemma":0.000051383355,"teacher_disagreement_score":0.8834173,"about_ca_system_score_codex":0.00013864283,"about_ca_system_score_gemma":0.0001411832,"threshold_uncertainty_score":0.84318763},"labels":[],"label_agreement":null},{"id":"W2126182348","doi":"10.1007/978-3-319-09284-3_2","title":"Cores in Core Based MaxSat Algorithms: An Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Cardinality (data modeling); Core (optical fiber); Algorithm; Computer science; Characterization (materials science); Satisfiability; Construct (python library); Theoretical computer science; Boolean function; Data mining","score_opus":0.019886095028331236,"score_gpt":0.25706543432108314,"score_spread":0.2371793392927519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126182348","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012783745,0.000046684,0.9972293,0.00045788824,0.00076584955,0.00025462708,0.0000061085457,0.00015407949,0.00095763494],"genre_scores_gemma":[0.33542946,0.000015289117,0.66207194,0.002084594,0.00018804842,0.000008134829,0.0000353733,0.000024279463,0.00014286255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654794,0.000056984434,0.00054728,0.0015071539,0.0008493445,0.00049131725],"domain_scores_gemma":[0.9976203,0.0003542287,0.00027860492,0.0013338476,0.00021656533,0.00019646213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008915026,0.00043755662,0.0005898063,0.0025517584,0.00015829965,0.0004984572,0.0019983856,0.00030272678,0.000107572116],"category_scores_gemma":[0.00006959821,0.00042317354,0.00016467198,0.0017446707,0.0004927776,0.0004815287,0.0003607771,0.0005633354,0.000020758955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029170262,0.000015379848,0.0020074663,0.000008367873,0.000011033522,0.00003247781,0.00020161702,0.4908485,0.000009070126,0.0077062696,0.000002970377,0.4991539],"study_design_scores_gemma":[0.00026581725,0.000095871954,0.00476263,0.000082935374,0.00002220946,0.000011012273,1.7684214e-7,0.9816076,0.00007070604,0.012346528,0.00025730015,0.0004772181],"about_ca_topic_score_codex":0.0000916561,"about_ca_topic_score_gemma":0.0017095995,"teacher_disagreement_score":0.4986767,"about_ca_system_score_codex":0.0003176088,"about_ca_system_score_gemma":0.00045026132,"threshold_uncertainty_score":0.999822},"labels":[],"label_agreement":null},{"id":"W2126735726","doi":"10.3233/sat190045","title":"A Switching Criterion for Intensification and Diversification in Local Search for SAT12","year":2008,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft","keywords":"Diversification (marketing strategy); Business; Economics; Marketing","score_opus":0.060497287460256816,"score_gpt":0.2991865808051254,"score_spread":0.23868929334486857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126735726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.383905,0.000023512888,0.614745,0.0008919715,0.0000796771,0.00032088373,0.000001618853,0.000026241249,0.0000060875495],"genre_scores_gemma":[0.9092379,0.00007859711,0.09044858,0.0001563331,0.000038198308,0.00002170848,0.000009044951,0.0000068000495,0.0000028203328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988335,0.00009733922,0.00039693367,0.00033293842,0.00018131315,0.00015800059],"domain_scores_gemma":[0.9990959,0.00026316434,0.000112619644,0.00010761949,0.0003330283,0.00008762734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051457,0.00011234945,0.00015584857,0.00024531345,0.00043636738,0.00014835884,0.000079633275,0.00006592244,5.7794557e-7],"category_scores_gemma":[0.00010493685,0.00011372212,0.000045957262,0.00013023382,0.0000423385,0.00054096075,0.000027063852,0.00016952172,4.8702503e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011574735,0.000043007098,0.0032509025,0.00003918113,0.0000066855155,0.0000011274941,0.0025181824,0.44493034,0.00025019626,0.0039762696,0.000012494713,0.54485583],"study_design_scores_gemma":[0.0008914969,0.00017848433,0.014601109,0.000046623947,0.0000051783345,0.000086824984,0.0003723358,0.97528654,0.000035349713,0.008365927,0.000013501225,0.00011664169],"about_ca_topic_score_codex":0.00002431991,"about_ca_topic_score_gemma":0.000011226015,"teacher_disagreement_score":0.5447392,"about_ca_system_score_codex":0.00012858663,"about_ca_system_score_gemma":0.0000707736,"threshold_uncertainty_score":0.46374536},"labels":[],"label_agreement":null},{"id":"W2126876194","doi":"10.1109/time.2005.22","title":"Exploiting the Relationship between IA Networks and Finite Domain CSPs","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Domain (mathematical analysis); Binary number; Integer (computer science); Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Algebra over a field; Arithmetic; Pure mathematics; Programming language","score_opus":0.034377078634180186,"score_gpt":0.2635963339228164,"score_spread":0.2292192552886362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126876194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016200578,0.000030049068,0.97060996,0.007260457,0.00004822072,0.00007154169,2.7052758e-7,0.0001139737,0.0056649647],"genre_scores_gemma":[0.93320835,0.0000056034914,0.065837465,0.00052718393,0.00012370922,0.0000038937205,0.0000017615238,0.0000028375348,0.00028918727],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99947494,0.00005733338,0.00013455962,0.00013699087,0.000084622196,0.00011152382],"domain_scores_gemma":[0.99888504,0.00084389886,0.000043067128,0.00016738835,0.000018078445,0.000042537707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027586785,0.000056293607,0.000048596637,0.0000368616,0.0002564177,0.00014967975,0.00013475743,0.000035177392,0.00003644224],"category_scores_gemma":[0.00007504995,0.00004089443,0.000017747525,0.00018969238,0.000034336794,0.0003792736,0.00006693046,0.00011050096,0.000019723764],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8303555e-7,0.000003986382,0.45186207,0.0000014515321,0.0000058525898,4.9839525e-7,0.0007412914,0.026527477,0.0000017071368,0.3252219,0.0004944128,0.19513857],"study_design_scores_gemma":[0.00018302356,0.000008402974,0.5842965,0.000007954462,0.0000034014572,0.0000065470326,0.0001073191,0.40765166,0.0000071259115,0.0049113445,0.0027120598,0.00010463679],"about_ca_topic_score_codex":0.0000054931747,"about_ca_topic_score_gemma":0.000030598007,"teacher_disagreement_score":0.9170078,"about_ca_system_score_codex":0.000012978892,"about_ca_system_score_gemma":0.000011322476,"threshold_uncertainty_score":0.19721836},"labels":[],"label_agreement":null},{"id":"W2129155132","doi":"10.1007/3-540-39963-1_29","title":"Learning Relational Clichés with Contextual LGG","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Generalization; Computer science; Cliché; Context (archaeology); Artificial intelligence; Greedy algorithm; Theoretical computer science; Natural language processing; Algorithm; Mathematics; Linguistics","score_opus":0.013323387383803963,"score_gpt":0.22247425904750187,"score_spread":0.20915087166369792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129155132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007513185,0.00007564553,0.97605157,0.0006801589,0.00043869403,0.000225323,0.0000019325187,0.00020689434,0.022244655],"genre_scores_gemma":[0.3431901,0.00007981633,0.6521561,0.0016885925,0.000407945,0.00000928004,0.00002358425,0.000046145975,0.0023983968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729127,0.000035490124,0.00037301795,0.0010572497,0.0008475623,0.00039542755],"domain_scores_gemma":[0.9985561,0.0003425053,0.00021991532,0.00055129844,0.00019568484,0.00013450395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039019834,0.000361655,0.00031321903,0.0006032433,0.00033399346,0.00038030968,0.00095607823,0.00023248799,0.00025450438],"category_scores_gemma":[0.000044413824,0.000320115,0.00007117138,0.00047614862,0.00057564693,0.0006936518,0.00025049195,0.0009106615,0.00009568206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007733709,0.0000072812504,0.0002489546,0.0000039147435,0.000006811699,0.000029512585,0.0004030879,0.2831841,0.0000054411794,0.035627417,0.0000060671036,0.6804697],"study_design_scores_gemma":[0.0005912598,0.00034817657,0.0015134274,0.00030504423,0.00000913399,0.00026122146,3.8410724e-7,0.95329314,0.00007261259,0.03498615,0.0078119254,0.00080750854],"about_ca_topic_score_codex":0.000010875395,"about_ca_topic_score_gemma":0.000081120874,"teacher_disagreement_score":0.67966217,"about_ca_system_score_codex":0.00019235908,"about_ca_system_score_gemma":0.0006009889,"threshold_uncertainty_score":0.9999251},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04561028564651798,"score_gpt":0.2598856250634991,"score_spread":0.21427533941698113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130202378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055276183,0.000017614604,0.99494225,0.0019050868,0.00014768771,0.00023203144,0.0000047427948,0.00028341537,0.0019144213],"genre_scores_gemma":[0.5305465,0.0000027415415,0.46892235,0.00045679658,0.000010769712,0.000011492088,0.000030212583,0.0000054273755,0.000013766429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986959,0.00003704357,0.00028159874,0.00040108094,0.00038314675,0.00020122102],"domain_scores_gemma":[0.9990003,0.00013380928,0.00013125503,0.00023119646,0.00038839562,0.00011500536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111969464,0.00016883276,0.0001257861,0.0001734627,0.0001698173,0.00019228335,0.0003780184,0.000057275985,0.00016797752],"category_scores_gemma":[0.000043373155,0.00015588319,0.000039745966,0.0006097857,0.00015617046,0.0005185257,0.000042346735,0.00012018201,0.00006745875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008527532,0.000042325017,0.00015894744,0.000004399599,0.000007941056,0.0000059143977,0.000111629175,0.85646284,0.000005874734,0.13037209,0.000011309218,0.01280823],"study_design_scores_gemma":[0.00033253516,0.000118999385,0.00082532095,0.00004797427,0.0000046361083,0.00004567389,0.000026890722,0.98214275,0.00096327945,0.015208712,0.000060874987,0.00022235815],"about_ca_topic_score_codex":0.00001233139,"about_ca_topic_score_gemma":0.00000958282,"teacher_disagreement_score":0.5299937,"about_ca_system_score_codex":0.00009737752,"about_ca_system_score_gemma":0.0005172011,"threshold_uncertainty_score":0.63567317},"labels":[],"label_agreement":null},{"id":"W2130581475","doi":"10.1109/time.1996.555697","title":"A topological transition based logic for the qualitative motion of objects","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Ontology; Motion (physics); Computer science; Space (punctuation); Transition (genetics); Topology (electrical circuits); Simple (philosophy); Artificial intelligence; Theoretical computer science; Mathematics; Epistemology","score_opus":0.08569189190258579,"score_gpt":0.3251144373181105,"score_spread":0.2394225454155247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130581475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000490876,0.000014394197,0.9894548,0.0072847167,0.00007204407,0.00019897228,0.0000021403714,0.000052997475,0.0024290453],"genre_scores_gemma":[0.9143624,0.0000041550234,0.08486321,0.0006799791,0.000008332471,0.000016677794,0.0000015325525,0.0000010714601,0.000062699015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995542,0.00007760526,0.00011231167,0.00010585786,0.000084365194,0.00006565693],"domain_scores_gemma":[0.99937475,0.0003929428,0.00004188779,0.000104492494,0.00007067122,0.000015277614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019733349,0.000041852087,0.00005564693,0.00003265553,0.000068040805,0.0000178959,0.00009628914,0.000029765746,0.00031743178],"category_scores_gemma":[0.000056711186,0.000025973948,0.000050387458,0.00013931525,0.000047430985,0.000109050365,0.000005413006,0.000027581911,0.0000048069896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020073432,0.0001327402,0.00001367006,0.000017923061,0.000014378756,4.794226e-7,0.014277713,0.012459132,0.0005283343,0.89169514,0.0003715283,0.08046886],"study_design_scores_gemma":[0.00029269393,0.00012421487,0.0002033601,0.0000025198958,0.0000039032616,0.0000013384756,0.0010362263,0.9886299,0.0009901283,0.008647695,0.000025443333,0.00004258796],"about_ca_topic_score_codex":0.000006467501,"about_ca_topic_score_gemma":0.000010565464,"teacher_disagreement_score":0.9761708,"about_ca_system_score_codex":0.000010724401,"about_ca_system_score_gemma":0.000006112496,"threshold_uncertainty_score":0.34756553},"labels":[],"label_agreement":null},{"id":"W2131529421","doi":"10.1613/jair.2808","title":"Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Interpretation (philosophy); Cover (algebra); Combinatorics; Mathematics; Set (abstract data type); Maximum satisfiability problem; Algorithm; Random walk; State (computer science); Discrete mathematics; Computer science; Statistics","score_opus":0.1536970349026865,"score_gpt":0.4022898729203972,"score_spread":0.2485928380177107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131529421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009628567,0.00006987586,0.9791751,0.010061756,0.0002849413,0.00060739834,0.0000023541602,0.00001945075,0.0001505924],"genre_scores_gemma":[0.9474835,0.00009658223,0.052162826,0.000058989277,0.00014776742,0.000009048081,0.000001449061,0.0000040948303,0.000035735862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731225,0.0006020093,0.00073143473,0.00020829747,0.0008257385,0.00032027112],"domain_scores_gemma":[0.9950567,0.0017645364,0.00026723463,0.00032550198,0.0024773325,0.000108696884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010554482,0.00009100357,0.00015687602,0.00026884963,0.00042721158,0.0003725432,0.00075437117,0.00007294106,0.000047687965],"category_scores_gemma":[0.0016982062,0.00006036529,0.00010046546,0.001106297,0.00015677648,0.0005868561,0.00004875138,0.00047895685,0.000017524984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012961877,0.0001020923,0.00047765698,0.000006311464,0.000012746497,0.0000022987779,0.00046599907,0.0017773903,0.0010832801,0.044588726,0.00042159078,0.95093226],"study_design_scores_gemma":[0.0001093837,0.0012864202,0.030007018,0.000056455516,0.00000908149,0.00004890475,0.00036623623,0.52108085,0.02228254,0.42354903,0.0010179243,0.0001861401],"about_ca_topic_score_codex":0.00004671044,"about_ca_topic_score_gemma":0.00016479673,"teacher_disagreement_score":0.9507462,"about_ca_system_score_codex":0.00013851124,"about_ca_system_score_gemma":0.00042995845,"threshold_uncertainty_score":0.3657994},"labels":[],"label_agreement":null},{"id":"W2132852182","doi":"10.1007/978-3-642-13059-5_36","title":"Notes on Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University; University of Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Preprocessor; Isomorphism (crystallography); Computer science; Combinatorics; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Graph","score_opus":0.019263700183633534,"score_gpt":0.24087385403856237,"score_spread":0.22161015385492883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132852182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001058777,0.00020638264,0.9927843,0.0005861392,0.0033683432,0.00044218788,0.000007831082,0.00020206672,0.0013439383],"genre_scores_gemma":[0.19455425,0.000059367077,0.8029797,0.0017944354,0.0004883877,0.0000062502913,0.000008462745,0.00003616759,0.0000729385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962161,0.00005401179,0.0006313474,0.0014738203,0.0010057546,0.0006189669],"domain_scores_gemma":[0.99724585,0.0007756181,0.00044686758,0.0010835822,0.00026499218,0.00018307197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081416446,0.0006055515,0.00059558335,0.0010637821,0.0007002069,0.0009430183,0.0015546709,0.00043254657,0.0000864474],"category_scores_gemma":[0.00018874303,0.0005473668,0.00016276311,0.00072127656,0.0007615613,0.0008130697,0.00046184633,0.0011518628,0.000028939623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001394117,0.000022186245,0.00034485233,0.000023454199,0.000014871459,0.000047657566,0.0006069505,0.3951462,0.004243504,0.013998867,0.0000052466407,0.5855323],"study_design_scores_gemma":[0.00071223325,0.00009816496,0.00011648152,0.00034940042,0.000010396447,0.00008461687,2.2089202e-7,0.9631619,0.0049086744,0.029343544,0.0004600903,0.0007542943],"about_ca_topic_score_codex":0.000067442284,"about_ca_topic_score_gemma":0.00047524917,"teacher_disagreement_score":0.584778,"about_ca_system_score_codex":0.00022672438,"about_ca_system_score_gemma":0.0006103067,"threshold_uncertainty_score":0.9996978},"labels":[],"label_agreement":null},{"id":"W2135089984","doi":"10.1109/time.2004.1314416","title":"The SOL time theory: a formalization of structured temporal objects and repetition","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Temporality; Repetition (rhetorical device); Formalism (music); Theory; Consistency (knowledge bases); Temporal logic; Theoretical computer science; Artificial intelligence; Programming language; Epistemology; Linguistics","score_opus":0.0035398680550759063,"score_gpt":0.19383634146547943,"score_spread":0.1902964734104035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135089984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008860845,0.00001814585,0.986952,0.00052013516,0.00007019207,0.000120740624,7.444158e-7,0.00006890729,0.0033882838],"genre_scores_gemma":[0.9783541,0.000016824662,0.021336,0.00008253012,0.000008145507,0.0000021997084,0.0000038422218,0.000002098483,0.00019423408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996012,0.000029153798,0.000115281626,0.000094190895,0.00009444791,0.00006575236],"domain_scores_gemma":[0.9996859,0.000031938158,0.000068481284,0.0001380355,0.000054048272,0.000021609298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016531849,0.00004445081,0.000045091256,0.000033848282,0.000118818374,0.00006388784,0.00008271569,0.000025048366,0.00002561867],"category_scores_gemma":[0.000033325632,0.000029679377,0.000015128715,0.00010040287,0.000047399764,0.00030093195,0.000032475982,0.000025258909,0.000003118144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011144878,0.0000075263993,0.0004395786,0.0000054085986,0.000008205896,4.789906e-7,0.0009218951,0.0017809429,0.0012457418,0.9523537,0.00003866672,0.043186698],"study_design_scores_gemma":[0.0030700546,0.0003612702,0.04356903,0.000072245886,0.000024343317,0.00015393423,0.0006099514,0.2804552,0.043795023,0.62640786,0.0009785952,0.0005024662],"about_ca_topic_score_codex":0.000011266778,"about_ca_topic_score_gemma":0.000057215384,"teacher_disagreement_score":0.96949327,"about_ca_system_score_codex":0.000013084495,"about_ca_system_score_gemma":0.000040664014,"threshold_uncertainty_score":0.12102898},"labels":[],"label_agreement":null},{"id":"W21360298","doi":"10.1007/s10654-011-9560-y","title":"Solving Temporal Constraints Using Neural Networks.","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Artificial neural network; Computer science; Mathematical optimization; Constraint (computer-aided design); Constraint satisfaction problem; Hopfield network; Optimization problem; Focus (optics); Computation; Constraint satisfaction; Artificial intelligence; Algorithm; Mathematics","score_opus":0.15877285869559393,"score_gpt":0.3267786207031929,"score_spread":0.16800576200759898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21360298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051487465,0.000015285144,0.975944,0.0026429922,0.0020966465,0.0001430841,0.000005291218,0.00019339238,0.013810565],"genre_scores_gemma":[0.9835947,0.00003429233,0.01544761,0.000607268,0.0001847456,0.000006791197,0.0000058842156,0.0000100564475,0.0001086381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982052,0.000072422896,0.00048752033,0.00048470378,0.00044193162,0.00030824705],"domain_scores_gemma":[0.9989782,0.000088957095,0.00018334032,0.00030775266,0.0003099879,0.00013174347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001882244,0.00020633181,0.00015515198,0.00022885064,0.0001972973,0.00056374166,0.00083064794,0.00008765304,0.0038411017],"category_scores_gemma":[0.00011549356,0.00021578274,0.00009080074,0.0003072351,0.00021971195,0.0006721452,0.00012982954,0.0002728802,0.00023258448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008275985,0.000074233925,0.0004128498,0.00000141853,0.000016685954,0.000024702173,0.00024925618,0.07209103,0.00035997547,0.5199147,0.00006770665,0.40677917],"study_design_scores_gemma":[0.000033826447,0.00004294781,0.00008052506,0.000031904496,0.000002919857,0.00004195965,0.000106753985,0.9910805,0.00093450636,0.007321035,0.00009608331,0.00022703454],"about_ca_topic_score_codex":0.00003501057,"about_ca_topic_score_gemma":0.000034900237,"teacher_disagreement_score":0.97844595,"about_ca_system_score_codex":0.00010430185,"about_ca_system_score_gemma":0.00003641148,"threshold_uncertainty_score":0.99706954},"labels":[],"label_agreement":null},{"id":"W2136726483","doi":"10.1007/978-3-540-72875-7_7","title":"Logical Topology Design II","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Topology (electrical circuits); Computer science; Mathematics; Combinatorics","score_opus":0.07466303026170845,"score_gpt":0.27270855519990617,"score_spread":0.19804552493819771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136726483","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.1303622e-8,0.000019026194,0.51859677,0.00038589648,0.0002325766,0.000066372624,2.981435e-7,0.00012867268,0.48057032],"genre_scores_gemma":[0.00021564226,0.00005139135,0.330845,0.0013609467,0.00007389571,0.0000012467672,0.000003704317,0.000007828173,0.66744035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915594,0.00001219793,0.00020315964,0.00032152014,0.00015502686,0.00015215093],"domain_scores_gemma":[0.9994059,0.0000851645,0.000076657714,0.00029296897,0.00006303297,0.000076261495],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016593536,0.0001558764,0.00016271806,0.00014886468,0.00010334284,0.000036546935,0.00029717293,0.0003213985,0.005500973],"category_scores_gemma":[0.00001093583,0.00013521872,0.00006988108,0.000026582933,0.000078448254,0.00008851639,0.00017197513,0.00019759237,0.00036402425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015560842,0.0000032188286,9.4902515e-7,8.166018e-7,0.000006851857,0.000017005155,0.00001673025,0.00007994472,0.0000013964953,0.8922108,0.0026904761,0.104970284],"study_design_scores_gemma":[0.00033145447,0.00032590507,0.000071201845,0.000021813523,0.000016427159,0.00023931361,0.000003261142,0.02307123,0.00007337786,0.27576718,0.69938105,0.00069782074],"about_ca_topic_score_codex":0.0000027289914,"about_ca_topic_score_gemma":0.000011895052,"teacher_disagreement_score":0.69669056,"about_ca_system_score_codex":0.000041831034,"about_ca_system_score_gemma":0.000066283756,"threshold_uncertainty_score":0.9954081},"labels":[],"label_agreement":null},{"id":"W2137215545","doi":"","title":"Detecting Physical Defects: A Practical 2D-Study of Cracks and Holes","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Set (abstract data type); Computer science; Spatial intelligence; Domain (mathematical analysis); Theoretical computer science; Artificial intelligence; Algorithm; Programming language; Mathematics","score_opus":0.016711017772679033,"score_gpt":0.2906654550549669,"score_spread":0.27395443728228785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137215545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59557885,0.0000018226206,0.40276235,0.0002822596,0.000019171312,0.000074333475,4.9588817e-8,0.00005593688,0.0012252275],"genre_scores_gemma":[0.9746809,9.669808e-7,0.0251829,0.00010582404,0.0000139759195,0.0000011652673,6.5032204e-8,0.0000013202523,0.000012887789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951375,0.000038839902,0.00009835194,0.00015833812,0.000114001465,0.00007674357],"domain_scores_gemma":[0.99964046,0.00010556781,0.000046745008,0.0001291269,0.000039009115,0.000039075927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008267056,0.00005297386,0.00008326145,0.00004575302,0.000054617725,0.000057137364,0.000058105903,0.000017466755,0.00000572382],"category_scores_gemma":[0.0000932278,0.00004498163,0.000016864511,0.00015139666,0.000022379003,0.00029747214,0.000035419594,0.0000670656,0.000002501674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023438623,0.001460518,0.017985348,0.000010579403,0.000027781512,0.000022965216,0.01027502,0.00065746653,0.0068344506,0.099756576,0.0000955821,0.86285025],"study_design_scores_gemma":[0.0019234617,0.0021872008,0.32856536,0.000023059303,0.000038252627,0.00013287802,0.0035241363,0.6481483,0.007539417,0.007462079,0.0000592535,0.0003965768],"about_ca_topic_score_codex":0.000009748915,"about_ca_topic_score_gemma":0.00002061684,"teacher_disagreement_score":0.8624537,"about_ca_system_score_codex":0.000006336624,"about_ca_system_score_gemma":0.000017515287,"threshold_uncertainty_score":0.18342976},"labels":[],"label_agreement":null},{"id":"W2137578750","doi":"10.1007/s10601-008-9067-7","title":"New filtering algorithms for combinations of among constraints","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Subsequence; Sequence (biology); Consistency (knowledge bases); Constraint (computer-aided design); Algorithm; Constraint programming; Domain (mathematical analysis); Computer science; Longest common subsequence problem; Local consistency; Time complexity; Mathematics; Constraint satisfaction; Mathematical optimization; Artificial intelligence; Stochastic programming","score_opus":0.022042688135491338,"score_gpt":0.26948883090847336,"score_spread":0.24744614277298202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137578750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020402453,0.000016282827,0.98814297,0.0007981762,0.000375812,0.00037781766,0.000022822935,0.00015577635,0.008070073],"genre_scores_gemma":[0.7380729,0.000004785927,0.26156878,0.0001409323,0.000028917475,0.000006219623,0.000010781526,0.0000048320785,0.00016185641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885976,0.00002636745,0.00037426146,0.00030385127,0.00018454647,0.00025122392],"domain_scores_gemma":[0.9990409,0.00012855705,0.00017705161,0.00030971348,0.00018168529,0.00016207725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019204101,0.00014716708,0.00020876229,0.00017544444,0.000109559944,0.000087025386,0.0003775268,0.00008283054,0.0002375112],"category_scores_gemma":[0.00012365756,0.00016207699,0.00011151974,0.00028093255,0.0002894623,0.0004312824,0.000036333517,0.000090242705,0.00000885167],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022321817,0.00005542903,0.00035402077,0.000006008179,0.000015911215,0.0000023819523,0.00025544566,0.00015905847,0.0008036565,0.1659329,0.00059426285,0.8318187],"study_design_scores_gemma":[0.021955889,0.001516625,0.27497122,0.000703047,0.00014597029,0.00043816853,0.00093472534,0.5030164,0.041179657,0.14739168,0.004946965,0.0027996562],"about_ca_topic_score_codex":0.000005545341,"about_ca_topic_score_gemma":0.0000041686844,"teacher_disagreement_score":0.829019,"about_ca_system_score_codex":0.000033088207,"about_ca_system_score_gemma":0.00021982644,"threshold_uncertainty_score":0.66093075},"labels":[],"label_agreement":null},{"id":"W2138183564","doi":"10.1109/pacrim.1993.407313","title":"A sense of scale","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Knowledge base; Intelligent design; Scale (ratio); Constraint (computer-aided design); Object (grammar); Conceptual design; Programming language; Artificial intelligence; Theoretical computer science; Human–computer interaction; Engineering","score_opus":0.012780364903092985,"score_gpt":0.19100995009590033,"score_spread":0.17822958519280735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138183564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061760363,0.0000060557595,0.9074546,0.00063008314,0.00005388746,0.000019928459,1.4305164e-7,0.000055673623,0.08560359],"genre_scores_gemma":[0.9046642,0.000006079218,0.09366081,0.00013858476,0.000003786002,3.5108712e-7,6.358772e-8,6.5575125e-7,0.00152544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998049,0.0000064672436,0.000052538857,0.00005225812,0.00004958368,0.000034214463],"domain_scores_gemma":[0.9998379,0.000009721878,0.000014450205,0.00010171808,0.0000199105,0.000016352378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000021605603,0.000017509283,0.000026195448,0.00002617616,0.000011653908,0.000009555771,0.00003195704,0.000009117905,0.0006681685],"category_scores_gemma":[0.000004006833,0.000015358619,0.00001291837,0.00010375587,0.0000106926045,0.00009691617,0.000015889727,0.000011787252,0.000057488258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.696081e-7,0.000085200525,0.0045657335,0.000007979414,0.0000080346035,0.000007328642,0.0014384966,0.0010632178,0.0025279946,0.1848402,0.010259364,0.79519546],"study_design_scores_gemma":[0.00017119848,0.0000198903,0.007894581,0.000003097013,0.0000010139655,0.00003756651,0.000019282385,0.98434174,0.004660047,0.0004125299,0.0023744015,0.00006463464],"about_ca_topic_score_codex":0.000004430417,"about_ca_topic_score_gemma":0.0000052366,"teacher_disagreement_score":0.9832785,"about_ca_system_score_codex":0.0000026180153,"about_ca_system_score_gemma":0.000002080026,"threshold_uncertainty_score":0.73159766},"labels":[],"label_agreement":null},{"id":"W2139177468","doi":"10.3138/infor.49.1.015","title":"A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations","year":2011,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Mitacs","keywords":"Guided Local Search; Incremental heuristic search; Search and rescue; Beam search; Best-first search; Computer science; Mathematical optimization; Search algorithm; Search theory; Constraint (computer-aided design); Iterative deepening depth-first search; Constraint programming; Object (grammar); Operations research; Algorithm; Artificial intelligence; Mathematics; Stochastic programming","score_opus":0.12590532380340372,"score_gpt":0.3202113026547849,"score_spread":0.1943059788513812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139177468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011222343,0.00007848895,0.9848891,0.00027722723,0.00006977264,0.0018595959,0.000050823634,0.00002045158,0.0015322057],"genre_scores_gemma":[0.9416542,0.00013134957,0.05748341,0.00005671267,0.00001677487,0.00044803903,0.00014716494,0.0000046473647,0.00005770425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981618,0.00022065126,0.0005861103,0.00016612922,0.00064279645,0.0002225226],"domain_scores_gemma":[0.99773955,0.0003781682,0.000031823503,0.00022775256,0.0015456898,0.000077009805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033824719,0.00009661849,0.00012957312,0.00055783434,0.0006443799,0.00040489703,0.00027186776,0.00007499787,0.000028710121],"category_scores_gemma":[0.0004212767,0.00007729541,0.00001787352,0.0008456547,0.00021403914,0.002220713,0.00016789662,0.000228092,0.0000014070191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028793716,0.000018151683,0.00084708363,0.000057076217,0.000010374206,7.092096e-8,0.006594594,0.7686546,0.000024768848,0.2183959,0.000016964415,0.0053516594],"study_design_scores_gemma":[0.0006907136,0.00008961575,0.004527614,0.000015823745,0.0000017298216,0.00001844391,0.0070161335,0.9872027,0.00010041833,0.000008022142,0.00024511927,0.00008366406],"about_ca_topic_score_codex":0.0023218873,"about_ca_topic_score_gemma":0.0001524024,"teacher_disagreement_score":0.93043184,"about_ca_system_score_codex":0.000075847085,"about_ca_system_score_gemma":0.0005040017,"threshold_uncertainty_score":0.4956114},"labels":[],"label_agreement":null},{"id":"W2139257162","doi":"10.1109/ictai.2008.43","title":"Solving Temporal Constraint Satisfaction Problems with Heuristic Based Evolutionary Algorithms","year":2008,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Heuristics; Computer science; Heuristic; Constraint satisfaction; Descendant; Evolutionary algorithm; Evolutionary computation; Constraint (computer-aided design); Genetic algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.018172809775191482,"score_gpt":0.21169144818541125,"score_spread":0.19351863841021977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139257162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041912585,0.000020661273,0.99041545,0.0007632162,0.00019461119,0.0002606974,0.000003176941,0.0004922061,0.0036587412],"genre_scores_gemma":[0.6715584,0.0000064088313,0.32803074,0.0001911753,0.000023329369,0.000016190308,0.000009236673,0.0000068044765,0.00015774938],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987405,0.000054086613,0.0002471837,0.00037389953,0.00034589318,0.00023846274],"domain_scores_gemma":[0.9992605,0.000072429306,0.00010609977,0.00028368033,0.0001577982,0.00011952292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011231336,0.00016002232,0.00013619894,0.00015581485,0.00034652112,0.00006774191,0.00015089949,0.000059145124,0.00028675506],"category_scores_gemma":[0.00002237262,0.00013600914,0.000044780867,0.0003753523,0.00017125394,0.00059513265,0.00003455582,0.00013701344,0.000045249948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046402805,0.0002917772,0.6261895,0.00008075525,0.000099743316,0.0002665011,0.0009861373,0.14035724,0.00064922054,0.042596873,0.005158329,0.18327756],"study_design_scores_gemma":[0.00070348283,0.00012733403,0.17851149,0.000028439734,0.000005275658,0.00050964486,0.00003422148,0.818974,0.00009441883,0.0002495107,0.000490066,0.00027212763],"about_ca_topic_score_codex":0.0002127607,"about_ca_topic_score_gemma":0.000112098875,"teacher_disagreement_score":0.67861676,"about_ca_system_score_codex":0.00010356382,"about_ca_system_score_gemma":0.0003573832,"threshold_uncertainty_score":0.55462915},"labels":[],"label_agreement":null},{"id":"W2142190389","doi":"10.1613/jair.2446","title":"A Constraint Programming Approach for Solving a Queueing Control Problem","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Queueing theory; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Concurrent constraint logic programming; Stochastic programming; Staffing; Control (management)","score_opus":0.15808666941614952,"score_gpt":0.37932137778767777,"score_spread":0.22123470837152825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142190389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026454364,0.000096194635,0.9949879,0.0009834715,0.0001492656,0.0006072512,0.0000010648331,0.000034133547,0.0004953008],"genre_scores_gemma":[0.6219927,0.000038296257,0.37774095,0.00002555556,0.00015242936,0.000021650161,3.6780446e-7,0.0000069525063,0.000021075815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974613,0.0001774961,0.0007944243,0.00025278926,0.0007950669,0.0005188895],"domain_scores_gemma":[0.9969792,0.00061916385,0.00028964167,0.00019716023,0.0017129623,0.00020192396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003949767,0.00011613704,0.00025217276,0.000541935,0.00054926414,0.00030076882,0.00062200194,0.00008314176,0.000020010883],"category_scores_gemma":[0.00076207373,0.00010136374,0.00017062915,0.00074364804,0.00034154858,0.000670354,0.00006879921,0.0005433654,0.000006852777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011637391,0.00026666382,0.00035083227,0.00004992607,0.00005769843,0.000058109003,0.0031739026,0.016986825,0.00466787,0.095546916,0.0001650835,0.8785598],"study_design_scores_gemma":[0.00022517054,0.0007607758,0.000073723175,0.00010029474,0.0000094968,0.000943691,0.0023457292,0.97149163,0.010078932,0.0128076095,0.0009318797,0.00023105548],"about_ca_topic_score_codex":0.000020473946,"about_ca_topic_score_gemma":0.000008358311,"teacher_disagreement_score":0.9545048,"about_ca_system_score_codex":0.00013697341,"about_ca_system_score_gemma":0.00071517157,"threshold_uncertainty_score":0.42245513},"labels":[],"label_agreement":null},{"id":"W2142853228","doi":"10.1109/robot.1996.509265","title":"Using hypergraph knowledge representation for natural terrain robot navigation and path planning","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Motion planning; Terrain; Computer science; Representation (politics); Path (computing); Robot; Natural (archaeology); Artificial intelligence; Computer vision; Mobile robot; Mobile robot navigation; Robot control; Geography; Cartography; Computer network","score_opus":0.06594421792344765,"score_gpt":0.3216563165017405,"score_spread":0.2557120985782928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142853228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0321528,0.00015736424,0.9657255,0.00025552957,0.00027365188,0.00017262869,7.1529297e-7,0.00011086375,0.0011509627],"genre_scores_gemma":[0.79464656,0.0000048984784,0.20503727,0.00006276036,0.000031519256,0.0000061126993,0.000006343472,0.0000036921165,0.00020087682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994521,0.000027200678,0.00013098752,0.00021430415,0.00006933877,0.00010605044],"domain_scores_gemma":[0.99967927,0.000063432046,0.00005168658,0.000109800116,0.000059643113,0.000036145393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000837412,0.00006914189,0.00006616623,0.00008850295,0.00015831363,0.000120311335,0.00007002267,0.000032673855,0.000014070831],"category_scores_gemma":[0.000025298967,0.000066007146,0.000027509532,0.00020234626,0.000021415848,0.0005532024,0.00003015346,0.000046403773,0.000002153693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014956308,0.000092468305,0.018296791,0.00006704837,0.000045033077,0.0000060384295,0.011794452,0.023125948,0.02401139,0.04510381,0.0030241967,0.87441784],"study_design_scores_gemma":[0.00029164003,0.000015784562,0.0038682106,0.000020193513,0.0000037626737,0.000027571752,0.00010607245,0.9944139,0.0004758891,0.0004650304,0.00021906335,0.00009287913],"about_ca_topic_score_codex":0.00001223913,"about_ca_topic_score_gemma":0.0000028968761,"teacher_disagreement_score":0.97128797,"about_ca_system_score_codex":0.000020722699,"about_ca_system_score_gemma":0.0000082002625,"threshold_uncertainty_score":0.26916933},"labels":[],"label_agreement":null},{"id":"W2144930856","doi":"10.1215/00294527-1731344","title":"Complementation in Representable Theories of Region-Based Space","year":2013,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Closure (psychology); Mereology; Mathematics; Class (philosophy); Topological space; Algebraic number; Space (punctuation); Pure mathematics; Identity (music); Complementation; Topology (electrical circuits); Computer science; Combinatorics; Physics; Epistemology","score_opus":0.018718476576078367,"score_gpt":0.25851814022920266,"score_spread":0.2397996636531243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144930856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07983442,0.00003492837,0.9146788,0.002505665,0.00021255111,0.00012740339,0.0000010415484,0.000011900765,0.0025932612],"genre_scores_gemma":[0.9568805,0.0000132352625,0.042865258,0.00017979255,0.000017299264,0.000001634718,0.0000017229072,0.0000019832921,0.000038545473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991333,0.00006307728,0.00040057185,0.000071892544,0.00020469356,0.00012648132],"domain_scores_gemma":[0.99909765,0.00008500529,0.00042972376,0.00013178581,0.00021518877,0.000040637107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026739214,0.00006244066,0.00014018721,0.00017427217,0.000037237525,0.00005063892,0.00021723352,0.000028327302,0.00017158627],"category_scores_gemma":[0.000057724963,0.000049577324,0.0000556174,0.000254198,0.000041836975,0.0012502766,0.000033442204,0.00010115264,0.0000054155266],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016991091,0.00039222848,0.2890023,0.00009209567,0.000053856777,0.000057146284,0.0029699013,0.1347301,0.004363967,0.42095092,0.004532014,0.14268555],"study_design_scores_gemma":[0.0050680093,0.0011578716,0.49938628,0.00023919805,0.00002603168,0.00028053313,0.0021322349,0.40501028,0.013566837,0.071603306,0.0010844669,0.00044496148],"about_ca_topic_score_codex":0.000081106526,"about_ca_topic_score_gemma":0.000022336739,"teacher_disagreement_score":0.8770461,"about_ca_system_score_codex":0.000037989852,"about_ca_system_score_gemma":0.0000706077,"threshold_uncertainty_score":0.20217045},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04697374374933979,"score_gpt":0.3001038880978434,"score_spread":0.2531301443485036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145996207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042110022,0.000037505015,0.95621413,0.0008598503,0.0002727958,0.00019594058,0.0000027125275,0.000088736175,0.00021831623],"genre_scores_gemma":[0.7805293,0.0000058651704,0.21923386,0.00017845347,0.000035223522,0.000004094633,0.0000053619215,0.0000043887476,0.0000034587463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988384,0.0000928186,0.00037392476,0.0003126227,0.00021723886,0.00016496574],"domain_scores_gemma":[0.99910474,0.0002943814,0.000117937474,0.0002618068,0.00017982296,0.000041329386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037997405,0.00011637843,0.000091854396,0.0001039604,0.00034948313,0.00030230984,0.00019439757,0.00006035927,0.00007635585],"category_scores_gemma":[0.00012723547,0.00009785039,0.00003791524,0.0004160394,0.00022580697,0.00042858033,0.000046762078,0.00008384424,0.000008499415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001635119,0.0000437549,0.0006868857,0.00000486298,0.000002534964,0.000002068257,0.00020644267,0.45605922,0.0021990726,0.058560852,0.0000254329,0.48219252],"study_design_scores_gemma":[0.000027636257,0.000021228207,0.00094868033,0.000016350426,0.000005651892,0.000009067332,0.00012735721,0.97421926,0.011221835,0.013236078,0.000057807374,0.0001090174],"about_ca_topic_score_codex":0.00015964109,"about_ca_topic_score_gemma":0.00010182146,"teacher_disagreement_score":0.7384193,"about_ca_system_score_codex":0.000034720822,"about_ca_system_score_gemma":0.00006944623,"threshold_uncertainty_score":0.3990223},"labels":[],"label_agreement":null},{"id":"W2146608275","doi":"10.1109/hpcs.2005.30","title":"High Performance Constraint Satisfaction Problem Solving: State-Recomputation versus State-Copying","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Copying; Computer science; Constraint satisfaction problem; State (computer science); Constraint (computer-aided design); Constraint satisfaction; Parallel computing; Focus (optics); Look-ahead; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.014794936891720553,"score_gpt":0.23671338482979226,"score_spread":0.2219184479380717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146608275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2638629,0.000007494376,0.73147523,0.00080495083,0.0006304466,0.00024107394,0.0000024319218,0.0004939665,0.0024815092],"genre_scores_gemma":[0.71512705,0.000038816637,0.28441784,0.00013814884,0.000041813095,0.0000097997545,0.000008734744,0.000009435661,0.00020835274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.000055244596,0.00042945484,0.000424957,0.00032907195,0.00034232234],"domain_scores_gemma":[0.99916404,0.00010874771,0.00018235017,0.00025343898,0.00017011589,0.00012131548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026752718,0.00019830807,0.00015899101,0.00019794113,0.00026369203,0.00030814856,0.00019857532,0.000056526253,0.0003102893],"category_scores_gemma":[0.000018997742,0.00019965082,0.000046538924,0.00035606054,0.00005941569,0.0018396457,0.0000721059,0.00017876134,0.0002371112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022737904,0.00001802279,0.0017448323,0.000010513947,0.000017025515,0.0000010341226,0.0005918129,0.22525077,0.00024883804,0.0035343098,0.00020595395,0.7683542],"study_design_scores_gemma":[0.0017653682,0.00017035284,0.047267567,0.000027317303,0.0000075729795,0.000024631758,0.00009162651,0.94457877,0.0043581086,0.0006044699,0.0006846413,0.00041957275],"about_ca_topic_score_codex":0.00013419005,"about_ca_topic_score_gemma":0.0003232524,"teacher_disagreement_score":0.76793456,"about_ca_system_score_codex":0.0002421808,"about_ca_system_score_gemma":0.0001536415,"threshold_uncertainty_score":0.8141524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","score_opus":0.011106381693631446,"score_gpt":0.2534107792008292,"score_spread":0.24230439750719776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147012241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003289905,0.000008421133,0.9854616,0.0029913713,0.0008518701,0.00029964934,0.00000331265,0.0002815281,0.0068123615],"genre_scores_gemma":[0.7039872,0.0000062501113,0.2952616,0.0005863193,0.00010593023,0.000009526894,0.0000020847692,0.0000039022857,0.00003724364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981244,0.000057810154,0.00029635933,0.0006321662,0.00043103547,0.0004582213],"domain_scores_gemma":[0.99842143,0.00043994805,0.00007025204,0.00060203235,0.00024576765,0.0002205458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106119,0.00013803323,0.00016058213,0.0001668348,0.0004629553,0.00044814366,0.0012352997,0.0000447303,0.000027368027],"category_scores_gemma":[0.00023263694,0.000114691,0.000072867384,0.0008936697,0.0011913131,0.00066106534,0.00030013482,0.00009542704,0.0000661918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006582385,0.000024217641,0.000028647899,0.0000016834803,0.000002042401,0.00000490856,0.00019163633,0.001007779,0.00009129958,0.87765133,0.00017133908,0.12075931],"study_design_scores_gemma":[0.0016659456,0.00015294435,0.0006730928,0.000010818729,0.0000033570134,0.00008688302,0.0000035264347,0.91239864,0.00058111246,0.08237204,0.0018623803,0.00018927881],"about_ca_topic_score_codex":0.0000017436761,"about_ca_topic_score_gemma":0.0000014034334,"teacher_disagreement_score":0.91139084,"about_ca_system_score_codex":0.000051575596,"about_ca_system_score_gemma":0.00011176928,"threshold_uncertainty_score":0.4676963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; 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","score_opus":0.1824121673170033,"score_gpt":0.40867049433853025,"score_spread":0.22625832702152696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147148915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046284464,0.000077396566,0.9930465,0.0013487235,0.00046086637,0.00020478257,0.0000016099915,0.000027244701,0.00020441732],"genre_scores_gemma":[0.57252115,0.00020159084,0.42651448,0.00009308095,0.00049510365,0.000009896355,0.0000016714849,0.000012531838,0.00015052738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786997,0.00016275294,0.0005922227,0.00019830729,0.00082490186,0.0003518579],"domain_scores_gemma":[0.99700785,0.0004441606,0.0002104016,0.00016280639,0.0020048667,0.0001699238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107196,0.00009273928,0.0001731313,0.0007339581,0.00044600118,0.00013878924,0.00044789736,0.00008174893,0.00011456385],"category_scores_gemma":[0.0004454133,0.00008375545,0.0001461786,0.0011208885,0.00016162948,0.0004885521,0.00003974252,0.00038091303,0.00004062097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005704911,0.00011245078,0.00032174267,0.0000070238816,0.000016379754,0.000023480894,0.00025617678,0.005787748,0.0016982679,0.007841962,0.0012974711,0.98258024],"study_design_scores_gemma":[0.00008654765,0.0007041182,0.00038528728,0.000027775082,0.0000043025743,0.00031067172,0.00019380008,0.9229377,0.059704397,0.01222745,0.0032832953,0.00013464026],"about_ca_topic_score_codex":0.000021711552,"about_ca_topic_score_gemma":0.000019971063,"teacher_disagreement_score":0.9824456,"about_ca_system_score_codex":0.00016787478,"about_ca_system_score_gemma":0.0007917904,"threshold_uncertainty_score":0.34303257},"labels":[],"label_agreement":null},{"id":"W2147311058","doi":"10.1109/ictai.2005.14","title":"A new temporal CSP framework handling composite variables and activity constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint satisfaction dual problem; Local consistency; Constraint graph; Constraint (computer-aided design); Mathematical optimization; Constraint logic programming; Computer science; Constraint programming; Constraint learning; Set (abstract data type); Mathematics; Artificial intelligence; Stochastic programming; Probabilistic logic","score_opus":0.0115169891188017,"score_gpt":0.24292235271913926,"score_spread":0.23140536360033756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147311058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008110926,0.000025567684,0.9830527,0.0026506407,0.00013164345,0.000087707296,9.688213e-7,0.00020059288,0.005739283],"genre_scores_gemma":[0.5225485,0.000007799451,0.47685203,0.0002954447,0.00004407491,7.7805356e-7,5.335312e-7,0.0000023082885,0.00024852954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993165,0.000031051797,0.00012298553,0.00025097164,0.00012391999,0.00015457619],"domain_scores_gemma":[0.9994813,0.00011566997,0.000052709544,0.00018033905,0.000030228477,0.00013970924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012068526,0.00010048964,0.000112672016,0.000065176304,0.00012850136,0.00024832305,0.00013632582,0.00007250601,0.00035538277],"category_scores_gemma":[0.000025764768,0.00009508735,0.000024526476,0.00016762309,0.00005706751,0.00058849045,0.00008364783,0.00012646735,0.000022868577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052702458,0.000020550246,0.007346418,0.0000037713999,0.000013953588,0.000002075892,0.00029520591,0.0010585588,0.00059871766,0.08643856,0.00028351392,0.9039334],"study_design_scores_gemma":[0.0013752193,0.00007121388,0.038720805,0.00010642898,0.000018482504,0.00017748223,0.00005567695,0.93393266,0.0056327577,0.010797623,0.008448146,0.0006634873],"about_ca_topic_score_codex":0.00007047641,"about_ca_topic_score_gemma":0.000046413254,"teacher_disagreement_score":0.93287414,"about_ca_system_score_codex":0.000023601784,"about_ca_system_score_gemma":0.00009080242,"threshold_uncertainty_score":0.3891192},"labels":[],"label_agreement":null},{"id":"W2148375944","doi":"10.1109/cwit.2007.375705","title":"On the Interpretation of Survey Propagation","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Belief propagation; Probabilistic logic; Computer science; Constraint (computer-aided design); Decoupling (probability); Token passing; Security token; Message passing; Local consistency; Interpretation (philosophy); Reduction (mathematics); Propagation of uncertainty; Constraint satisfaction problem; Constraint satisfaction; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Distributed computing; Computer security; Engineering; Programming language","score_opus":0.020907023503495308,"score_gpt":0.25203305472889853,"score_spread":0.23112603122540323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148375944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017789334,8.136115e-7,0.9688079,0.00035171479,0.00010016526,0.000079162586,2.6280298e-7,0.000031013307,0.012839666],"genre_scores_gemma":[0.9947102,5.805037e-7,0.004941987,0.00022617032,0.0000031289924,8.223603e-7,0.0000016483525,0.0000010339929,0.000114431736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962556,0.00004710598,0.00011033774,0.000067392044,0.00010534375,0.00004427195],"domain_scores_gemma":[0.9994097,0.00031907525,0.000051913514,0.0001270668,0.00008092911,0.000011336577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000764818,0.000027376642,0.000027849781,0.000045948527,0.000027983891,0.000019392786,0.000107528715,0.000013579037,0.000056152458],"category_scores_gemma":[0.00015451548,0.00001708716,0.000012456471,0.00019703526,0.000016725151,0.0001141497,0.0000136389735,0.00002890041,0.000014735514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018157172,0.000023354727,0.004699685,0.000002136083,0.000004906643,2.0836673e-7,0.0004919393,0.0022053109,0.00040717312,0.74144465,0.0004990321,0.2502035],"study_design_scores_gemma":[0.00010255754,0.00006044549,0.38616696,0.000008797097,8.7567355e-7,0.0000014737259,0.000035157937,0.6003753,0.010242434,0.0029177968,0.000031013198,0.000057202356],"about_ca_topic_score_codex":0.000031715947,"about_ca_topic_score_gemma":0.00017281817,"teacher_disagreement_score":0.97692084,"about_ca_system_score_codex":0.000010953835,"about_ca_system_score_gemma":0.000014179393,"threshold_uncertainty_score":0.06967942},"labels":[],"label_agreement":null},{"id":"W2148937493","doi":"10.1109/fuzzy.2005.1452487","title":"Describing Topological Relationships in Words: Refinements","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Counterintuitive; Object (grammar); Set (abstract data type); Computer science; Theoretical computer science; Natural language; Natural (archaeology); Spatial relation; Artificial intelligence; Topology (electrical circuits); Mathematics; Programming language; Geography","score_opus":0.08285777074343353,"score_gpt":0.2658932788542005,"score_spread":0.18303550811076696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148937493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023997113,0.000011849266,0.92242044,0.006363555,0.00007897882,0.00006296479,1.0574896e-7,0.00013581978,0.046929188],"genre_scores_gemma":[0.79116076,0.0000046726154,0.20791514,0.00043418029,0.000013398169,0.0000032351672,7.3301436e-7,0.0000010413908,0.00046685847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999489,0.000045134573,0.0001415961,0.00014028346,0.00008202977,0.000101933285],"domain_scores_gemma":[0.999753,0.00004475692,0.000020903615,0.00012575526,0.000014106939,0.000041507337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019281873,0.000042074193,0.000042309588,0.00008782868,0.0000614404,0.000046804995,0.00012332818,0.000033889206,0.00046105185],"category_scores_gemma":[0.00009052571,0.000037560414,0.000013735891,0.00024395967,0.000012566605,0.00036278277,0.000045771176,0.00009727763,0.000089165485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021793776,0.00005312563,0.08769386,7.256175e-7,0.0000023216112,0.000003315645,0.00058332266,0.0067811296,0.000065317705,0.5414237,0.0004898048,0.3629012],"study_design_scores_gemma":[0.0010374316,0.00003830926,0.26894596,0.000030499024,0.000002244059,0.000024284309,0.00032493836,0.7150541,0.00037154785,0.004709182,0.009115194,0.00034629443],"about_ca_topic_score_codex":0.000011660326,"about_ca_topic_score_gemma":0.0003250412,"teacher_disagreement_score":0.76716363,"about_ca_system_score_codex":0.00004990895,"about_ca_system_score_gemma":0.000020097721,"threshold_uncertainty_score":0.50481945},"labels":[],"label_agreement":null},{"id":"W2149314352","doi":"10.4007/annals.2012.175.3.10","title":"On sharp transitions in making squares","year":2012,"lang":"en","type":"article","venue":"Annals of Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Subsequence; Longest increasing subsequence; Combinatorics; Product (mathematics); Sequence (biology); Square (algebra); Interval (graph theory); Longest common subsequence problem; Factoring; Integer (computer science); Discrete mathematics; Bounded function","score_opus":0.08776437228952438,"score_gpt":0.3403959717314798,"score_spread":0.2526315994419554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149314352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054322843,0.000048237693,0.9325929,0.0034649123,0.00009508967,0.000113132475,0.0000039576853,0.000054105283,0.009304797],"genre_scores_gemma":[0.94815975,0.0000071658833,0.05141103,0.00039000556,0.000009535217,0.0000033349677,7.3064945e-7,0.0000030649487,0.000015409089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951,0.00001620844,0.00017509401,0.0000585588,0.000119752585,0.00012039213],"domain_scores_gemma":[0.9996379,0.00007878034,0.000062288615,0.00016099698,0.00003326538,0.000026794936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002112281,0.000049854953,0.000084261774,0.000111402456,0.000022104947,0.000016148842,0.00011722304,0.000025614276,0.00006981587],"category_scores_gemma":[0.000052080497,0.000047088946,0.000034389224,0.00016866348,0.000014365442,0.00024585868,0.00001486272,0.0000445413,0.00002376105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013173943,0.0003121069,0.00039105187,0.00005545059,0.0000068349736,8.7429123e-7,0.009982255,0.0014976832,0.00009079251,0.9712106,0.00040152346,0.016049514],"study_design_scores_gemma":[0.0013149156,0.00036327518,0.051822823,0.0016354354,0.000024423844,0.00007192236,0.0029567832,0.67617124,0.014232926,0.24765922,0.0026468064,0.0011002367],"about_ca_topic_score_codex":0.0000010425565,"about_ca_topic_score_gemma":0.0000033439578,"teacher_disagreement_score":0.89383686,"about_ca_system_score_codex":0.000004372691,"about_ca_system_score_gemma":0.000009834864,"threshold_uncertainty_score":0.19202314},"labels":[],"label_agreement":null},{"id":"W2149825906","doi":"10.1109/time.1998.674143","title":"Towards a formal characterization of temporal repetition with closed time","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Repetition (rhetorical device); Computer science; Formalism (music); Regular polygon; Temporal logic; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Linguistics","score_opus":0.00905997780571611,"score_gpt":0.18753792533564967,"score_spread":0.17847794752993357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149825906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055354286,9.8586e-7,0.927376,0.0006615944,0.00003742612,0.00010649384,0.0000022457095,0.00012804788,0.01633296],"genre_scores_gemma":[0.9566103,0.0000054348066,0.0420563,0.00012504589,0.000014434841,0.0000039216757,0.000021064821,0.000003407512,0.0011600474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947274,0.000017593185,0.00014607923,0.00012440514,0.00014945015,0.00008973518],"domain_scores_gemma":[0.9996342,0.0000051584398,0.00009077355,0.00015809036,0.00008049553,0.000031261836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006653431,0.00005768053,0.00007346507,0.00007577178,0.000039589424,0.000036562516,0.000093775576,0.000028543338,0.0009473296],"category_scores_gemma":[0.000005140544,0.000046796205,0.000020611591,0.00023075061,0.00002155051,0.0008517558,0.000023016924,0.000029855759,0.000046535173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049172413,0.0002830887,0.00607793,0.00004707742,0.00004525965,0.000011484585,0.0017944911,0.00036155357,0.09421869,0.096458256,0.00043409286,0.8002189],"study_design_scores_gemma":[0.00087665085,0.00028764823,0.07847562,0.000029280922,0.0000070132987,0.000049785653,0.000012542086,0.90307665,0.015605319,0.00013070641,0.0012251068,0.00022365712],"about_ca_topic_score_codex":0.0000070488395,"about_ca_topic_score_gemma":0.0000033576007,"teacher_disagreement_score":0.90271515,"about_ca_system_score_codex":0.000013343718,"about_ca_system_score_gemma":0.000016141708,"threshold_uncertainty_score":0.99996597},"labels":[],"label_agreement":null},{"id":"W2150231253","doi":"","title":"Min-Max Problems on Factor Graphs","year":2014,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Cluster analysis; Combinatorics; Travelling salesman problem; Set cover problem; Mathematics; Independent set; Mathematical optimization; Hamiltonian path; Bottleneck; Computer science; Graph; Set (abstract data type); Artificial intelligence","score_opus":0.012393766790395961,"score_gpt":0.21176233821432894,"score_spread":0.19936857142393297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150231253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036278446,0.0000015560387,0.9280442,0.0012932844,0.00025993746,0.00008011094,4.1977776e-7,0.00022354434,0.06646908],"genre_scores_gemma":[0.97141826,0.0000029871314,0.026469793,0.0007834219,0.000014787079,0.000004323572,0.0000010092574,0.000003118657,0.0013022949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994874,0.000023906152,0.000088837834,0.0001741991,0.00012284743,0.000102788115],"domain_scores_gemma":[0.9996221,0.00004444371,0.00002805407,0.00022300139,0.000028826627,0.000053568638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056943456,0.00006162336,0.000053494423,0.0000726083,0.00005375776,0.000081312384,0.00016989521,0.000027143931,0.0002679669],"category_scores_gemma":[0.000020445708,0.000049506805,0.000029944442,0.00014945741,0.000014454643,0.00016851953,0.000026345604,0.000045290846,0.0002112706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.246413e-7,0.000031076015,0.0019994646,0.0000037729756,0.000004338169,3.393093e-7,0.00018105218,0.0010705787,0.00022331545,0.6466134,0.0013846675,0.34848705],"study_design_scores_gemma":[0.0012421974,0.00061167066,0.077828646,0.000043080076,0.000005096038,0.000014574828,0.000025029229,0.7545907,0.0045037526,0.045077942,0.11526055,0.0007967935],"about_ca_topic_score_codex":0.000009126737,"about_ca_topic_score_gemma":0.000027109967,"teacher_disagreement_score":0.9677904,"about_ca_system_score_codex":0.000009497354,"about_ca_system_score_gemma":0.000010962888,"threshold_uncertainty_score":0.29340497},"labels":[],"label_agreement":null},{"id":"W2151266168","doi":"10.1023/a:1011402324562","title":"Random Constraint Satisfaction: A More Accurate Picture","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complement (music); Constraint (computer-aided design); Mathematics; Applied mathematics; Point (geometry); Constraint satisfaction problem; Mathematical optimization; Statistics; Geometry","score_opus":0.015994956451348324,"score_gpt":0.257697762280475,"score_spread":0.24170280582912665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151266168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019129638,0.000054368094,0.9537196,0.0035581596,0.00096370786,0.0003908384,0.000013424343,0.0005789571,0.021591287],"genre_scores_gemma":[0.97479975,0.00007270847,0.023347523,0.0013361545,0.00010777608,0.000024773555,0.000010585116,0.000012965445,0.00028777684],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982227,0.00009473111,0.0004102696,0.0005260993,0.00033435767,0.0004118286],"domain_scores_gemma":[0.9987275,0.000149083,0.00016589617,0.0005424898,0.00017330302,0.00024171073],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025115703,0.00026771182,0.00027215586,0.00018166094,0.00025563024,0.00028605858,0.00039633218,0.00015180094,0.0020357938],"category_scores_gemma":[0.0001333641,0.0002555349,0.00013706025,0.0005169732,0.00049385155,0.00067678106,0.00009588165,0.00028075377,0.00022416939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040733394,0.000046752775,0.018151408,0.00001260427,0.00008322719,0.00023887045,0.0010397153,0.001401501,0.000749933,0.049222417,0.0015670422,0.92744577],"study_design_scores_gemma":[0.03154939,0.00043666697,0.5668484,0.0004677041,0.00019804826,0.017777214,0.00492702,0.26892263,0.0026129019,0.01785837,0.083138995,0.0052626715],"about_ca_topic_score_codex":0.000011064507,"about_ca_topic_score_gemma":0.000028503006,"teacher_disagreement_score":0.9556701,"about_ca_system_score_codex":0.00007735831,"about_ca_system_score_gemma":0.00023074009,"threshold_uncertainty_score":0.9999897},"labels":[],"label_agreement":null},{"id":"W2151273784","doi":"10.1142/s0218213008004114","title":"A SPACE-EFFICIENT BACKTRACK-FREE REPRESENTATION FOR CONSTRAINT SATISFACTION PROBLEMS","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pruning; Heuristics; Constraint satisfaction problem; Backtracking; Constraint satisfaction; Representation (politics); Local consistency; Constraint (computer-aided design); Space (punctuation); Search tree; Tuple; Mathematical optimization; Consistency (knowledge bases); Algorithm; Variety (cybernetics); Search algorithm; Artificial intelligence; Mathematics","score_opus":0.09226414483271571,"score_gpt":0.32722756922078367,"score_spread":0.23496342438806794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151273784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03454256,0.00003154494,0.9575817,0.004401871,0.00259186,0.00033699555,0.000019755606,0.00005133603,0.0004423677],"genre_scores_gemma":[0.89487344,0.00010524859,0.10442782,0.00013306084,0.00038519767,0.000014842593,0.0000061499577,0.00001020892,0.0000440099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769443,0.00006834202,0.0009900521,0.00026832303,0.00077039853,0.0002084722],"domain_scores_gemma":[0.9968543,0.00038071815,0.0007237822,0.00027700176,0.0016439665,0.00012020682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052477425,0.00015543112,0.00021382507,0.00039307761,0.00016031307,0.00029746979,0.0008270106,0.00008090343,0.00014769098],"category_scores_gemma":[0.0010095761,0.00015012051,0.00022851527,0.0002926282,0.00015650548,0.0010269181,0.00009044963,0.00019801827,0.0000321583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016266787,0.00020341159,0.0009988258,0.000008071848,0.00014109082,0.00006509981,0.0020533858,0.24280703,0.0062523023,0.17719492,0.00097457826,0.56913865],"study_design_scores_gemma":[0.0009202564,0.00074416044,0.012897189,0.00021947762,0.00004866336,0.0033190886,0.0013492926,0.8239981,0.07904508,0.07370215,0.002999374,0.0007571585],"about_ca_topic_score_codex":0.000028083394,"about_ca_topic_score_gemma":0.000032864406,"teacher_disagreement_score":0.8603309,"about_ca_system_score_codex":0.00018709907,"about_ca_system_score_gemma":0.00027816396,"threshold_uncertainty_score":0.6121737},"labels":[],"label_agreement":null},{"id":"W2152310223","doi":"10.1061/(asce)0887-3801(2007)21:5(353)","title":"Engineering Analysis with Uncertainties and Complexities, Using Reasoning Approaches","year":2007,"lang":"en","type":"article","venue":"Journal of Computing in Civil Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Leverage (statistics); Constraint (computer-aided design); Engineering design process; Computer science; Qualitative reasoning; Domain (mathematical analysis); Interval arithmetic; Computation; Process (computing); Industrial engineering; Artificial intelligence; Engineering; Mathematics; Algorithm","score_opus":0.02102872710225893,"score_gpt":0.21879518758036032,"score_spread":0.1977664604781014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152310223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564349,0.00011546705,0.7431922,0.000018958892,0.000084858824,0.000026884016,1.0687633e-7,0.00003289182,0.00009378151],"genre_scores_gemma":[0.68858826,0.0000029138278,0.31135532,0.0000058572446,0.000039851275,7.174498e-8,2.1363869e-7,0.000006370248,0.0000011236292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989734,0.000014398494,0.00041918512,0.00013726961,0.00022444397,0.00023126599],"domain_scores_gemma":[0.9993203,0.0002091799,0.00020918455,0.00010891517,0.00007225301,0.00008012495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095747015,0.00013109196,0.00028069655,0.00092901307,0.000048205282,0.00012592395,0.00016846797,0.00003912821,0.000002125848],"category_scores_gemma":[0.00006459387,0.00012382197,0.00005639206,0.0010597076,0.000018635994,0.00034329927,0.000059216454,0.00024445582,6.115244e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000379666,0.000006564319,0.01825658,0.000021312007,0.00009488231,0.000026071335,0.0007402729,0.9747473,0.00009807103,0.0043422915,4.6927522e-7,0.0016623997],"study_design_scores_gemma":[0.00022927963,0.000023041635,0.069939606,0.00016848414,0.000033914544,0.00022003255,0.000143603,0.92901134,0.000070877024,0.000010668452,0.000019467552,0.00012970513],"about_ca_topic_score_codex":0.000018199611,"about_ca_topic_score_gemma":0.000061399296,"teacher_disagreement_score":0.4321534,"about_ca_system_score_codex":0.000112049616,"about_ca_system_score_gemma":0.00004052502,"threshold_uncertainty_score":0.50493133},"labels":[],"label_agreement":null},{"id":"W2152678693","doi":"10.1109/fuzzy.2006.1681723","title":"Fuzzy Object Localization Based on Directional (and Distance) Information","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Euclidean distance; Raster graphics; Computer science; Fuzzy logic; Object (grammar); Point (geometry); Artificial intelligence; Computation; Template; Spatial analysis; Object-based spatial database; Line (geometry); Space (punctuation); Computer vision; Euclidean space; Algorithm; Mathematics; Spatial database; Geometry","score_opus":0.003537221414437068,"score_gpt":0.18747295011777632,"score_spread":0.18393572870333924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152678693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001688909,0.0000028779405,0.91642725,0.0005533488,0.00014872661,0.00007260839,0.000001645984,0.00017346774,0.08245119],"genre_scores_gemma":[0.9729437,0.0000026281011,0.02592223,0.00084170426,0.000026172871,0.000006426393,0.000037544738,0.000002100836,0.00021746154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994926,0.000019033505,0.00013628775,0.00010744188,0.00017013657,0.00007449645],"domain_scores_gemma":[0.9997258,0.00003676394,0.000046182256,0.00010476706,0.00006118695,0.000025283045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000764884,0.00006201069,0.000044291384,0.000114448136,0.000117578435,0.00015211171,0.00005291307,0.00002999353,0.000045133573],"category_scores_gemma":[0.000015378826,0.000056692297,0.000016523161,0.00023176933,0.000020127207,0.0007678744,0.000011541934,0.000033133016,0.000026892107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011864622,0.000035689034,0.011044494,0.00001002122,0.0000024501294,4.872443e-7,0.000058378613,0.2708133,0.00001867998,0.624071,0.003030083,0.09090354],"study_design_scores_gemma":[0.0002836718,0.000022159047,0.037291024,0.000006399308,0.0000012489262,0.0000024929448,0.000006025498,0.9504523,0.0002290073,0.0026241322,0.008990117,0.00009137863],"about_ca_topic_score_codex":0.00005160169,"about_ca_topic_score_gemma":0.000054843476,"teacher_disagreement_score":0.97277486,"about_ca_system_score_codex":0.000039146347,"about_ca_system_score_gemma":0.00003146841,"threshold_uncertainty_score":0.23118448},"labels":[],"label_agreement":null},{"id":"W2152694638","doi":"10.2991/agi.2009.15","title":"CHS-Soar: Introducing Constrained Heuristic Search to the Soar Cognitive Architecture","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Soar; Computer science; Cognitive architecture; Heuristic; Architecture; Cognition; Artificial intelligence; Psychology","score_opus":0.009904943412824847,"score_gpt":0.25036329721836487,"score_spread":0.24045835380554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152694638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041874303,0.0000121947,0.95064926,0.03361893,0.0001833969,0.00033728214,0.000004030485,0.000201963,0.010805538],"genre_scores_gemma":[0.95612854,0.000003842316,0.03750171,0.005660143,0.0001383169,0.0000057826155,0.0000045662805,0.0000044527683,0.000552627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988036,0.000100606565,0.00017492558,0.00037667554,0.00026711455,0.0002770785],"domain_scores_gemma":[0.9991642,0.00019756617,0.000031094616,0.00031718862,0.00016228454,0.00012762447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030760962,0.00012621318,0.00011411541,0.00012994028,0.00023475815,0.00024302719,0.00036873634,0.00003833671,0.00023782751],"category_scores_gemma":[0.00022411275,0.00008793981,0.000047185178,0.00052655133,0.00006657617,0.00014175443,0.00008153436,0.00021938473,0.00013162523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001765722,0.000034534398,0.00010433202,0.0000034514437,0.000016394199,0.000010922158,0.0027144242,0.017346323,0.0005381013,0.053225465,0.001487533,0.9245009],"study_design_scores_gemma":[0.004294857,0.0014614189,0.070064485,0.00022152156,0.00006944224,0.00074449985,0.0029326126,0.88451153,0.013258955,0.009642494,0.010920179,0.0018780313],"about_ca_topic_score_codex":0.000018902523,"about_ca_topic_score_gemma":0.00003604602,"teacher_disagreement_score":0.95194113,"about_ca_system_score_codex":0.000028536677,"about_ca_system_score_gemma":0.00010397375,"threshold_uncertainty_score":0.35860813},"labels":[],"label_agreement":null},{"id":"W2152906186","doi":"10.1017/s147106840500236x","title":"A CHR-based implementation of known arc-consistency","year":2005,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Canadian Patient Safety Institute","keywords":"Local consistency; Computer science; Constraint satisfaction problem; Constraint satisfaction; Constraint logic programming; Constraint (computer-aided design); Consistency (knowledge bases); Constraint programming; Solver; Extension (predicate logic); Domain (mathematical analysis); Obsolescence; Programming language; Theoretical computer science; Process (computing); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.02296435859975818,"score_gpt":0.32255880254978747,"score_spread":0.29959444395002927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152906186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009653869,0.000431237,0.9832374,0.002057549,0.000057850604,0.00024446455,0.0000014658647,0.00006387176,0.004252291],"genre_scores_gemma":[0.7451688,0.000027192487,0.25458667,0.0001853515,0.000011641264,0.000006407611,0.0000018530251,0.000001964298,0.000010111617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990759,0.0003169816,0.00024583947,0.00014030893,0.00011636068,0.00010464468],"domain_scores_gemma":[0.9984817,0.0009138409,0.00030622268,0.00015449074,0.000109598004,0.000034185257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016254693,0.00006801859,0.00010503509,0.00007684382,0.00006831531,0.000034348734,0.00010814477,0.000030288074,0.00007136279],"category_scores_gemma":[0.00035521275,0.00006142981,0.000031817737,0.00017315717,0.00009201096,0.00063298614,0.000036183097,0.000060636758,0.0000019995346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051610088,0.000058006837,0.00013021822,0.000019733332,0.000010751948,7.490373e-7,0.0006038233,0.00008977704,0.0004635085,0.3028919,0.0000022720278,0.69567764],"study_design_scores_gemma":[0.023482747,0.011812025,0.03157512,0.00096885103,0.0016384614,0.001698005,0.0755849,0.087072544,0.2148538,0.2908972,0.25603244,0.0043839156],"about_ca_topic_score_codex":0.000014415755,"about_ca_topic_score_gemma":0.000009157323,"teacher_disagreement_score":0.73551494,"about_ca_system_score_codex":0.000010358266,"about_ca_system_score_gemma":0.000068627356,"threshold_uncertainty_score":0.2505035},"labels":[],"label_agreement":null},{"id":"W2152972178","doi":"10.1287/ijoc.1120.0514","title":"Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling","year":2012,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Column generation; Scheduling (production processes); Grammar; Mathematical optimization; Context-free grammar; Rule-based machine translation; Artificial intelligence; Mathematics","score_opus":0.061927155787091875,"score_gpt":0.3074853138278305,"score_spread":0.24555815804073863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152972178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13577393,0.00002015727,0.8620862,0.0004685125,0.0012816918,0.00018874543,0.0000012463933,0.00009492688,0.00008461816],"genre_scores_gemma":[0.68593043,0.0000017156638,0.31308794,0.00055415765,0.00038813933,0.0000029471503,0.0000033589179,0.0000071131744,0.00002421942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987996,0.000048125075,0.00033633524,0.0001478514,0.00028648836,0.0003815695],"domain_scores_gemma":[0.99895376,0.00017687427,0.0003572403,0.00014828292,0.00016436032,0.00019946504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089122,0.00014834384,0.00016042654,0.00017695993,0.00067184377,0.00050048734,0.00022130474,0.00007444795,0.000018796505],"category_scores_gemma":[0.00017755889,0.00013333795,0.00014417672,0.0002034871,0.00002866737,0.0011978626,0.000038990926,0.00027403224,0.000013845748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072643044,0.00023989752,0.013406244,0.000032421318,0.000059725957,0.0000036536057,0.0020293333,0.27084816,0.0015783311,0.033313327,0.00017305619,0.6782432],"study_design_scores_gemma":[0.0014191509,0.00008274593,0.0066323616,0.000033046206,0.0000057774496,0.000040543946,0.000023678014,0.98839396,0.00091611437,0.00003701447,0.0022284815,0.00018714168],"about_ca_topic_score_codex":0.000005235817,"about_ca_topic_score_gemma":0.000004603712,"teacher_disagreement_score":0.7175458,"about_ca_system_score_codex":0.0001606296,"about_ca_system_score_gemma":0.00014895626,"threshold_uncertainty_score":0.54373634},"labels":[],"label_agreement":null},{"id":"W2153904215","doi":"10.1609/aaai.v26i1.8142","title":"Predicting Satisfiability at the Phase Transition","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":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Western Canada Research Grid; Compute Canada","keywords":"Satisfiability; Conjecture; Computer science; Range (aeronautics); Decision tree; Classifier (UML); Simple (philosophy); Binary number; Binary classification; Algorithm; Mathematics; Artificial intelligence; Machine learning; Discrete mathematics","score_opus":0.0556724554641079,"score_gpt":0.29746112244139145,"score_spread":0.24178866697728355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153904215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69651,0.000032414227,0.2604063,0.02821842,0.00080238236,0.00056355254,0.00001811583,0.00016980991,0.013279021],"genre_scores_gemma":[0.997414,0.000026170523,0.0019618834,0.00036901195,0.00004168897,0.000016491642,0.0000013438138,0.0000055449527,0.00016387859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853176,0.00003910876,0.0004252938,0.00039498662,0.0004056623,0.00020321245],"domain_scores_gemma":[0.9986279,0.00013022333,0.00023728992,0.0003040769,0.0006434586,0.000057048903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047728492,0.00013890772,0.00014603618,0.00004076856,0.00039404305,0.00021096364,0.00066454744,0.000061353,0.00035957052],"category_scores_gemma":[0.0004318535,0.00009419542,0.00011150876,0.000595856,0.00025464257,0.0003548908,0.00021543486,0.00021797256,0.000036861016],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000572778,0.00022316254,0.001182795,0.000036635316,0.000020609521,9.002125e-7,0.004085722,0.0007577728,0.076544456,0.61089903,0.00015508776,0.30603653],"study_design_scores_gemma":[0.00006404535,0.000083229075,0.00070925377,0.00008836992,0.000015087254,0.000019954488,0.00083453575,0.2552325,0.69877136,0.043923147,0.00011202356,0.00014648285],"about_ca_topic_score_codex":0.000021721651,"about_ca_topic_score_gemma":0.00006360988,"teacher_disagreement_score":0.6222269,"about_ca_system_score_codex":0.000067420006,"about_ca_system_score_gemma":0.00012523406,"threshold_uncertainty_score":0.3937045},"labels":[],"label_agreement":null},{"id":"W2155444699","doi":"10.1007/978-3-540-72397-4_22","title":"Solving a Stochastic Queueing Control Problem with Constraint Programming","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Mathematical optimization; Constraint programming; Staffing; Heuristic; Constraint (computer-aided design); Stochastic programming; Concurrent constraint logic programming; Constraint satisfaction; Operations research; Constraint logic programming; Artificial intelligence; Mathematics; Computer network","score_opus":0.01278232178409479,"score_gpt":0.23312548162427615,"score_spread":0.22034315984018135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155444699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012277337,0.00009507886,0.9942976,0.00052172964,0.000515393,0.0009082526,0.0000022224374,0.00032653875,0.0033208618],"genre_scores_gemma":[0.30070332,0.0000032563921,0.6984137,0.00061075576,0.00015262175,0.0000129913815,0.000002316247,0.000028165972,0.00007284738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628663,0.000028205408,0.00056668883,0.0013403946,0.0009798266,0.00079827476],"domain_scores_gemma":[0.9978088,0.0004202896,0.0004018595,0.00072854763,0.00041001465,0.00023044998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010429512,0.0005348966,0.0004951444,0.00097137,0.00034762293,0.00090437225,0.0012658964,0.0002660132,0.000032011983],"category_scores_gemma":[0.000057507776,0.00046712006,0.00009497381,0.0006483712,0.00097464654,0.00070968753,0.00032818702,0.0008678749,0.0000141984965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007771408,0.000013209432,0.000036580568,0.000024350726,0.000014342381,0.000081978294,0.0005731174,0.18431675,0.000024581845,0.02316453,8.7956136e-7,0.7917419],"study_design_scores_gemma":[0.0007829963,0.00024864604,0.00006709607,0.00095339486,0.000017936254,0.00042805262,0.0000010888356,0.981544,0.000054473243,0.014868559,0.00021773005,0.0008160348],"about_ca_topic_score_codex":0.000023680943,"about_ca_topic_score_gemma":0.00036574554,"teacher_disagreement_score":0.79722726,"about_ca_system_score_codex":0.00037517122,"about_ca_system_score_gemma":0.00093151344,"threshold_uncertainty_score":0.99977803},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; 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","score_opus":0.008280661343385138,"score_gpt":0.24325122505584842,"score_spread":0.23497056371246328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155616412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004827246,0.000034008463,0.9884618,0.00092678063,0.00114192,0.000044783166,0.000025261095,0.000039345952,0.004498836],"genre_scores_gemma":[0.85849875,0.0000029236817,0.14083609,0.0004904709,0.00014882752,2.3689525e-7,0.0000020406617,0.0000032362725,0.000017445767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875647,0.000051111227,0.00044743472,0.00013078089,0.00043258193,0.00018161602],"domain_scores_gemma":[0.9989982,0.00010588763,0.00033233946,0.00016707426,0.00028570244,0.00011078248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020897797,0.000120931465,0.00017133314,0.000055377874,0.00008212189,0.00012898266,0.0003080825,0.000063126645,0.0000582966],"category_scores_gemma":[0.00019613386,0.00010896892,0.000108343425,0.00026338955,0.000092526905,0.00014275721,0.000026063657,0.00013566973,0.000024051371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109193585,0.0005436801,0.02681994,0.000029308365,0.000055776753,0.00081808725,0.000031206993,0.39268756,0.000049609585,0.2877679,0.040040117,0.2510476],"study_design_scores_gemma":[0.003478276,0.0006393377,0.05036538,0.00015891886,0.00006557591,0.0014094873,0.000024938192,0.8741205,0.00022666677,0.061928235,0.007057086,0.00052561733],"about_ca_topic_score_codex":0.0000053464446,"about_ca_topic_score_gemma":0.000008121459,"teacher_disagreement_score":0.8536715,"about_ca_system_score_codex":0.00021855609,"about_ca_system_score_gemma":0.00033361767,"threshold_uncertainty_score":0.44436237},"labels":[],"label_agreement":null},{"id":"W2156111468","doi":"10.1016/j.dam.2005.05.003","title":"On the complexity of unfrozen problems","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monotonic function; Mathematics; Monotone polygon; Property (philosophy); Sequence (biology); Set (abstract data type); Combinatorics; Point (geometry); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.038389970936973446,"score_gpt":0.2434952825889067,"score_spread":0.20510531165193327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156111468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035113408,0.0000038606213,0.9285735,0.0027215234,0.00002795672,0.00030326957,0.000003512493,0.0000832864,0.06477178],"genre_scores_gemma":[0.78334814,0.0000034535783,0.21628419,0.00026036263,0.000013788821,0.000018602057,0.0000023710681,0.0000059874005,0.00006309571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930674,0.0000102427975,0.00022725364,0.00012838036,0.00021526925,0.000112142465],"domain_scores_gemma":[0.999245,0.00012520957,0.00013989548,0.0004301748,0.000029399107,0.00003031131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018371124,0.00008917031,0.00011788373,0.000036069177,0.000077149525,0.000043542615,0.00036460612,0.000028343917,0.00011983236],"category_scores_gemma":[0.00002077029,0.000058162863,0.000039462895,0.00016383185,0.00014236095,0.00006929346,0.00007723573,0.00007763896,0.00007601652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.275935e-7,0.000034006083,0.0000018681636,0.000016602367,0.0000072500225,5.1291334e-8,0.0010572196,0.0019019751,0.00048927683,0.99158347,0.0002892657,0.0046182186],"study_design_scores_gemma":[0.00031208765,0.000032531712,0.00023155376,0.000041683605,0.000010544083,0.0000043065875,0.000236909,0.44349197,0.0066019674,0.54797214,0.00086712185,0.00019716899],"about_ca_topic_score_codex":0.0000011930346,"about_ca_topic_score_gemma":0.0000058900473,"teacher_disagreement_score":0.77983683,"about_ca_system_score_codex":0.000016881051,"about_ca_system_score_gemma":0.000017620174,"threshold_uncertainty_score":0.23718128},"labels":[],"label_agreement":null},{"id":"W2156413802","doi":"10.1007/11424918_10","title":"Modelling an Academic Curriculum Plan as a Mixed-Initiative Constraint Satisfaction Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backtracking; Computer science; Constraint satisfaction; Flexibility (engineering); Scheduling (production processes); Constraint satisfaction problem; Curriculum; Plan (archaeology); Process (computing); Operations research; Mathematical optimization; Artificial intelligence; Programming language; Mathematics","score_opus":0.02668433257560479,"score_gpt":0.2584488897330694,"score_spread":0.2317645571574646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156413802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003794339,0.00012511862,0.9916355,0.000838649,0.0011959387,0.00063816935,0.000011648018,0.00035758587,0.0048179575],"genre_scores_gemma":[0.4098441,0.00015854595,0.5881671,0.0011858451,0.00049316534,0.000018176126,0.000020769205,0.000036870166,0.000075461554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957528,0.000080353224,0.00076166337,0.0016934782,0.0010375379,0.0006741352],"domain_scores_gemma":[0.99776727,0.00025197904,0.00050820515,0.0008145304,0.0003422136,0.00031582892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076266786,0.00062019634,0.00050030893,0.0010056868,0.00039195988,0.0005336195,0.0014350971,0.00057018775,0.00009546091],"category_scores_gemma":[0.000042977685,0.0006175138,0.00012332568,0.0005598611,0.0006694565,0.0019003527,0.00043359067,0.001601534,0.00008661997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002407917,0.000010983638,0.00013478914,0.00000954929,0.000006903968,0.00001665642,0.0007096453,0.4889161,0.000012980251,0.033534214,0.000005380674,0.4766404],"study_design_scores_gemma":[0.00026867463,0.00015130697,0.00013277592,0.00030259436,0.000010153256,0.00023038074,0.0000019600486,0.9166309,0.00016337621,0.08110072,0.00033299363,0.0006741465],"about_ca_topic_score_codex":0.00009712325,"about_ca_topic_score_gemma":0.00027005418,"teacher_disagreement_score":0.47596624,"about_ca_system_score_codex":0.0005475287,"about_ca_system_score_gemma":0.0009960772,"threshold_uncertainty_score":0.99962765},"labels":[],"label_agreement":null},{"id":"W2156697525","doi":"10.1109/iros.1995.526243","title":"A constraint-satisfaction approach for 3D vision/touch-based object recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Consistency (knowledge bases); Constraint satisfaction problem; Local consistency; Constraint satisfaction; Constraint (computer-aided design); Cognitive neuroscience of visual object recognition; Process (computing); Artificial intelligence; Object (grammar); Computer vision; Perception; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.03423121467788842,"score_gpt":0.24608534429340106,"score_spread":0.21185412961551264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156697525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035499924,0.000010715008,0.9732331,0.00067658786,0.00026157516,0.000546313,0.000012625665,0.00045400727,0.024450049],"genre_scores_gemma":[0.32146502,0.000008286978,0.6774452,0.00062358816,0.000042076983,0.000080389116,0.000034389395,0.000008884784,0.0002922235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987887,0.00005910826,0.00027296643,0.00043086702,0.00021367146,0.00023466944],"domain_scores_gemma":[0.999204,0.00014333466,0.00010729759,0.00028436008,0.00016444418,0.00009659019],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017431694,0.00015333117,0.00014109355,0.00019706906,0.00021063793,0.0002073871,0.00014765467,0.00010116213,0.0009418018],"category_scores_gemma":[0.000074813746,0.00014761965,0.00010123846,0.0003359256,0.00006697936,0.0006217716,0.000021329784,0.000096557116,0.000092027636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007775065,0.00008063099,0.00032202588,0.000020435713,0.00001253454,7.895744e-7,0.000090134476,0.0019302855,0.00026372238,0.0038109398,0.0028382489,0.99062246],"study_design_scores_gemma":[0.0009380653,0.00011952474,0.0010685402,0.000010094295,0.000009490329,0.000021506554,0.00003670696,0.9955177,0.0005360619,0.00044177313,0.0010770576,0.0002235024],"about_ca_topic_score_codex":0.00002241701,"about_ca_topic_score_gemma":0.000020668278,"teacher_disagreement_score":0.9935874,"about_ca_system_score_codex":0.000065406464,"about_ca_system_score_gemma":0.00003907872,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W2160028617","doi":"10.1109/time.2006.10","title":"Conditional and Composite Temporal Constraints with Preferences","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint (computer-aided design); Computer science; Local consistency; Set (abstract data type); Constraint programming; Budget constraint; Preference; Projection (relational algebra); Mathematical optimization; Theoretical computer science; Semiring; Artificial intelligence; Constraint satisfaction problem; Mathematics; Algorithm; Stochastic programming","score_opus":0.007154168888011379,"score_gpt":0.1989811948992757,"score_spread":0.19182702601126433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160028617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042948578,0.000007594134,0.9242609,0.0005749887,0.000028949547,0.00006847745,0.000004232585,0.00011421135,0.031992044],"genre_scores_gemma":[0.9165267,0.0000010809432,0.08308417,0.00013389278,0.000011256869,0.000002717041,0.000018606119,0.000001360372,0.00022022393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995674,0.000014386669,0.00008404848,0.00014815856,0.000109976754,0.00007605435],"domain_scores_gemma":[0.9997969,0.000027620195,0.000032436656,0.00006778499,0.00004179749,0.000033416465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003616414,0.00005827026,0.000054298915,0.000042505908,0.00007532473,0.00011461685,0.000066681954,0.000018904977,0.00017977599],"category_scores_gemma":[0.0000011372138,0.00004409581,0.000007821882,0.00008215391,0.00015885757,0.0002828736,0.00002070862,0.000033700206,0.000008969345],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056777485,0.000037137746,0.28526765,0.0000050701374,0.0000117462505,0.000008398773,0.00004398419,0.000867712,0.00021123906,0.68977284,0.0008442636,0.02292429],"study_design_scores_gemma":[0.0011347703,0.000113535934,0.9293589,0.000018210103,0.0000067503856,0.0002971941,0.000054970627,0.044096638,0.0010778019,0.022395805,0.0011211325,0.00032426417],"about_ca_topic_score_codex":0.000048284146,"about_ca_topic_score_gemma":0.00009895407,"teacher_disagreement_score":0.87357813,"about_ca_system_score_codex":0.0000061586434,"about_ca_system_score_gemma":0.000035399225,"threshold_uncertainty_score":0.1968421},"labels":[],"label_agreement":null},{"id":"W2160129920","doi":"10.1109/isit.2006.261908","title":"On Generalized Survey Propagation: Normal Realization and Sum-Product Interpretation","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Formalism (music); Belief propagation; Markov random field; Computer science; Algorithm; Markov chain; Theoretical computer science; Mathematics; Discrete mathematics; Artificial intelligence; Decoding methods; Machine learning; Segmentation; Image segmentation","score_opus":0.011071110766379738,"score_gpt":0.22938216484308865,"score_spread":0.21831105407670892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160129920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03527086,0.000013394696,0.95640504,0.0004410223,0.00020228431,0.00016468125,0.0000020370103,0.00016298509,0.007337666],"genre_scores_gemma":[0.98419875,0.000008449833,0.014671789,0.00023363526,0.000036144396,0.0000074701315,0.000100307894,0.000004886111,0.00073859293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991639,0.00012347041,0.00019134495,0.00026687607,0.00015694254,0.00009746786],"domain_scores_gemma":[0.99952984,0.00005224337,0.00007272827,0.00018405331,0.00013136504,0.000029742168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027696107,0.00008529243,0.00007373824,0.0001075716,0.00009823367,0.00016757773,0.00008731133,0.000028715747,0.000075851895],"category_scores_gemma":[0.000061747676,0.000077595585,0.000014781879,0.00027735604,0.000025061148,0.00050191686,0.00002868655,0.000039785464,0.000016409454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059594848,0.00007066658,0.02970941,0.000014919154,0.00001054492,0.0000021089375,0.00022710585,0.029813029,0.0008626142,0.8341905,0.0059548276,0.09908471],"study_design_scores_gemma":[0.0004604153,0.000052073403,0.34696174,0.000008705239,0.0000029564253,0.000011229253,0.0000034699287,0.64648676,0.0023019304,0.0033825021,0.00015387227,0.00017432598],"about_ca_topic_score_codex":0.0004913541,"about_ca_topic_score_gemma":0.00078038214,"teacher_disagreement_score":0.9489279,"about_ca_system_score_codex":0.000027289165,"about_ca_system_score_gemma":0.000029308054,"threshold_uncertainty_score":0.3164256},"labels":[],"label_agreement":null},{"id":"W2160734757","doi":"10.1109/mmdbms.1996.541863","title":"Modeling of video spatial relationships in an object database management system","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Object-based spatial database; Computer science; Representation (politics); Spatial database; Set (abstract data type); Semantics (computer science); Inference; Object (grammar); Spatial query; Data modeling; Data model (GIS); Salient; Video tracking; Key (lock); Database; Data mining; Information retrieval; Spatial analysis; Artificial intelligence; Search engine; Web query classification; Programming language; Geography","score_opus":0.04990593347884132,"score_gpt":0.24180862978037174,"score_spread":0.19190269630153042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160734757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00760424,0.000009114344,0.9807694,0.00009199601,0.000089835965,0.00012588485,0.0000012016956,0.00009373154,0.011214586],"genre_scores_gemma":[0.8747117,0.0000063255147,0.12517565,0.000016584178,0.0000069769126,0.0000049240666,0.0000036957506,0.0000023255739,0.00007180148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930084,0.00007373209,0.0002241386,0.00017862329,0.00013991912,0.00008273311],"domain_scores_gemma":[0.99957824,0.000019504416,0.000034148692,0.00030235856,0.000031092808,0.00003468123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022187327,0.00005197132,0.000067435045,0.00017665706,0.000046714154,0.00003509046,0.0001596456,0.000022118475,0.00006384426],"category_scores_gemma":[0.000008993674,0.00005180135,0.000015664285,0.00025241886,0.0000071851923,0.0005442214,0.000055969034,0.000060237257,0.000018743181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032209582,0.00006722292,0.0064180316,0.000056886613,0.000006846203,0.00001117933,0.0006706019,0.7395502,0.000033039854,0.20540912,0.000040155293,0.047733538],"study_design_scores_gemma":[0.00020364556,0.000009315382,0.00193785,0.000029922536,0.000002263848,0.0000031414022,0.00021394795,0.9974638,0.00002108843,0.00005007694,0.0000074852937,0.000057458477],"about_ca_topic_score_codex":0.00015403221,"about_ca_topic_score_gemma":0.00055128185,"teacher_disagreement_score":0.86710745,"about_ca_system_score_codex":0.000039562936,"about_ca_system_score_gemma":0.000005627495,"threshold_uncertainty_score":0.21123978},"labels":[],"label_agreement":null},{"id":"W2161879374","doi":"10.1109/icc.2007.29","title":"Fast Exact MultiConstraint Shortest Path Algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Algorithm; Mathematical optimization; Path (computing); Shortest path problem; Approximation algorithm; Mathematics; Theoretical computer science","score_opus":0.012368674750726973,"score_gpt":0.2490259893291628,"score_spread":0.23665731457843583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161879374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018028525,0.0000066755115,0.96087044,0.00035915466,0.00033734948,0.00010702255,0.0000012627655,0.00032391018,0.03619134],"genre_scores_gemma":[0.7015218,0.0000045996944,0.29772145,0.00035295123,0.000039937484,0.000001600649,0.0000025922373,0.0000041894264,0.00035086242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905837,0.000015673439,0.00021927405,0.00026031618,0.00019434941,0.00025200882],"domain_scores_gemma":[0.9993778,0.000084452055,0.00004506774,0.00028213975,0.00007026591,0.00014031102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003337558,0.00010521865,0.00008799916,0.000105015104,0.000091732,0.00011471721,0.0002462221,0.000051551393,0.0003319846],"category_scores_gemma":[0.000028191916,0.00009403574,0.00004794038,0.000248926,0.000054286083,0.00034301795,0.00006640097,0.00009708024,0.000106520405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011945913,0.00004255962,0.003093971,0.0000010734008,0.000007237717,0.000025884647,0.00027196712,0.00047276003,0.00046896905,0.03597471,0.00018089575,0.95945877],"study_design_scores_gemma":[0.0007204308,0.000083082596,0.12332018,0.000015900092,0.000006361497,0.00019108522,0.0004930318,0.86678636,0.0035193013,0.0005196497,0.003843641,0.00050098985],"about_ca_topic_score_codex":0.000031573392,"about_ca_topic_score_gemma":0.00005977015,"teacher_disagreement_score":0.9589578,"about_ca_system_score_codex":0.000040424828,"about_ca_system_score_gemma":0.00004580063,"threshold_uncertainty_score":0.38346663},"labels":[],"label_agreement":null},{"id":"W2163325295","doi":"10.2478/v10037-006-0022-z","title":"Recognizing Chordal Graphs: Lex BFS and MCS1","year":2006,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Computer science; Combinatorics; Graph","score_opus":0.00848656058205855,"score_gpt":0.2081372526272673,"score_spread":0.19965069204520874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163325295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024572998,0.000056003075,0.95541203,0.00024334583,0.00013482475,0.00015511333,0.000002229596,0.00023530633,0.019188136],"genre_scores_gemma":[0.17111002,0.00005575932,0.828099,0.0001566947,0.00003366354,0.000013638407,0.000007960154,0.000012131902,0.0005111391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.000015248252,0.00025557808,0.00014570757,0.00014939268,0.00017288145],"domain_scores_gemma":[0.9995407,0.000056168345,0.00010697413,0.00020192847,0.000047833946,0.00004638685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019031145,0.000105038496,0.0001323682,0.00010439947,0.00012774197,0.00016132559,0.00014721145,0.000048288544,0.000047739257],"category_scores_gemma":[0.000026345115,0.000096353804,0.000041250798,0.00020568528,0.00003563216,0.00050411595,0.00007414908,0.00006696283,0.000024753252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039748566,0.000089719426,0.0007655144,0.000118774624,0.000018788187,0.000006136402,0.0014578862,0.00018679551,0.00055759127,0.942269,0.0020230873,0.052502688],"study_design_scores_gemma":[0.0021027548,0.00008428129,0.0030647719,0.00010889638,0.0000371615,0.0003198173,0.0002960598,0.5925252,0.0030922606,0.38828802,0.009399836,0.00068093475],"about_ca_topic_score_codex":0.00001354441,"about_ca_topic_score_gemma":0.000016001339,"teacher_disagreement_score":0.5923384,"about_ca_system_score_codex":0.00001390607,"about_ca_system_score_gemma":0.000018814548,"threshold_uncertainty_score":0.39291942},"labels":[],"label_agreement":null},{"id":"W2163522217","doi":"10.1142/s0218194009004416","title":"AN EFFICIENT LOTOS-BASED FRAMEWORK FOR DESCRIBING AND SOLVING (TEMPORAL) CSPs","year":2009,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint satisfaction problem; Scheduling (production processes); Combinatorial explosion; Constraint satisfaction; Theoretical computer science; Execution time; Constraint (computer-aided design); Local consistency; Mathematical optimization; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.012273620884149782,"score_gpt":0.24988336061337696,"score_spread":0.23760973972922717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163522217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049788553,0.00056852365,0.948291,0.00016257941,0.000987831,0.00006619532,0.000002109342,0.00013022736,0.0000029547484],"genre_scores_gemma":[0.58457726,0.000013704524,0.4152233,0.000022549288,0.00015134295,0.0000015169784,0.0000011276392,0.000007892204,0.0000013185314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992113,0.000008123354,0.0002972339,0.00016126485,0.00016614304,0.00015593371],"domain_scores_gemma":[0.99911565,0.000275115,0.00010119945,0.00009455693,0.0002714554,0.00014200107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028875112,0.00014379302,0.00015696815,0.0003567573,0.000049684477,0.00021553434,0.0002573431,0.0000649217,0.0000018186731],"category_scores_gemma":[0.00046845438,0.00014781946,0.000058824302,0.00011829102,0.000009465581,0.00033807106,0.000025755906,0.00018350683,3.1735112e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015249643,0.00005779461,0.0008768269,0.00003443315,0.000042972424,0.000015365971,0.000687196,0.88881844,0.0015355113,0.015055611,0.000010525788,0.09285009],"study_design_scores_gemma":[0.00044088217,0.00011971092,0.0035964153,0.00036500744,0.000008298616,0.0000966473,0.000013513023,0.9938551,0.000854835,0.00013047343,0.00035017318,0.00016893547],"about_ca_topic_score_codex":6.9943496e-7,"about_ca_topic_score_gemma":2.8228715e-7,"teacher_disagreement_score":0.53478867,"about_ca_system_score_codex":0.000068593166,"about_ca_system_score_gemma":0.00005205519,"threshold_uncertainty_score":0.60279024},"labels":[],"label_agreement":null},{"id":"W2163770137","doi":"10.1109/ictai.2005.77","title":"Improving Lotos simulation using constraint propagation","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Theoretical computer science; Local consistency; Combinatorial explosion; Distributed computing; Parallel computing; Programming language; Constraint satisfaction problem; Mathematics; Artificial intelligence","score_opus":0.022469762098530712,"score_gpt":0.2657509892373411,"score_spread":0.24328122713881037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163770137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013365055,0.0000041826715,0.9835469,0.00039455376,0.00010723871,0.00018648231,3.4004583e-7,0.00025346296,0.002141782],"genre_scores_gemma":[0.7221294,4.2417784e-7,0.2775601,0.00019128827,0.00004752868,0.0000017709996,9.719465e-7,0.0000030062083,0.00006549284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933344,0.000025207455,0.000183024,0.00019302084,0.00014326927,0.00012206011],"domain_scores_gemma":[0.9995829,0.000034115546,0.00008132419,0.00016260275,0.000092096605,0.000047000438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013185467,0.00007243342,0.0000576619,0.000090578586,0.000108341264,0.00013731133,0.000104923514,0.00003849433,0.0001435412],"category_scores_gemma":[0.000037113343,0.00006961636,0.000026577643,0.00018079265,0.000024466528,0.0009405129,0.000037670576,0.000052343694,0.00003711171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5666204e-7,0.000009702009,0.0001952848,0.000002408574,0.0000019584563,3.5132638e-7,0.00009515402,0.54128313,0.0034209748,0.013661034,0.0000045113547,0.44132462],"study_design_scores_gemma":[0.00017442615,0.000009368959,0.00046222933,0.0000041315225,0.0000022598776,0.000009933314,0.000017824901,0.99623513,0.0026752444,0.00007755146,0.000237225,0.00009468559],"about_ca_topic_score_codex":0.000016994883,"about_ca_topic_score_gemma":0.000015472015,"teacher_disagreement_score":0.7087644,"about_ca_system_score_codex":0.000084822364,"about_ca_system_score_gemma":0.00007431421,"threshold_uncertainty_score":0.2838873},"labels":[],"label_agreement":null},{"id":"W2164902897","doi":"10.1109/ictai.2004.109","title":"Solving conditional and composite temporal constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint (computer-aided design); Constraint satisfaction dual problem; Constraint satisfaction; Constraint satisfaction problem; Local consistency; Computer science; Mathematical optimization; Variable (mathematics); Constraint graph; Set (abstract data type); Constraint programming; Constraint learning; Constraint logic programming; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.009649338070301376,"score_gpt":0.22910882249081807,"score_spread":0.2194594844205167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164902897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068857055,0.00001389595,0.9716259,0.003448804,0.00005870452,0.00005281246,0.0000023477219,0.00013967727,0.017772108],"genre_scores_gemma":[0.81833977,0.0000034895436,0.18047562,0.0009544787,0.000025985175,0.000001364205,0.0000062744025,0.0000015542048,0.00019148296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.0000146472885,0.00010662751,0.00014564066,0.00009975363,0.00009130563],"domain_scores_gemma":[0.9997557,0.000036864734,0.000028667042,0.00008131935,0.00003407374,0.00006336878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072129675,0.00005577398,0.000054139713,0.000051709474,0.00009628687,0.00010983696,0.000079004065,0.000023570736,0.0004924597],"category_scores_gemma":[0.0000063478437,0.000053325184,0.000015385158,0.000064811225,0.00009372969,0.0004520415,0.00004546122,0.000045818015,0.00004825479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020872733,0.000033680437,0.029982854,0.000004213032,0.000015471354,0.0000052466785,0.0002282885,0.0012334342,0.0010313641,0.6485504,0.0020672185,0.31684572],"study_design_scores_gemma":[0.0013741944,0.000043097727,0.13832912,0.000018106832,0.0000064168294,0.0004509818,0.00007837913,0.83724195,0.00216114,0.0052024536,0.014641891,0.0004522715],"about_ca_topic_score_codex":0.0000043808127,"about_ca_topic_score_gemma":0.00001574108,"teacher_disagreement_score":0.8360085,"about_ca_system_score_codex":0.000014496165,"about_ca_system_score_gemma":0.000027943894,"threshold_uncertainty_score":0.5392088},"labels":[],"label_agreement":null},{"id":"W2166613432","doi":"","title":"Retrieving the most probable solution in a temporal interval algebra network","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Markov chain; Computer science; Software; Interval (graph theory); Theoretical computer science; Markov process; Domain (mathematical analysis); Constraint (computer-aided design); Algorithm; Programming language; Mathematics; Machine learning","score_opus":0.01457664796622929,"score_gpt":0.23686770410179991,"score_spread":0.22229105613557062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166613432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050477204,0.000025728737,0.98237234,0.0019785368,0.00031130176,0.00017108992,6.921297e-8,0.000110614936,0.009982586],"genre_scores_gemma":[0.9363004,0.000004049167,0.0625351,0.00067977444,0.00006511314,0.000002883405,0.0000015220614,0.0000030646909,0.00040810302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923354,0.000037673915,0.00021032248,0.00016194137,0.00012973804,0.00022675743],"domain_scores_gemma":[0.9996199,0.00006570397,0.000054163283,0.00018893734,0.00003710067,0.00003421606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009537789,0.00006240922,0.00006211685,0.00005592262,0.0001105616,0.00010940293,0.00022995804,0.000039256764,0.000050771112],"category_scores_gemma":[0.000041754658,0.000045350953,0.000023114519,0.0007752669,0.000027979493,0.0003765732,0.000104895465,0.000117610245,0.000017312548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035430327,0.00007249239,0.21196592,0.000011916468,0.000015989941,0.000022258222,0.001493166,0.015534253,0.00018944245,0.36288512,0.011458754,0.39631528],"study_design_scores_gemma":[0.0005109998,0.00006429413,0.13242261,0.00005592274,0.0000028892232,0.000041844854,0.00016242737,0.85262024,0.00026808618,0.00610681,0.0074899015,0.00025399332],"about_ca_topic_score_codex":0.00011077953,"about_ca_topic_score_gemma":0.0022184264,"teacher_disagreement_score":0.93125266,"about_ca_system_score_codex":0.00006267088,"about_ca_system_score_gemma":0.000045620767,"threshold_uncertainty_score":0.18493581},"labels":[],"label_agreement":null},{"id":"W2168720677","doi":"10.1109/ccece.1993.332485","title":"Approximate spatial reasoning using vague object boundaries","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spatial intelligence; Object (grammar); Simple (philosophy); Spatial relation; Computer science; Artificial intelligence; Reasoning system; Qualitative reasoning; Relation (database); Spatial analysis; Theoretical computer science; Mathematics; Data mining; Epistemology","score_opus":0.02379961013879514,"score_gpt":0.23429101162361607,"score_spread":0.21049140148482093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168720677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030489597,0.000020995538,0.9751966,0.00028718525,0.0004242471,0.00006339539,4.6556903e-7,0.00025655163,0.02070159],"genre_scores_gemma":[0.7457634,0.0000044647313,0.25360605,0.00015694177,0.000037976803,0.000001550144,7.1653176e-7,0.000004249722,0.0004246542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999351,0.000029168768,0.00012555308,0.00019484396,0.00014179751,0.00015764071],"domain_scores_gemma":[0.9996474,0.000018848297,0.000046942558,0.00019919066,0.000041038656,0.000046592453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088297405,0.00007795673,0.00007612504,0.000067511464,0.000321673,0.00057573547,0.00014907123,0.000033092463,0.0006522687],"category_scores_gemma":[0.000035712957,0.00007357598,0.000030755193,0.00019006658,0.00006069417,0.00048753916,0.00006674037,0.000060113198,0.000043911983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059644876,0.00009628358,0.007281051,0.000026205431,0.000048073685,0.000033369524,0.006162774,0.012729034,0.0015922511,0.3827351,0.0026516365,0.5866383],"study_design_scores_gemma":[0.0001321157,0.000010229161,0.0005163021,0.0000070734072,0.0000023950877,0.000037060097,0.000027486354,0.99684286,0.00058921444,0.00030045607,0.0014280635,0.00010674172],"about_ca_topic_score_codex":0.00022561991,"about_ca_topic_score_gemma":0.0000929079,"teacher_disagreement_score":0.9841138,"about_ca_system_score_codex":0.00004502644,"about_ca_system_score_gemma":0.000039095194,"threshold_uncertainty_score":0.7141885},"labels":[],"label_agreement":null},{"id":"W2168974442","doi":"10.1504/ijcat.2006.010085","title":"A constraint-based product configurator for mass customisation","year":2006,"lang":"en","type":"article","venue":"International Journal of Computer Applications in Technology","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Configurator; Computer science; Flexibility (engineering); Domain (mathematical analysis); Product (mathematics); Constraint (computer-aided design); Software engineering; Product design; Key (lock); Product design specification; Systems engineering; Generality; Engineering; Mathematics; Operating system","score_opus":0.0062073721560834405,"score_gpt":0.2538095361016644,"score_spread":0.24760216394558096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168974442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002333887,0.000043419906,0.9892184,0.007075751,0.00048110407,0.00042536022,0.000007891975,0.00009320276,0.0003209902],"genre_scores_gemma":[0.5843431,0.0000036962326,0.4152917,0.000099070196,0.00016592164,0.00007126315,0.0000104022965,0.000005037126,0.000009819971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988051,0.000023303344,0.0006009763,0.0002136768,0.00022433388,0.00013259554],"domain_scores_gemma":[0.9982586,0.00016327943,0.00044824337,0.00022293409,0.00088053895,0.000026440113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023956882,0.000108774024,0.00016435304,0.001346954,0.00005050635,0.00009211108,0.00088411686,0.0000857302,0.000009308746],"category_scores_gemma":[0.000039297098,0.000108661894,0.00007899206,0.0005660136,0.00010749731,0.00025347352,0.000035762587,0.00014975968,0.000003843339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021722473,0.00020211893,0.0069957953,0.000009356933,0.000037636135,0.000007960621,0.00002837521,0.024546722,0.003228928,0.7650343,0.00061008247,0.199277],"study_design_scores_gemma":[0.0068011996,0.00032939078,0.011716591,0.00014988544,0.000032014563,0.0004905054,0.000089609246,0.6054335,0.05073763,0.2079556,0.115567766,0.00069629133],"about_ca_topic_score_codex":0.0000037350644,"about_ca_topic_score_gemma":0.000010674478,"teacher_disagreement_score":0.5820092,"about_ca_system_score_codex":0.00015082696,"about_ca_system_score_gemma":0.00022000758,"threshold_uncertainty_score":0.44311035},"labels":[],"label_agreement":null},{"id":"W2170250576","doi":"","title":"A quadratic propagator for the inter-distance constraint","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; University of Waterloo","funders":"","keywords":"Propagator; Consistency (knowledge bases); Local consistency; Quadratic equation; Constraint (computer-aided design); Scheduling (production processes); Mathematics; Mathematical optimization; Benchmark (surveying); Computer science; Applied mathematics; Constraint satisfaction; Discrete mathematics; Probabilistic logic; Statistics","score_opus":0.011017266303704795,"score_gpt":0.22919986874205162,"score_spread":0.2181826024383468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170250576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013037042,0.00002703142,0.9877489,0.004524959,0.00022960342,0.00035416675,0.000002131989,0.00013752746,0.006845317],"genre_scores_gemma":[0.9021067,0.000001428788,0.095840104,0.00046916088,0.000043047756,0.000060195947,0.0000015959894,0.0000033601575,0.0014744302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994797,0.000014871473,0.0001500888,0.00015515932,0.00008132156,0.00011882885],"domain_scores_gemma":[0.9995036,0.0001439642,0.00004699716,0.00021827733,0.00006518372,0.000021957907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012544135,0.000064769876,0.000057505822,0.000024359115,0.00012724068,0.00015407692,0.0002276547,0.000019032068,0.00007484415],"category_scores_gemma":[0.00002691617,0.00004076742,0.000043701235,0.000120660625,0.00007007567,0.00016506364,0.000026296919,0.000038234994,0.000016506026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025893175,0.000017462808,0.00026175223,0.000006140054,0.00000546628,6.631652e-7,0.00006370232,0.0005090109,0.00014249049,0.89994586,0.004744707,0.094300136],"study_design_scores_gemma":[0.000494713,0.00004726601,0.0025381532,0.000013121647,0.0000072202315,0.000026069723,0.000100923884,0.9524749,0.0011905378,0.009663447,0.033260252,0.00018339908],"about_ca_topic_score_codex":0.000030740463,"about_ca_topic_score_gemma":0.00022175598,"teacher_disagreement_score":0.95196587,"about_ca_system_score_codex":0.00002317697,"about_ca_system_score_gemma":0.00005894491,"threshold_uncertainty_score":0.16624472},"labels":[],"label_agreement":null},{"id":"W2170479010","doi":"10.1007/978-3-540-68825-9_23","title":"Mathematically Clinching a Playoff Spot in the NHL and the Effect of Scoring Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; League; Solver; Heuristic; Operations research; Constraint (computer-aided design); Hot spot (computer programming); Artificial intelligence; Newspaper; Machine learning; Simulation; Mathematics; Programming language","score_opus":0.0106162438047289,"score_gpt":0.2299818879855886,"score_spread":0.21936564418085971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170479010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016499106,0.00040107942,0.994456,0.00039383917,0.00054425496,0.0008125544,8.776853e-7,0.00003218925,0.0017092898],"genre_scores_gemma":[0.9521592,0.00011645607,0.0472512,0.00028296196,0.00012396644,0.000024407924,6.948645e-7,0.000012587676,0.000028492062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978451,0.00016948218,0.00050568546,0.00055456214,0.00066670094,0.00025846018],"domain_scores_gemma":[0.99603945,0.002896866,0.00027006306,0.00069479947,0.000057550733,0.000041261646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026035442,0.00026498595,0.0004576398,0.00036444212,0.00019922573,0.00033271173,0.0012353273,0.00012906358,0.0000021725568],"category_scores_gemma":[0.00021328553,0.00014487098,0.000076710254,0.0003936227,0.00090720656,0.0002660681,0.0004070207,0.0005627936,0.0000022585168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049037266,0.000019336187,0.0008403906,0.00032028212,0.000022697872,0.00012671655,0.01005898,0.23209324,0.00003972028,0.09310019,0.000009522161,0.6633199],"study_design_scores_gemma":[0.0006934728,0.00011894721,0.00039291164,0.00069739,0.000008061091,0.00043624995,8.698349e-7,0.99022466,0.00006548124,0.007089988,0.00006192774,0.0002100585],"about_ca_topic_score_codex":0.000035023,"about_ca_topic_score_gemma":0.00003276388,"teacher_disagreement_score":0.9505093,"about_ca_system_score_codex":0.00006328957,"about_ca_system_score_gemma":0.00012191783,"threshold_uncertainty_score":0.59076667},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.21269704873182618,"score_gpt":0.408101652300917,"score_spread":0.1954046035690908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170780172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014381535,0.00010662081,0.9823598,0.0017658045,0.00084109773,0.0003452369,0.0000039962747,0.000028356853,0.00016750759],"genre_scores_gemma":[0.90551186,0.000047833248,0.09392729,0.00005551639,0.0004260031,0.0000073257333,0.0000010851913,0.000010917007,0.000012151859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716413,0.00029684338,0.0007433028,0.00017526979,0.0010100217,0.00061041344],"domain_scores_gemma":[0.99635804,0.0011704342,0.00025954773,0.0002194382,0.0017237661,0.0002687798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006791956,0.00011673648,0.00019978601,0.00059356913,0.0004010872,0.00038592445,0.00041636822,0.00009257729,0.00008539693],"category_scores_gemma":[0.0012081958,0.0001063935,0.00013041761,0.0006852772,0.00022930183,0.00091627275,0.000060521787,0.00062522246,0.00003302514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007159277,0.000183141,0.0038769853,0.000079378275,0.000030748706,0.0000047779504,0.0015461697,0.042556986,0.006048503,0.117421925,0.00026632953,0.82791346],"study_design_scores_gemma":[0.00019865343,0.00072255277,0.0026276363,0.00022968934,0.00001683396,0.00015010354,0.00160333,0.9112295,0.050352223,0.030121721,0.0024038712,0.0003438671],"about_ca_topic_score_codex":0.000036908,"about_ca_topic_score_gemma":0.00003714543,"teacher_disagreement_score":0.8911303,"about_ca_system_score_codex":0.00020544275,"about_ca_system_score_gemma":0.0005300402,"threshold_uncertainty_score":0.43386006},"labels":[],"label_agreement":null},{"id":"W2171033649","doi":"10.1007/978-3-540-30134-9_94","title":"Stochastic Local Search for Incremental SAT and Incremental MAX-SAT","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Boolean satisfiability problem; Maximum satisfiability problem; Satisfiability; Conjunctive normal form; Set (abstract data type); Local search (optimization); True quantified Boolean formula; Mathematics; Computer science; Algorithm; Boolean function; Combinatorics; Discrete mathematics; Programming language","score_opus":0.017442964766918197,"score_gpt":0.2524938784654792,"score_spread":0.23505091369856101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171033649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004845215,0.00012911463,0.9966573,0.0006256672,0.0008511387,0.00075537217,0.000018108309,0.000108538785,0.00037020817],"genre_scores_gemma":[0.71443903,0.000013303961,0.28453317,0.00072838337,0.00016943878,0.000012116156,0.000025037252,0.000023609982,0.0000558998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997068,0.000022726806,0.00040135215,0.0011942434,0.00078033464,0.0005333627],"domain_scores_gemma":[0.9987074,0.00027784638,0.00013543002,0.00051922514,0.00016186944,0.00019823773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060848816,0.0004068349,0.0003528926,0.0006416185,0.00035121237,0.00048159403,0.0010076832,0.0002235337,0.000048860406],"category_scores_gemma":[0.00002799673,0.00040233237,0.00008573892,0.00029932716,0.00095903786,0.00055753504,0.0009338996,0.00046207957,0.000020779755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019862728,0.000026303758,0.00013867178,0.000056795925,0.000016729437,0.00002054976,0.00070573034,0.22718441,0.00024111732,0.031844825,0.0000066774755,0.73973835],"study_design_scores_gemma":[0.001090699,0.0003400336,0.00045925876,0.0003153671,0.000012951949,0.00015252343,0.0000018600925,0.9556105,0.0010315577,0.04023849,0.000062662235,0.00068407995],"about_ca_topic_score_codex":0.000045137607,"about_ca_topic_score_gemma":0.00014311168,"teacher_disagreement_score":0.73905426,"about_ca_system_score_codex":0.00067150244,"about_ca_system_score_gemma":0.0006106798,"threshold_uncertainty_score":0.9998429},"labels":[],"label_agreement":null},{"id":"W2172184802","doi":"10.1109/icip.2009.5414186","title":"Feature correspondence with constrained global spatial structures","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Feature (linguistics); Computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.005189851806916921,"score_gpt":0.22578808865528344,"score_spread":0.22059823684836652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172184802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027167238,0.000009628135,0.9735022,0.005583779,0.00016488349,0.00010359434,0.0000031282914,0.00025785086,0.017658183],"genre_scores_gemma":[0.85535234,0.0000014753087,0.14283004,0.0013554947,0.00002736995,7.726026e-7,0.0000027750846,0.0000013342263,0.0004284078],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992895,0.00002390847,0.0000721035,0.00024198709,0.00021662925,0.00015588595],"domain_scores_gemma":[0.99955463,0.00001771698,0.00004507701,0.00022568747,0.000073287476,0.00008358779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000418035,0.00010782479,0.00008654483,0.000034642933,0.00008220843,0.00015842344,0.00025282492,0.000053068157,0.00018526125],"category_scores_gemma":[0.000016766884,0.00007910382,0.000023520548,0.00029426717,0.00005291929,0.00029588686,0.000020510683,0.000077738834,0.000014625968],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053268013,0.000018735489,0.0036431835,0.0000015931201,0.000009607098,0.00003881832,0.00009475428,0.0019790344,0.00021535496,0.48328075,0.003399487,0.50726545],"study_design_scores_gemma":[0.0024257929,0.0008385187,0.7516519,0.000031242966,0.000017631304,0.001176419,0.00011229972,0.21597324,0.0015392713,0.020237379,0.0051464085,0.00084989937],"about_ca_topic_score_codex":0.000016986147,"about_ca_topic_score_gemma":0.00010786594,"teacher_disagreement_score":0.8526356,"about_ca_system_score_codex":0.000032484495,"about_ca_system_score_gemma":0.00012169309,"threshold_uncertainty_score":0.32257602},"labels":[],"label_agreement":null},{"id":"W2175971376","doi":"10.1287/ijoc.2015.0654","title":"Achieving Domain Consistency and Counting Solutions for Dispersion Constraints","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Heuristics; Consistency (knowledge bases); Benchmark (surveying); Mathematical optimization; Constraint programming; Constraint satisfaction; Computer science; Constraint satisfaction problem; Local consistency; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type); Heuristic; Mathematics; Algorithm; Stochastic programming; Artificial intelligence","score_opus":0.03486259221766811,"score_gpt":0.2661912026807494,"score_spread":0.2313286104630813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175971376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065441936,0.000056549146,0.9292251,0.0012236533,0.00074860314,0.00014985361,0.0000017706404,0.00008125414,0.0030712981],"genre_scores_gemma":[0.8637197,0.000011059036,0.13552949,0.0005788559,0.00013709265,0.0000010223849,0.0000018636752,0.000006162996,0.0000147614755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878824,0.000031481377,0.00041081855,0.00016366865,0.00025992625,0.00034588441],"domain_scores_gemma":[0.99885017,0.00023822012,0.00029291687,0.0001229739,0.00026729555,0.00022845523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014037933,0.0001271025,0.00015432751,0.0001799073,0.0008623604,0.0005324797,0.00019966139,0.000055227865,0.000006050014],"category_scores_gemma":[0.00028153288,0.00010822083,0.00006823246,0.00014611187,0.000108449574,0.0007701955,0.00013653612,0.00023877696,0.00000898658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024779929,0.00003544652,0.0054944893,0.000021126289,0.000040537878,0.000014555688,0.002768937,0.013573774,0.00014108121,0.18617178,0.00083763537,0.79087585],"study_design_scores_gemma":[0.0044154967,0.0005451841,0.00868653,0.00046710152,0.000021923022,0.003167461,0.0032381027,0.9580966,0.000047163347,0.00867769,0.011953164,0.0006835844],"about_ca_topic_score_codex":0.0000019716658,"about_ca_topic_score_gemma":0.0000019281135,"teacher_disagreement_score":0.9445228,"about_ca_system_score_codex":0.00011182371,"about_ca_system_score_gemma":0.00020572382,"threshold_uncertainty_score":0.6632666},"labels":[],"label_agreement":null},{"id":"W2176819926","doi":"10.1609/aaai.v28i1.9125","title":"Linear-Time Filtering Algorithms for the Disjunctive Constraint","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Constraint (computer-aided design); Logarithm; Time complexity; Time constraint; Data structure; Tree (set theory); Constant (computer programming); Running time; Theoretical computer science; Mathematics","score_opus":0.06594457206901701,"score_gpt":0.29010170181726114,"score_spread":0.22415712974824414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176819926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027729247,0.0000047696044,0.98452187,0.006858664,0.00064101483,0.00057111576,0.000007591788,0.000091359216,0.0045306925],"genre_scores_gemma":[0.9789952,0.000012140558,0.020191617,0.00032766358,0.00014379859,0.00005668711,6.416071e-7,0.000009931203,0.00026231256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.000016499878,0.00038111326,0.00036043033,0.00029191948,0.0002516999],"domain_scores_gemma":[0.9984333,0.00038512805,0.00028548998,0.0002548391,0.00058087544,0.000060376973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059885957,0.00017314736,0.00018266636,0.00006496356,0.0003265853,0.00021987165,0.0011670219,0.00006220959,0.000078543395],"category_scores_gemma":[0.00063442823,0.00010883568,0.0001294151,0.00032813742,0.0003442074,0.00027884895,0.00020499261,0.00018353053,0.000050642757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025296404,0.000035025685,0.00003908508,0.000012881035,0.000017113394,3.616078e-8,0.00061883254,0.0007447391,0.010161159,0.6512861,0.00011838788,0.33694133],"study_design_scores_gemma":[0.000036631263,0.000127991,0.0001597754,0.00006921727,0.000012589627,0.000004100395,0.00024953828,0.82437134,0.125152,0.049210858,0.00045671203,0.0001492196],"about_ca_topic_score_codex":0.000010742025,"about_ca_topic_score_gemma":0.0000038129808,"teacher_disagreement_score":0.9762223,"about_ca_system_score_codex":0.000030618412,"about_ca_system_score_gemma":0.00006408624,"threshold_uncertainty_score":0.44381902},"labels":[],"label_agreement":null},{"id":"W2182695824","doi":"10.82308/6712","title":"The complexity of constraint satisfaction problems and symmetric Datalog /","year":2007,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Datalog; Constraint satisfaction problem; Constraint (computer-aided design); Constraint satisfaction; Computer science; Constraint programming; Mathematics; Programming language; Mathematical optimization; Artificial intelligence","score_opus":0.03650783466781337,"score_gpt":0.24127150413035037,"score_spread":0.204763669462537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182695824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.917779,0.00036164554,0.02203723,0.00056150457,0.0017889865,0.0016067325,0.0004579721,0.00070636166,0.054700553],"genre_scores_gemma":[0.9845538,0.000140412,0.015085191,0.00012600853,0.000009663885,0.000007979235,0.000011808018,0.000014395375,0.000050735398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99785537,0.00016715203,0.0006193719,0.000492261,0.00046041436,0.00040541543],"domain_scores_gemma":[0.9981378,0.0004905218,0.0003472414,0.00058567256,0.000240891,0.00019792069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018392951,0.00022355367,0.00023511164,0.00026967382,0.0010122872,0.0001267863,0.00043225448,0.00012880446,0.000028467557],"category_scores_gemma":[0.00043119452,0.00018900674,0.00007786409,0.000940596,0.00057220005,0.00096288975,0.0002867334,0.0003944332,0.000019789113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073357737,0.000018213279,0.00069356465,0.000014670095,0.0000201166,0.0000028747143,0.000003533332,0.00003514716,0.002903407,0.5528007,8.800171e-7,0.44349954],"study_design_scores_gemma":[0.0036999974,0.000599743,0.52730066,0.00022097904,0.000105565545,0.00084245554,0.00039220645,0.01588478,0.05008666,0.36012134,0.0389805,0.0017651537],"about_ca_topic_score_codex":0.00026573372,"about_ca_topic_score_gemma":0.0012434873,"teacher_disagreement_score":0.52660704,"about_ca_system_score_codex":0.0001665923,"about_ca_system_score_gemma":0.000025598754,"threshold_uncertainty_score":0.7785797},"labels":[],"label_agreement":null},{"id":"W2183864785","doi":"10.70930/tac/6r8l5k81","title":"Range Categories I: General Theory","year":2012,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Range (aeronautics); Generalization; Mathematics; Enriched category; Epimorphism; Semigroup; Domain theory; Domain (mathematical analysis); Category theory; Algebra over a field; Pure mathematics; Discrete mathematics; Functor; Mathematical analysis","score_opus":0.009075658467979229,"score_gpt":0.23952542104886743,"score_spread":0.2304497625808882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183864785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009979902,0.0010908893,0.98003036,0.00017288113,0.000092083166,0.00018755144,0.0000053952767,0.00010845525,0.008332487],"genre_scores_gemma":[0.99110836,0.0001210865,0.007555167,0.00010636008,0.00010945703,0.00009804405,0.000008607495,0.000006150413,0.0008867617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993012,0.00012789722,0.00017628257,0.0001397195,0.00009488239,0.00016001999],"domain_scores_gemma":[0.99920696,0.00022425663,0.00009044623,0.00032722196,0.000074686475,0.00007642211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007231819,0.00009893285,0.00011901913,0.00008100372,0.00018527683,0.00004427611,0.000218798,0.00004626684,0.00007723045],"category_scores_gemma":[0.000027106062,0.000087778935,0.000031510586,0.00024734923,0.00028474812,0.0005600592,0.00008029501,0.00006126585,0.000016144093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134009515,0.000025294476,0.0010912433,0.000011051759,0.000011070973,4.2229505e-8,0.0011709146,0.000013623384,0.0001971206,0.9358725,0.00004487375,0.061548855],"study_design_scores_gemma":[0.00023734281,0.000025388717,0.007590757,0.0000034273837,0.000028058581,0.000029169518,0.00089822727,0.00018215201,0.0066125235,0.9720984,0.012074673,0.00021984096],"about_ca_topic_score_codex":0.0000052493738,"about_ca_topic_score_gemma":0.0000012357159,"teacher_disagreement_score":0.98112845,"about_ca_system_score_codex":0.000008665351,"about_ca_system_score_gemma":0.00002984957,"threshold_uncertainty_score":0.3579521},"labels":[],"label_agreement":null},{"id":"W2184947655","doi":"10.1109/wcre.1995.514719","title":"Program understanding as constraint satisfaction","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constraint satisfaction; Constraint programming; Heuristics; Programming language; Source code; Constraint satisfaction problem; Code (set theory); Software engineering; Theoretical computer science; Artificial intelligence; Mathematical optimization","score_opus":0.056210156874070875,"score_gpt":0.26476183145956994,"score_spread":0.20855167458549906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184947655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097078923,0.000009032389,0.8502918,0.0018539778,0.00025126454,0.00018419635,2.726136e-7,0.0007099323,0.14572874],"genre_scores_gemma":[0.923883,0.000023928598,0.07516255,0.0003245604,0.000017784423,0.000011039264,6.815113e-7,0.000003831742,0.0005725761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929506,0.000025183852,0.00013962969,0.00021124045,0.00016863884,0.00016026438],"domain_scores_gemma":[0.9996251,0.00003503357,0.000044081306,0.00018661517,0.000028467828,0.00008069226],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000712719,0.000081955266,0.000066984925,0.00009377829,0.0001355414,0.00021177849,0.00010718201,0.000044319557,0.002335391],"category_scores_gemma":[0.000020726755,0.000077771816,0.00003784001,0.00026349296,0.000052010724,0.00047472396,0.00003138933,0.00007656013,0.000339202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0567997e-7,0.000019209188,0.0013239995,0.000001767226,0.0000064324227,0.0000037156767,0.00015286313,0.000103108156,0.00004444192,0.5315173,0.0008955271,0.46593118],"study_design_scores_gemma":[0.000884801,0.00024840035,0.01002185,0.000021068165,0.000009194004,0.00032201255,0.0007053129,0.9559153,0.00042945793,0.023976441,0.0069637783,0.0005024032],"about_ca_topic_score_codex":0.000025810008,"about_ca_topic_score_gemma":0.00004204551,"teacher_disagreement_score":0.95581216,"about_ca_system_score_codex":0.00011584989,"about_ca_system_score_gemma":0.000015627134,"threshold_uncertainty_score":0.9985766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Solver; Parameterized complexity; Boolean satisfiability problem; Local search (optimization); Satisfiability; Task (project management); Theoretical computer science; State (computer science); Algorithm; Programming language","score_opus":0.11416094608679045,"score_gpt":0.3091856572084594,"score_spread":0.19502471112166897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185085875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07649842,0.00001856364,0.92045426,0.0011573237,0.00069752696,0.00012534756,0.0000033053623,0.00026344002,0.0007818172],"genre_scores_gemma":[0.8804225,0.000003928373,0.119196594,0.00027797304,0.00006131485,0.0000034487032,0.000008256258,0.000007663519,0.000018319834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983195,0.00010302956,0.00038297495,0.00039754255,0.00048550867,0.00031143162],"domain_scores_gemma":[0.9989125,0.00016532048,0.00006208868,0.00038117036,0.00020207171,0.00027683744],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036827906,0.00014112596,0.00015653351,0.00011082194,0.0001322193,0.00026116468,0.00055328367,0.00007746703,0.00011197828],"category_scores_gemma":[0.000107733176,0.00014222524,0.00005569291,0.00039275,0.00017896443,0.00048646543,0.00021504135,0.00016848114,0.0010179634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026939446,0.00009209018,0.0011466764,0.0000045694783,0.000026526975,0.000038277656,0.0024284006,0.07228913,0.004901001,0.19158825,0.00022356183,0.72723454],"study_design_scores_gemma":[0.000039871833,0.000045853663,0.0007377854,0.000021232845,0.0000045085753,0.000007304021,0.00046811195,0.94759303,0.023203913,0.027471568,0.00022462783,0.00018216285],"about_ca_topic_score_codex":0.00047785026,"about_ca_topic_score_gemma":0.00008531598,"teacher_disagreement_score":0.8753039,"about_ca_system_score_codex":0.00012333944,"about_ca_system_score_gemma":0.0001379134,"threshold_uncertainty_score":0.99975985},"labels":[],"label_agreement":null},{"id":"W2186289433","doi":"","title":"Novelty + and Adaptive Novelty +","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Novelty; Diversification (marketing strategy); Exploit; Novelty detection; Computer science; Artificial intelligence; Noise (video); Range (aeronautics); Mathematical optimization; Machine learning; Mathematics; Engineering","score_opus":0.011928343444614761,"score_gpt":0.21034442531861391,"score_spread":0.19841608187399914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186289433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035253142,0.000008661966,0.97742337,0.0015810494,0.00009194745,0.000051833515,6.4472437e-7,0.00011832117,0.017198877],"genre_scores_gemma":[0.7469502,0.000006050414,0.25234222,0.0005218292,0.000009844869,0.0000014109883,3.806992e-7,0.0000015670859,0.0001664946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996194,0.000005007971,0.00006753606,0.00015207354,0.00007610039,0.000079846446],"domain_scores_gemma":[0.99977225,0.000013504554,0.000019303294,0.00011328191,0.000032349068,0.000049340186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045895868,0.00004943136,0.00004476651,0.00003670459,0.00005524446,0.000057735142,0.00008261676,0.000022826056,0.000043076376],"category_scores_gemma":[0.000009249297,0.000043214743,0.000012611354,0.00012572661,0.000027518485,0.00031347998,0.000054932487,0.000039081064,0.00002990574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018160677,0.000019305235,0.00043199217,0.000001069195,0.0000049357554,0.0000021891449,0.00027976252,0.0012666904,0.00021453993,0.92234653,0.00007637687,0.07535479],"study_design_scores_gemma":[0.0076708463,0.0005560752,0.41763386,0.00006420447,0.000020228696,0.00046500113,0.00057955,0.44751605,0.013016899,0.10075213,0.010168249,0.0015569107],"about_ca_topic_score_codex":0.00004787833,"about_ca_topic_score_gemma":0.00006669686,"teacher_disagreement_score":0.8215944,"about_ca_system_score_codex":0.00002223529,"about_ca_system_score_gemma":0.000039491166,"threshold_uncertainty_score":0.1762246},"labels":[],"label_agreement":null},{"id":"W21866977","doi":"10.1007/978-3-642-04170-9_6","title":"CSP Techniques for Solving Combinatorial Queries within Relational Databases","year":2009,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Tuple; Computer science; Database; Constraint (computer-aided design); SQL; Relational database; Constraint satisfaction problem; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.11740292776604609,"score_gpt":0.36069119688637985,"score_spread":0.24328826912033374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21866977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015442955,0.0008702135,0.96632266,0.00071916945,0.0017819101,0.0006048841,0.000059414615,0.00022877131,0.02941142],"genre_scores_gemma":[0.008405664,0.00086291076,0.9690959,0.0006283777,0.0005321621,0.00012309736,0.00033793924,0.00004541782,0.019968543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778914,0.000024951634,0.00082751387,0.00065450586,0.00048914907,0.00021473544],"domain_scores_gemma":[0.9971122,0.0013814934,0.0004302075,0.00027968973,0.00074657035,0.000049802282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046797167,0.00035673057,0.00042793865,0.00037685595,0.00027982224,0.00007817615,0.00041508154,0.00014575628,0.000034323344],"category_scores_gemma":[0.00040505067,0.00038290358,0.00012295812,0.00013163507,0.0003530933,0.0005160774,0.00025218923,0.0003383009,0.000016267611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015218523,0.000017612914,0.000019552364,0.00004042037,0.0000547163,0.000007197917,0.0004415407,0.034321234,4.3670093e-7,0.9276846,0.0008626784,0.03653482],"study_design_scores_gemma":[0.000113030466,0.00011103555,0.00003108229,0.0004968794,0.000015308668,0.000020605716,0.000071623006,0.06926428,0.000093212104,0.91408783,0.015243359,0.00045174648],"about_ca_topic_score_codex":0.0000047930885,"about_ca_topic_score_gemma":0.000037036247,"teacher_disagreement_score":0.036083072,"about_ca_system_score_codex":0.0002852959,"about_ca_system_score_gemma":0.00030104918,"threshold_uncertainty_score":0.9998623},"labels":[],"label_agreement":null},{"id":"W2186952700","doi":"10.1007/978-3-319-06251-8_23","title":"Refinements of the RCC25 Composition Table","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Table (database); Composition (language); Connection (principal bundle); Binary relation; Relation algebra; Computer science; Boolean algebra; Algebra over a field; Algebraic number; Algebraic structure; Two-element Boolean algebra; Discrete mathematics; Pure mathematics; Algorithm; Mathematics; Algebra representation; Geometry; Data mining; Mathematical analysis","score_opus":0.010090059713814463,"score_gpt":0.22035399814584708,"score_spread":0.21026393843203262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186952700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004918666,0.000037775517,0.9910693,0.00088780915,0.0014497874,0.0002318504,0.0000034350892,0.000051774998,0.0062190895],"genre_scores_gemma":[0.56733465,0.000029391593,0.4286996,0.002653835,0.00023757954,0.000006536791,0.000008036422,0.000025083968,0.0010052639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980508,0.00003366792,0.0003815482,0.00060876575,0.0006758932,0.00024928627],"domain_scores_gemma":[0.9983034,0.0001419748,0.00034063205,0.00094455446,0.0002126842,0.00005675696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449126,0.0002290051,0.00026227004,0.00030629366,0.00019329679,0.00015904383,0.0016714241,0.00014482468,0.000044005745],"category_scores_gemma":[0.000032381202,0.00017621664,0.000082677085,0.00047646777,0.0004343777,0.00021782906,0.00067263906,0.00032836228,0.000012448969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033724145,0.000019142502,0.0002853255,0.000037527483,0.000009683741,0.0000028369293,0.00025501827,0.12197031,0.00066441647,0.0820179,0.00008218122,0.7946523],"study_design_scores_gemma":[0.00041692425,0.00010193703,0.0015185009,0.0005558023,0.000012061222,0.0000429124,8.5658876e-8,0.9394698,0.0054717497,0.048538815,0.003377908,0.0004934768],"about_ca_topic_score_codex":0.00001638703,"about_ca_topic_score_gemma":0.000042106698,"teacher_disagreement_score":0.8174995,"about_ca_system_score_codex":0.00013570816,"about_ca_system_score_gemma":0.00027018753,"threshold_uncertainty_score":0.7185906},"labels":[],"label_agreement":null},{"id":"W2187584737","doi":"","title":"Solving Resource Allocation/Scheduling Problems with Constraint Integer Programming","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Integer programming; Mathematical optimization; Computer science; Concurrent constraint logic programming; Constraint logic programming; Decomposition; Scheduling (production processes); Benders' decomposition; Decomposition method (queueing theory); Constraint satisfaction; Generalization; Mathematics; Stochastic programming; Artificial intelligence; Discrete mathematics","score_opus":0.0259289450491757,"score_gpt":0.2136287232734865,"score_spread":0.1876997782243108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187584737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013633054,0.000012353895,0.9600143,0.00042740858,0.000057560625,0.00024871883,1.3423593e-7,0.00042796647,0.037448257],"genre_scores_gemma":[0.5361266,0.0000014016634,0.46351114,0.00015876895,0.0000106827465,0.000017977674,0.000001450755,0.000005764415,0.0001661752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903405,0.000032455202,0.00021307367,0.00031330824,0.0001789938,0.00022812422],"domain_scores_gemma":[0.9993638,0.00003284312,0.00009409556,0.0002855949,0.0001286715,0.000094994655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024712156,0.000121593024,0.00009643607,0.000103734405,0.00013883227,0.00015884105,0.00026938718,0.00004509634,0.00017987969],"category_scores_gemma":[0.000026856085,0.00009663796,0.000029604618,0.0003134885,0.00009401154,0.00050155696,0.00007149174,0.00012710532,0.000027218099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011896366,0.00012805832,0.007966671,0.00003571373,0.000060702714,0.000014032805,0.010361948,0.008551498,0.0003739602,0.38850322,0.00008636108,0.58390594],"study_design_scores_gemma":[0.0013143091,0.00038411224,0.00528287,0.00028299767,0.00003064707,0.00038462158,0.0038719194,0.9707782,0.0045287698,0.001809821,0.010271131,0.0010605456],"about_ca_topic_score_codex":0.000045536566,"about_ca_topic_score_gemma":0.00007256755,"teacher_disagreement_score":0.96222675,"about_ca_system_score_codex":0.000032038366,"about_ca_system_score_gemma":0.00009217746,"threshold_uncertainty_score":0.39407817},"labels":[],"label_agreement":null},{"id":"W2207275587","doi":"10.48550/arxiv.2409.11044","title":"Computation and Complexity of Preference Inference Based on Hierarchical Models","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Science Foundation Ireland; Queen's University Belfast","keywords":"Computation; Inference; Preference; Computer science; Artificial intelligence; Theoretical computer science; Mathematics; Algorithm; Statistics","score_opus":0.1940580369590579,"score_gpt":0.2228332303218106,"score_spread":0.028775193362752693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207275587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06321537,0.000009500476,0.93294084,0.00020487461,0.00018917621,0.00019103153,0.000027899321,0.00014975673,0.0030715715],"genre_scores_gemma":[0.9837515,0.000026801332,0.01607791,0.000058790007,0.000009057231,5.7896807e-7,0.000020176318,0.0000063385833,0.00004889325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987921,0.00011824383,0.00017596969,0.00067815906,0.00010446587,0.00013102584],"domain_scores_gemma":[0.99907213,0.00016919158,0.00013931213,0.00039084413,0.0001316146,0.00009689139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012651498,0.00018334802,0.00021740329,0.00029582606,0.00006328365,0.000088468456,0.000390004,0.0001522702,0.000014727946],"category_scores_gemma":[0.000022173,0.00020493793,0.00007213963,0.0003414121,0.00025079268,0.00015865323,0.0007723933,0.00046481512,0.000008081035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011186597,0.000023665065,0.00023521032,0.000070219554,0.000009359485,0.000007706612,0.000083566985,0.6068171,0.000004094761,0.3901391,0.000008659505,0.002590096],"study_design_scores_gemma":[0.00014887769,0.000036158257,0.0015885172,0.00011471204,0.000013986238,6.250559e-7,0.0000056757062,0.6778189,0.000020758182,0.32012618,0.0000018806063,0.00012372647],"about_ca_topic_score_codex":0.000059899823,"about_ca_topic_score_gemma":0.00002456537,"teacher_disagreement_score":0.9205361,"about_ca_system_score_codex":0.00007110652,"about_ca_system_score_gemma":0.00023477752,"threshold_uncertainty_score":0.8357126},"labels":[],"label_agreement":null},{"id":"W22136221","doi":"10.1111/j.1740-8709.2010.00253.x","title":"Solving constraint satisfaction sequencing problems by iterative repair","year":2001,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Constraint programming; Constraint satisfaction dual problem; Mathematical optimization; Constraint learning; Sequence (biology); Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Computer science; Local consistency; Local search (optimization); Constructive; Domain (mathematical analysis); Mathematics; Artificial intelligence; Stochastic programming; Process (computing)","score_opus":0.017500780364908177,"score_gpt":0.23381689892706822,"score_spread":0.21631611856216004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22136221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012463202,0.00003121947,0.96174145,0.00076113094,0.0002442494,0.000210089,0.0000017538999,0.0008639619,0.023682944],"genre_scores_gemma":[0.89997375,0.000047335456,0.098387234,0.00056205754,0.00002739667,0.000015654476,0.000005821799,0.000007009519,0.00097373774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888176,0.000061731844,0.00026710078,0.00035990123,0.00020070147,0.00022881645],"domain_scores_gemma":[0.99939704,0.000061983315,0.00009320258,0.00024784775,0.000107482796,0.000092437294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021073985,0.00013351582,0.00011421089,0.00009601742,0.00020371891,0.00020999441,0.00012374826,0.00006108936,0.0004481186],"category_scores_gemma":[0.000038984046,0.00012624865,0.00006352096,0.00032485244,0.000053184645,0.001037203,0.00005129743,0.00012588967,0.00005369065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011503598,0.0000726149,0.105420634,0.00004027889,0.00012941699,0.000060394916,0.006130728,0.014659715,0.044103514,0.2042546,0.016016059,0.6091005],"study_design_scores_gemma":[0.0006897815,0.00011711627,0.011305775,0.000065698325,0.000009701791,0.00042992728,0.0006068614,0.97468126,0.0026952398,0.0021400838,0.0066761402,0.0005823895],"about_ca_topic_score_codex":0.00017320411,"about_ca_topic_score_gemma":0.00017874784,"teacher_disagreement_score":0.96002156,"about_ca_system_score_codex":0.00018693968,"about_ca_system_score_gemma":0.0000943926,"threshold_uncertainty_score":0.5148271},"labels":[],"label_agreement":null},{"id":"W2220966158","doi":"10.1007/978-3-319-19066-2_20","title":"Integrating TCP-Nets and CSPs: The Constrained TCP-Net (CTCP-Net) Model","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Net (polyhedron); Computer science; Mathematics; Geometry","score_opus":0.02496630554524978,"score_gpt":0.25208001702801275,"score_spread":0.22711371148276296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220966158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006110143,0.000438353,0.9839412,0.0026755354,0.0009687254,0.0005000433,0.000009825666,0.00020265598,0.011202557],"genre_scores_gemma":[0.26685187,0.00011321274,0.72779477,0.0039265137,0.00034240517,0.000018603558,0.000014569732,0.000050672064,0.0008873657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964024,0.000066238215,0.00060891634,0.0013565732,0.0009728971,0.0005930216],"domain_scores_gemma":[0.99736255,0.0005111086,0.00036354386,0.0010899962,0.0004169795,0.00025578894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012345535,0.0005835456,0.00049196207,0.0005223551,0.00044166425,0.0009799188,0.0019807017,0.00033033267,0.00003340648],"category_scores_gemma":[0.00022529559,0.0004365284,0.0000986474,0.0005146917,0.0014917912,0.00073719444,0.0010584091,0.0010039143,0.000017199243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049325035,0.0000117095,0.000040263432,0.00001687469,0.000013680095,0.000023427214,0.0018160562,0.20933846,0.000060540737,0.08038165,0.00021873588,0.7080737],"study_design_scores_gemma":[0.00028451052,0.00007220229,0.000037543003,0.00017390434,0.00000964323,0.0001606425,0.0000017509703,0.9008613,0.00006410347,0.09703717,0.0008263273,0.00047087483],"about_ca_topic_score_codex":0.000033222757,"about_ca_topic_score_gemma":0.0002484495,"teacher_disagreement_score":0.7076028,"about_ca_system_score_codex":0.00025303522,"about_ca_system_score_gemma":0.0010663085,"threshold_uncertainty_score":0.99980867},"labels":[],"label_agreement":null},{"id":"W2225793258","doi":"10.1522/030298395","title":"Qualitative spatial reasoning for activity recognition using tools of ambient intelligence /","year":2012,"lang":"en","type":"book","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cégep de Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Université du Québec à Chicoutimi","keywords":"Spatial intelligence; Ambient intelligence; Computer science; Qualitative reasoning; Artificial intelligence; Human–computer interaction","score_opus":0.16368904383896035,"score_gpt":0.3708452051883328,"score_spread":0.20715616134937245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225793258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015117243,0.000017697077,0.971495,0.00003436916,0.0005452236,0.00050578255,0.000060173967,0.000067543595,0.02712304],"genre_scores_gemma":[0.047331806,0.000038946284,0.9260291,0.0000849095,0.00027428643,0.0000451408,0.00016581398,0.00003571019,0.025994284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879867,0.000107979635,0.0003393058,0.0003232153,0.00024209767,0.00018875183],"domain_scores_gemma":[0.99831295,0.00050153356,0.0005070256,0.00024826452,0.00036342206,0.00006681802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005463045,0.00018508076,0.0002799277,0.00016927779,0.000083108236,0.00007545365,0.00020652948,0.00018100835,0.00015330272],"category_scores_gemma":[0.00019431565,0.00019069675,0.00013707658,0.000097196855,0.00006692063,0.00072077353,0.00009379872,0.00014765168,0.000012356559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025653868,0.000038139664,0.000004902018,0.00009379798,0.00004390962,2.8483714e-7,0.0029117048,0.000304785,0.00022541457,0.027050145,0.00022733943,0.96907395],"study_design_scores_gemma":[0.00074663316,0.0005220851,0.0002674944,0.0014805316,0.00023155831,0.000037594094,0.00086237054,0.8909532,0.04693367,0.050778244,0.0052518304,0.0019348048],"about_ca_topic_score_codex":0.000085761014,"about_ca_topic_score_gemma":0.00004845997,"teacher_disagreement_score":0.9671391,"about_ca_system_score_codex":0.00021649274,"about_ca_system_score_gemma":0.00034445268,"threshold_uncertainty_score":0.7776388},"labels":[],"label_agreement":null},{"id":"W2227333382","doi":"10.1609/socs.v1i1.18180","title":"Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Solver; Branch and bound; Pruning; Bounding overwatch; Mathematical optimization; Transformation (genetics); Computer science; Context (archaeology); Domain (mathematical analysis); Local search (optimization); Boolean satisfiability problem; Mathematics; Algorithm; Artificial intelligence; Boolean function","score_opus":0.01213545434067036,"score_gpt":0.2629143388659637,"score_spread":0.25077888452529334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227333382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60389614,0.000022321536,0.31476754,0.036239192,0.026331112,0.002964537,0.00011825935,0.00033708022,0.015323823],"genre_scores_gemma":[0.995061,0.000023867555,0.0043918383,0.00010108809,0.00029013152,0.000026783227,0.000014427515,0.000016831964,0.00007405379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803233,0.000021885544,0.0004123918,0.0003592004,0.00090458116,0.00026958183],"domain_scores_gemma":[0.9983595,0.0002854015,0.0001611301,0.00014352589,0.00094202464,0.00010842714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009977592,0.00016907498,0.00017429737,0.000110891444,0.00043151155,0.0004648263,0.0011225239,0.0001279557,0.000025482595],"category_scores_gemma":[0.00016547307,0.00014946422,0.000113945796,0.00031737995,0.00017891474,0.00064656255,0.00026931555,0.00039453595,0.0000025767022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105920626,0.0002168171,0.00096628576,0.000048730843,0.000051529503,5.4313727e-8,0.00062218064,0.0033206828,0.06847598,0.92151535,0.00083240564,0.0038440856],"study_design_scores_gemma":[0.005819885,0.00041321444,0.00081878825,0.0001181415,0.000030951192,0.000024313122,0.00011110513,0.73880225,0.22407348,0.024603147,0.004665529,0.00051921053],"about_ca_topic_score_codex":0.00003165333,"about_ca_topic_score_gemma":0.0000012246279,"teacher_disagreement_score":0.89691216,"about_ca_system_score_codex":0.0001084177,"about_ca_system_score_gemma":0.00009344498,"threshold_uncertainty_score":0.60949737},"labels":[],"label_agreement":null},{"id":"W2240863283","doi":"","title":"New Encoding for Translating Pseudo-Boolean Constraints into SAT.","year":2013,"lang":"en","type":"article","venue":"Symposium on Abstraction, Reformulation and Approximation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint (computer-aided design); Conjunctive normal form; Constraint satisfaction problem; Local consistency; Computer science; Benchmark (surveying); Boolean data type; Propositional calculus; Propositional formula; Set (abstract data type); Transformation (genetics); Boolean function; Propositional variable; Theoretical computer science; Algorithm; Mathematics; Programming language; Artificial intelligence","score_opus":0.012499912340134072,"score_gpt":0.24658291382864672,"score_spread":0.23408300148851266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240863283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021506172,0.0000057302695,0.9635247,0.0052792006,0.00036985145,0.0009729256,0.0000025243478,0.00030541467,0.008033492],"genre_scores_gemma":[0.86338484,0.000014204558,0.1358161,0.00022193954,0.00011944491,0.00006152051,0.00006438823,0.000014604648,0.00030294785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.000035018085,0.0005020507,0.00042305468,0.0002289709,0.00022735368],"domain_scores_gemma":[0.99901754,0.000119746095,0.00028138087,0.00022797269,0.00018858936,0.00016479507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027173344,0.00020660547,0.00016207992,0.00023727477,0.00042752392,0.00040498635,0.00012751069,0.00013848045,0.00013151279],"category_scores_gemma":[0.000052803185,0.00019446113,0.00007229551,0.00023127954,0.000039858398,0.002069647,0.000016943834,0.0001408464,0.000058791073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024755398,0.000056111752,0.00083068665,0.00009059781,0.000028365555,2.3120431e-7,0.0030602587,0.010410429,0.04812656,0.13099888,0.0003722988,0.8060008],"study_design_scores_gemma":[0.002074114,0.00019641206,0.025848042,0.00010122446,0.000022714577,0.000043762437,0.0005495947,0.9304955,0.010130805,0.02848372,0.0014426399,0.00061144744],"about_ca_topic_score_codex":0.00006502718,"about_ca_topic_score_gemma":0.000021351545,"teacher_disagreement_score":0.9200851,"about_ca_system_score_codex":0.00011996071,"about_ca_system_score_gemma":0.000078574376,"threshold_uncertainty_score":0.7929895},"labels":[],"label_agreement":null},{"id":"W2244307845","doi":"10.1109/ictai.2015.135","title":"RLBS: An Adaptive Backtracking Strategy Based on Reinforcement Learning for Combinatorial Optimization","year":2015,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Backtracking; Reinforcement learning; Computer science; Mathematical optimization; Iterative deepening depth-first search; Search tree; Combinatorial search; Search algorithm; Scheduling (production processes); Beam stack search; Beam search; Binary number; Combinatorial optimization; Artificial intelligence; Algorithm; Mathematics; Best-first search","score_opus":0.05122607948455666,"score_gpt":0.2803174550396211,"score_spread":0.22909137555506442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244307845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011316265,0.0000016536553,0.9859843,0.00017069488,0.00056925614,0.00032556182,3.9143578e-7,0.00023488086,0.01260007],"genre_scores_gemma":[0.8094997,9.3808234e-7,0.18999287,0.00021381135,0.00007179785,0.000023316341,0.000036843416,0.0000086383125,0.00015207929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899817,0.000075816344,0.00020112823,0.00027888277,0.00026964847,0.00017634509],"domain_scores_gemma":[0.9991829,0.00007892356,0.000104537095,0.0001991655,0.00029060277,0.00014391817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036377,0.00011719679,0.00010117272,0.00009105213,0.00014387393,0.00021455252,0.00018303217,0.00006339817,0.000070207505],"category_scores_gemma":[0.00008387487,0.00011445529,0.000036447596,0.00019337729,0.000017687951,0.0007387661,0.000023729108,0.00009218203,0.000009519216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005344883,0.000029652509,0.00003948277,0.0000016172587,0.0000033754907,4.4779796e-7,0.00009760082,0.9029486,0.0000046273435,0.08595472,0.00010631308,0.010760113],"study_design_scores_gemma":[0.0014517027,0.0012844488,0.000039688974,0.000009267948,0.0000037718094,8.141386e-7,0.0001730255,0.99580353,0.0002001293,0.00060218235,0.00028080764,0.00015062705],"about_ca_topic_score_codex":0.000016453796,"about_ca_topic_score_gemma":0.00000489535,"teacher_disagreement_score":0.80938655,"about_ca_system_score_codex":0.00010897301,"about_ca_system_score_gemma":0.00019404708,"threshold_uncertainty_score":0.4667351},"labels":[],"label_agreement":null},{"id":"W2250281898","doi":"","title":"Finding the most probable solution to a probabilistic temporal interval algebra network","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Implementation; Computer science; Theoretical computer science; Constraint satisfaction problem; Constraint programming; Domain (mathematical analysis); Constraint (computer-aided design); Constraint logic programming; Constraint satisfaction; Interval (graph theory); Binary number; Simplicity; Programming language; Algorithm; Mathematical optimization; Mathematics; Arithmetic; Artificial intelligence; Stochastic programming","score_opus":0.015177417123747084,"score_gpt":0.22880406446065146,"score_spread":0.21362664733690437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250281898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033637062,0.000009359559,0.98131406,0.0050986996,0.00034746807,0.00040522986,4.750663e-7,0.00022343763,0.009237582],"genre_scores_gemma":[0.8763188,4.7527635e-7,0.12090847,0.0007555271,0.00015036204,0.000038899303,0.0000060172515,0.000005575606,0.0018158582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.000050056315,0.00020383311,0.00024455527,0.00015942131,0.00024634728],"domain_scores_gemma":[0.99952686,0.000048311183,0.000054500913,0.00026241108,0.00006245443,0.00004547764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029017718,0.00009200296,0.000077547,0.00004385506,0.00025221822,0.00025821797,0.0002968154,0.00003278501,0.000075086384],"category_scores_gemma":[0.00003359865,0.00006522542,0.000033794055,0.00059138564,0.000029411127,0.00028634217,0.0001432039,0.00007614057,0.0000760561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000926547,0.000056412187,0.011023482,0.000010941054,0.0000104618985,0.0000034306452,0.00028395167,0.24088149,0.00011547494,0.6408719,0.06565773,0.041075494],"study_design_scores_gemma":[0.0002578322,0.000084999774,0.01910865,0.000039007617,0.0000071089416,0.000031829557,0.00002882052,0.9439433,0.00010106318,0.024921848,0.011204417,0.00027112835],"about_ca_topic_score_codex":0.00021579655,"about_ca_topic_score_gemma":0.0012971071,"teacher_disagreement_score":0.8729551,"about_ca_system_score_codex":0.00007205271,"about_ca_system_score_gemma":0.00006315068,"threshold_uncertainty_score":0.26598155},"labels":[],"label_agreement":null},{"id":"W2254552512","doi":"10.3233/kes-150323","title":"A family of honey-bee optimization algorithms for Max-CSPs","year":2016,"lang":"en","type":"article","venue":"International Journal of Knowledge-based and Intelligent Engineering Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematical optimization; Honey bee; Computer science; Process (computing); Constraint (computer-aided design); Algorithm; Constraint satisfaction problem; Mathematics; Artificial intelligence; Programming language","score_opus":0.01823865065051133,"score_gpt":0.2523864329864029,"score_spread":0.23414778233589156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254552512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017510932,0.0006951682,0.994259,0.0002756454,0.002766843,0.0001385952,0.000014708281,0.000030510919,0.00006843595],"genre_scores_gemma":[0.9266027,0.0001947315,0.072737224,0.000021630778,0.00031536454,0.000010800133,0.000002224618,0.000014518224,0.00010078743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988408,0.000027016093,0.00061124796,0.00014124591,0.0002641392,0.00011551423],"domain_scores_gemma":[0.9981378,0.00024443606,0.00034219795,0.00009418409,0.0010940667,0.000087369015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038261464,0.00012409907,0.00021002625,0.00043478093,0.000022192791,0.00007944991,0.00036806843,0.00005873282,0.0000079794745],"category_scores_gemma":[0.0001790414,0.00009249384,0.00011351224,0.00012799952,0.000026490687,0.00032909188,0.000032276632,0.00005697501,0.0000021464825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006913707,0.00011707961,0.0006117671,0.00012026716,0.00023831535,0.0000069207044,0.00033323126,0.84168345,0.014371857,0.01970281,0.00042475993,0.1223204],"study_design_scores_gemma":[0.0008755508,0.00017269903,0.00022722069,0.00062401267,0.000013282708,0.000057533558,0.000030712457,0.983646,0.009942469,0.000031057432,0.004241692,0.00013780636],"about_ca_topic_score_codex":0.0000036649358,"about_ca_topic_score_gemma":3.8311208e-7,"teacher_disagreement_score":0.9248516,"about_ca_system_score_codex":0.00010976584,"about_ca_system_score_gemma":0.000119966455,"threshold_uncertainty_score":0.37717894},"labels":[],"label_agreement":null},{"id":"W2259046930","doi":"","title":"Managing qualitative preferences and constraints in a dynamic environment","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Mathematical optimization; Set (abstract data type); Preference; Constraint (computer-aided design); Optimization problem; Constraint satisfaction problem; Pareto principle; Current (fluid); Work (physics); Dynamic problem; Artificial intelligence; Mathematics; Engineering","score_opus":0.07761106500187302,"score_gpt":0.3239963777134457,"score_spread":0.24638531271157266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259046930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033696152,0.0000113773995,0.9436737,0.011001692,0.00036216175,0.0003434465,0.0000063263187,0.00007281099,0.010832388],"genre_scores_gemma":[0.98500794,0.00018207952,0.014359382,0.00028278428,0.000013287309,0.000063975756,0.0000062667114,0.000005337765,0.00007895457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983425,0.00012573748,0.00048026018,0.00048675723,0.00034565773,0.00021909755],"domain_scores_gemma":[0.99929917,0.0001509586,0.00014271495,0.00019806223,0.000115217656,0.000093867326],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028761494,0.00017394764,0.00015802684,0.00031944484,0.00006456463,0.0003818624,0.00039056447,0.000057635043,0.0015342663],"category_scores_gemma":[0.00009423894,0.00017029337,0.000035697514,0.00013855803,0.00029677557,0.00062851503,0.00014116746,0.0002030302,0.00050596334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048873944,0.00005093255,0.00009087025,0.0000027474457,0.000009693288,0.0000046706596,0.0027564655,0.00077219284,0.0009080418,0.40653622,0.000006336935,0.58885694],"study_design_scores_gemma":[0.000057796802,0.0000760671,0.0041594133,0.00009100187,0.0000016884502,0.000011596405,0.0040271436,0.56390905,0.0022590144,0.4251333,0.000027169659,0.00024677525],"about_ca_topic_score_codex":0.0001416967,"about_ca_topic_score_gemma":0.000106666586,"teacher_disagreement_score":0.95131177,"about_ca_system_score_codex":0.00010806624,"about_ca_system_score_gemma":0.00005217178,"threshold_uncertainty_score":0.99937844},"labels":[],"label_agreement":null},{"id":"W2259386961","doi":"10.1007/978-3-642-40627-0_42","title":"Time-Table Extended-Edge-Finding for the Cumulative Constraint","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Constraint (computer-aided design); Table (database); Propagator; Task (project management); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Data mining; Geometry","score_opus":0.023322449762499652,"score_gpt":0.261160112566523,"score_spread":0.23783766280402335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259386961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007405672,0.0001810634,0.98887527,0.0014379352,0.0015315958,0.0010505969,0.000010675866,0.00015602821,0.0067494395],"genre_scores_gemma":[0.053124484,0.000068721456,0.93813366,0.0027002587,0.0006867475,0.00009101485,0.000015500395,0.000061034032,0.0051185656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972369,0.000028205723,0.00046709282,0.0010941053,0.0006044277,0.0005692886],"domain_scores_gemma":[0.9967013,0.0015186457,0.0003287192,0.00092763663,0.00039443813,0.000129237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007789511,0.0004246069,0.0003809972,0.0004426634,0.0005729524,0.0007851826,0.0018932709,0.00023732347,0.0002659003],"category_scores_gemma":[0.00016343442,0.00031962802,0.0001402134,0.0004489927,0.0011309305,0.00070761517,0.0005624743,0.0005239115,0.00012612653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023800644,0.000008628151,0.000003934645,0.000011342271,0.00001601478,0.0000040561185,0.00057482265,0.0873967,0.000057409383,0.048396584,0.00013974129,0.86338836],"study_design_scores_gemma":[0.00024692205,0.0000732268,0.000081286584,0.00013241086,0.000010500848,0.000045114906,7.6253366e-7,0.93312895,0.0003129058,0.06241237,0.003148837,0.00040671937],"about_ca_topic_score_codex":0.000012835773,"about_ca_topic_score_gemma":0.000020613877,"teacher_disagreement_score":0.8629817,"about_ca_system_score_codex":0.00026600892,"about_ca_system_score_gemma":0.0006032797,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W2262254779","doi":"","title":"Modeling, Global Constraints, and Decomposition","year":2013,"lang":"en","type":"article","venue":"Symposium on Abstraction, Reformulation and Approximation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Computer science; Constraint (computer-aided design); Mathematical optimization; Decomposition; Constraint satisfaction problem; Solver; Theoretical computer science; Local consistency; Concurrent constraint logic programming; Combinatorial optimization; Constraint logic programming; Constraint satisfaction; Mathematics; Artificial intelligence; Algorithm; Programming language; Stochastic programming","score_opus":0.009107650882841841,"score_gpt":0.24771174964520062,"score_spread":0.23860409876235877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262254779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23179407,0.000012118841,0.7566571,0.0029188462,0.00020802961,0.00047748905,0.000003899549,0.00026363932,0.0076648006],"genre_scores_gemma":[0.98217505,0.0000689544,0.017285924,0.00028969295,0.000043078726,0.00003506007,0.00004735228,0.000006732408,0.000048136557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998866,0.000042235657,0.0003519589,0.00036980314,0.00020137096,0.00016863624],"domain_scores_gemma":[0.99934745,0.000024292889,0.00013581802,0.00019067917,0.00017148985,0.00013025418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016129535,0.00017055462,0.000122654,0.00012444967,0.00029349685,0.00039817052,0.00007605788,0.000118589865,0.00006746987],"category_scores_gemma":[0.000015846608,0.00015762827,0.00003089867,0.00019064582,0.000057401972,0.0018950766,0.000030595485,0.00010949516,0.000054875127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030314619,0.00016823244,0.0038882762,0.00007610824,0.000039229417,9.251019e-7,0.0006781284,0.08703083,0.0062967828,0.4451485,0.00014845691,0.4564942],"study_design_scores_gemma":[0.0004911028,0.00005380585,0.03773259,0.000022208145,0.0000063920706,0.00006618529,0.00007910512,0.95193785,0.000268848,0.009074261,0.00007766865,0.00018998052],"about_ca_topic_score_codex":0.00006984662,"about_ca_topic_score_gemma":0.000011223946,"teacher_disagreement_score":0.864907,"about_ca_system_score_codex":0.00011423326,"about_ca_system_score_gemma":0.000028783717,"threshold_uncertainty_score":0.6427894},"labels":[],"label_agreement":null},{"id":"W2263762061","doi":"","title":"Algorithmes pour la prise de decision distribuee en contexte hierarchique","year":2009,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Computer science; Supply chain; Heuristic; Context (archaeology); Scheduling (production processes); Job shop scheduling; A priori and a posteriori; Mathematical optimization; Operations research; Artificial intelligence; Mathematics; Schedule","score_opus":0.008874412735650709,"score_gpt":0.24368106465915743,"score_spread":0.23480665192350672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263762061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008316374,0.0037733857,0.9235094,0.06058818,0.00046238737,0.00076919945,0.00009479284,0.00083474605,0.0016515254],"genre_scores_gemma":[0.31188947,0.0018843898,0.67437595,0.0057517327,0.00033353805,0.00009971905,0.000029042654,0.000050453666,0.005585741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956167,0.0009672948,0.0008190629,0.0008568827,0.0005563858,0.0011837228],"domain_scores_gemma":[0.99634904,0.0010619803,0.00035470192,0.001100662,0.00038017193,0.00075345766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019213335,0.0005883846,0.00053645024,0.000492157,0.00044658373,0.00097399805,0.0010701088,0.0007381415,0.00016682051],"category_scores_gemma":[0.001261827,0.0006611661,0.00033975847,0.00091996236,0.00023126665,0.0012382953,0.00029181305,0.0010277596,0.000074615025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065667315,0.00033974313,0.004121766,0.000018773073,0.000033741882,0.00025441305,0.00084116415,0.006053372,0.0013381869,0.17899683,0.008842893,0.7990934],"study_design_scores_gemma":[0.0011464955,0.00024666707,0.14873289,0.00034051773,0.000051570805,0.0012621183,0.00008237651,0.76285017,0.002907268,0.04752711,0.034080777,0.00077204034],"about_ca_topic_score_codex":0.0043940633,"about_ca_topic_score_gemma":0.0012943823,"teacher_disagreement_score":0.7983214,"about_ca_system_score_codex":0.0011370977,"about_ca_system_score_gemma":0.0013610482,"threshold_uncertainty_score":0.99958396},"labels":[],"label_agreement":null},{"id":"W2265246327","doi":"","title":"On the empirical time complexity of random 3-SAT at the phase transition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; DPLL algorithm; Scaling; Exponential function; Context (archaeology); Computer science; Boolean satisfiability problem; Solver; Time complexity; Constant (computer programming); Function (biology); Algorithm; Mathematics; Theoretical computer science; Mathematical optimization; Jitter","score_opus":0.3905235528133467,"score_gpt":0.397099776394029,"score_spread":0.006576223580682272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265246327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06834313,0.0000052602572,0.8633815,0.053611632,0.0007468738,0.00031562246,0.00003756429,0.00006861489,0.013489786],"genre_scores_gemma":[0.99758357,0.0000069005923,0.0006304573,0.0014663766,0.000059802467,0.000016556622,0.000023946432,0.000004800297,0.00020759841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983341,0.00021517402,0.0003912608,0.0002799604,0.00063861796,0.00014088888],"domain_scores_gemma":[0.99854356,0.00043636077,0.000161205,0.00035490462,0.00042602594,0.000077933706],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060532254,0.00013600306,0.0001353419,0.000088353554,0.00015708421,0.00015132557,0.00079191936,0.00004923665,0.0018096351],"category_scores_gemma":[0.0003145398,0.00008447043,0.00009082298,0.00022084886,0.0004316933,0.00018094966,0.00008728573,0.0001836602,0.00085781195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004307224,0.0002119581,0.000008897613,0.0000011113725,0.000023146042,0.0000030671458,0.0019203828,0.006158304,0.0014212149,0.9505467,0.0013659223,0.037908603],"study_design_scores_gemma":[0.00021377325,0.00021826958,0.000042035343,0.000028231045,0.000005146046,0.000009786028,0.00021696671,0.810227,0.024628347,0.16381851,0.00047465155,0.00011732139],"about_ca_topic_score_codex":0.000023457715,"about_ca_topic_score_gemma":0.000051945775,"teacher_disagreement_score":0.9292404,"about_ca_system_score_codex":0.000103710845,"about_ca_system_score_gemma":0.0001166683,"threshold_uncertainty_score":0.9999201},"labels":[],"label_agreement":null},{"id":"W2267545879","doi":"10.1609/aimag.v38i2.2722","title":"The ICON Challenge on Algorithm Selection","year":2017,"lang":"en","type":"article","venue":"AI Magazine","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Icon; Selection (genetic algorithm); Variety (cybernetics); Relevance (law); Computer science; Machine learning; Algorithm; Selection algorithm; Artificial intelligence; Data mining","score_opus":0.0139382738647652,"score_gpt":0.26708353586962136,"score_spread":0.25314526200485615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267545879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002987563,0.00002447084,0.91607845,0.039169304,0.001092395,0.00014266545,0.0000010456963,0.0001790967,0.04301379],"genre_scores_gemma":[0.9650745,0.00039136873,0.023839887,0.001579621,0.0004048925,0.000027916692,0.000003328559,0.000015131559,0.008663399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945825,0.000023355351,0.000086498694,0.00017057704,0.00013367535,0.00012762872],"domain_scores_gemma":[0.9993279,0.00003690936,0.00007870129,0.00045453434,0.000065361084,0.000036596117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014351256,0.00006683137,0.000050377235,0.00002916018,0.00080079277,0.00040870626,0.00037646966,0.00003191673,0.000032534994],"category_scores_gemma":[0.000047342477,0.000048664286,0.000027512557,0.00004676032,0.000043791635,0.00035432001,0.00006830418,0.00010538841,0.00033978198],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018970971,0.000015626747,0.000089680456,6.927804e-7,0.0000049998794,0.0000015575612,0.000033302582,0.000041676514,0.000041832896,0.053258255,0.0030681957,0.9434423],"study_design_scores_gemma":[0.0006141738,0.0002678961,0.058801517,0.000015435447,0.000005048019,0.000024389552,0.000006176174,0.6915416,0.0005710827,0.0058706705,0.24206577,0.00021620859],"about_ca_topic_score_codex":0.000007485938,"about_ca_topic_score_gemma":0.00007151046,"teacher_disagreement_score":0.9647757,"about_ca_system_score_codex":0.000023796314,"about_ca_system_score_gemma":0.000024120318,"threshold_uncertainty_score":0.61591315},"labels":[],"label_agreement":null},{"id":"W2271441614","doi":"10.1080/03155986.2001.11732431","title":"An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Waseda University","keywords":"Tabu search; Guided Local Search; Constraint satisfaction problem; Constraint (computer-aided design); Mathematical optimization; Constraint satisfaction; Constraint satisfaction dual problem; Computer science; Local consistency; Mathematics; Artificial intelligence","score_opus":0.04851963617864127,"score_gpt":0.36324750177105053,"score_spread":0.3147278655924093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271441614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001641857,0.0000428028,0.99150336,0.0022107076,0.000213788,0.0019154081,0.000035260793,0.00008731145,0.0023495175],"genre_scores_gemma":[0.87213314,0.0001655287,0.12565304,0.00049309694,0.00019823348,0.0008198494,0.00014681654,0.000010064764,0.00038022417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789685,0.00021121235,0.00057552545,0.00020421958,0.00077091233,0.0003412526],"domain_scores_gemma":[0.9969321,0.00070743915,0.00010030646,0.00032647292,0.0017764367,0.00015727153],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003973612,0.00013050376,0.00013560141,0.00036325023,0.001200108,0.0021503877,0.00031856075,0.00011238516,0.00004875396],"category_scores_gemma":[0.00012614153,0.000093102615,0.000040042818,0.0005662961,0.000114956914,0.004675879,0.00007784828,0.00026622397,0.000032957352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054669235,0.00001437921,0.0011398792,0.00005234531,0.000035213267,3.5593695e-7,0.0021264304,0.015406099,0.00043408578,0.53022164,0.00076867896,0.44974622],"study_design_scores_gemma":[0.0006145681,0.00013780517,0.0046994807,0.00001499144,0.0000026026964,0.000089239795,0.0014749774,0.9434468,0.00008854058,0.00024437654,0.049064144,0.00012246578],"about_ca_topic_score_codex":0.0008326783,"about_ca_topic_score_gemma":0.000108164415,"teacher_disagreement_score":0.9280407,"about_ca_system_score_codex":0.00011521887,"about_ca_system_score_gemma":0.00045835404,"threshold_uncertainty_score":0.99888545},"labels":[],"label_agreement":null},{"id":"W2287187553","doi":"10.1016/j.ijar.2011.06.007","title":"Special section – Uncertain reasoning track FLAIRS 2009","year":2011,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Section (typography); Track (disk drive); Computer science; Special section; Artificial intelligence; Computer vision; Engineering; Engineering physics","score_opus":0.021210560415313145,"score_gpt":0.2550463360600741,"score_spread":0.23383577564476096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287187553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030639438,0.000063604195,0.9088665,0.00041974668,0.010048712,0.00010343337,0.0000038129904,0.00010282769,0.049751926],"genre_scores_gemma":[0.5059019,0.00018816923,0.48525408,0.00020585136,0.008148235,0.000004145126,0.000006518931,0.000025644196,0.00026545665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838454,0.00007323068,0.0005306999,0.00020422849,0.00060772797,0.00019958544],"domain_scores_gemma":[0.9984384,0.00004610512,0.00063189596,0.0001479328,0.00061715813,0.000118513206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060566136,0.00014579826,0.00018122584,0.00035544712,0.000098621196,0.0002206505,0.00070254755,0.00007827207,0.00031063356],"category_scores_gemma":[0.00019246849,0.00013806793,0.0001489206,0.00024309076,0.00004287801,0.0013759255,0.00008371687,0.00028651868,0.000015133022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054934697,0.00049221545,0.018767308,0.000025338515,0.00069328595,0.000952714,0.014410363,0.008301269,0.001642721,0.26408547,0.0100273425,0.68005264],"study_design_scores_gemma":[0.009938001,0.0013083665,0.11187489,0.0024483646,0.00020636235,0.022071367,0.0043928693,0.7339751,0.023532037,0.021180777,0.06645976,0.00261206],"about_ca_topic_score_codex":0.000031006322,"about_ca_topic_score_gemma":0.000010332645,"teacher_disagreement_score":0.72567385,"about_ca_system_score_codex":0.00019193234,"about_ca_system_score_gemma":0.00015278316,"threshold_uncertainty_score":0.5630247},"labels":[],"label_agreement":null},{"id":"W2289296210","doi":"10.1287/ijoc.2015.0664","title":"Modeling with Metaconstraints and Semantic Typing of Variables","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Computer science; Exploit; Solver; Computation; Predicate (mathematical logic); Theoretical computer science; Variety (cybernetics); Algorithm; Artificial intelligence; Programming language","score_opus":0.014666814800067459,"score_gpt":0.2303182043340496,"score_spread":0.21565138953398214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289296210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14204714,0.000010766996,0.8566124,0.00024066273,0.00010928696,0.000035186513,2.424705e-7,0.000028689059,0.0009156462],"genre_scores_gemma":[0.9115195,0.000019056179,0.08832409,0.00009726555,0.000028871013,1.2821847e-7,6.474521e-8,0.0000035278188,0.000007447775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926645,0.000017011473,0.00030184965,0.0001042541,0.0001600803,0.00015033716],"domain_scores_gemma":[0.9993978,0.000110602814,0.00018275926,0.00010394733,0.00013138325,0.00007347635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040886248,0.000086140164,0.00013713332,0.00016311574,0.00013795997,0.00011495139,0.00015022115,0.000027302825,0.000010376177],"category_scores_gemma":[0.000053629,0.000047817866,0.000027390917,0.00013936209,0.00003884896,0.0006021897,0.000055252516,0.00010455074,0.0000023683735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001519915,0.0000114458735,0.0020592452,0.000013810733,0.000051880175,0.000007901034,0.00044912598,0.13016728,0.00040569346,0.049575012,0.0000037329685,0.81723964],"study_design_scores_gemma":[0.000615292,0.000100070625,0.0009000421,0.0004711937,0.0000064673704,0.00059681037,0.00005676261,0.9956196,0.00027429918,0.0012244581,0.000024274083,0.000110754525],"about_ca_topic_score_codex":0.0000027892527,"about_ca_topic_score_gemma":0.0000013223577,"teacher_disagreement_score":0.8654523,"about_ca_system_score_codex":0.000023292952,"about_ca_system_score_gemma":0.00007632333,"threshold_uncertainty_score":0.1949956},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.016166400033941094,"score_gpt":0.2481487157063605,"score_spread":0.2319823156724194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292954498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062821787,0.000021611371,0.9880998,0.0046733287,0.00021636192,0.00037481906,0.000003566111,0.00031005713,0.000018250506],"genre_scores_gemma":[0.61104596,0.000011981883,0.38833028,0.0004918389,0.000037962232,0.000059204962,0.0000023068492,0.0000070190904,0.000013450525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992736,0.000023164086,0.00019610689,0.00024640266,0.00009547103,0.00016523115],"domain_scores_gemma":[0.9995391,0.0001278595,0.00010128909,0.00011965351,0.000050141698,0.0000619874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017163994,0.00011070253,0.00011211569,0.00010630021,0.0001338365,0.00018775537,0.00008100375,0.000049167,0.0000017182858],"category_scores_gemma":[0.00002109604,0.00008574772,0.000028655631,0.00007625024,0.000093386254,0.0003742772,0.000026253798,0.0000416477,0.000001250013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035647586,0.000017788148,0.000873252,0.00004241603,0.00002282807,0.0000034840803,0.00039900566,0.01420589,0.040052056,0.01408275,0.0006767472,0.9296202],"study_design_scores_gemma":[0.0012472502,0.00023390287,0.0031520335,0.00041861343,0.00003399717,0.0001383933,0.00018287534,0.968584,0.018300774,0.0010143089,0.0059755915,0.0007182563],"about_ca_topic_score_codex":0.0000019396957,"about_ca_topic_score_gemma":0.0000010360345,"teacher_disagreement_score":0.9543781,"about_ca_system_score_codex":0.00002615921,"about_ca_system_score_gemma":0.000017469883,"threshold_uncertainty_score":0.34966907},"labels":[],"label_agreement":null},{"id":"W2293089674","doi":"10.1109/time.2008.9","title":"Moving Spaces","year":2008,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Representation (politics); Representation theorem; Topological space; Space (punctuation); Algebra over a field; Computer science; Mathematics; Pure mathematics","score_opus":0.017091347122514165,"score_gpt":0.21916448699905222,"score_spread":0.20207313987653805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293089674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008627893,0.000005825013,0.9368785,0.00089115073,0.00009592298,0.000016859136,3.2947774e-8,0.00016381756,0.053320013],"genre_scores_gemma":[0.8460926,0.000011255485,0.15158653,0.00029757898,0.000010885258,6.727316e-7,1.4033766e-7,8.940021e-7,0.0019994623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977565,0.0000057244897,0.000038427286,0.000072322,0.000058043173,0.000049813345],"domain_scores_gemma":[0.9998475,0.000011485719,0.000010384127,0.00009280708,0.000015229298,0.000022644863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000021821912,0.000023030807,0.000022683673,0.000028699927,0.00006784905,0.000026265327,0.00008429155,0.000009524016,0.00015499826],"category_scores_gemma":[0.000007552341,0.000020065796,0.000011027523,0.00009723319,0.000012287156,0.00023779277,0.000026148506,0.00001793148,0.000080500264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012171399,0.00003258311,0.051869594,0.0000031969053,0.000009598114,0.00003771018,0.0017558096,0.00348303,0.00084503554,0.67707956,0.011718879,0.2531638],"study_design_scores_gemma":[0.000431791,0.000038121765,0.17372197,0.0000057685247,0.0000014762855,0.00035003218,0.00009107158,0.7920109,0.0039806217,0.0018562056,0.027174914,0.00033714526],"about_ca_topic_score_codex":0.000010317781,"about_ca_topic_score_gemma":0.000005114922,"teacher_disagreement_score":0.8374647,"about_ca_system_score_codex":0.00000545928,"about_ca_system_score_gemma":0.000017560775,"threshold_uncertainty_score":0.16971223},"labels":[],"label_agreement":null},{"id":"W2293473511","doi":"","title":"Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Algorithm; Local search (optimization); Local consistency; Substructure; Computer science; Consistency (knowledge bases); Filter (signal processing); Search algorithm; Graph; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Mathematical optimization; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.049922239491426636,"score_gpt":0.28362049259754557,"score_spread":0.23369825310611894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293473511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028724553,0.000058773283,0.96677,0.0022573501,0.00039259857,0.0009675202,0.000042879143,0.00067871046,0.0001076242],"genre_scores_gemma":[0.4310302,0.000026274263,0.56656563,0.0018579614,0.00011224717,0.000072907336,0.000009763051,0.000031586842,0.00029343422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976414,0.000084987405,0.00045324236,0.0006205541,0.00041519862,0.0007846312],"domain_scores_gemma":[0.998438,0.000119760945,0.00011124646,0.0006710581,0.00020156578,0.00045836892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005008205,0.0002950347,0.00032253022,0.0005505038,0.00048771256,0.00021117671,0.0006685426,0.00016012315,0.00004747352],"category_scores_gemma":[0.00010785445,0.00033010694,0.00016511335,0.0006310496,0.00024123766,0.0007969938,0.0003043233,0.00026408955,0.000024289187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001365243,0.00022820395,0.0053689405,0.000074828946,0.000116038296,0.00024053629,0.0023669095,0.29476714,0.052857824,0.08428056,0.0034584221,0.55610406],"study_design_scores_gemma":[0.0006334036,0.000111004854,0.0040867887,0.00003328616,0.000008311824,0.0007623249,0.00009372911,0.9656985,0.02707766,0.0004314754,0.00064331543,0.00042021828],"about_ca_topic_score_codex":0.0010541691,"about_ca_topic_score_gemma":0.00011499095,"teacher_disagreement_score":0.67093134,"about_ca_system_score_codex":0.0004904872,"about_ca_system_score_gemma":0.00043020459,"threshold_uncertainty_score":0.9999151},"labels":[],"label_agreement":null},{"id":"W2295801280","doi":"10.1007/s00012-024-00865-5","title":"Graphs of finite algebras: edges, and connectivity","year":2024,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semilattice; Mathematics; Reduct; Idempotence; Graph; Affine transformation; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.009650576863395122,"score_gpt":0.21074432687725234,"score_spread":0.2010937500138572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295801280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12186952,0.0006622859,0.8678409,0.0015919919,0.00056759134,0.00013925161,0.00001662943,0.0004069042,0.0069049303],"genre_scores_gemma":[0.9956461,0.00016086627,0.003965049,0.0000713073,0.000010269115,8.612652e-7,0.000003905425,0.0000050338267,0.00013659344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.00004010391,0.000099677636,0.0002301237,0.00010251103,0.000098431665],"domain_scores_gemma":[0.999473,0.0002159183,0.00003046665,0.00018253218,0.000043476804,0.000054603315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010326456,0.00007837795,0.000094896866,0.00020619894,0.000047791804,0.00008071988,0.00014113725,0.000043597018,0.00007501985],"category_scores_gemma":[0.000031462856,0.00007914024,0.00004266724,0.0004833482,0.00008824647,0.0006029826,0.00008003563,0.000071880975,0.000008862324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023369062,0.00001041131,0.0010285415,0.000026620339,0.000035959973,0.000017578557,0.00084312,0.000059094073,0.00034761734,0.9027522,0.00042978965,0.09444673],"study_design_scores_gemma":[0.002438998,0.00058228493,0.111521,0.00053600624,0.00020931385,0.00022226514,0.0014142909,0.5399835,0.020468336,0.2514804,0.06940684,0.0017367676],"about_ca_topic_score_codex":0.00006670272,"about_ca_topic_score_gemma":0.000036281905,"teacher_disagreement_score":0.8737766,"about_ca_system_score_codex":0.00001715373,"about_ca_system_score_gemma":0.000057813435,"threshold_uncertainty_score":0.32272455},"labels":[],"label_agreement":null},{"id":"W2296186174","doi":"10.48550/arxiv.1512.06657","title":"Inside the clustering window for random linear equations","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Cluster analysis; Mathematics; Cluster (spacecraft); Partition (number theory); Infinity; Combinatorics; Random variable; Statistical physics; Random graph; Discrete mathematics; Physics; Mathematical analysis; Computer science; Statistics; Graph","score_opus":0.12017429466191945,"score_gpt":0.21519735301284973,"score_spread":0.09502305835093028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296186174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029284873,0.00001943257,0.99309987,0.00059983955,0.00078614417,0.0006100939,0.000015810627,0.00017877038,0.0017615376],"genre_scores_gemma":[0.9881387,0.000037068698,0.010637734,0.00017802171,0.0001061863,0.000004252979,0.000025491567,0.000010818871,0.0008617439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898165,0.00010432118,0.00016475796,0.00049368374,0.000071212606,0.00018434436],"domain_scores_gemma":[0.998423,0.00031519594,0.00018496947,0.00069638825,0.0002855716,0.00009488021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037803434,0.00016875817,0.0001808625,0.00014149047,0.0002460877,0.00013121897,0.0008020156,0.00014346298,0.00001612124],"category_scores_gemma":[0.00015579315,0.00015705994,0.00015351416,0.00029658736,0.000072165,0.0002852503,0.00075765996,0.00026929806,0.000027549955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027434671,0.000013150399,0.000124617,0.000014071514,0.000036068417,0.0000059369945,0.00028978102,0.9561636,0.000005016895,0.040802732,0.00021693796,0.0023006608],"study_design_scores_gemma":[0.0010732727,0.000017410364,0.00013258439,0.00002450116,0.000039633473,0.00000230287,0.00007044169,0.9819205,0.000015485408,0.01535609,0.0011648304,0.00018298578],"about_ca_topic_score_codex":0.00005902284,"about_ca_topic_score_gemma":0.00020394288,"teacher_disagreement_score":0.9852102,"about_ca_system_score_codex":0.00013928999,"about_ca_system_score_gemma":0.00030816055,"threshold_uncertainty_score":0.6404719},"labels":[],"label_agreement":null},{"id":"W2312211582","doi":"10.1061/40513(279)23","title":"Geometrical Reasoning and the Conceptual Design of Building Structures","year":2000,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Conceptual design; Design language; Architecture; Spatial intelligence; Software engineering; Visual reasoning; Human–computer interaction; Software; Building design; Systems engineering; Architectural engineering; Artificial intelligence; Programming language; Engineering","score_opus":0.014524003332997271,"score_gpt":0.23251198316299068,"score_spread":0.2179879798299934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312211582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011794621,0.00006974182,0.9859975,0.00025513058,0.000027139537,0.00006618328,1.502912e-7,0.000031908494,0.0017575985],"genre_scores_gemma":[0.7752167,0.000029208413,0.2245493,0.00011166643,0.000007058982,8.8048637e-7,7.644075e-8,9.98875e-7,0.00008410465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995956,0.000059921047,0.00009281018,0.00009431292,0.00009497293,0.00006241062],"domain_scores_gemma":[0.99959594,0.00024024726,0.000025330673,0.00009580787,0.00002036014,0.000022322462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017152984,0.000037504655,0.00006491061,0.000044498574,0.00006135801,0.00004507876,0.00011747945,0.000018806597,0.00036271592],"category_scores_gemma":[0.000062604835,0.000022899847,0.000013853555,0.00025156696,0.00015516303,0.00012330659,0.000024043426,0.00004031712,9.98719e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012377869,0.0000022079766,0.0002922385,6.781971e-7,0.0000061677283,3.8734606e-7,0.00047842797,0.017456904,0.000055732246,0.6786119,0.000080485974,0.3030025],"study_design_scores_gemma":[0.000988817,0.000031046333,0.0074125794,0.000005174904,0.000005230162,0.000034288158,0.000099540695,0.98380256,0.00094672915,0.0062796394,0.00030850942,0.00008587022],"about_ca_topic_score_codex":0.000020793634,"about_ca_topic_score_gemma":4.666417e-7,"teacher_disagreement_score":0.96634567,"about_ca_system_score_codex":0.0000044651492,"about_ca_system_score_gemma":0.000014548556,"threshold_uncertainty_score":0.3971485},"labels":[],"label_agreement":null},{"id":"W2316544729","doi":"10.7939/r3-bvfe-3v82","title":"Phase transitions and typical-case complexity: easy (hard) aspects of hard (easy) problems","year":2005,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint satisfaction problem; Random graph; Treewidth; Mathematics; Computer science; Theoretical computer science; Algorithm; Graph; Probabilistic logic; Artificial intelligence","score_opus":0.021511376231509238,"score_gpt":0.20477951837293382,"score_spread":0.1832681421414246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316544729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5647972,0.0001046455,0.3582378,0.014485401,0.00009911543,0.0004440452,0.000048125978,0.00019362579,0.061589994],"genre_scores_gemma":[0.9097866,0.0000390553,0.08877884,0.00013338275,0.000012868402,1.0095407e-7,0.000019390049,0.000004712505,0.0012250523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947,0.000042033145,0.00011687278,0.0001881624,0.000086216205,0.00009674218],"domain_scores_gemma":[0.99954,0.00006217241,0.00007755875,0.0001909353,0.00002722252,0.00010215239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000027259002,0.0000770445,0.00013671213,0.00012873698,0.000107518936,0.000023686702,0.00016951824,0.00004540034,0.00056606566],"category_scores_gemma":[0.000005240943,0.00009170585,0.00005617313,0.00021534749,0.00017930841,0.0012806738,0.00007534542,0.00006829211,0.000009508351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002289917,0.0015256093,0.0030602894,0.00018032717,0.0001905456,0.00025432504,0.014155757,0.0018918901,0.0013215927,0.89035994,0.00341912,0.0834116],"study_design_scores_gemma":[0.019534128,0.0014529295,0.036826644,0.00039544664,0.00025675452,0.0020429469,0.002109673,0.7700295,0.0056214356,0.013332789,0.14690147,0.0014962741],"about_ca_topic_score_codex":0.000101888785,"about_ca_topic_score_gemma":0.00021948708,"teacher_disagreement_score":0.87702715,"about_ca_system_score_codex":0.000008155734,"about_ca_system_score_gemma":0.00006853349,"threshold_uncertainty_score":0.61980224},"labels":[],"label_agreement":null},{"id":"W2322966705","doi":"10.20381/ruor-19599","title":"Automatically generated lower bounds for search","year":2004,"lang":"en","type":"dissertation","venue":"uO Research (University of Ottawa)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Heuristic; Computer science; Upper and lower bounds; Simple (philosophy); Travelling salesman problem; Macro; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04041851152014229,"score_gpt":0.31641918052982937,"score_spread":0.27600066900968706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322966705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041413233,0.000044474873,0.8748633,0.0026334734,0.0009152611,0.0017470649,0.00008462665,0.0003431715,0.077955365],"genre_scores_gemma":[0.3888195,0.0003275227,0.4330398,0.00007704991,0.00019832222,0.000011840606,0.0019348348,0.00009404897,0.17549708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977837,0.00015407272,0.00018134496,0.00048754137,0.0009545336,0.00043878425],"domain_scores_gemma":[0.9975504,0.00019354602,0.00010329221,0.0004589469,0.0015105372,0.00018324965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008953473,0.00015188333,0.00025802624,0.0008405631,0.0005684348,0.00015196769,0.0010913211,0.00029820987,0.0004237579],"category_scores_gemma":[0.00012910529,0.00019209347,0.00015877461,0.00095468375,0.00017774668,0.00042673206,0.00011730485,0.00045166689,0.00007659014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084030726,0.0005590073,0.0006361244,0.00127148,0.00034648567,0.00014771766,0.0057692477,0.0032106559,0.004265079,0.79794437,0.017636247,0.16812953],"study_design_scores_gemma":[0.008658694,0.0027495779,0.08292664,0.001087536,0.00014312282,0.000032637705,0.008644336,0.76224566,0.0063727926,0.017883334,0.10690791,0.0023477955],"about_ca_topic_score_codex":0.000105103885,"about_ca_topic_score_gemma":0.0014373587,"teacher_disagreement_score":0.78006107,"about_ca_system_score_codex":0.0002879585,"about_ca_system_score_gemma":0.0015260255,"threshold_uncertainty_score":0.78333443},"labels":[],"label_agreement":null},{"id":"W2336995775","doi":"10.58079/oux4","title":"What happens if we forget a trivial assumption ?","year":2014,"lang":"en","type":"article","venue":"OpenEdition (OpenEdition)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; AXA Research Fund","keywords":"Series (stratigraphy); Mathematics; Quadratic equation; Root (linguistics); Mathematical economics; Calculus (dental); Philosophy; Linguistics; Geometry","score_opus":0.015795018938460373,"score_gpt":0.24049047391909611,"score_spread":0.22469545498063576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336995775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010627444,0.00005559259,0.91685873,0.06583469,0.0053327843,0.0005814617,0.000024544253,0.00046960835,0.009779844],"genre_scores_gemma":[0.9306878,0.00079209765,0.036521684,0.026863156,0.0012165067,0.00032143056,0.0007706226,0.000048609767,0.0027781131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971731,0.0002872966,0.0006005859,0.000762835,0.00071511214,0.0004611266],"domain_scores_gemma":[0.99813217,0.00020589617,0.00033899894,0.0007198141,0.0003190264,0.00028410435],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication","insufficient_payload"],"category_scores_codex":[0.00075350347,0.00032864726,0.00032995056,0.0003279662,0.00056898396,0.0014581175,0.0006906498,0.0002044431,0.0011878128],"category_scores_gemma":[0.00015193336,0.00034416228,0.00017360784,0.00058145984,0.00010974187,0.035889495,0.00021297086,0.0002621456,0.0016564602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037732232,0.0001721782,0.00013033253,0.000031651532,0.00003598563,0.0000099334875,0.0002346022,0.0015890562,0.00047589088,0.7633452,0.01288503,0.22105244],"study_design_scores_gemma":[0.0056132893,0.0007119559,0.04164883,0.00055412366,0.0000928883,0.00028820775,0.0003893617,0.21613371,0.006268663,0.04629776,0.6800287,0.0019725182],"about_ca_topic_score_codex":0.000013026949,"about_ca_topic_score_gemma":0.00039155417,"teacher_disagreement_score":0.92962503,"about_ca_system_score_codex":0.00014336455,"about_ca_system_score_gemma":0.00011373385,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W2396141326","doi":"10.3166/ria.30.11-33","title":"Gestion des réseaux temporels simples multi-agents dynamiques","year":2016,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Computer science; Philosophy","score_opus":0.10897645474854768,"score_gpt":0.3120747472535416,"score_spread":0.20309829250499395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396141326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004043438,0.0021101143,0.97488236,0.014417826,0.0019631058,0.0003832432,0.00003399176,0.00025410985,0.0019117929],"genre_scores_gemma":[0.88811225,0.006259655,0.06480279,0.00024860288,0.00020229266,0.00003349801,0.000009631306,0.00003946387,0.040291812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972917,0.00027616014,0.0007594043,0.0007713795,0.00025866396,0.0006427091],"domain_scores_gemma":[0.99790716,0.00042386435,0.00025269092,0.000705985,0.0004303094,0.00028000667],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00063001516,0.00033173474,0.0002790891,0.00020504041,0.00041460362,0.00030193228,0.0005617081,0.0002533006,0.0024535134],"category_scores_gemma":[0.00058462756,0.00028932552,0.0001832229,0.00064368546,0.0006520759,0.001344129,0.0002097057,0.00020259173,0.0023841253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009346487,0.00021409614,0.0031278313,0.00009979427,0.000026046006,0.000031232637,0.0019709805,0.019111348,0.002159964,0.049312804,0.001080851,0.92285573],"study_design_scores_gemma":[0.00012480015,0.00014697116,0.004283165,0.001222057,0.000025486801,0.00011895229,0.0003553872,0.9403246,0.023410125,0.008681026,0.02079692,0.0005105072],"about_ca_topic_score_codex":0.00035418142,"about_ca_topic_score_gemma":0.00041183186,"teacher_disagreement_score":0.9223452,"about_ca_system_score_codex":0.0003129833,"about_ca_system_score_gemma":0.00016564774,"threshold_uncertainty_score":0.9999559},"labels":[],"label_agreement":null},{"id":"W2396409565","doi":"","title":"A Method of Virtual Camera Selection Using Soft Constraints.","year":2011,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Constraint (computer-aided design); ENCODE; Software; Virtual machine; Computation; Perspective (graphical); Code (set theory); Adaptation (eye); Selection (genetic algorithm); Artificial intelligence; Computer vision; Human–computer interaction; Algorithm; Programming language; Engineering","score_opus":0.12383346728190261,"score_gpt":0.3838814007859753,"score_spread":0.26004793350407274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396409565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009457853,0.000014319392,0.98846644,0.00046344762,0.00019010786,0.00022970258,0.0000032837343,0.0000762596,0.0010985663],"genre_scores_gemma":[0.6969489,0.000031249223,0.30247855,0.00024077475,0.00010754029,0.000013711937,0.0000011973985,0.00001071718,0.00016734339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980801,0.0004720893,0.00022681787,0.00027031905,0.00059798046,0.0003527381],"domain_scores_gemma":[0.9986466,0.00032235324,0.00007848666,0.00033003348,0.0005379824,0.000084538115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859838,0.00009856081,0.00013594146,0.000078447025,0.000437757,0.00007363886,0.00053836254,0.000082635626,0.00027451583],"category_scores_gemma":[0.00010881429,0.00007617569,0.00014032176,0.0010358621,0.0005515225,0.00038942238,0.00022496477,0.0005016879,0.000015141111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007791065,0.00021342083,0.0041776607,0.00006832161,0.0003941744,0.0000060959387,0.072962224,0.0073130466,0.04938901,0.27173486,0.008203283,0.58546],"study_design_scores_gemma":[0.0004423128,0.00016697033,0.0023463706,0.000025969797,0.000013222279,0.000074433214,0.0022673036,0.969914,0.019914161,0.003928042,0.00072383665,0.00018334271],"about_ca_topic_score_codex":0.00034971003,"about_ca_topic_score_gemma":0.000012557742,"teacher_disagreement_score":0.962601,"about_ca_system_score_codex":0.0001096995,"about_ca_system_score_gemma":0.00042217193,"threshold_uncertainty_score":0.3366917},"labels":[],"label_agreement":null},{"id":"W2396856145","doi":"","title":"Approximation results for the linear ordering problem on interval graphs.","year":2013,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics; Interval graph; Discrete mathematics; Chordal graph; Computer science; 1-planar graph; Graph","score_opus":0.014870486590647857,"score_gpt":0.2397716318963463,"score_spread":0.22490114530569844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396856145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037409621,0.000052479525,0.9835149,0.005480528,0.0033101176,0.0022137577,0.0000065862714,0.00031159932,0.0013690422],"genre_scores_gemma":[0.9047109,0.0005745836,0.09210498,0.0010763439,0.00015377742,0.00089305855,0.00011528795,0.000041108357,0.00032998636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984472,0.000097386495,0.00043034359,0.0004974673,0.00025336372,0.00027424184],"domain_scores_gemma":[0.9984235,0.00054424966,0.00026211486,0.00037080926,0.00030637268,0.000092942566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040455858,0.00023356942,0.00020436874,0.00022882792,0.00052264996,0.00038154816,0.00033923404,0.00015399355,0.000017421115],"category_scores_gemma":[0.00020784288,0.0001802742,0.00010190106,0.0006598009,0.0000906532,0.0004972736,0.00009303512,0.0002146471,0.0000070408937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031142618,0.00021871278,0.00007959137,0.000021937902,0.000057340738,5.7074965e-7,0.00042180548,0.4038171,0.000022789705,0.517488,0.0036260395,0.073934704],"study_design_scores_gemma":[0.0025853706,0.0005177658,0.000461687,0.00007617277,0.000021133083,0.000002565872,0.00009452016,0.9746991,0.00007081915,0.020154662,0.001068891,0.00024734155],"about_ca_topic_score_codex":0.000011130819,"about_ca_topic_score_gemma":0.000004430785,"teacher_disagreement_score":0.9009699,"about_ca_system_score_codex":0.000045244284,"about_ca_system_score_gemma":0.00003413094,"threshold_uncertainty_score":0.73513687},"labels":[],"label_agreement":null},{"id":"W2397809402","doi":"","title":"Neighbor Rupture Degree And The Relations Between Other Parameters.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degree (music); Mathematics; Statistics; Acoustics; Physics","score_opus":0.034396968666349594,"score_gpt":0.2273431693680174,"score_spread":0.19294620070166782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397809402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51795435,0.00040450683,0.35615972,0.0077818567,0.0029598058,0.0012174161,0.0000094604275,0.00074386137,0.11276903],"genre_scores_gemma":[0.98876405,0.0000056928566,0.010749202,0.0002829047,0.0000042127613,0.000010250732,9.070905e-7,0.000005840942,0.00017694474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993797,0.00008983974,0.00013648767,0.00017060433,0.0001083926,0.00011498273],"domain_scores_gemma":[0.999353,0.00017516124,0.00007021272,0.0003078323,0.00004080087,0.000052996704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020914047,0.000082213926,0.00009791543,0.00004382322,0.00015790689,0.000072742296,0.00024791338,0.00005895367,0.000059468126],"category_scores_gemma":[0.000050468974,0.000058275196,0.000035923647,0.0001989918,0.0001241025,0.00027507538,0.00007764398,0.0001259089,0.000040406634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036049119,0.000008151628,0.045091238,8.960331e-7,0.000016328946,6.735261e-7,0.0011191391,0.0000030545843,7.652584e-7,0.9434242,0.00033549254,0.009996459],"study_design_scores_gemma":[0.0018415508,0.000044810633,0.320887,0.000009560431,0.000024651868,0.0000070376846,0.00004103756,0.005050757,0.00008248218,0.67095166,0.00089923723,0.00016024648],"about_ca_topic_score_codex":0.00006265217,"about_ca_topic_score_gemma":0.000009652937,"teacher_disagreement_score":0.4708097,"about_ca_system_score_codex":0.000013484498,"about_ca_system_score_gemma":0.00002322012,"threshold_uncertainty_score":0.23763935},"labels":[],"label_agreement":null},{"id":"W2398036300","doi":"10.29007/fblb","title":"CDCL with Less Destructive Backtracking through Partial Ordering","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Backtracking; Satisfiability; Boolean satisfiability problem; Solver; Relation (database); Computer science; Series (stratigraphy); Algorithm; Theoretical computer science; Combinatorics; Mathematics; Programming language; Data mining","score_opus":0.02310364717064647,"score_gpt":0.26435545493342355,"score_spread":0.24125180776277708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398036300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2704308,0.000010419855,0.7248498,0.0002528772,0.0005320736,0.000079958634,1.8162847e-7,0.00014436292,0.003699499],"genre_scores_gemma":[0.7526261,0.0000022926424,0.24707714,0.000112667476,0.0001600353,0.0000016754517,6.524458e-7,0.0000070655833,0.000012346766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989469,0.000059679227,0.00022359389,0.00034038283,0.00015420416,0.00027524453],"domain_scores_gemma":[0.99944395,0.00008589712,0.0001032265,0.0002434358,0.00009070664,0.00003277265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017145877,0.00012580125,0.00014013231,0.00006228703,0.00025066244,0.00016024547,0.00026658826,0.000043120097,0.000034004024],"category_scores_gemma":[0.000044830813,0.00012147172,0.00001914269,0.00050596864,0.00017447324,0.0008490403,0.00017369521,0.0001407006,0.000009218137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064240536,0.000044737353,0.12252304,0.000036490568,0.00004146603,0.000068269896,0.024439063,0.036330964,0.00024012766,0.13368367,0.000038741084,0.6824892],"study_design_scores_gemma":[0.0019414359,0.0005128704,0.1308771,0.00051253015,0.000012212811,0.0006064584,0.0044252183,0.835173,0.012553552,0.009197466,0.003061419,0.001126701],"about_ca_topic_score_codex":0.00006315216,"about_ca_topic_score_gemma":0.00019762246,"teacher_disagreement_score":0.7988421,"about_ca_system_score_codex":0.00005776392,"about_ca_system_score_gemma":0.00006565299,"threshold_uncertainty_score":0.4953473},"labels":[],"label_agreement":null},{"id":"W2398436144","doi":"10.1016/j.artint.2016.05.004","title":"Automatic construction of parallel portfolios via algorithm configuration","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Algorithm; Parallel computing","score_opus":0.023485811717941993,"score_gpt":0.26123016908454955,"score_spread":0.23774435736660754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398436144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039428524,0.000009519394,0.9937965,0.0008781057,0.00048715764,0.00014962319,0.0000025276652,0.00014184462,0.00059181906],"genre_scores_gemma":[0.7879332,0.000024882791,0.21191318,0.000049302016,0.00003335359,0.000008621793,0.0000016018702,0.000004152127,0.000031729098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889696,0.000050166884,0.0004627858,0.00023371975,0.00020810128,0.00014824087],"domain_scores_gemma":[0.9991736,0.00010108851,0.00021074597,0.00027400482,0.00018162746,0.00005894968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017645964,0.000096945645,0.00012536476,0.00012656982,0.00007147615,0.000041865445,0.0002189339,0.00005740469,0.00053471065],"category_scores_gemma":[0.00007082419,0.00007607998,0.000051167888,0.0003071888,0.0001544046,0.00053804624,0.000033162232,0.000041853822,0.00017537952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017218348,0.000016888662,0.00009619377,0.0000024714898,0.0000056616723,0.0000011979947,0.00009896601,0.0000891229,0.0037968296,0.16316004,0.00001196369,0.83271897],"study_design_scores_gemma":[0.00005140491,0.00008111536,0.0009669988,0.000042989068,0.000007763975,0.000044924655,0.00009446415,0.71631956,0.18254235,0.09952412,0.0001290268,0.00019529043],"about_ca_topic_score_codex":0.000024989115,"about_ca_topic_score_gemma":0.000011016926,"teacher_disagreement_score":0.83252364,"about_ca_system_score_codex":0.000031689484,"about_ca_system_score_gemma":0.00006494566,"threshold_uncertainty_score":0.5854707},"labels":[],"label_agreement":null},{"id":"W2398768505","doi":"","title":"From Interval Arithmetic to Interval Constraints.","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Interval arithmetic; Interval (graph theory); Mathematics; Affine arithmetic; Arithmetic; Constraint satisfaction problem; Division (mathematics); Function (biology); Algebra over a field; Constraint (computer-aided design); Discrete mathematics; Algorithm; Pure mathematics; Combinatorics","score_opus":0.035271965334193196,"score_gpt":0.24760279445990863,"score_spread":0.21233082912571544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398768505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009323877,0.0000029093114,0.93813527,0.00070703507,0.0006526215,0.00010266623,0.0000038566272,0.0002502043,0.050821554],"genre_scores_gemma":[0.68099123,7.686165e-7,0.31751993,0.001146058,0.000030024534,0.0000051612174,0.0000017860667,0.000003956205,0.00030105902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915904,0.000036594898,0.00020817794,0.0003043699,0.00012706389,0.0001647723],"domain_scores_gemma":[0.9993937,0.000034616238,0.000036475023,0.0003219205,0.00006154574,0.00015172354],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000101599064,0.000103510174,0.00011529147,0.000112979564,0.000038880593,0.000091332855,0.00043908396,0.00004094293,0.004110223],"category_scores_gemma":[0.00003922355,0.00009519792,0.00005684587,0.00019703976,0.00006472536,0.00031315268,0.00019776644,0.00008218562,0.0007397405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013686383,0.00009072159,0.0028642516,0.0000027040444,0.000042386706,0.000025228155,0.0069714836,0.000026314032,0.00044602805,0.11279919,0.0028190203,0.873899],"study_design_scores_gemma":[0.00519719,0.0017730609,0.39343905,0.0003681323,0.000103763,0.0003913549,0.0060459888,0.41279703,0.06083139,0.086378396,0.028538564,0.0041360916],"about_ca_topic_score_codex":0.00024926104,"about_ca_topic_score_gemma":0.00008819542,"teacher_disagreement_score":0.8697629,"about_ca_system_score_codex":0.000027789833,"about_ca_system_score_gemma":0.000035872115,"threshold_uncertainty_score":0.9968002},"labels":[],"label_agreement":null},{"id":"W2398919057","doi":"","title":"GeospatialRules: A Datalog+ RuleML Rulebase for Geospatial Reasoning.","year":2014,"lang":"en","type":"article","venue":"Rules and Rule Markup Languages for the Semantic Web","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Datalog; Computer science; Geospatial analysis; RuleML; Task (project management); Set (abstract data type); Fragment (logic); Programming language; Conjunctive query; XML; Information retrieval; World Wide Web; Markup language","score_opus":0.006195305034952877,"score_gpt":0.2364738115818276,"score_spread":0.2302785065468747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398919057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023951517,0.0005607117,0.9702079,0.0030036161,0.00041663027,0.00087233644,0.00021311149,0.000199552,0.00057456654],"genre_scores_gemma":[0.8171832,0.0004270952,0.17852707,0.0012031536,0.00069933233,0.00026579326,0.000389712,0.00005645025,0.001248225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985975,0.00007137764,0.00029023757,0.00046376392,0.00018746337,0.00038966382],"domain_scores_gemma":[0.9982621,0.00077583484,0.00016344,0.0005972085,0.00009504108,0.00010636862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071472686,0.00023082693,0.0002593587,0.00009151602,0.0005618937,0.0003055351,0.00050653244,0.00009403132,0.000039084753],"category_scores_gemma":[0.0003350229,0.0001634384,0.00013116347,0.000117762385,0.00010738334,0.00025268484,0.0001916626,0.00010052722,0.000016000637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012201875,0.000094423434,0.001144145,0.00033294913,0.00017842304,0.0000054962907,0.0011489401,0.0004965115,0.0005566329,0.23581167,0.0066959485,0.75341284],"study_design_scores_gemma":[0.0017593948,0.00014800891,0.0058494695,0.00008169725,0.00010421271,0.000056481585,0.00026140022,0.9549651,0.0001398896,0.0038133983,0.032423634,0.0003972776],"about_ca_topic_score_codex":0.00016919264,"about_ca_topic_score_gemma":0.0003231206,"teacher_disagreement_score":0.9544686,"about_ca_system_score_codex":0.000018648807,"about_ca_system_score_gemma":0.000052435782,"threshold_uncertainty_score":0.66648245},"labels":[],"label_agreement":null},{"id":"W2401402817","doi":"","title":"Experimental Results on the Satisfiable Core in Random 3SAT.","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Core (optical fiber); Boolean satisfiability problem; Variable (mathematics); Computer science; Mathematics; Measure (data warehouse); Combinatorics; Discrete mathematics; Data mining","score_opus":0.01894528631107373,"score_gpt":0.23991388848356646,"score_spread":0.22096860217249273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401402817","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17711808,0.000044981418,0.32196814,0.00757205,0.0005496132,0.00060675427,0.000004123673,0.00030831542,0.49182796],"genre_scores_gemma":[0.991529,0.0000016257612,0.006486825,0.00053185836,0.00002049706,0.000010602603,0.0000028252396,0.0000022812424,0.0014145254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994216,0.000023668035,0.00015604675,0.00016158418,0.00013101331,0.000106067295],"domain_scores_gemma":[0.999592,0.00013460506,0.00003268646,0.0002122372,0.000012557677,0.000015907268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017381,0.000059824182,0.000056933222,0.000050988267,0.00006706234,0.00006634511,0.0001575706,0.000022639782,0.00015858683],"category_scores_gemma":[0.000019988254,0.000039242033,0.000021792433,0.00019389624,0.00002333236,0.00012680628,0.00003279397,0.000056436715,0.00005642138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008120806,0.00010182667,0.0016171812,8.310206e-7,0.0000028695986,0.000007971476,0.00040811225,0.012354127,0.0021400743,0.954297,0.02241311,0.0065756724],"study_design_scores_gemma":[0.01422319,0.00024010053,0.07269316,0.000055531036,0.0000028947838,0.000029702576,0.0006047382,0.80985504,0.07918251,0.010853363,0.011628022,0.0006317361],"about_ca_topic_score_codex":0.00034437573,"about_ca_topic_score_gemma":0.00018640613,"teacher_disagreement_score":0.94344366,"about_ca_system_score_codex":0.00003354325,"about_ca_system_score_gemma":0.00002475913,"threshold_uncertainty_score":0.17364146},"labels":[],"label_agreement":null},{"id":"W2402008367","doi":"","title":"A formalization of structured temporal objects and repetition","year":2000,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Parameterized complexity; Formalism (music); Temporal logic; Temporal database; Regular polygon; Theoretical computer science; Algorithm; Mathematics; Data mining","score_opus":0.00409146584646694,"score_gpt":0.1950054538879156,"score_spread":0.19091398804144866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402008367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1035711,0.0000123108575,0.876865,0.00019331917,0.00005483866,0.00009672254,0.0000010155436,0.0000972003,0.019108485],"genre_scores_gemma":[0.9530422,0.000021150461,0.046562202,0.00007911822,0.0000055641012,9.898137e-7,0.0000047883177,0.0000012720466,0.00028270792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967897,0.00001276959,0.00010066853,0.00009239882,0.00006996053,0.000045255776],"domain_scores_gemma":[0.9998169,0.0000065643644,0.000030803963,0.000095256335,0.000029154853,0.000021346441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043074302,0.00003406883,0.000042886975,0.00004196987,0.000030349245,0.000025957848,0.000042989774,0.00002213658,0.00046250515],"category_scores_gemma":[0.000005425968,0.000030641604,0.000010224641,0.00012888035,0.000016345375,0.00035814775,0.000009799706,0.000016067872,0.0000024218552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014981736,0.000020888061,0.014304241,0.000025237741,0.000009077307,0.0000014569282,0.00136747,0.002338057,0.0011663657,0.14166752,0.00022979658,0.8388549],"study_design_scores_gemma":[0.0013510048,0.00018036415,0.20813428,0.000035418907,0.00000905616,0.00010581948,0.00012521958,0.7612541,0.013577637,0.012776532,0.0021298567,0.0003207629],"about_ca_topic_score_codex":0.000020729365,"about_ca_topic_score_gemma":0.00004045302,"teacher_disagreement_score":0.8494711,"about_ca_system_score_codex":0.0000050131043,"about_ca_system_score_gemma":0.00001431825,"threshold_uncertainty_score":0.5064107},"labels":[],"label_agreement":null},{"id":"W2403294653","doi":"","title":"A Cube-covering Problem.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Combinatorics","score_opus":0.010907786761450418,"score_gpt":0.22702334014891656,"score_spread":0.21611555338746616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403294653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3761984,0.00039462626,0.48172122,0.0022408455,0.013233457,0.0006884013,0.000002028547,0.0015419801,0.12397902],"genre_scores_gemma":[0.98121864,0.000007488745,0.018432375,0.00015050909,0.00000900293,0.000009802988,0.0000010371859,0.000005556275,0.00016556957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993552,0.000027524482,0.0001164806,0.00012940065,0.00014280381,0.00022862291],"domain_scores_gemma":[0.9995505,0.000030520972,0.000045420195,0.00023852436,0.000036075995,0.000098932935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016620234,0.000075373704,0.00007178373,0.000055315875,0.00008639383,0.00007557729,0.00021076093,0.00003651946,0.000053588108],"category_scores_gemma":[0.000019770705,0.000076965865,0.00003097519,0.00023988943,0.000015040324,0.00084383006,0.00009841202,0.000076345656,0.0001618709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8232555e-7,0.00003452992,0.013794235,0.0000037225175,0.000005226286,6.6347417e-7,0.0003611352,0.000039014958,0.00014816922,0.97185725,0.0006745601,0.013080793],"study_design_scores_gemma":[0.0031849616,0.00018695828,0.18557587,0.000088072215,0.000028329348,0.00015731294,0.00013307559,0.04836494,0.008083854,0.6794737,0.073266365,0.0014565337],"about_ca_topic_score_codex":0.000009374573,"about_ca_topic_score_gemma":9.2753817e-7,"teacher_disagreement_score":0.6050202,"about_ca_system_score_codex":0.000042220916,"about_ca_system_score_gemma":0.000027181002,"threshold_uncertainty_score":0.31385767},"labels":[],"label_agreement":null},{"id":"W2403908314","doi":"","title":"On Generalizing the.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.010584648451156939,"score_gpt":0.2177366835089529,"score_spread":0.20715203505779595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403908314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7831797,0.00007841472,0.1254867,0.022444095,0.008926058,0.0007433538,6.1430586e-7,0.00073449814,0.05840653],"genre_scores_gemma":[0.99631476,0.000004803945,0.0021644945,0.0012085851,0.0000041673743,0.00001731128,5.699315e-7,0.0000036226286,0.00028168707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995013,0.000039001763,0.00008517678,0.00013184111,0.00012877308,0.00011391116],"domain_scores_gemma":[0.9995037,0.000075935,0.000033166405,0.00030220716,0.00004611923,0.00003889493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007890927,0.000058758476,0.00004566464,0.000032779615,0.00013555236,0.00016387407,0.0002946863,0.000023323099,0.00014378132],"category_scores_gemma":[0.000026893342,0.000042389103,0.00002584415,0.00016698113,0.000020190513,0.00025359812,0.000054650915,0.0000731107,0.0004982534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9051413e-7,0.000008980599,0.0002527744,4.2745137e-7,0.0000027344115,4.472918e-7,0.000083670806,0.00015630132,0.00007685805,0.9773083,0.0067588557,0.01535051],"study_design_scores_gemma":[0.00031456543,0.000044018878,0.015926825,0.0000066990897,0.0000016791192,0.000005971583,0.00001705831,0.06440245,0.0006032587,0.91642433,0.0021199347,0.00013317015],"about_ca_topic_score_codex":0.000032850687,"about_ca_topic_score_gemma":0.0000014628887,"teacher_disagreement_score":0.21313503,"about_ca_system_score_codex":0.000021065023,"about_ca_system_score_gemma":0.00001694823,"threshold_uncertainty_score":0.6404205},"labels":[],"label_agreement":null},{"id":"W2404236476","doi":"10.1080/03155986.2004.11732693","title":"Special Issue of INFOR<i>Graphs, Networks and Integer Programming</i>","year":2004,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia; Polytechnique Montréal","funders":"","keywords":"Integer programming; Integer (computer science); Computer science; Combinatorics; Mathematics; Mathematical optimization; Programming language","score_opus":0.024593497508196137,"score_gpt":0.3023217930134131,"score_spread":0.277728295505217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404236476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008866012,0.00018887769,0.94369084,0.002083102,0.001238263,0.0017473237,0.000023157221,0.00010731315,0.042055115],"genre_scores_gemma":[0.9884205,0.00025600253,0.009762029,0.00035448937,0.0007138038,0.00010627456,0.00007600215,0.0000059437825,0.0003049956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984723,0.00004007557,0.0005385488,0.00011226661,0.00063053006,0.00020632056],"domain_scores_gemma":[0.99867934,0.000095294185,0.000111589965,0.00015496399,0.0008425261,0.0001162814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030765,0.00009686579,0.00013636882,0.00040208767,0.00028554985,0.000835263,0.00016981346,0.00009498619,0.000024621242],"category_scores_gemma":[0.00013299321,0.000083946325,0.000024650253,0.00052004354,0.00016597903,0.0033631066,0.0001341357,0.00019262628,0.00002308198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020422842,0.00001359655,0.0011326653,0.00007801043,0.000017455086,6.0699233e-7,0.0025854309,0.035069287,0.0000046525797,0.823867,0.0029601662,0.13425066],"study_design_scores_gemma":[0.0019040904,0.0003151517,0.007096021,0.00015940075,0.0000039737374,0.00012597156,0.002137413,0.22235636,0.00008502933,0.0006735268,0.76481736,0.000325721],"about_ca_topic_score_codex":0.00020717725,"about_ca_topic_score_gemma":0.00002747854,"teacher_disagreement_score":0.9795545,"about_ca_system_score_codex":0.00004823544,"about_ca_system_score_gemma":0.0002340999,"threshold_uncertainty_score":0.805446},"labels":[],"label_agreement":null},{"id":"W2406701104","doi":"","title":"Computing possibly optimal solutions for multi-objective constraint optimisation with tradeoffs","year":2015,"lang":"en","type":"article","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Science Foundation Ireland; Queen's University Belfast","keywords":"Mathematical optimization; Constraint (computer-aided design); Set (abstract data type); Computer science; Mathematics","score_opus":0.05445567795100584,"score_gpt":0.2802333580001624,"score_spread":0.22577768004915658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406701104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036773596,0.00006309928,0.957158,0.0032913722,0.0007348602,0.00072108104,0.000023676987,0.00067392323,0.0005603525],"genre_scores_gemma":[0.5088188,0.0000042706347,0.4910209,0.000047196987,0.000027307771,0.000031164916,0.000016340298,0.000009079213,0.00002496883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982196,0.000026520112,0.00049057323,0.0005400183,0.0002677229,0.0004555824],"domain_scores_gemma":[0.99827355,0.00004624756,0.00037122244,0.0005008043,0.00067043427,0.00013772622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761981,0.00024562568,0.00032341768,0.0007519286,0.0003218153,0.00009439603,0.0006337606,0.0002694711,0.000005207319],"category_scores_gemma":[0.00032624952,0.00023569414,0.0000913288,0.0011478052,0.00076585065,0.0010394236,0.0001770854,0.0002668326,0.0000079872625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000886446,0.0003939033,0.0012167849,0.00004655745,0.0001943998,0.000019833853,0.0014703714,0.2091315,0.0016781754,0.6578142,0.00088039605,0.12706523],"study_design_scores_gemma":[0.0047959695,0.0006962323,0.0008724533,0.00013211343,0.000053718264,0.0002619145,0.00133148,0.9785873,0.0069677625,0.0019388791,0.0038044816,0.0005576684],"about_ca_topic_score_codex":0.000030435047,"about_ca_topic_score_gemma":0.000081121056,"teacher_disagreement_score":0.76945585,"about_ca_system_score_codex":0.00017316766,"about_ca_system_score_gemma":0.00069236464,"threshold_uncertainty_score":0.9611328},"labels":[],"label_agreement":null},{"id":"W2407520746","doi":"","title":"GENCOL : Une équipe et un logiciel d'optimisation","year":2010,"lang":"fr","type":"article","venue":"Studia informatica universalis","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Software; Library science; Humanities; Computer science; Art; Operating system","score_opus":0.016923378926516405,"score_gpt":0.24787685683118024,"score_spread":0.23095347790466383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407520746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033232,0.000060211616,0.5388707,0.040565446,0.0041127466,0.00065175514,0.000048297366,0.00032153516,0.4120461],"genre_scores_gemma":[0.710154,0.0013984876,0.27319032,0.0053869574,0.00030049312,0.000027763306,0.00010571474,0.000037757905,0.0093985135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981839,0.00010312203,0.0005473985,0.00027627157,0.0004367092,0.00045257207],"domain_scores_gemma":[0.99825025,0.00021123354,0.0003299667,0.0005718755,0.00039763228,0.0002390376],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005054013,0.0002943826,0.0002659311,0.00024316153,0.00038773788,0.0003873423,0.0005262127,0.00025098838,0.0018124634],"category_scores_gemma":[0.00020311953,0.00031520225,0.00013026319,0.0011200052,0.00036232665,0.003348874,0.00029217915,0.00057330483,0.00056863786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009885127,0.000096971016,0.00023302426,0.000049316743,0.00008280473,0.000017196882,0.019400937,0.0041986904,0.00006760257,0.8127194,0.007369547,0.1557546],"study_design_scores_gemma":[0.0020847,0.00026520574,0.011587821,0.00008613619,0.00014537733,0.00013447102,0.0056906724,0.304168,0.00026944358,0.0031140945,0.6715411,0.00091299426],"about_ca_topic_score_codex":0.0004130084,"about_ca_topic_score_gemma":0.0005294472,"teacher_disagreement_score":0.8096053,"about_ca_system_score_codex":0.000114919625,"about_ca_system_score_gemma":0.00058682443,"threshold_uncertainty_score":0.99993},"labels":[],"label_agreement":null},{"id":"W2411060471","doi":"10.5623/cig2016-104","title":"Topological Similarity Measurement of Region Compositions Based on Boundary Contacts","year":2016,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Similarity (geometry); Matching (statistics); Boundary (topology); Topology (electrical circuits); Sequence (biology); Traverse; Computer science; Mathematics; Algorithm; Pattern recognition (psychology); Artificial intelligence; Combinatorics; Geography; Image (mathematics); Mathematical analysis","score_opus":0.03331444434787264,"score_gpt":0.23824964462194537,"score_spread":0.20493520027407272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411060471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038669584,0.0000050841813,0.9796108,0.010612127,0.00012506926,0.00013243154,0.0000031778459,0.00009095796,0.00555339],"genre_scores_gemma":[0.97878134,0.0000029942362,0.020633949,0.0005448751,0.000010096049,0.000006737095,0.0000011123183,0.0000021172448,0.000016747592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99915475,0.00008484949,0.00018607361,0.0001541352,0.00030470412,0.00011549471],"domain_scores_gemma":[0.9993025,0.0001315618,0.00007882431,0.00030183708,0.00012523714,0.00006003609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019696902,0.00006970791,0.00010780259,0.00006302071,0.000094511444,0.00002883042,0.00016232082,0.00004205708,0.00011746296],"category_scores_gemma":[0.00011461716,0.000047003177,0.000047559857,0.00010108969,0.000081584345,0.000121324636,0.000030381996,0.00003911029,0.000025601374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015090567,0.0013209321,0.010916789,0.000111126275,0.000082317885,0.0000555589,0.00043524074,0.001807202,0.01763986,0.68599296,0.0063752537,0.27511182],"study_design_scores_gemma":[0.0067564207,0.0020791139,0.48568892,0.0012534915,0.00007269445,0.00008704421,0.00006586715,0.4005702,0.032553177,0.05885305,0.010870371,0.0011496295],"about_ca_topic_score_codex":0.000004436023,"about_ca_topic_score_gemma":0.000007790685,"teacher_disagreement_score":0.97491443,"about_ca_system_score_codex":0.00006849973,"about_ca_system_score_gemma":0.000080761616,"threshold_uncertainty_score":0.1916734},"labels":[],"label_agreement":null},{"id":"W2416495215","doi":"10.1016/j.tcs.2016.04.041","title":"A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability; Probabilistic logic; Constraint programming; Constraint (computer-aided design); Computer science; Mathematics; Programming language; Theoretical computer science; Algorithm; Mathematical optimization; Discrete mathematics; Stochastic programming; Artificial intelligence","score_opus":0.021345531829380798,"score_gpt":0.2795715204165245,"score_spread":0.2582259885871437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416495215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4668438,0.0000022743977,0.5324575,0.0001761611,0.00006931434,0.00033032146,3.9471172e-7,0.000049618637,0.000070643844],"genre_scores_gemma":[0.7901732,5.170621e-7,0.20978029,0.00002095908,0.000009704697,0.000012689911,4.8863456e-8,0.000002196742,4.3004914e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818724,0.00021076987,0.0003838654,0.00055823463,0.00036091966,0.00029897603],"domain_scores_gemma":[0.99858373,0.0006275519,0.00010295217,0.0003529249,0.00021339406,0.00011946475],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015857733,0.00011653185,0.00019216775,0.00015380418,0.00013512354,0.00010787594,0.00042726388,0.000030338646,0.000011867904],"category_scores_gemma":[0.0007559956,0.00008103986,0.000016779257,0.0008713342,0.0027932238,0.0004268033,0.0003824902,0.0000718891,0.0000012195994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006018555,0.00013223724,0.018770317,0.000008258009,0.000001626389,0.000002743775,0.00084453035,0.00019745604,0.0013149712,0.48077247,2.5429085e-7,0.49794912],"study_design_scores_gemma":[0.0016324549,0.0007570892,0.14734782,0.000107963315,0.0000053020613,0.00003964286,0.000058282792,0.7856122,0.0004767438,0.06372139,0.0000014932538,0.00023956812],"about_ca_topic_score_codex":0.000030222382,"about_ca_topic_score_gemma":0.000019824824,"teacher_disagreement_score":0.7854148,"about_ca_system_score_codex":0.00007375949,"about_ca_system_score_gemma":0.00013299388,"threshold_uncertainty_score":0.9999206},"labels":[],"label_agreement":null},{"id":"W2426786974","doi":"10.1016/j.comcom.2013.01.001","title":"Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Optimization problem; Wireless sensor network; Distributed computing; Set (abstract data type); Constraint (computer-aided design); Mathematical optimization; Algorithm; Computer network","score_opus":0.017447699110899124,"score_gpt":0.2480492258699638,"score_spread":0.23060152675906467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2426786974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016208443,0.000040535597,0.97630477,0.020104513,0.0001914367,0.00085184333,0.000021212252,0.0005357021,0.0017879301],"genre_scores_gemma":[0.19687311,0.000026280522,0.80131304,0.0010814144,0.000029577526,0.0001995173,0.00040771466,0.00001341155,0.000055911863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982231,0.0002736732,0.00047415373,0.00046876952,0.00024696754,0.0003133011],"domain_scores_gemma":[0.9966432,0.00019933966,0.00012849187,0.0023092325,0.0004320267,0.0002877078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019353024,0.00021815191,0.00021717972,0.00024052295,0.00045572268,0.00050847355,0.0019124433,0.00010024567,0.00012306077],"category_scores_gemma":[0.000052146417,0.0002299452,0.000086498396,0.0009311134,0.00018889579,0.0006473273,0.00095912133,0.0002842406,0.00018333762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025091663,0.00032810748,0.00027129348,0.0000128384545,0.000053227533,8.902936e-7,0.0010700298,0.82701486,0.000101172074,0.08133673,0.0027356225,0.0870727],"study_design_scores_gemma":[0.0002613458,0.000036273093,0.0029317113,0.000014789966,0.0000058979326,0.00004084477,0.00005195855,0.9935857,0.000007934368,0.0006750228,0.0021252611,0.0002632622],"about_ca_topic_score_codex":0.000024055289,"about_ca_topic_score_gemma":0.0000055583378,"teacher_disagreement_score":0.19671102,"about_ca_system_score_codex":0.00013601726,"about_ca_system_score_gemma":0.00013033013,"threshold_uncertainty_score":0.9376893},"labels":[],"label_agreement":null},{"id":"W2487415203","doi":"10.4018/978-1-61692-811-7.ch004","title":"Probabilistic Temporal Network for Numeric and Symbolic Time Information","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Probabilistic logic; Constraint (computer-aided design); Constraint satisfaction problem; Computer science; Constraint satisfaction; Theoretical computer science; Interval (graph theory); Probabilistic relevance model; Uncertain data; Time constraint; Mathematical optimization; Algorithm; Probabilistic analysis of algorithms; Mathematics; Artificial intelligence","score_opus":0.00783830348793546,"score_gpt":0.20948628424061472,"score_spread":0.20164798075267926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487415203","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019426425,0.000038409948,0.35092568,0.00013557298,0.0006726361,0.0009216639,0.000074304044,0.00026709383,0.64694524],"genre_scores_gemma":[0.09193039,0.000030701376,0.78615123,0.0055402876,0.0023442828,0.0004049852,0.0003835421,0.00015138976,0.11306318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989778,0.000008717361,0.00033643728,0.00027263898,0.00018354978,0.0002208606],"domain_scores_gemma":[0.99909866,0.000041051553,0.00026080557,0.00033261869,0.00014808992,0.000118748576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012216864,0.00024863318,0.0002545896,0.000054585526,0.00015424877,0.0002708837,0.00024357806,0.0003003488,0.000025346862],"category_scores_gemma":[0.000025784435,0.0002514364,0.00008459381,0.000025718498,0.00008393477,0.00027392744,0.00010990763,0.00017771902,0.00009835136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006750186,0.0000014130447,0.000011916667,0.000026361013,0.000015880121,7.410799e-7,0.000035604542,0.000122021636,0.0000010880946,0.94319284,0.0010331987,0.055552207],"study_design_scores_gemma":[0.000620574,0.00014156093,0.00022237726,0.00012261976,0.000058081827,0.00011592715,0.0000019081672,0.04736967,0.0000032279013,0.7781035,0.17254043,0.00070017343],"about_ca_topic_score_codex":0.00001286519,"about_ca_topic_score_gemma":0.00002945974,"teacher_disagreement_score":0.533882,"about_ca_system_score_codex":0.00007131099,"about_ca_system_score_gemma":0.00019022968,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W2512972094","doi":"10.1142/s1469026816500176","title":"A New Parallel GA-Based Method for Constraint Satisfaction Problems","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Crossover; Computer science; Heuristic; Mathematical optimization; Solver; Constraint satisfaction; Computation; Constraint (computer-aided design); Constraint programming; Local consistency; Genetic algorithm; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.030263103537537,"score_gpt":0.3294731553865745,"score_spread":0.2992100518490375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512972094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062285435,0.00006152311,0.9878145,0.011316883,0.00026487088,0.00030662652,0.00001980777,0.000036666384,0.000116839656],"genre_scores_gemma":[0.2513592,0.00006230406,0.747825,0.00043626997,0.00020006677,0.000043257915,0.000006082777,0.0000066778753,0.000061115315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986451,0.000037979644,0.00058114604,0.0002233389,0.00039044092,0.00012198488],"domain_scores_gemma":[0.99741304,0.0007929339,0.00045813873,0.00011133714,0.0010831947,0.00014133197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033205698,0.00012342277,0.00014791681,0.00027804973,0.000090659276,0.00015239375,0.0004148277,0.000053493568,0.00007144955],"category_scores_gemma":[0.00007808574,0.000095332216,0.000114453236,0.00016371129,0.00006405139,0.00053063536,0.00003696722,0.00007785618,0.0000110485225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017512075,0.000024767034,0.00030490372,0.0000035321154,0.00004569429,7.1974324e-7,0.000048520877,0.09940838,0.00019169648,0.2588877,0.00027498047,0.6407916],"study_design_scores_gemma":[0.0014547075,0.00022749143,0.005298041,0.00015831283,0.00003397352,0.00041816384,0.00006720078,0.30280516,0.0015518639,0.65965223,0.027987855,0.0003449992],"about_ca_topic_score_codex":0.000011670292,"about_ca_topic_score_gemma":0.000009942204,"teacher_disagreement_score":0.6404466,"about_ca_system_score_codex":0.00008406737,"about_ca_system_score_gemma":0.00039116605,"threshold_uncertainty_score":0.38875347},"labels":[],"label_agreement":null},{"id":"W2513520185","doi":"10.12988/imf.2014.38161","title":"Generalized Langford sequences: new results and algorithms","year":2014,"lang":"en","type":"article","venue":"International Mathematical Forum","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Algorithm; Computer science","score_opus":0.018304743404416124,"score_gpt":0.26803103738133005,"score_spread":0.24972629397691393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513520185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001107462,0.000006546939,0.958113,0.019185524,0.00031081474,0.00006872665,0.000004234328,0.000113177324,0.021090483],"genre_scores_gemma":[0.25607938,0.00002243501,0.7373062,0.0018317112,0.00018940649,0.000010017623,0.00001843025,0.000009850882,0.004532577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991765,0.000024144902,0.00022988305,0.00020334669,0.00023917705,0.0001269541],"domain_scores_gemma":[0.99946856,0.00015089267,0.0000652202,0.00016196762,0.000052833508,0.00010054841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019570507,0.00008050651,0.00009883781,0.00006565294,0.000046868394,0.0001590147,0.0002792603,0.000039657818,0.00011073623],"category_scores_gemma":[0.00028026814,0.00006685339,0.000033914108,0.00007278154,0.00003486629,0.0002913643,0.0001074902,0.00005696298,0.00009847945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004432861,0.000011700593,0.0000711129,0.0000032246999,0.000010619592,0.0000012450714,0.00011710328,0.000076310374,0.000053470158,0.92340094,0.0020979894,0.07415187],"study_design_scores_gemma":[0.0006878014,0.000032778542,0.00035517832,0.000028552635,0.000002898297,0.00006093672,0.000019208928,0.5992834,0.00022938498,0.3752903,0.023887934,0.00012163491],"about_ca_topic_score_codex":0.000016746002,"about_ca_topic_score_gemma":0.00000855285,"teacher_disagreement_score":0.5992071,"about_ca_system_score_codex":0.000021174521,"about_ca_system_score_gemma":0.000023412635,"threshold_uncertainty_score":0.2726202},"labels":[],"label_agreement":null},{"id":"W2526645609","doi":"","title":"Analyse textométrique du Cycle du Monde réel","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Linguistic Association","funders":"","keywords":"Art","score_opus":0.01740762995040639,"score_gpt":0.2196860745786031,"score_spread":0.2022784446281967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526645609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016475609,0.00068589504,0.8489293,0.03675079,0.0009513481,0.0005783541,0.000047066074,0.00048384897,0.09509783],"genre_scores_gemma":[0.76915526,0.003055882,0.20536499,0.00042690188,0.000099511824,0.00009343438,0.00029060722,0.000075400116,0.021438027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881888,0.007681234,0.0011329686,0.0016284129,0.00067413057,0.000694434],"domain_scores_gemma":[0.9892777,0.0013829396,0.0010891753,0.003514995,0.004190998,0.0005441693],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006363807,0.00068736076,0.0006743294,0.00047600575,0.00085348473,0.0012030635,0.002739716,0.0006132207,0.0016599278],"category_scores_gemma":[0.0019497249,0.0007977264,0.00052820804,0.0012087174,0.0006053205,0.00084910524,0.0024941154,0.0010677484,0.0005332647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000174753,0.0010253118,0.014877187,0.00011236717,0.00021386429,0.00003586146,0.023641067,0.0035006008,0.00074143254,0.7697716,0.0024576264,0.18360563],"study_design_scores_gemma":[0.0014912436,0.0000017110999,0.0728728,0.0018048167,0.00019590252,0.00019433272,0.0002810861,0.8253485,0.017122347,0.027903512,0.051098432,0.0016852958],"about_ca_topic_score_codex":0.0071505005,"about_ca_topic_score_gemma":0.006629592,"teacher_disagreement_score":0.8218479,"about_ca_system_score_codex":0.00033671592,"about_ca_system_score_gemma":0.00081677974,"threshold_uncertainty_score":0.99983376},"labels":[],"label_agreement":null},{"id":"W2531021157","doi":"10.1145/2933575.2933604","title":"Graphs of relational structures","year":2016,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semilattice; Mathematics; Bounded function; Affine transformation; Discrete mathematics; Algebraic structure; Combinatorics; Pure mathematics","score_opus":0.012986707156762766,"score_gpt":0.21777016235082897,"score_spread":0.2047834551940662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531021157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292194,0.0000037172144,0.9863215,0.0009400498,0.0000870713,0.000018603518,8.9995416e-7,0.000040179995,0.00829579],"genre_scores_gemma":[0.88364816,0.0000041162166,0.115915805,0.00005366123,0.0000036714976,4.0740463e-7,2.36116e-7,6.904683e-7,0.00037326245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99974954,0.000007942851,0.000068856025,0.00006313633,0.00007698787,0.00003355043],"domain_scores_gemma":[0.999793,0.000038139562,0.00002648519,0.00009104881,0.000036062534,0.000015270556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029258594,0.000021638041,0.000025714151,0.000044787335,0.000014655961,0.000004846566,0.0000721012,0.000013640136,0.0004630123],"category_scores_gemma":[0.000015532918,0.000012598734,0.00001647507,0.00008115542,0.000021450936,0.00017588997,0.000017493194,0.000008611081,0.000008747149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0106303e-7,0.000001382628,0.00579989,3.147984e-7,0.0000017007304,6.543412e-8,0.000013144282,0.00002455277,0.0009543523,0.94163465,0.00017299899,0.051396545],"study_design_scores_gemma":[0.00062274677,0.000036110694,0.5518855,0.000010805896,0.0000023149976,0.000014498725,0.0000067052497,0.01068293,0.016049374,0.4170752,0.0034642953,0.00014954757],"about_ca_topic_score_codex":0.0000025321312,"about_ca_topic_score_gemma":0.0000037523553,"teacher_disagreement_score":0.87935597,"about_ca_system_score_codex":0.000003960354,"about_ca_system_score_gemma":0.000016289638,"threshold_uncertainty_score":0.506966},"labels":[],"label_agreement":null},{"id":"W254961257","doi":"10.1007/978-3-319-09284-3_28","title":"Approximating Highly Satisfiable Random 2-SAT","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Window (computing); Connection (principal bundle); Image (mathematics); Distribution (mathematics); Combinatorics; Polynomial; Computer science; Time complexity; Algorithm; Mathematics; Discrete mathematics; Set (abstract data type); Uniform distribution (continuous); Probability distribution; Artificial intelligence; Statistics; Geometry; Mathematical analysis","score_opus":0.010372630650418994,"score_gpt":0.2176377306963465,"score_spread":0.20726510004592752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W254961257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019862659,0.0001169302,0.98575675,0.0008027784,0.0018310958,0.00040751378,0.0000025239797,0.00029486362,0.010767655],"genre_scores_gemma":[0.098434925,0.00002914285,0.8984927,0.0016935098,0.00041569656,0.000011708377,0.000010670178,0.000036191122,0.0008754445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964895,0.0000518933,0.00066375773,0.0013217147,0.00089941046,0.00057368376],"domain_scores_gemma":[0.9974525,0.00059120014,0.00041125825,0.0011478169,0.00022240465,0.0001747953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011721414,0.00047691603,0.0005738713,0.00076049916,0.0003460324,0.0007707439,0.0018408431,0.0002920842,0.00007148197],"category_scores_gemma":[0.0001733501,0.00044773013,0.00013223215,0.00053704745,0.00046730367,0.0005492895,0.00073029264,0.0006435683,0.00011242131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004115614,0.000006725879,0.000082433144,0.000031286832,0.0000075567973,0.000013595445,0.00031199632,0.09747228,0.00006301054,0.045538276,0.00003314525,0.8564356],"study_design_scores_gemma":[0.0006299766,0.00006429202,0.00008143229,0.00025370764,0.000006901751,0.00006199397,9.761866e-8,0.93300205,0.00037505158,0.06300844,0.0019450277,0.00057103345],"about_ca_topic_score_codex":0.000018253924,"about_ca_topic_score_gemma":0.000056401765,"teacher_disagreement_score":0.8558645,"about_ca_system_score_codex":0.00024263457,"about_ca_system_score_gemma":0.00040176776,"threshold_uncertainty_score":0.99979746},"labels":[],"label_agreement":null},{"id":"W2556841172","doi":"10.1109/fuzz-ieee.2016.7737810","title":"Fuzzy models of topological relationships based on the PHI-descriptor","year":2016,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Focus (optics); Fuzzy logic; Set (abstract data type); Fuzzy set; Basis (linear algebra); Variety (cybernetics); Topology (electrical circuits); Computer science; Position (finance); Artificial intelligence; Mathematics; Combinatorics; Physics; Geometry","score_opus":0.07568122065252852,"score_gpt":0.23328143207792834,"score_spread":0.15760021142539982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556841172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029804467,0.0000014576207,0.930932,0.018717205,0.00009419031,0.000074860385,0.0000011698754,0.00007211307,0.047126587],"genre_scores_gemma":[0.9759579,0.0000021257595,0.022895698,0.0005968163,0.000009433829,0.0000050355834,2.2170225e-7,0.0000015848042,0.000531225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945134,0.00009692621,0.000119289,0.00012362028,0.00013549393,0.00007330228],"domain_scores_gemma":[0.99919844,0.00041248108,0.000041486735,0.00027037977,0.00004868513,0.000028515316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312412,0.00004736063,0.000049640814,0.00004316939,0.000079404716,0.000018657267,0.00019944969,0.0000356636,0.00029616448],"category_scores_gemma":[0.0001146985,0.000021234197,0.00003424521,0.00012885139,0.0000604109,0.00018630413,0.00002595349,0.000049416067,0.000033086348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024457447,0.000014250825,0.00069008145,4.0967618e-7,0.00000134844,1.6787654e-7,0.000028733675,0.0027774468,0.00023822197,0.9907482,0.0005450227,0.004953643],"study_design_scores_gemma":[0.0004248075,0.00009474447,0.018255299,0.000023981645,0.000003159325,0.000002171548,0.000045101082,0.8120578,0.0018461411,0.16676909,0.00034490228,0.00013279148],"about_ca_topic_score_codex":0.0000037716798,"about_ca_topic_score_gemma":0.000005257817,"teacher_disagreement_score":0.9729774,"about_ca_system_score_codex":0.000017159375,"about_ca_system_score_gemma":0.000030757416,"threshold_uncertainty_score":0.32427934},"labels":[],"label_agreement":null},{"id":"W2558952101","doi":"10.1007/978-3-319-50137-6_3","title":"New Approaches to Constraint Acquisition","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"European Commission","keywords":"Computer science; Constraint (computer-aided design); Generalization; Logarithm; Ask price; Process (computing); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Programming language","score_opus":0.039883254997316944,"score_gpt":0.23152733163903066,"score_spread":0.19164407664171373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558952101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000520681,0.000053302592,0.9748037,0.007437566,0.0014013347,0.0004127634,0.000005426429,0.0002025638,0.015678145],"genre_scores_gemma":[0.05598576,0.000013427143,0.93971354,0.0023318597,0.0005640577,0.0000072434996,0.0000037100606,0.000025587575,0.0013548465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971122,0.000023573308,0.000407648,0.001280082,0.0006979833,0.00047849608],"domain_scores_gemma":[0.9982467,0.00021374442,0.0001782498,0.0009312154,0.000091453905,0.0003386301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045218872,0.00039692043,0.0003403543,0.0008443307,0.00016979092,0.00048666308,0.0015407813,0.00024582056,0.00019157804],"category_scores_gemma":[0.000039186896,0.00033737102,0.00010049196,0.0004479443,0.00031836494,0.0005798519,0.0006586005,0.00032470774,0.00020432928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023354844,0.0000040571117,0.000015056052,0.0000050559556,0.000004106969,0.000011409378,0.00023438636,0.007872257,0.000051316405,0.18734038,0.00003387057,0.8044258],"study_design_scores_gemma":[0.0009634417,0.00037046307,0.0006526236,0.0010154633,0.00001598726,0.00031718542,4.1537092e-7,0.27671847,0.0032210443,0.70773983,0.006889948,0.0020951522],"about_ca_topic_score_codex":0.000006347457,"about_ca_topic_score_gemma":0.000038726263,"teacher_disagreement_score":0.8023306,"about_ca_system_score_codex":0.00033797402,"about_ca_system_score_gemma":0.0008120779,"threshold_uncertainty_score":0.99990785},"labels":[],"label_agreement":null},{"id":"W2564265628","doi":"10.1017/s0269888916000254","title":"Logic-based Benders decomposition for planning and scheduling: a computational analysis","year":2016,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Benders' decomposition; Scheduling (production processes); Mathematical optimization; Computer science; Implementation; Constraint programming; Integer programming; Job shop scheduling; Theoretical computer science; Operations research; Mathematics; Programming language; Schedule; Stochastic programming","score_opus":0.025606828449799106,"score_gpt":0.3048572922159124,"score_spread":0.2792504637661133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564265628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015339247,0.012772755,0.98450077,0.002155781,0.0000701833,0.00019792256,0.000002072191,0.00010133848,0.000045760287],"genre_scores_gemma":[0.6560736,0.0008335697,0.34247044,0.0004420524,0.00004835427,0.000079475794,0.000014492692,0.000010832267,0.000027229878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949914,0.000026008669,0.00015562396,0.0001572344,0.00006132421,0.00010068583],"domain_scores_gemma":[0.9992973,0.00040339064,0.000050322287,0.00013730988,0.000071830495,0.00003985172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030370857,0.000084717416,0.00014598038,0.00010022378,0.000078665784,0.000034849498,0.00013619165,0.000019388168,0.000009950769],"category_scores_gemma":[0.00008560388,0.00005187071,0.000078929275,0.00036993774,0.00001633887,0.000103736355,0.000025447676,0.000033324915,0.000005248427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004246486,0.000028901679,0.0005646143,0.00086564437,0.00025955518,9.329573e-7,0.00018834003,0.6939742,0.00019997763,0.06926845,0.00022200371,0.23442315],"study_design_scores_gemma":[0.00018909156,0.000013352112,0.0021522301,0.000611976,0.00010338574,0.000003753472,0.000001180843,0.99513555,0.000022046768,0.00033230276,0.0013390059,0.000096151525],"about_ca_topic_score_codex":2.0784823e-7,"about_ca_topic_score_gemma":5.3475475e-7,"teacher_disagreement_score":0.65592015,"about_ca_system_score_codex":0.00002907327,"about_ca_system_score_gemma":0.000026306001,"threshold_uncertainty_score":0.21152261},"labels":[],"label_agreement":null},{"id":"W2566425679","doi":"10.1609/aaai.v30i1.10433","title":"Counting-Based Search for Constraint Optimization Problems","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Benchmark (surveying); Constraint satisfaction problem; Mathematical optimization; Constraint (computer-aided design); Computation; Computer science; Constraint satisfaction; Constraint programming; Optimization problem; Counting problem; Constraint satisfaction dual problem; Adaptation (eye); Local search (optimization); Metaheuristic; Mathematics; Constraint logic programming; Algorithm; Artificial intelligence; Stochastic programming","score_opus":0.07479258741980677,"score_gpt":0.2882084655670942,"score_spread":0.2134158781472874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566425679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002767079,0.0000030389506,0.9829641,0.010808942,0.0002661455,0.0006789451,0.000011033695,0.00010722509,0.0023934883],"genre_scores_gemma":[0.9546933,0.0000147783285,0.04487992,0.00020172681,0.000034513945,0.000055414177,7.389007e-7,0.000010499859,0.00010907966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844974,0.000015159267,0.00045182282,0.00041251964,0.00038316587,0.0002876032],"domain_scores_gemma":[0.99805456,0.00019173534,0.00028286086,0.0002119412,0.0011878115,0.00007109886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703148,0.00016538308,0.00016986177,0.00013899132,0.00020156689,0.00020701542,0.0008928007,0.000081622835,0.00013169581],"category_scores_gemma":[0.00031463194,0.000105729334,0.00010319199,0.00042457273,0.00032417945,0.00040378122,0.000099824254,0.000100491336,0.000021815988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003402828,0.00006672291,0.0003451669,0.000037217203,0.000008328897,5.236103e-8,0.00020349855,0.015364145,0.017795054,0.8062575,0.000052927917,0.15983538],"study_design_scores_gemma":[0.00008003117,0.00013953897,0.000049678547,0.00023060286,0.000006009735,0.0000018526267,0.00008490822,0.63407105,0.3420971,0.022995539,0.0000809323,0.00016276946],"about_ca_topic_score_codex":0.000007839892,"about_ca_topic_score_gemma":0.000004548899,"teacher_disagreement_score":0.95192623,"about_ca_system_score_codex":0.000063223444,"about_ca_system_score_gemma":0.00020743567,"threshold_uncertainty_score":0.43115172},"labels":[],"label_agreement":null},{"id":"W2572009727","doi":"","title":"Bias in algorithm portfolio performance evaluation","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Solver; Computer science; Portfolio; Measure (data warehouse); Algorithm; Data mining","score_opus":0.17519415168197777,"score_gpt":0.33823255301065713,"score_spread":0.16303840132867936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572009727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028561095,0.0000050657904,0.94711185,0.0062776553,0.001549397,0.0002776771,0.00000785618,0.00011856781,0.016090838],"genre_scores_gemma":[0.9868424,0.00013011915,0.012304599,0.00029225962,0.000095195704,0.000054157183,0.0000068555746,0.000007913838,0.00026653084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976629,0.00011164324,0.0006214669,0.0005208,0.00082393974,0.00025927357],"domain_scores_gemma":[0.9986564,0.00011763447,0.00020438322,0.00034947545,0.00058315595,0.000088978566],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00087113975,0.00018240724,0.00015382092,0.00050709175,0.00006708644,0.00019912305,0.00061740074,0.000079268706,0.0019926638],"category_scores_gemma":[0.0003402191,0.00014436877,0.00006436353,0.00036553232,0.00009369105,0.00088064664,0.00010643717,0.00014543961,0.00080886146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010231851,0.000059778125,0.00054999115,7.454846e-7,0.0000060634015,0.000005272578,0.00010177889,0.00076988037,0.00091168354,0.1836926,0.000032330532,0.81385964],"study_design_scores_gemma":[0.00012842647,0.00009744522,0.009628385,0.00017656143,0.000002857879,0.000017786593,0.00007107798,0.9181352,0.03321419,0.037882235,0.0003664859,0.0002792939],"about_ca_topic_score_codex":0.000032037584,"about_ca_topic_score_gemma":0.00006112862,"teacher_disagreement_score":0.9582813,"about_ca_system_score_codex":0.00028377853,"about_ca_system_score_gemma":0.00023981497,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W2572760676","doi":"","title":"Using metric temporal logic to specify scheduling problems","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Temporal logic; Computer science; Linear temporal logic; Formalism (music); Theoretical computer science; Scheduling (production processes); Programming language; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.09561138242305982,"score_gpt":0.33751754286274355,"score_spread":0.24190616043968372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572760676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069534265,0.00026761196,0.9248355,0.00036454867,0.00020373764,0.00020356398,9.678016e-7,0.000082060775,0.004507767],"genre_scores_gemma":[0.73993623,0.00005949677,0.2596743,0.000013205207,0.000037849488,0.000004973992,7.719825e-7,0.000005914732,0.0002672694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895114,0.00007445231,0.00031246245,0.0003389249,0.000161253,0.00016174155],"domain_scores_gemma":[0.9991249,0.0001492156,0.00016900923,0.00023328814,0.00019882705,0.00012475059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032045858,0.000104959836,0.00016182299,0.00035269116,0.00011651649,0.00006610945,0.00017931925,0.000047015186,0.000024871053],"category_scores_gemma":[0.00043849053,0.00007772754,0.000046794088,0.0007277371,0.000048836733,0.0004058182,0.00021937685,0.0000483544,0.000014262822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022825625,0.00011635465,0.28651294,0.00010105925,0.000062251005,0.000005798284,0.0029840758,0.023044698,0.028771855,0.21686539,0.00001950091,0.44149324],"study_design_scores_gemma":[0.0020310292,0.0001528104,0.15090889,0.0010460934,0.00003724711,0.00013706114,0.00047285986,0.81434387,0.024827067,0.0020757318,0.0032341597,0.00073320104],"about_ca_topic_score_codex":0.000023470782,"about_ca_topic_score_gemma":0.000021603806,"teacher_disagreement_score":0.79129916,"about_ca_system_score_codex":0.000053873016,"about_ca_system_score_gemma":0.00007230935,"threshold_uncertainty_score":0.31696373},"labels":[],"label_agreement":null},{"id":"W2573071641","doi":"10.2991/icmmita-16.2016.102","title":"Heuristic Approaches for Minimum Weighted Latency Problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Latency (audio); Heuristic; Mathematical optimization; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.03217173585872935,"score_gpt":0.2237465985010759,"score_spread":0.19157486264234655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573071641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038350763,0.000007134015,0.9820859,0.004098951,0.00012500187,0.00023178513,0.0000020897094,0.00019733985,0.0128682805],"genre_scores_gemma":[0.52131706,0.000007614752,0.4729865,0.00013333227,0.000032546282,0.000049901155,0.0000020047826,0.0000056936124,0.005465331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994278,0.000014542798,0.00013059606,0.00021337884,0.00007647546,0.00013718309],"domain_scores_gemma":[0.99959123,0.00009356399,0.000039019593,0.00017860538,0.000048627488,0.000048960574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008827118,0.000066505316,0.000064942156,0.00005225867,0.000059021688,0.000046014113,0.00017561151,0.000032915024,0.00010431615],"category_scores_gemma":[0.000019623321,0.00004012011,0.00003508753,0.00010898068,0.000023280814,0.00025997567,0.000034865097,0.000016124102,0.000051395058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004164303,0.000026925665,0.00064251316,0.000009867915,0.000008693326,4.9087066e-7,0.00008216515,0.000014269117,0.000276293,0.50884056,0.0021140063,0.48798007],"study_design_scores_gemma":[0.0030048017,0.00027576386,0.007737153,0.00006545843,0.000019572171,0.000036371093,0.00004213088,0.77960354,0.004274694,0.17704763,0.02712314,0.00076974777],"about_ca_topic_score_codex":0.0000017505354,"about_ca_topic_score_gemma":0.0000056777135,"teacher_disagreement_score":0.7795893,"about_ca_system_score_codex":0.000016642784,"about_ca_system_score_gemma":0.00003661516,"threshold_uncertainty_score":0.16360506},"labels":[],"label_agreement":null},{"id":"W2573689326","doi":"10.1609/socs.v7i1.18410","title":"Searching for Real-Time Heuristic Search Algorithms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Beam search; Null-move heuristic; Iterative deepening depth-first search; Computer science; Consistent heuristic; Heuristic; Search algorithm; Best-first search; Scheduling (production processes); Combinatorial search; Algorithm; Depth-first search; Bidirectional search; Beam stack search; Hyper-heuristic; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.016073819418587185,"score_gpt":0.27212556171222463,"score_spread":0.2560517422936374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573689326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64984596,0.000038023976,0.046738576,0.09429593,0.024014207,0.0032138266,0.00013419265,0.0007072215,0.18101208],"genre_scores_gemma":[0.9850185,0.00005845482,0.012068799,0.0001533097,0.0005521617,0.00004187631,0.000012167453,0.000026277441,0.0020684514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776685,0.000032067095,0.00031390905,0.00043462834,0.0011645514,0.0002879945],"domain_scores_gemma":[0.9975977,0.00035813104,0.00010644802,0.00018932372,0.0016486056,0.00009979002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008056221,0.000137722,0.00017128346,0.00011296663,0.00025705923,0.0003772425,0.0013482819,0.000074436386,0.000056322773],"category_scores_gemma":[0.00032165178,0.00012023852,0.00015684614,0.00044214734,0.000079720616,0.00034878895,0.00060473295,0.00025599185,0.000021188727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094593015,0.00022156446,0.0009006606,0.00005087929,0.00007968206,0.0000018555397,0.00047264935,0.00079764606,0.14230375,0.8479031,0.000999998,0.006173671],"study_design_scores_gemma":[0.0032842082,0.00042555452,0.0030654299,0.0002625778,0.000023963075,0.00006451416,0.00016914362,0.34715816,0.5987872,0.041528087,0.0047384663,0.0004926866],"about_ca_topic_score_codex":0.00006205737,"about_ca_topic_score_gemma":0.0000010164172,"teacher_disagreement_score":0.80637497,"about_ca_system_score_codex":0.00022025766,"about_ca_system_score_gemma":0.00022271328,"threshold_uncertainty_score":0.49031845},"labels":[],"label_agreement":null},{"id":"W25763866","doi":"10.1371/journal.pone.0115657","title":"Regret-based utility elicitation in constraint-based decision problems","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Toronto","funders":"","keywords":"Regret; Preference elicitation; Mathematical optimization; Computer science; Preference; Heuristic; Constraint (computer-aided design); Minimax; Binary decision diagram; Optimization problem; Product (mathematics); Artificial intelligence; Machine learning; Mathematics; Theoretical computer science","score_opus":0.10050128863106629,"score_gpt":0.3222350740173838,"score_spread":0.22173378538631755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25763866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009845957,0.0000061762353,0.96670544,0.014295229,0.0007074375,0.0003751332,0.000014116721,0.00018992496,0.007860587],"genre_scores_gemma":[0.92090863,0.00000820427,0.07760141,0.0013032228,0.000069147754,0.000045716664,0.000025747882,0.000009876737,0.00002805528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972034,0.00012390019,0.0009202197,0.0006941757,0.0007407755,0.00031751933],"domain_scores_gemma":[0.99825007,0.00034214603,0.00026732893,0.0004512287,0.00055779674,0.00013140382],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006891488,0.0002563807,0.00022177803,0.00064483494,0.00010898047,0.00038406317,0.0007297554,0.00013218564,0.0012041829],"category_scores_gemma":[0.0005467143,0.00026129343,0.000113629525,0.0005104582,0.00020790155,0.00060456037,0.000049857463,0.00033600797,0.00046433386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049959486,0.00021914407,0.00044911838,0.0000040805107,0.0000047691356,0.0000063376233,0.00015867027,0.075823635,0.0009781494,0.24685189,0.000037428214,0.6754168],"study_design_scores_gemma":[0.00015752992,0.00008523933,0.002578448,0.0001895856,0.0000020990126,0.000004246266,0.00008774938,0.9500656,0.020958535,0.024969772,0.00063780363,0.00026340247],"about_ca_topic_score_codex":0.00007204872,"about_ca_topic_score_gemma":0.0007772833,"teacher_disagreement_score":0.91106266,"about_ca_system_score_codex":0.00026765993,"about_ca_system_score_gemma":0.00039582982,"threshold_uncertainty_score":0.9999839},"labels":[],"label_agreement":null},{"id":"W2577088067","doi":"10.1609/icaps.v26i1.13780","title":"Scheduling Ocean Color Observations for a GEO-Stationary Satellite","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Goddard Space Flight Center; Ministry of Education, India; Langley Research Center; Ames Research Center; National Aeronautics and Space Administration","keywords":"Remote sensing; Computer science; Radiometer; Satellite; Environmental science; Meteorology; Cloud cover; Scheduling (production processes); Real-time computing; Ocean color; Cloud computing; Geology; Geography; Aerospace engineering; Engineering; Mathematical optimization; Mathematics","score_opus":0.057705320826238644,"score_gpt":0.29025124259599255,"score_spread":0.23254592176975392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577088067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8288397,0.00004995416,0.14161484,0.025534108,0.0006506587,0.00040951773,0.000041104817,0.0006228695,0.0022372382],"genre_scores_gemma":[0.91451395,0.000030332498,0.084890015,0.00025256572,0.00003456222,0.000014745412,0.000005126268,0.000007892233,0.00025083227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989913,0.000007074672,0.00030189045,0.0002838003,0.00026200718,0.0001538968],"domain_scores_gemma":[0.9987198,0.00020892142,0.00028543212,0.00007921993,0.0006544477,0.000052148447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030070622,0.00012761338,0.00012443813,0.00014664143,0.00020570123,0.00019798867,0.00050096883,0.00006594593,0.0000073708693],"category_scores_gemma":[0.00042965592,0.00008682997,0.00005388384,0.0001675087,0.00006469554,0.0005408392,0.000107618594,0.00008710472,0.0000017924741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009391738,0.00005192143,0.04025753,0.000053092444,0.00010191938,6.419475e-7,0.00096862705,0.005045245,0.08338914,0.8588503,0.0003145772,0.010873093],"study_design_scores_gemma":[0.00056646514,0.000053924323,0.019278893,0.000605114,0.000010159917,0.000013603873,0.0002684793,0.9652285,0.0064656404,0.0070735374,0.00027653095,0.0001591388],"about_ca_topic_score_codex":0.00000265976,"about_ca_topic_score_gemma":4.7381272e-7,"teacher_disagreement_score":0.96018326,"about_ca_system_score_codex":0.000044181616,"about_ca_system_score_gemma":0.00008394776,"threshold_uncertainty_score":0.35408232},"labels":[],"label_agreement":null},{"id":"W2586483973","doi":"10.1016/j.procs.2017.01.141","title":"Causal Analysis of Airline Trajectory Preferences to Improve Airspace Capacity","year":2017,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"European Commission","keywords":"Computer science; Air traffic control; Workload; Trajectory; National Airspace System; Interdependence; Separation (statistics); Constraint (computer-aided design); Constraint programming; Range (aeronautics); Operations research; Air traffic management; Trajectory optimization; Free flight; Mathematical optimization; Simulation; Aerospace engineering","score_opus":0.02372190299875134,"score_gpt":0.2682412418537127,"score_spread":0.24451933885496133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586483973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17114758,0.000005064729,0.82660913,0.0006786818,0.0007669449,0.000168416,0.000006102513,0.000087462955,0.0005306217],"genre_scores_gemma":[0.7726878,0.0000033224371,0.22708592,0.0001337413,0.00005202197,0.000008804357,5.5915365e-7,0.0000025400263,0.000025304864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980749,0.000023034838,0.00026676522,0.0007148161,0.0005975922,0.00032290467],"domain_scores_gemma":[0.9978656,0.00005941385,0.0002960091,0.0010453954,0.0004930491,0.0002405004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006466727,0.00015030277,0.00027307734,0.0006172091,0.0005171305,0.0005491781,0.0023006997,0.00004207638,0.000013336354],"category_scores_gemma":[0.00020776456,0.00013603129,0.00008680513,0.0015017847,0.00046867406,0.0014756179,0.00062251434,0.00010417012,0.000010153723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022860833,0.00027512352,0.12172577,0.000083270985,0.0003025954,0.0000072577554,0.010318051,0.06251459,0.019019056,0.035043925,0.00044832742,0.7502392],"study_design_scores_gemma":[0.00012430255,0.00009926693,0.3379246,0.000011977109,0.00003423741,0.0000023208272,0.000008188599,0.65527004,0.0060873316,0.0002026622,0.000060139486,0.0001749564],"about_ca_topic_score_codex":0.00011935938,"about_ca_topic_score_gemma":0.00026124282,"teacher_disagreement_score":0.7500642,"about_ca_system_score_codex":0.000057252335,"about_ca_system_score_gemma":0.00035285426,"threshold_uncertainty_score":0.5547195},"labels":[],"label_agreement":null},{"id":"W2593220893","doi":"10.1142/s0218213017600041","title":"Exact and Hybrid Solutions for the Multi-Objective VM Reassignment Problem","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"Science Foundation Ireland","keywords":"Computer science; Mathematical optimization; Metaheuristic; Solver; Integer programming; Context (archaeology); Linear programming; Heuristic; Constraint programming; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.1038246961650876,"score_gpt":0.34661481742437705,"score_spread":0.24279012125928945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593220893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011239507,0.00006213642,0.9865174,0.010456813,0.0013752126,0.00022801533,0.000014048471,0.000012626398,0.00020976711],"genre_scores_gemma":[0.9343732,0.00016483075,0.06495406,0.00014851888,0.00027055098,0.000014503374,0.0000010234558,0.000005173377,0.00006814918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889594,0.00003408168,0.00043154837,0.00015493916,0.0003265885,0.00015692666],"domain_scores_gemma":[0.9980524,0.00037006816,0.0005718604,0.00022366484,0.00071656966,0.00006543797],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075527036,0.00009263371,0.000109834364,0.00010002425,0.0005717055,0.0011347351,0.0010003812,0.000027240045,0.000031244108],"category_scores_gemma":[0.00065771415,0.00006801778,0.00010304317,0.000032045748,0.00016081003,0.0011939178,0.00018041322,0.00013971163,0.000007432344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047163456,0.00006654391,0.00016676533,0.0000016813236,0.00010099861,0.000009736465,0.0004303258,0.0047237244,0.0005930392,0.09647484,0.00016190908,0.8972233],"study_design_scores_gemma":[0.00041432012,0.0003464091,0.013837134,0.0001579325,0.000060965613,0.0005456413,0.00090846635,0.863197,0.022549063,0.091773726,0.0058366824,0.00037264623],"about_ca_topic_score_codex":0.00002950183,"about_ca_topic_score_gemma":0.00004680333,"teacher_disagreement_score":0.93324924,"about_ca_system_score_codex":0.00008691169,"about_ca_system_score_gemma":0.00012568147,"threshold_uncertainty_score":0.9999022},"labels":[],"label_agreement":null},{"id":"W2593872908","doi":"10.1051/ro/2017011","title":"Lower and upper bounds for the linear arrangement problem on interval graphs","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Interval graph; Intersection graph; Mathematics; Interval (graph theory); Combinatorics; Indifference graph; Graph; Intersection (aeronautics); Upper and lower bounds; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Mathematical analysis","score_opus":0.09050988374062498,"score_gpt":0.39536974454451657,"score_spread":0.3048598608038916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593872908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02118418,0.00006550426,0.906833,0.063475534,0.00053433777,0.0017717498,0.000016381076,0.000071664865,0.0060476544],"genre_scores_gemma":[0.95993596,0.000106485,0.03491904,0.0002861926,0.00010361059,0.00034169274,0.000005906327,0.000009798707,0.004291285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989961,0.00007490602,0.00013153793,0.00026813283,0.0003130613,0.00021626438],"domain_scores_gemma":[0.9988081,0.00016688599,0.000017638247,0.00065383577,0.00029067683,0.000062886],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009219897,0.00007447045,0.00006816836,0.00012742296,0.0025961436,0.0013866664,0.00055206986,0.000037567283,0.000068707115],"category_scores_gemma":[0.00021078852,0.000051169638,0.000042740623,0.00010971331,0.00022287366,0.00045254754,0.00020880329,0.00018620372,0.000031709773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063665786,0.00021428088,0.0014275351,0.000028368931,0.0000803636,0.0000028135787,0.0023630757,0.008645203,0.00076546037,0.6700945,0.011616695,0.30469805],"study_design_scores_gemma":[0.0009314272,0.00044054855,0.016337184,0.00004561476,0.0000061615747,0.0000058116566,0.00016903866,0.92477906,0.0006031711,0.0022770348,0.054225408,0.00017955502],"about_ca_topic_score_codex":0.00007777078,"about_ca_topic_score_gemma":0.00041704762,"teacher_disagreement_score":0.9387518,"about_ca_system_score_codex":0.000035928893,"about_ca_system_score_gemma":0.00009668723,"threshold_uncertainty_score":0.99965},"labels":[],"label_agreement":null},{"id":"W2597306717","doi":"","title":"Robust Satisfiability of Constraint Satisfaction Problems.","year":2011,"lang":"en","type":"article","venue":"Homo Politicus (Academy of Humanities and Economics in Lodz)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Backtracking; Constraint satisfaction; Complexity of constraint satisfaction; Constraint satisfaction dual problem; Conjecture; Fraction (chemistry); Mathematics; Satisfiability; Characterization (materials science); Combinatorics; Constraint learning; Local consistency; Discrete mathematics; Computer science; Mathematical optimization; Statistics","score_opus":0.0841047064910663,"score_gpt":0.22302690649129117,"score_spread":0.13892220000022487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597306717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9635185,0.00014551362,0.0111746015,0.00021687057,0.00018840184,0.00033531434,0.000045891346,0.0000493109,0.024325622],"genre_scores_gemma":[0.98878074,0.00028156937,0.010754247,0.00010766549,0.00001992939,0.00001000423,0.0000015953731,0.0000071705686,0.00003707234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987567,0.000049831942,0.0006282641,0.00027117098,0.000060090442,0.00023395923],"domain_scores_gemma":[0.9994066,0.00009057474,0.00026663335,0.0001507171,0.000034937653,0.00005054723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031587234,0.0001380003,0.0002910726,0.0002187565,0.00006314327,0.000032178723,0.00017522856,0.000110468995,0.00019712649],"category_scores_gemma":[0.000021352304,0.00015298866,0.00005453799,0.00006231838,0.00048234308,0.000523475,0.00009191097,0.0001574892,0.0000023616944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056095328,0.000031477255,0.040603045,0.00010215736,0.000016522628,2.5446465e-7,0.0031451895,0.00060540676,0.000019121333,0.94562054,0.000013642998,0.009837064],"study_design_scores_gemma":[0.0011361757,0.00019417907,0.7834046,0.00012467365,0.00002195663,0.000054189433,0.0026909383,0.014416054,0.0023971577,0.19468406,0.0003963705,0.00047964696],"about_ca_topic_score_codex":0.0008308161,"about_ca_topic_score_gemma":0.0005220329,"teacher_disagreement_score":0.75093645,"about_ca_system_score_codex":0.000083745515,"about_ca_system_score_gemma":0.000063397965,"threshold_uncertainty_score":0.6238697},"labels":[],"label_agreement":null},{"id":"W2604296014","doi":"10.1609/aaai.v31i1.11143","title":"Getting More Out of the Exposed Structure in Constraint Programming Models of Combinatorial Problems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Constraint (computer-aided design); Mathematical optimization; Computer science; Set (abstract data type); Key (lock); Computation; Combinatorial optimization; Theoretical computer science; Constraint satisfaction; Constraint logic programming; Mathematics; Algorithm; Stochastic programming; Artificial intelligence; Programming language","score_opus":0.0762784727144263,"score_gpt":0.29231251834197863,"score_spread":0.21603404562755235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604296014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.929774,0.000016380834,0.05635506,0.0045567323,0.0022043802,0.0018338471,0.00001938881,0.0000636745,0.0051765377],"genre_scores_gemma":[0.9953001,0.0000066967245,0.00461343,0.000023652181,0.000025935908,0.00001067975,2.3080902e-7,0.0000069439307,0.000012335088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827415,0.000021839722,0.000682575,0.0003189301,0.0004750269,0.00022747197],"domain_scores_gemma":[0.99762577,0.000055044206,0.0011799508,0.00044932737,0.0006491239,0.00004079919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043314244,0.00017011775,0.00028217165,0.00009035254,0.00023094632,0.00018556177,0.0020516205,0.000103649356,0.00001209928],"category_scores_gemma":[0.0005005587,0.00011655442,0.00011123654,0.00023549722,0.0007478646,0.00050418533,0.00043530832,0.00029453894,6.554969e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027553024,0.00009137236,0.0031081233,0.00008831423,0.000012778151,1.4229813e-7,0.005435238,0.0026957027,0.06390702,0.80618745,0.0000030903434,0.11844323],"study_design_scores_gemma":[0.00010791505,0.000083082894,0.0012337948,0.00059717265,0.00000964801,0.0000020928694,0.0011817749,0.28113496,0.52948844,0.18598792,0.0000057176308,0.00016749692],"about_ca_topic_score_codex":0.000072175535,"about_ca_topic_score_gemma":0.000047575322,"teacher_disagreement_score":0.6201995,"about_ca_system_score_codex":0.000034795346,"about_ca_system_score_gemma":0.00016751845,"threshold_uncertainty_score":0.47529516},"labels":[],"label_agreement":null},{"id":"W2605022915","doi":"10.1609/aaai.v31i1.10640","title":"What's Hot at CPAIOR (Extended Abstract)","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Constraint programming; Operations research; Computer science; Order (exchange); Engineering; Business; Mathematical optimization; Mathematics; Stochastic programming","score_opus":0.08394019557605761,"score_gpt":0.3129034657129764,"score_spread":0.22896327013691878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605022915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73979837,0.00007809824,0.062190287,0.057474524,0.009397989,0.0019523692,0.000015868816,0.00060931593,0.1284832],"genre_scores_gemma":[0.99641585,0.0001194197,0.0022468574,0.00021362997,0.00006032374,0.000014891236,3.6592908e-7,0.000008969498,0.00091970863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835163,0.000007778731,0.0004324346,0.00046358744,0.0004585197,0.000286071],"domain_scores_gemma":[0.99801666,0.000053995984,0.0006747627,0.0006071179,0.00054459576,0.00010288248],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038663304,0.00019610798,0.00020344702,0.000089490684,0.0007736001,0.0015554728,0.0024278243,0.00009530692,0.000322468],"category_scores_gemma":[0.00044187641,0.00015335137,0.00012361498,0.00015350059,0.00040122384,0.0019691086,0.0005980022,0.0002271128,0.00021547837],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005153498,0.00008223574,0.00044389704,0.000019596111,0.000013192041,8.2407695e-7,0.00081170327,0.00004035315,0.02237197,0.67783695,0.000231442,0.2980963],"study_design_scores_gemma":[0.00007736797,0.00014824628,0.02339295,0.00039467,0.000017191374,0.000016261309,0.0007112198,0.06299443,0.79662377,0.11464499,0.00051362993,0.00046525444],"about_ca_topic_score_codex":0.00003037626,"about_ca_topic_score_gemma":0.000044572622,"teacher_disagreement_score":0.7742518,"about_ca_system_score_codex":0.0000636047,"about_ca_system_score_gemma":0.00008386823,"threshold_uncertainty_score":0.999481},"labels":[],"label_agreement":null},{"id":"W2605041732","doi":"10.1109/focs.2017.37","title":"A Dichotomy Theorem for Nonuniform CSPs","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Mathematical economics; Calculus (dental); Pure mathematics","score_opus":0.027278464091534425,"score_gpt":0.2880112279968599,"score_spread":0.26073276390532546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605041732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009407913,0.000015138824,0.9092769,0.0019148812,0.0011884324,0.0005995975,0.000013447599,0.0002711799,0.08662636],"genre_scores_gemma":[0.314556,0.000083677376,0.67518306,0.0007069326,0.00026196428,0.0002967197,0.00006147721,0.00002330626,0.008826895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999013,0.000015574475,0.00019211543,0.00044239004,0.00015378898,0.0001831409],"domain_scores_gemma":[0.9983665,0.000069373215,0.00021497185,0.0011196303,0.00015185944,0.0000776613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025331817,0.00017095926,0.00018610485,0.000103060454,0.00021851559,0.0006596661,0.0011280078,0.00018020209,0.00012204379],"category_scores_gemma":[0.000073932744,0.00014810791,0.00015279009,0.000030924108,0.000050875926,0.0002589339,0.00071770727,0.00019394897,0.000035145375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006869364,0.000024536428,0.00023516097,0.00006634644,0.000040999985,0.0000024251406,0.00028840677,0.0009439298,0.000011184988,0.6762317,0.0035680586,0.31858042],"study_design_scores_gemma":[0.00065496954,0.00003738211,0.0020867328,0.000088757886,0.000020104255,0.0000135549235,0.000017344646,0.7590953,0.0004144564,0.19593352,0.041078325,0.0005595561],"about_ca_topic_score_codex":0.000030353274,"about_ca_topic_score_gemma":0.000051074632,"teacher_disagreement_score":0.75815135,"about_ca_system_score_codex":0.00004578135,"about_ca_system_score_gemma":0.00021260374,"threshold_uncertainty_score":0.6361175},"labels":[],"label_agreement":null},{"id":"W2606659033","doi":"10.71781/9814","title":"Mise à jour de la famille des générateurs minimaux des treillis de concepts et des icebergs","year":2004,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.04921838958408964,"score_gpt":0.3591252824856087,"score_spread":0.30990689290151907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606659033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7785584,0.00089115126,0.12696435,0.00018088562,0.00041312142,0.0005740486,0.00006204255,0.000016473345,0.09233953],"genre_scores_gemma":[0.5071699,0.0017828803,0.46786284,0.00019306733,0.00007375727,0.00006093822,0.00025996665,0.000061305174,0.022535354],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9969586,0.0007227388,0.0005666979,0.00076143123,0.00030582244,0.000684719],"domain_scores_gemma":[0.99799424,0.0003867504,0.0003875237,0.00036899655,0.0004531149,0.0004093601],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009818529,0.00048687856,0.0004484989,0.0002040619,0.000827257,0.0022598188,0.0010835562,0.00048041157,0.0024584096],"category_scores_gemma":[0.00040760686,0.00055213977,0.00018895346,0.0006248298,0.00095112686,0.0016286,0.00016466908,0.0004460486,0.00027859714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094301184,0.00024144084,0.00981069,0.00012430831,0.000112148984,0.0001547611,0.12067579,0.024878832,0.0024097813,0.0023735503,0.00016249642,0.8389619],"study_design_scores_gemma":[0.01134285,0.0011896875,0.5847801,0.008324326,0.00095882843,0.0023328548,0.11335748,0.11927195,0.07485041,0.02850863,0.049488734,0.0055941446],"about_ca_topic_score_codex":0.0033480015,"about_ca_topic_score_gemma":0.014248868,"teacher_disagreement_score":0.83336776,"about_ca_system_score_codex":0.0006744038,"about_ca_system_score_gemma":0.0027322704,"threshold_uncertainty_score":0.99969304},"labels":[],"label_agreement":null},{"id":"W2610653637","doi":"","title":"Une preuve formelle de l'algorithme de Tarjan-1972 pour trouver les composantes fortement connexes dans un graphe","year":2017,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Combinatorics; Humanities; Mathematics; Philosophy","score_opus":0.02136758383861038,"score_gpt":0.24256107447815398,"score_spread":0.2211934906395436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610653637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03077787,0.0009264087,0.90557015,0.029334404,0.00060863834,0.00084027706,0.0001396968,0.00033429306,0.031468254],"genre_scores_gemma":[0.6300244,0.0016697291,0.35205615,0.00017391787,0.00006204461,0.00012430457,0.00029487265,0.00006101886,0.0155336065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99110293,0.004890745,0.0010250635,0.0013211577,0.00068433513,0.0009757669],"domain_scores_gemma":[0.9910244,0.0016518146,0.0013509066,0.0031830647,0.0022785598,0.00051127316],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005941748,0.00070805236,0.00067837775,0.00027008142,0.0020923153,0.0016111141,0.0031313573,0.0005540629,0.00045990545],"category_scores_gemma":[0.0010896643,0.0007993964,0.0005138792,0.00044880903,0.00090111437,0.00070469745,0.0018964792,0.0009830708,0.00006611348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029446635,0.0012285393,0.029311981,0.00027189436,0.00040646928,0.00003199236,0.04966701,0.003338459,0.0044859243,0.53396565,0.0018621514,0.37540048],"study_design_scores_gemma":[0.0021712938,0.0000042980328,0.07734657,0.0029024393,0.00022174629,0.00017489247,0.0014050982,0.8086026,0.05048036,0.037440594,0.017858852,0.0013913064],"about_ca_topic_score_codex":0.013897429,"about_ca_topic_score_gemma":0.016989522,"teacher_disagreement_score":0.8052641,"about_ca_system_score_codex":0.00066273514,"about_ca_system_score_gemma":0.0012076087,"threshold_uncertainty_score":0.9994457},"labels":[],"label_agreement":null},{"id":"W2615489195","doi":"","title":"The Complexity of Integer Bound Propagation","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Search tree; Constraint (computer-aided design); Set (abstract data type); Integer (computer science); Fixed point; Tree (set theory); Constraint satisfaction problem; Local consistency; Upper and lower bounds; Time complexity; Polynomial; Algorithm; Discrete mathematics; Computer science; Combinatorics; Search algorithm","score_opus":0.4425624707903778,"score_gpt":0.4107181668670509,"score_spread":0.03184430392332688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615489195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068061063,0.000030305491,0.9810397,0.0014152925,0.00023132583,0.00026423804,7.379492e-7,0.00004511604,0.010167172],"genre_scores_gemma":[0.9923671,0.00004174553,0.0074342196,0.000013446847,0.000025229354,0.00001572301,7.179501e-7,0.0000036245758,0.00009820752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847347,0.00025859626,0.00031678897,0.00020443983,0.00047532434,0.00027136764],"domain_scores_gemma":[0.9985803,0.0002429274,0.00006723873,0.00041184714,0.0006367532,0.00006095012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019283715,0.00005933626,0.00007131623,0.00013253427,0.00044778775,0.00014240146,0.0006721847,0.000038649065,0.00015852886],"category_scores_gemma":[0.00038275833,0.000042760348,0.000038054106,0.00078114046,0.0012746324,0.00029775233,0.0001754256,0.00022438607,0.0001738262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012112322,0.00003271643,0.00009709841,0.000002700525,0.0000037180234,7.584666e-7,0.0011647566,0.000019903882,0.0007463243,0.7500231,0.00003926484,0.2478575],"study_design_scores_gemma":[0.000011536451,0.00012355433,0.0014450852,0.000013977416,0.00000119068,0.000004159043,0.0011302829,0.15273745,0.18309464,0.66101086,0.0003428746,0.00008440005],"about_ca_topic_score_codex":0.0002999059,"about_ca_topic_score_gemma":0.00043776765,"teacher_disagreement_score":0.98556095,"about_ca_system_score_codex":0.000041080686,"about_ca_system_score_gemma":0.00014490781,"threshold_uncertainty_score":0.46964362},"labels":[],"label_agreement":null},{"id":"W2621333565","doi":"","title":"Solving the clique partitioning problem as a maximally diverse grouping problem","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Clique; Variable neighborhood search; Heuristic; Mathematical optimization; Mathematics; Local search (optimization); Computer science; Metaheuristic; Combinatorics","score_opus":0.01734099212668329,"score_gpt":0.2219894169001398,"score_spread":0.20464842477345652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621333565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02354145,0.0000477681,0.95292026,0.0063202153,0.0002759416,0.00033914964,0.0000010607315,0.00033965334,0.016214507],"genre_scores_gemma":[0.77193403,0.000037827824,0.2259413,0.0015077154,0.00011535549,0.000052210664,0.0000061280552,0.000013718322,0.00039169233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988438,0.0001270941,0.00022812998,0.00025935305,0.00027039123,0.00027123562],"domain_scores_gemma":[0.9992476,0.000075862234,0.00013144307,0.000272427,0.00014108136,0.00013159547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285442,0.00013595232,0.000111647765,0.00008855231,0.0005399326,0.00039211148,0.00037719475,0.00008618608,0.000029821682],"category_scores_gemma":[0.00008349418,0.00011097746,0.00006197778,0.0003367107,0.00013975603,0.0007111618,0.00012730857,0.00026552437,0.00007159221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010937939,0.000028164819,0.0038185383,0.000015762973,0.000028081051,0.000028134726,0.017177956,0.0043714764,0.00013472437,0.9290339,0.001330974,0.04402137],"study_design_scores_gemma":[0.0048624044,0.00068937294,0.014769749,0.0004111085,0.0001127025,0.0013259584,0.014044926,0.37676695,0.0014316703,0.5034299,0.07975237,0.0024028916],"about_ca_topic_score_codex":0.00016215062,"about_ca_topic_score_gemma":0.0000994974,"teacher_disagreement_score":0.7483926,"about_ca_system_score_codex":0.00015776497,"about_ca_system_score_gemma":0.00015291014,"threshold_uncertainty_score":0.45255297},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10572874360278885,"score_gpt":0.38882664250124305,"score_spread":0.2830978988984542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2717681899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2978967,0.000013919492,0.68321395,0.0006342831,0.0001977496,0.00021433237,0.0000018355548,0.000022025439,0.017805206],"genre_scores_gemma":[0.99167657,0.000030254672,0.008075251,0.00012943677,0.000014630669,0.000010888435,0.0000015395776,0.0000017634911,0.00005968157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989897,0.00003866315,0.00015742949,0.00041319276,0.00023496372,0.00016603348],"domain_scores_gemma":[0.99936044,0.00013372634,0.0001074753,0.0001422417,0.00020743019,0.000048682898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004897785,0.00006987661,0.000090799556,0.0002546601,0.0003030864,0.00041179225,0.0002735259,0.00003057015,0.000006098434],"category_scores_gemma":[0.0006343105,0.00007569624,0.000010951482,0.00037991974,0.00048117337,0.00232601,0.00021363313,0.00010661972,0.000003087839],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012249518,0.000045845103,0.101084806,0.0000054067364,0.0000021386454,0.000028258835,0.0035587545,0.001792478,0.00009841158,0.033390477,0.000003205036,0.85997796],"study_design_scores_gemma":[0.00053797144,0.000017215618,0.47268432,0.00006738566,0.0000012313759,0.0000069449056,0.00028024134,0.5015546,0.00047589678,0.024286492,9.3938013e-7,0.00008672067],"about_ca_topic_score_codex":0.0001120589,"about_ca_topic_score_gemma":0.00023908861,"teacher_disagreement_score":0.85989124,"about_ca_system_score_codex":0.00004523455,"about_ca_system_score_gemma":0.00010431244,"threshold_uncertainty_score":0.39709222},"labels":[],"label_agreement":null},{"id":"W2737699254","doi":"10.1613/jair.5306","title":"Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Keck Institute for Space Studies; Natural Sciences and Engineering Research Council of Canada; Government of Canada; California Institute of Technology; Massachusetts Institute of Technology","keywords":"Computer science; Constraint programming; Scheduling (production processes); Automated planning and scheduling; Timeline; Robot; Solver; Constraint satisfaction; Operations research; Distributed computing; Mathematical optimization; Artificial intelligence; Programming language","score_opus":0.19464905447823935,"score_gpt":0.44034238049091196,"score_spread":0.2456933260126726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737699254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12691024,0.00025358915,0.86835235,0.0033413174,0.0002328562,0.00032753573,7.3320615e-7,0.0000060900165,0.00057530974],"genre_scores_gemma":[0.9594288,0.00010018724,0.040348977,0.000024115323,0.00006803563,0.0000074385543,9.108088e-8,0.000004839757,0.000017510269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997994,0.00018096878,0.00060335494,0.00019700537,0.0007392049,0.00028546414],"domain_scores_gemma":[0.9982085,0.00038974403,0.00035442307,0.00032585644,0.0005865941,0.00013487785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00391376,0.00008556084,0.00020765868,0.00050766085,0.00046401695,0.00045636384,0.00080577057,0.00005116539,0.000010795614],"category_scores_gemma":[0.0015202655,0.00006735938,0.000049198992,0.00038572375,0.00021111552,0.0005260041,0.00032582393,0.0004972341,0.000005215164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012463822,0.00009087044,0.016987098,0.000028913639,0.000026911632,0.000044816235,0.00385809,0.16769335,0.0066358503,0.00977388,0.00004454393,0.794691],"study_design_scores_gemma":[0.00022284992,0.0009835041,0.11245522,0.001741539,0.00001302994,0.00009346867,0.0111224055,0.80840474,0.052951653,0.011318224,0.00032513484,0.00036823956],"about_ca_topic_score_codex":0.000069665904,"about_ca_topic_score_gemma":0.00008794104,"teacher_disagreement_score":0.8325186,"about_ca_system_score_codex":0.00011149396,"about_ca_system_score_gemma":0.00022487223,"threshold_uncertainty_score":0.4400727},"labels":[],"label_agreement":null},{"id":"W2738937907","doi":"10.1609/aimag.v24i1.1694","title":"The fifth symposium on abstraction, reformulation, and approximation (SARA-2002)","year":2003,"lang":"en","type":"article","venue":"AI Magazine","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Abstraction; Computer science; Constraint programming; Constraint satisfaction; Scheduling (production processes); Constraint (computer-aided design); Constraint satisfaction problem; Artificial intelligence; Operations research; Mathematical economics; Theoretical computer science; Mathematics education; Mathematics; Mathematical optimization; Epistemology; Philosophy","score_opus":0.0076671345304081436,"score_gpt":0.22671531230180064,"score_spread":0.2190481777713925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738937907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055260384,0.00007792748,0.9172785,0.016727518,0.0007561442,0.00038003444,0.0000018058736,0.00024510585,0.059006926],"genre_scores_gemma":[0.98351836,0.00014953324,0.0115530165,0.0012812997,0.000053797223,0.000019383582,0.0000071935633,0.000010117917,0.0034073046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928015,0.000047472076,0.00018126646,0.00019781323,0.00016482838,0.00012848507],"domain_scores_gemma":[0.99941325,0.000080036836,0.0000834021,0.00027460532,0.00010183835,0.0000468892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025546845,0.000088016,0.000059514772,0.000058235873,0.00031295608,0.00020141553,0.00009958157,0.00004102083,0.000046584402],"category_scores_gemma":[0.00006362592,0.00006415046,0.00001987375,0.00020576818,0.000034722518,0.00047894326,0.000016348233,0.000097406606,0.00016705133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017987071,0.000068739304,0.0016330526,0.000014887832,0.000022998622,0.000002624042,0.0005958006,0.008380534,0.0013724131,0.85456663,0.009796837,0.12352747],"study_design_scores_gemma":[0.0013469878,0.00020295297,0.1341923,0.00003128558,0.000016190657,0.00013635725,0.000048194983,0.28367114,0.0023136758,0.01849895,0.5590429,0.000499087],"about_ca_topic_score_codex":0.000002488082,"about_ca_topic_score_gemma":0.000014904885,"teacher_disagreement_score":0.9779923,"about_ca_system_score_codex":0.00003621318,"about_ca_system_score_gemma":0.0000316995,"threshold_uncertainty_score":0.261598},"labels":[],"label_agreement":null},{"id":"W2740968888","doi":"10.24963/ijcai.2017/726","title":"Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots (Extended Abstract)","year":2017,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Scheduling (production processes); Computer science; Constraint programming; Robotics; Robot; Automated planning and scheduling; Artificial intelligence; Motion planning; Constraint (computer-aided design); Operations research; Distributed computing; Industrial engineering; Human–computer interaction; Mathematical optimization; Engineering; Mathematics","score_opus":0.033173801095417475,"score_gpt":0.3033306277825641,"score_spread":0.27015682668714663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740968888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08157371,0.00009000878,0.90333456,0.0017381327,0.0001961374,0.00056092534,0.0000015081737,0.000067975314,0.012437018],"genre_scores_gemma":[0.89267766,0.000010053555,0.10707926,0.00011143183,0.000012032262,0.000024020741,6.665199e-7,0.000004280403,0.00008059144],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990597,0.00002089615,0.0002604099,0.00028407565,0.00020078065,0.0001741738],"domain_scores_gemma":[0.9992013,0.00007945438,0.00018416534,0.0004033133,0.000060026687,0.00007174048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037868798,0.00010583025,0.00015466713,0.00012205939,0.0002737468,0.00024625778,0.00036397207,0.000042648426,0.000013965442],"category_scores_gemma":[0.00014069714,0.000086095264,0.000026566211,0.000104973034,0.000057137993,0.00040906508,0.00022765085,0.00011497378,0.0000037652276],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043353397,0.0001044389,0.1098695,0.00006180606,0.00004982153,0.000020281252,0.0036121372,0.21404155,0.003798379,0.016239177,0.00014158776,0.65201795],"study_design_scores_gemma":[0.0004141436,0.00003786863,0.83087814,0.00015967208,0.000004253019,0.000005629389,0.00045527043,0.16654314,0.0010744323,0.00019612489,0.00007937782,0.00015192805],"about_ca_topic_score_codex":0.00008850912,"about_ca_topic_score_gemma":0.00012976295,"teacher_disagreement_score":0.81110394,"about_ca_system_score_codex":0.00004408578,"about_ca_system_score_gemma":0.000052156745,"threshold_uncertainty_score":0.3510863},"labels":[],"label_agreement":null},{"id":"W2748627688","doi":"10.1007/978-3-319-66167-4_6","title":"Pushing the Boundaries of Reasoning About Qualified Cardinality Restrictions","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Satisfiability; Cardinality (data modeling); Integer programming; Scalability; Answer set programming; Set (abstract data type); Integer (computer science); Automated reasoning; Theoretical computer science; Linear programming; Architecture; Column generation; Mathematical optimization; Algorithm; Programming language; Mathematics; Data mining","score_opus":0.025759379115844055,"score_gpt":0.277529945164877,"score_spread":0.2517705660490329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748627688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005314949,0.00025249994,0.985271,0.0017504424,0.0020279866,0.00023815008,0.000006642745,0.00008710393,0.010313027],"genre_scores_gemma":[0.7016672,0.00014045283,0.29650116,0.0005461664,0.0004322986,0.000010874973,0.000006088121,0.0000266308,0.0006691256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975969,0.00006447669,0.00047410766,0.0007634498,0.00076860155,0.00033242098],"domain_scores_gemma":[0.99686086,0.00044339502,0.0006075697,0.001674022,0.00033321336,0.00008094148],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013199624,0.00028189435,0.00037292874,0.00036596565,0.0014547274,0.0017079875,0.002389784,0.00019242892,0.000015348487],"category_scores_gemma":[0.00043651977,0.00022202793,0.0001416998,0.00025512115,0.0019390091,0.00071555254,0.00074509566,0.0006414768,0.000005705048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005697496,0.000011377539,0.00061859767,0.00003114885,0.000026055508,0.000015464964,0.002702684,0.040107362,0.000041540898,0.25428388,0.00006208251,0.7020941],"study_design_scores_gemma":[0.0005523742,0.0001555848,0.015152067,0.0013119887,0.000053130603,0.00019795516,0.000003495491,0.6975761,0.00096677395,0.25965917,0.023100274,0.0012710514],"about_ca_topic_score_codex":0.00028604266,"about_ca_topic_score_gemma":0.00061816035,"teacher_disagreement_score":0.701614,"about_ca_system_score_codex":0.0001708489,"about_ca_system_score_gemma":0.0010383553,"threshold_uncertainty_score":0.99984527},"labels":[],"label_agreement":null},{"id":"W2757817310","doi":"","title":"Non-local Right Node Raising: an Analysis using Delayed Tree-Local MC-TAG","year":2010,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Contraction (grammar); Tree (set theory); Locality; Mathematics; Tree structure; Algorithm; Computer science; Combinatorics; Binary tree","score_opus":0.013825717419724699,"score_gpt":0.2660343578258076,"score_spread":0.2522086404060829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757817310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0818433,0.0000015685092,0.9133726,0.00027914532,0.0003791266,0.00007161892,0.0000015806528,0.00019683194,0.0038542654],"genre_scores_gemma":[0.80960596,6.934887e-7,0.18987411,0.00031645622,0.00004697187,0.0000016181273,0.000010390633,0.000006934918,0.00013688738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986531,0.000041903397,0.0002871512,0.00046310734,0.00028387737,0.00027086036],"domain_scores_gemma":[0.9989275,0.000039636827,0.000088648376,0.0005961936,0.00012769416,0.00022037663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023321876,0.00016266028,0.00020827951,0.00036171803,0.00023749683,0.00025837802,0.00041271833,0.00012934594,0.0008071154],"category_scores_gemma":[0.0000101151545,0.00014387918,0.00014029487,0.0010641336,0.00013161206,0.0008185011,0.00008929954,0.00021709625,0.00003763925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034009194,0.0002963963,0.019294186,0.000006444464,0.0004523626,0.000057968,0.0011929073,0.37228486,0.015040436,0.040494688,0.0002854211,0.55056036],"study_design_scores_gemma":[0.0002862443,0.000024226807,0.010140616,0.0000014848605,0.00007639094,0.000024937632,0.000048395115,0.98658335,0.0021765549,0.00017694828,0.00025071992,0.00021009997],"about_ca_topic_score_codex":0.00052765926,"about_ca_topic_score_gemma":0.0042050662,"teacher_disagreement_score":0.72776264,"about_ca_system_score_codex":0.000049524428,"about_ca_system_score_gemma":0.00010703933,"threshold_uncertainty_score":0.88373476},"labels":[],"label_agreement":null},{"id":"W2768278295","doi":"10.1109/focs.2017.19","title":"Random Θ(log n)-CNFs Are Hard for Cutting Planes","year":2017,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Benchmark (surveying); Combinatorics; Exponential function; Probability distribution; Binary logarithm; Distribution (mathematics); Mathematics; Computer science; Discrete mathematics; Algorithm; Statistics; Mathematical analysis","score_opus":0.03328536348223558,"score_gpt":0.2718105256040718,"score_spread":0.23852516212183622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768278295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015264467,0.0000068918307,0.9841585,0.0031957761,0.00051276933,0.00015676251,0.000002566104,0.00013124841,0.010309026],"genre_scores_gemma":[0.742451,0.0000103923185,0.25311425,0.0005295422,0.0001320204,0.000022936114,0.000003830139,0.000005612637,0.0037304019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995365,0.000009616575,0.00009900858,0.0001682211,0.00007269964,0.00011391786],"domain_scores_gemma":[0.9993658,0.00007799641,0.00011772568,0.0003458317,0.00005384063,0.000038807884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014066038,0.00005762293,0.00008523427,0.000030673476,0.00045240662,0.00039456863,0.00034069165,0.000030086181,0.00006002618],"category_scores_gemma":[0.00015251717,0.00004898778,0.00004176402,0.000018007415,0.00002444377,0.0004090395,0.00006354508,0.000031226456,0.000026103366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007509436,0.000048358954,0.095120095,0.00005658513,0.000057688852,0.000013079096,0.00065811333,0.0022606913,0.00051718595,0.1472725,0.023113092,0.73080754],"study_design_scores_gemma":[0.0050396486,0.000048252503,0.14070672,0.00004771389,0.000012546904,0.00003562384,0.000116410934,0.8118326,0.0023833616,0.0037433088,0.03562121,0.00041261764],"about_ca_topic_score_codex":0.000017716135,"about_ca_topic_score_gemma":0.000042589065,"teacher_disagreement_score":0.8095719,"about_ca_system_score_codex":0.000007972771,"about_ca_system_score_gemma":0.000018805882,"threshold_uncertainty_score":0.38048345},"labels":[],"label_agreement":null},{"id":"W2772071247","doi":"10.1109/smc.2017.8122742","title":"Representing and reasoning with constrained PCP-nets","year":2017,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Preference; Outcome (game theory); Probabilistic logic; Net (polyhedron); Key (lock); Representation (politics); Task (project management); Computer science; Mathematical optimization; Upper and lower bounds; Artificial intelligence; Theoretical computer science; Mathematics; Mathematical economics; Statistics","score_opus":0.0115621572788532,"score_gpt":0.24330493035010914,"score_spread":0.23174277307125593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772071247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030357646,0.000007158349,0.8455803,0.0021939368,0.0000704442,0.000068468275,2.0843524e-7,0.0001276452,0.12159419],"genre_scores_gemma":[0.8178893,0.0000044719354,0.18132631,0.00009175838,0.000010144732,0.0000014256871,2.8513395e-7,0.0000020493162,0.0006742952],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995462,0.000010641046,0.000067627894,0.00019428018,0.00008290636,0.0000983831],"domain_scores_gemma":[0.9994374,0.000024323032,0.000079405225,0.00036984403,0.000038456856,0.000050580602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010917979,0.00005198961,0.000056647743,0.00002694873,0.0003864748,0.0005265633,0.00017318694,0.000018824157,0.000038038343],"category_scores_gemma":[0.000077664474,0.00004140539,0.000008889042,0.000028032882,0.00009301845,0.000558077,0.00010838059,0.00004336784,0.0000040046107],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063312496,0.0000113472,0.18119521,0.000007034084,0.000023211387,0.000036406534,0.00045479002,0.00020072186,0.00035553952,0.3164953,0.00028577543,0.50092834],"study_design_scores_gemma":[0.0010530918,0.000046371184,0.50336206,0.00006861833,0.00000569,0.0003031626,0.00014160048,0.4905265,0.00107832,0.0009236104,0.0021826518,0.00030832796],"about_ca_topic_score_codex":0.00005191333,"about_ca_topic_score_gemma":0.000051889525,"teacher_disagreement_score":0.7875316,"about_ca_system_score_codex":0.000004370064,"about_ca_system_score_gemma":0.000025051446,"threshold_uncertainty_score":0.50776625},"labels":[],"label_agreement":null},{"id":"W2772146156","doi":"10.1007/s10489-017-1094-x","title":"Using conflict and support counts for variable and value ordering in CSPs","year":2017,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Constraint satisfaction problem; Heuristic; Computer science; Constraint (computer-aided design); Variable (mathematics); Mathematical optimization; Constraint satisfaction; Local consistency; Incremental heuristic search; Constraint satisfaction dual problem; Beam search; Search algorithm; Algorithm; Artificial intelligence; Mathematics","score_opus":0.059983945177105084,"score_gpt":0.3146261805797957,"score_spread":0.2546422354026906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772146156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016996686,0.000018074645,0.9860362,0.000038083945,0.00009837169,0.00012233999,9.712069e-7,0.000015917425,0.011970399],"genre_scores_gemma":[0.8311814,0.000080961,0.16851181,0.00011255232,0.000013117551,0.000006985129,6.5114955e-7,0.0000038357553,0.0000886943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996389,0.0000026378725,0.00008275975,0.00014903702,0.00004124431,0.000085396365],"domain_scores_gemma":[0.99973464,0.000032645105,0.000042699572,0.00014788107,0.000017043956,0.000025062262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001315926,0.000045794717,0.000058686277,0.00003021397,0.00011994118,0.00014205425,0.00012009375,0.000027169588,0.000023041914],"category_scores_gemma":[0.000023146718,0.00004856642,0.0000045030865,0.000031424664,0.00004506552,0.00014250292,0.00006695721,0.00003478369,0.0000040515897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004888146,0.000007376775,0.0020551786,0.00002334947,0.0000047688995,0.0000011246897,0.00039564053,0.0016655901,0.0012499153,0.7754182,0.000042887565,0.21913104],"study_design_scores_gemma":[0.00018844703,0.000021324462,0.0030717298,0.00002674202,0.0000049736022,0.00002169457,0.000053105086,0.96678126,0.004798935,0.012169365,0.012650234,0.00021221305],"about_ca_topic_score_codex":0.000026625352,"about_ca_topic_score_gemma":0.000004150155,"teacher_disagreement_score":0.96511567,"about_ca_system_score_codex":0.000010075959,"about_ca_system_score_gemma":0.000028085382,"threshold_uncertainty_score":0.19804811},"labels":[],"label_agreement":null},{"id":"W2774512527","doi":"","title":"MaxSAT Evaluation 2017: Solver and Benchmark Descriptions","year":2017,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Maximum satisfiability problem; Solver; Artificial intelligence; Programming language; Algorithm; Geography; Cartography","score_opus":0.053512572028516114,"score_gpt":0.30380877867825945,"score_spread":0.25029620664974334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774512527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009527037,0.00003260977,0.89237946,0.003114423,0.00055002264,0.00017130745,8.750106e-7,0.0000775436,0.094146736],"genre_scores_gemma":[0.9408242,0.000035795594,0.057797756,0.00018178155,0.000025437266,0.000009168411,0.0000026738717,0.000001958916,0.0011212073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994624,0.000023153943,0.00008328077,0.00017900926,0.00016470219,0.00008743876],"domain_scores_gemma":[0.9993357,0.000014559047,0.00006182595,0.00043567474,0.0000994528,0.00005275907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002729553,0.000053636377,0.000046923447,0.000046815832,0.00051303394,0.00050399604,0.00021086959,0.00003079386,0.00039990098],"category_scores_gemma":[0.000076717806,0.00004895019,0.000017506783,0.000027942939,0.000052505824,0.0010428118,0.00010522717,0.00003857474,0.000042411866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022975712,0.00002663776,0.023049781,0.00000456312,0.000016458065,0.0000020856864,0.0004146184,0.00027466335,0.0007996447,0.19359684,0.01160035,0.77021205],"study_design_scores_gemma":[0.0003699631,0.000014617103,0.41708475,0.0000067416217,0.000010094037,0.00001852258,0.000025517707,0.5728976,0.00014820081,0.0066073956,0.002694164,0.00012240667],"about_ca_topic_score_codex":0.000044004024,"about_ca_topic_score_gemma":0.00012526226,"teacher_disagreement_score":0.9312972,"about_ca_system_score_codex":0.000021340124,"about_ca_system_score_gemma":0.000043563683,"threshold_uncertainty_score":0.48600456},"labels":[],"label_agreement":null},{"id":"W2783796426","doi":"10.1109/icmla.2017.0-124","title":"Incremental Dynamic Search Solver","year":2017,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Solver; Constraint satisfaction problem; Computer science; Usability; Robustness (evolution); Constraint satisfaction; Local search (optimization); Extension (predicate logic); Mathematical optimization; Constraint (computer-aided design); Guided Local Search; Problem solver; Theoretical computer science; Algorithm; Computational science; Mathematics; Programming language; Artificial intelligence","score_opus":0.0198134027213537,"score_gpt":0.29113103380779426,"score_spread":0.2713176310864406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783796426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016193341,0.0000019926538,0.92028004,0.0019148008,0.00020371289,0.00004973698,3.8721163e-7,0.0000839483,0.061272047],"genre_scores_gemma":[0.95155644,0.000004718834,0.04677781,0.00015177554,0.000007631827,0.000001077202,5.992958e-7,0.000001531106,0.0014984086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996235,0.000008582666,0.000051675674,0.00011808333,0.00011052857,0.000087656714],"domain_scores_gemma":[0.99953705,0.0000068964464,0.000021441481,0.0003753,0.000023428476,0.000035912257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008734721,0.000034482477,0.00003142023,0.000028612301,0.0002915918,0.00031560377,0.00038471984,0.000016059668,0.00037595423],"category_scores_gemma":[0.000009352712,0.000030942632,0.000017588147,0.000020546875,0.000034376357,0.0005290656,0.00018500359,0.000038575912,0.00017179333],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028410868,0.000034028595,0.023875507,0.000004200794,0.000015138878,0.000009923252,0.00027609657,0.00024084999,0.0030505788,0.1572841,0.0012827887,0.81392395],"study_design_scores_gemma":[0.00031821933,0.000017620065,0.2674168,0.0000035980645,0.0000010943503,0.00001097252,0.000028419043,0.7292435,0.0015442469,0.00054876896,0.0007542228,0.00011249281],"about_ca_topic_score_codex":0.00006165809,"about_ca_topic_score_gemma":0.000098467965,"teacher_disagreement_score":0.9353631,"about_ca_system_score_codex":0.000022311782,"about_ca_system_score_gemma":0.00002520902,"threshold_uncertainty_score":0.41164353},"labels":[],"label_agreement":null},{"id":"W2784087652","doi":"10.1007/978-3-319-50137-6_12","title":"The Inductive Constraint Programming Loop","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Constraint programming; Computer science; Concurrent constraint logic programming; Inductive programming; Constraint satisfaction; Exploit; Constraint (computer-aided design); Reactive programming; Scheduling (production processes); Constraint logic programming; Mathematical optimization; Programming language; Theoretical computer science; Programming paradigm; Artificial intelligence; Functional logic programming; Stochastic programming; Mathematics","score_opus":0.015462791322360728,"score_gpt":0.24157038091516056,"score_spread":0.22610758959279983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784087652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000120165,0.0001429294,0.9866018,0.0029758927,0.002039348,0.00046649764,0.000002491665,0.00016914673,0.007589856],"genre_scores_gemma":[0.13204089,0.00024296982,0.8616271,0.0019948147,0.0010879738,0.000053127886,0.0000036381787,0.00007042769,0.002879038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720234,0.000037904363,0.00042850996,0.0010323626,0.00072923675,0.0005696419],"domain_scores_gemma":[0.99760187,0.0006751978,0.00029793163,0.0009716614,0.0003114853,0.00014188186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080069224,0.00037026498,0.00027400907,0.00037163237,0.0005723042,0.0008388644,0.0019782924,0.00022537906,0.000026385507],"category_scores_gemma":[0.00013659362,0.00023849879,0.000105151055,0.0003923131,0.0017440512,0.00054467935,0.00071825326,0.0005911159,0.000052697058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001600548,0.0000042860493,0.000021451346,0.0000034207717,0.000006901614,0.000013898441,0.00019765666,0.0007714549,0.00001871779,0.12678435,0.000005224159,0.87217104],"study_design_scores_gemma":[0.0010752054,0.00039278847,0.00044880467,0.0011011235,0.000022430799,0.00046196967,0.0000026533464,0.34941697,0.0013819356,0.603722,0.039703835,0.0022702732],"about_ca_topic_score_codex":0.0000049703076,"about_ca_topic_score_gemma":0.00008410879,"teacher_disagreement_score":0.86990076,"about_ca_system_score_codex":0.00031493412,"about_ca_system_score_gemma":0.00074152224,"threshold_uncertainty_score":0.9725698},"labels":[],"label_agreement":null},{"id":"W2785235494","doi":"10.25904/1912/3289","title":"Agent Ordering and Nogood Repairs in Distributed Constraint Solving","year":2006,"lang":"en","type":"dissertation","venue":"Griffith Research Online (Griffith University, Queensland, Australia)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Computer science; Distributed computing; Operations research; Mathematics; Engineering; Mechanical engineering","score_opus":0.06579499569887005,"score_gpt":0.3364242096003087,"score_spread":0.2706292139014387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785235494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9721579,0.00023600047,0.016573766,0.0022232595,0.0011226145,0.0019696178,0.0010342805,0.0006180834,0.0040644575],"genre_scores_gemma":[0.9497575,0.0011089658,0.020238537,0.000036022713,0.00027623452,0.000012430449,0.0068316604,0.00008395647,0.021654645],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9948282,0.00055974827,0.0006952372,0.0014346055,0.0012571977,0.0012249871],"domain_scores_gemma":[0.99734277,0.0003458247,0.00034983375,0.0007658096,0.00075970986,0.00043608464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010175845,0.0006001224,0.0007021711,0.0018161375,0.00057547353,0.000425403,0.0010575264,0.0007219192,0.00010921216],"category_scores_gemma":[0.00022002631,0.00068194314,0.00017806237,0.0020875023,0.0003360784,0.0006998473,0.00043078288,0.0021595976,0.0000270422],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033799817,0.006953202,0.48057616,0.0070808264,0.0021031825,0.020910287,0.01747222,0.045682255,0.0043402943,0.113320686,0.08905123,0.20912968],"study_design_scores_gemma":[0.0056300866,0.00050729077,0.93028617,0.0017618668,0.00011019684,0.00017112987,0.008777269,0.032545008,0.00025493043,0.00077528803,0.016917286,0.002263473],"about_ca_topic_score_codex":0.0055955895,"about_ca_topic_score_gemma":0.06688912,"teacher_disagreement_score":0.44971004,"about_ca_system_score_codex":0.0006741252,"about_ca_system_score_gemma":0.000772777,"threshold_uncertainty_score":0.99956316},"labels":[],"label_agreement":null},{"id":"W2789610989","doi":"10.1609/icaps.v28i1.13920","title":"Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Exploration Systems; National Aeronautics and Space Administration","keywords":"Computer science; Satisficing; Task (project management); Time horizon; Constraint (computer-aided design); Class (philosophy); Constraint programming; Quantum; Baseline (sea); Mathematical optimization; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Routing (electronic design automation)","score_opus":0.08699356612568282,"score_gpt":0.3177409570303168,"score_spread":0.23074739090463398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789610989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8692251,0.0001243405,0.12624083,0.0012428663,0.0006891085,0.0006050503,0.000025807294,0.0004713812,0.0013755359],"genre_scores_gemma":[0.9394303,0.000012045232,0.060351413,0.00005947768,0.00006723905,0.000029788871,0.000025481782,0.0000134316815,0.000010800216],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998388,0.000015822416,0.0005053725,0.0005660334,0.00031496322,0.00020980208],"domain_scores_gemma":[0.9983487,0.00014998681,0.00073474046,0.00009812651,0.00058807613,0.00008037312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064884505,0.00028095933,0.00034322034,0.00024654716,0.00032597542,0.0010167536,0.00047102175,0.00018535502,0.0000021570797],"category_scores_gemma":[0.0002792666,0.00024314164,0.000054169825,0.000098533135,0.00022097022,0.00030624037,0.00058998726,0.0004609528,1.9528501e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015320253,0.00007327478,0.48659754,0.0010596864,0.0003851902,0.0000027618762,0.013008321,0.0071209087,0.0067033996,0.4663975,0.00015916357,0.018339083],"study_design_scores_gemma":[0.00038774943,0.000066775094,0.0123001,0.0029619099,0.000023923787,0.00004227124,0.0012653392,0.97532237,0.00053070096,0.0068287826,0.000022751477,0.0002473598],"about_ca_topic_score_codex":0.000020791984,"about_ca_topic_score_gemma":0.0000015094577,"teacher_disagreement_score":0.9682014,"about_ca_system_score_codex":0.00005007519,"about_ca_system_score_gemma":0.00010159038,"threshold_uncertainty_score":0.9915028},"labels":[],"label_agreement":null},{"id":"W2806949166","doi":"10.1007/978-3-319-93031-2_17","title":"Accelerating Counting-Based Search","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint satisfaction problem; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Constraint programming; Variable (mathematics); Mathematical optimization; Constraint logic programming; Incremental heuristic search; Search algorithm; Theoretical computer science; Algorithm; Beam search; Artificial intelligence; Mathematics; Stochastic programming","score_opus":0.02864159094443126,"score_gpt":0.26373692640347246,"score_spread":0.2350953354590412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806949166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006993406,0.00004468019,0.9912947,0.0008988647,0.0013329239,0.00027240405,0.0000025792312,0.00022207528,0.0058618686],"genre_scores_gemma":[0.09794794,0.000010175854,0.8985072,0.0025279701,0.0005903465,0.0000052687506,0.000007629475,0.000032422737,0.00037105923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679464,0.000032827993,0.00042364735,0.0012105451,0.0010024476,0.00053590606],"domain_scores_gemma":[0.9978965,0.00034129753,0.00020034765,0.0009560764,0.00046625824,0.00013953619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096037,0.00036818648,0.0003139663,0.0007874351,0.0003866144,0.0010089978,0.0019034893,0.00024920012,0.00030240227],"category_scores_gemma":[0.00008798214,0.0003596653,0.000090461006,0.0006170127,0.00069229887,0.00059704547,0.000613812,0.0006180728,0.00012534864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032964585,0.000014902935,0.00019204724,0.000028875727,0.000005937279,0.00003127734,0.0005518253,0.14489715,0.00008746711,0.010818886,0.000045291894,0.84332305],"study_design_scores_gemma":[0.00019857273,0.00008472176,0.00013269279,0.00019595968,0.0000027249757,0.000022585522,1.2166652e-7,0.9808246,0.0011163641,0.016328381,0.00067629945,0.0004169773],"about_ca_topic_score_codex":0.000014827648,"about_ca_topic_score_gemma":0.00009542451,"teacher_disagreement_score":0.84290606,"about_ca_system_score_codex":0.00027940492,"about_ca_system_score_gemma":0.001013984,"threshold_uncertainty_score":0.99988556},"labels":[],"label_agreement":null},{"id":"W2807276737","doi":"10.1007/978-3-319-92058-0_28","title":"Transformation Between CP-net and CPC-net","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Net (polyhedron); Preference; Computer science; Transformation (genetics); The Internet; Mathematical optimization; Artificial intelligence; Operations research; Mathematics; Statistics; World Wide Web; Geometry","score_opus":0.015172127370351129,"score_gpt":0.23644143616566307,"score_spread":0.22126930879531195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807276737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026386135,0.00007665102,0.99229366,0.000961223,0.00077961327,0.00032237955,0.0000090656695,0.00015130085,0.0051422785],"genre_scores_gemma":[0.38803798,0.00014111983,0.60854965,0.0017713658,0.0009266089,0.000008675439,0.000038462273,0.000040688785,0.00048543507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771166,0.000027209584,0.00042757244,0.00087241054,0.00059167476,0.00036945858],"domain_scores_gemma":[0.9986967,0.00020711319,0.00018648297,0.00058519916,0.00017011203,0.00015440494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005597489,0.0003407956,0.00033060287,0.0006390294,0.00024482387,0.000540138,0.00097329053,0.00027049865,0.00008686108],"category_scores_gemma":[0.000030522348,0.00032459825,0.000059179056,0.00037494197,0.0006363692,0.0009442754,0.00031330984,0.00040780922,0.00004738164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020604539,0.0000046580876,0.00016548164,0.000024905505,0.000007657522,0.000005414028,0.0020082183,0.0027544743,0.0000199269,0.009343679,0.000029282422,0.98563427],"study_design_scores_gemma":[0.0007173492,0.00035032973,0.0036485686,0.00040032985,0.000025007539,0.00013302336,9.0543307e-7,0.81551427,0.0010982411,0.16724601,0.009602005,0.0012639363],"about_ca_topic_score_codex":0.000011063883,"about_ca_topic_score_gemma":0.00008355037,"teacher_disagreement_score":0.9843703,"about_ca_system_score_codex":0.00013011064,"about_ca_system_score_gemma":0.00024120009,"threshold_uncertainty_score":0.9999206},"labels":[],"label_agreement":null},{"id":"W2807385899","doi":"10.1007/978-3-319-93031-2_34","title":"A $$O(n \\log ^2 n)$$ Checker and $$O(n^2 \\log n)$$ Filtering Algorithm for the Energetic Reasoning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Satisfiability; Computer science; Binary logarithm; Interval (graph theory); Algorithm; Time complexity; Process (computing); State (computer science); Running time; Constraint (computer-aided design); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Programming language","score_opus":0.0145130423926603,"score_gpt":0.23915709428527634,"score_spread":0.22464405189261605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807385899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020108515,0.00045755276,0.9960256,0.0007603856,0.0016545655,0.00046081227,0.00000692332,0.00012692336,0.0004871102],"genre_scores_gemma":[0.0073353522,0.00015474526,0.99000424,0.0013802772,0.0006063508,0.000029357749,0.0000046226874,0.00003111036,0.00045392258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975336,0.000023391574,0.00037104895,0.0011175291,0.0004608486,0.00049353886],"domain_scores_gemma":[0.9980566,0.0005401956,0.00022604794,0.00081685954,0.000236032,0.00012428338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070482225,0.00038979852,0.00032408023,0.00037140338,0.00052204245,0.00068870146,0.0013401975,0.0002234919,0.000055029308],"category_scores_gemma":[0.00011824034,0.0003020276,0.000098248536,0.00032370095,0.00083883776,0.00043956676,0.0008092026,0.00038134318,0.000009988223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022945717,0.0000046159635,0.000015392736,0.000013178575,0.000011792042,0.0000068275153,0.0005813726,0.005237139,0.000029269046,0.005557039,0.000049958275,0.9884911],"study_design_scores_gemma":[0.00021735122,0.0000975252,0.00014497187,0.0001742725,0.000012242772,0.00010584488,4.85029e-7,0.9745398,0.00041203966,0.020367322,0.0035470806,0.00038106545],"about_ca_topic_score_codex":0.000015383093,"about_ca_topic_score_gemma":0.00007190279,"teacher_disagreement_score":0.98811007,"about_ca_system_score_codex":0.00012838584,"about_ca_system_score_gemma":0.00025809382,"threshold_uncertainty_score":0.9999432},"labels":[],"label_agreement":null},{"id":"W2807463858","doi":"10.1609/aaai.v32i1.12164","title":"Preliminary Results on Exploration-Driven Satisfiability Solving","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Satisfiability; Boolean satisfiability problem; Computer science; Branching (polymer chemistry); Heuristics; DPLL algorithm; Space (punctuation); Theoretical computer science; Algorithm; Artificial intelligence; Chemistry","score_opus":0.08495256228418385,"score_gpt":0.29892390857299717,"score_spread":0.2139713462888133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807463858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23894861,0.000008517053,0.6005392,0.035307996,0.0029312787,0.0019216391,0.000030197665,0.0006378889,0.11967468],"genre_scores_gemma":[0.9896143,0.000012624588,0.009837016,0.0002633691,0.00010684818,0.00002036829,8.3952864e-7,0.000007917269,0.00013671312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99815375,0.000029147637,0.00056894904,0.0005401988,0.00046039082,0.00024755736],"domain_scores_gemma":[0.99810416,0.00015379026,0.0003917059,0.00039136823,0.00087990693,0.000079092504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048418442,0.00018540253,0.00017370362,0.0001312065,0.00033104548,0.00023921952,0.001068191,0.00008403924,0.00008758015],"category_scores_gemma":[0.0009612726,0.00014601652,0.00008214108,0.0005839043,0.0003887427,0.00074717123,0.00024528147,0.00021887843,0.00017421118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029876386,0.00013351135,0.000316263,0.000015675087,0.0000098377905,2.3837549e-7,0.0035506636,0.0005273896,0.0065850792,0.8256629,0.00045200187,0.16244769],"study_design_scores_gemma":[0.00007442755,0.0013874805,0.002302111,0.0002919771,0.00000991155,0.0000038006297,0.00067313906,0.43258455,0.43391228,0.12828219,0.0001573425,0.00032082025],"about_ca_topic_score_codex":0.000021518777,"about_ca_topic_score_gemma":0.000021383072,"teacher_disagreement_score":0.75066566,"about_ca_system_score_codex":0.000060198447,"about_ca_system_score_gemma":0.00010503753,"threshold_uncertainty_score":0.5954381},"labels":[],"label_agreement":null},{"id":"W2808592708","doi":"10.1109/radar.2018.8378775","title":"Machine learning based cognitive radar resource management","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Radar; Scheduling (production processes); Computational complexity theory; Real-time computing; Artificial neural network; Computational resource; Radar tracker; Distributed computing; Artificial intelligence; Machine learning; Algorithm; Mathematical optimization","score_opus":0.010232161128605026,"score_gpt":0.22806538492873482,"score_spread":0.2178332238001298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808592708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015230189,0.000005130669,0.82349646,0.0005807518,0.000057602665,0.00007219201,3.7154328e-7,0.00020665045,0.17542852],"genre_scores_gemma":[0.842034,0.0000036135552,0.15086631,0.0018033694,0.000035554945,0.000004256299,0.000008076434,0.000005242631,0.0052396012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994443,0.000047177902,0.0000829954,0.00018711733,0.00013084605,0.000107561376],"domain_scores_gemma":[0.9997234,0.0000404131,0.000031390613,0.000114553426,0.00004824047,0.000042042826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012705386,0.000059018672,0.000045294786,0.000084453946,0.00014585968,0.00007118904,0.00012811972,0.000017164753,0.00067171437],"category_scores_gemma":[0.000014505838,0.000054178978,0.000020903428,0.00021839979,0.000040730094,0.0001238243,0.00007027626,0.000056853954,0.00018783759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024282836,0.000048145583,0.0034194859,0.000010459558,0.000034071076,0.000018426126,0.00038531324,0.00082864886,0.000036869933,0.07287719,0.0014776128,0.9208395],"study_design_scores_gemma":[0.000782038,0.00010590427,0.0069114314,0.000021931584,0.000007885943,0.0000055216483,0.00012776011,0.9224314,0.0009288347,0.00018635168,0.06832213,0.0001687905],"about_ca_topic_score_codex":0.0000097665825,"about_ca_topic_score_gemma":0.000011750486,"teacher_disagreement_score":0.9216028,"about_ca_system_score_codex":0.000014269278,"about_ca_system_score_gemma":0.000010282938,"threshold_uncertainty_score":0.7354801},"labels":[],"label_agreement":null},{"id":"W2811466089","doi":"10.1007/978-3-319-94144-8_8","title":"Centrality-Based Improvements to CDCL Heuristics","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Solver; Computer science; Exploit; Centrality; Boolean satisfiability problem; Theoretical computer science; Data structure; Algorithm; Programming language; Mathematics; Combinatorics","score_opus":0.01511907516038146,"score_gpt":0.2498447418800109,"score_spread":0.23472566671962944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811466089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041983367,0.000019804824,0.99348086,0.0014196073,0.002515062,0.0004378341,0.0000119892775,0.00017847905,0.0018943603],"genre_scores_gemma":[0.04857628,0.000007660927,0.9420374,0.008364424,0.00045631357,0.000008454385,0.000012808636,0.000032647866,0.00050397986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679893,0.000025629452,0.00045832022,0.0012731082,0.0008733897,0.0005705932],"domain_scores_gemma":[0.99778557,0.00016832358,0.00020450122,0.0011398975,0.00042345768,0.0002782718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052515115,0.00039978483,0.00032452683,0.0007007049,0.00022860242,0.0005590783,0.0018968631,0.0002102059,0.00016177153],"category_scores_gemma":[0.000119355434,0.000395935,0.00008090983,0.00066299026,0.00039237883,0.00030706805,0.00065977115,0.00038215015,0.00016854263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007710437,0.00003193358,0.00013820044,0.000030682342,0.00000867433,0.000032146338,0.00046578326,0.054217976,0.00012090863,0.009244773,0.00020928528,0.9354919],"study_design_scores_gemma":[0.00043482223,0.0003091677,0.0004710252,0.0002746362,0.000009032558,0.000015112666,1.3724315e-7,0.93923736,0.0021420866,0.042998273,0.013205132,0.00090319134],"about_ca_topic_score_codex":0.000014311042,"about_ca_topic_score_gemma":0.00008353725,"teacher_disagreement_score":0.93458873,"about_ca_system_score_codex":0.00035521915,"about_ca_system_score_gemma":0.00078741106,"threshold_uncertainty_score":0.99984926},"labels":[],"label_agreement":null},{"id":"W2854884023","doi":"10.24963/ijcai.2018/654","title":"Local Minima, Heavy Tails, and Search Effort for GBFS","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Local search (optimization); Mathematics; Work (physics); Mathematical optimization; Algorithm; Mathematical analysis; Physics","score_opus":0.017969855245510057,"score_gpt":0.26981857682927907,"score_spread":0.25184872158376903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2854884023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062182266,0.000008162774,0.9872725,0.0014580721,0.00013267378,0.00013575629,8.864744e-7,0.00007793524,0.0046958155],"genre_scores_gemma":[0.81988287,0.000004473977,0.17839341,0.0005310021,0.000046703895,0.0000064481865,0.000001461907,0.0000030377016,0.0011306126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951464,0.000007770558,0.00008195203,0.00018045814,0.00008505529,0.0001301525],"domain_scores_gemma":[0.99967104,0.000035556164,0.000011448784,0.00013164744,0.000085406275,0.000064900145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013076895,0.00004845898,0.00005354236,0.000045918503,0.000107014,0.00008604719,0.000102273494,0.000029522582,0.00010220011],"category_scores_gemma":[0.000008103933,0.000042150205,0.000016773633,0.00009993265,0.0001031309,0.00020101924,0.000058720358,0.00002678775,0.000031623673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023588665,0.000026356727,0.0032290507,0.000015945394,0.000011928808,0.0000011159035,0.0005237364,0.000068337955,0.00018175192,0.16172308,0.007996789,0.82619834],"study_design_scores_gemma":[0.0005628518,0.00027220638,0.011451618,0.0000063697203,0.0000028015736,0.000025408553,0.00010404584,0.960972,0.0069399416,0.0010277128,0.018485205,0.00014979998],"about_ca_topic_score_codex":0.0000230968,"about_ca_topic_score_gemma":0.000064290856,"teacher_disagreement_score":0.9609037,"about_ca_system_score_codex":0.000012748129,"about_ca_system_score_gemma":0.000042799842,"threshold_uncertainty_score":0.17188355},"labels":[],"label_agreement":null},{"id":"W2883127994","doi":"10.4018/978-1-5225-2255-3.ch391","title":"A Fast and Space-Economical Algorithm for the Tree Inclusion Problem","year":2017,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Space (punctuation); Tree (set theory); Algorithm; Inclusion (mineral); Mathematical optimization; Mathematics; Combinatorics; Physics","score_opus":0.015028239325126466,"score_gpt":0.23916699560809304,"score_spread":0.2241387562829666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883127994","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.383853e-7,0.00008631014,0.4954249,0.0007652417,0.00027143187,0.00045485533,0.000048346436,0.00006074521,0.5028874],"genre_scores_gemma":[0.01809267,0.00013874081,0.6497557,0.0020587759,0.0013945884,0.00021228367,0.000020716785,0.000110816814,0.32821572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990193,0.000008627396,0.00021172708,0.00042940275,0.0001483128,0.00018257851],"domain_scores_gemma":[0.99899733,0.00006871333,0.00023694937,0.0005279092,0.00007180451,0.00009730052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014070187,0.00023667142,0.00022987118,0.000036286383,0.0006911329,0.00035026568,0.000560678,0.00021497604,0.0000096366],"category_scores_gemma":[0.000008995968,0.00018430044,0.0001171402,0.0000040597843,0.00014903258,0.00010962323,0.0010328173,0.00014422263,0.000015380887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026143507,0.0000011307678,0.0000014331705,0.0000037222273,0.000016582793,0.0000015807723,0.00004809731,0.000007638552,5.596065e-7,0.50525874,0.0003859439,0.49427193],"study_design_scores_gemma":[0.0009810408,0.00012888771,0.00013206333,0.00013019946,0.000067699984,0.00012157889,0.0000069135413,0.20055678,0.000011095336,0.642782,0.15454432,0.00053741765],"about_ca_topic_score_codex":0.000033661934,"about_ca_topic_score_gemma":0.00024680988,"teacher_disagreement_score":0.49373454,"about_ca_system_score_codex":0.000112696354,"about_ca_system_score_gemma":0.00015649822,"threshold_uncertainty_score":0.7515554},"labels":[],"label_agreement":null},{"id":"W2888052067","doi":"10.1007/978-3-319-98334-9_29","title":"The Effect of Structural Measures and Merges on SAT Solver Performance","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Merge (version control); Computer science; Solver; Boolean satisfiability problem; Satisfiability; Theoretical computer science; Benchmark (surveying); Scaling; Algorithm; Mathematics; Parallel computing; Programming language","score_opus":0.008673127966575591,"score_gpt":0.22453538193192688,"score_spread":0.21586225396535128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888052067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011677978,0.00030700467,0.98456043,0.00031292933,0.0016498639,0.00030831137,0.0000020955545,0.000059117923,0.0011222617],"genre_scores_gemma":[0.97303474,0.00010929058,0.026314208,0.0001875686,0.00018082246,0.0000035029766,0.0000013459331,0.00001333584,0.0001551832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998136,0.000043511664,0.00028053814,0.0006158413,0.0006438172,0.00028028202],"domain_scores_gemma":[0.99834836,0.00061113655,0.0002038027,0.0006286435,0.00013975592,0.000068294015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064035,0.00028995518,0.00027395468,0.00026081438,0.00036565767,0.0002508446,0.0010068301,0.00013347069,0.00001632399],"category_scores_gemma":[0.000084522384,0.00018099429,0.000059464917,0.0002163225,0.0011107126,0.00029573223,0.00037529634,0.00032022802,0.000008331075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018479735,0.0000011216422,0.000964975,0.000022341268,0.000009510846,0.000001816023,0.00031166602,0.009145871,0.000056527548,0.0018052916,0.000013830627,0.98764855],"study_design_scores_gemma":[0.0005375104,0.0014650126,0.009464186,0.0004514982,0.000016233313,0.00006804954,2.1005776e-7,0.95956427,0.011340883,0.015716814,0.00074751786,0.00062780146],"about_ca_topic_score_codex":0.0000049435,"about_ca_topic_score_gemma":0.00004515811,"teacher_disagreement_score":0.9870208,"about_ca_system_score_codex":0.00007089563,"about_ca_system_score_gemma":0.000108610795,"threshold_uncertainty_score":0.7380733},"labels":[],"label_agreement":null},{"id":"W2894550935","doi":"10.1287/ijoc.2017.0797","title":"Structure Detection in Mixed-Integer Programs","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Integer programming; Block matrix; Block (permutation group theory); Data structure; Granularity; Hypergraph; Computer science; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.011098491207575589,"score_gpt":0.2458892900069362,"score_spread":0.23479079879936063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894550935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24006894,0.0000033868384,0.7568563,0.00015807354,0.0014354372,0.00007296936,1.2283864e-7,0.00008301719,0.0013216984],"genre_scores_gemma":[0.9820973,0.0000017516105,0.017224936,0.0003417259,0.0003132664,3.419988e-7,5.4743185e-7,0.0000049851315,0.000015101572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899024,0.000028860022,0.00035133472,0.00014038075,0.00024683867,0.0002423528],"domain_scores_gemma":[0.9993745,0.000034083227,0.00020397679,0.00014318495,0.00015950757,0.00008472759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032002648,0.000109906425,0.00010525043,0.00028577846,0.00023667849,0.00040977137,0.00027462764,0.00006720944,0.00002581634],"category_scores_gemma":[0.00005533742,0.000086451895,0.000048686397,0.00048153728,0.00003788111,0.0006573809,0.00006679004,0.00040671442,0.000033978406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007720863,0.000010911081,0.0021477353,0.000002038629,0.0000052023643,0.000007756474,0.00054660725,0.0043075224,0.00010467099,0.0016312859,0.000020726353,0.99120784],"study_design_scores_gemma":[0.00076315424,0.0004602401,0.034025077,0.00014280484,0.000002065034,0.0008996089,0.00012702633,0.95475245,0.0031426281,0.0021088107,0.003319706,0.00025645588],"about_ca_topic_score_codex":0.000005880728,"about_ca_topic_score_gemma":0.000079611025,"teacher_disagreement_score":0.99095136,"about_ca_system_score_codex":0.00011819163,"about_ca_system_score_gemma":0.000057257614,"threshold_uncertainty_score":0.39514348},"labels":[],"label_agreement":null},{"id":"W2894929382","doi":"10.1007/978-3-030-02149-8_9","title":"A Modal and Relevance Logic for Qualitative Spatial Reasoning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Dynamic logic (digital electronics); Multimodal logic; Modal logic; Computer science; Normal modal logic; Axiom; Algebra over a field; Mathematics; Theoretical computer science; Description logic; Modal; Pure mathematics","score_opus":0.02498503563160197,"score_gpt":0.2961177508704074,"score_spread":0.27113271523880544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894929382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049506474,0.00014662319,0.9964492,0.0007909925,0.00094228523,0.00042623034,0.000008573393,0.00010550524,0.0010810855],"genre_scores_gemma":[0.05215032,0.00004578243,0.9462938,0.0008833353,0.00033847394,0.000014273759,0.000005254016,0.000018138473,0.00025062752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772924,0.000039014594,0.00033380673,0.0011115553,0.00041936187,0.00036701834],"domain_scores_gemma":[0.99786437,0.00096353417,0.00024905332,0.00049867784,0.00031456715,0.00010978248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080668856,0.00031077812,0.00032138327,0.00036650666,0.0002723922,0.00036139615,0.00077560905,0.00020171168,0.000025226906],"category_scores_gemma":[0.00041756357,0.0002924426,0.00006497364,0.00022853383,0.00078190764,0.0004733395,0.0004176095,0.00029530295,0.00000960076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014953421,0.000008940121,0.000012419563,0.000032786433,0.000009094616,0.0000081546195,0.006943531,0.006315675,0.000039815695,0.099198125,0.000026222076,0.88739026],"study_design_scores_gemma":[0.0002527731,0.00019212627,0.000037811435,0.00017748062,0.0000042917272,0.00003234023,0.0000015349593,0.71651495,0.00014631539,0.28178385,0.00051750895,0.00033905794],"about_ca_topic_score_codex":0.000017229686,"about_ca_topic_score_gemma":0.00015629032,"teacher_disagreement_score":0.8870512,"about_ca_system_score_codex":0.00014311573,"about_ca_system_score_gemma":0.00030121277,"threshold_uncertainty_score":0.9999528},"labels":[],"label_agreement":null},{"id":"W2897904533","doi":"10.1109/cec.2018.8477823","title":"Discrete Firefly Algorithm: A New Metaheuristic Approach for Solving Constraint Satisfaction Problems","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Firefly algorithm; Constraint satisfaction problem; Metaheuristic; Constraint satisfaction; Mathematical optimization; Constraint (computer-aided design); Firefly protocol; Computer science; Algorithm; Hybrid algorithm (constraint satisfaction); Combinatorial optimization; Constraint satisfaction dual problem; Meta heuristic; Mathematics; Local consistency; Artificial intelligence; Particle swarm optimization","score_opus":0.024251704046770295,"score_gpt":0.25852921154223946,"score_spread":0.23427750749546916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897904533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007058383,0.000019779987,0.99176633,0.00057789637,0.00043099836,0.0006180197,0.0000063143607,0.00037752732,0.0061325203],"genre_scores_gemma":[0.23292448,0.0000066411876,0.76574713,0.00021970285,0.00018251518,0.0000411648,0.000012550948,0.000010742955,0.00085508695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986663,0.000028173263,0.0003102618,0.0004795517,0.00021192929,0.0003037744],"domain_scores_gemma":[0.9991342,0.000083262945,0.00012601423,0.00032832465,0.00016447074,0.00016375884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026383737,0.00017369185,0.00017782296,0.000118514734,0.00026932624,0.00028916346,0.00023904232,0.00007538698,0.00017149655],"category_scores_gemma":[0.00007159346,0.00015297247,0.00009199305,0.00028549417,0.00011225566,0.00061861635,0.000073957926,0.00008871554,0.00003082251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052531536,0.000021091593,0.00033546126,0.000018861063,0.000051242117,5.507871e-7,0.000697318,0.00090987026,0.00047806354,0.04231005,0.00244832,0.9527239],"study_design_scores_gemma":[0.0005825161,0.00013900241,0.0017504754,0.000011377419,0.00001982256,0.00003894936,0.000073485266,0.99112713,0.0004944347,0.0038347815,0.00167987,0.0002481648],"about_ca_topic_score_codex":0.00019032175,"about_ca_topic_score_gemma":0.00007964442,"teacher_disagreement_score":0.99021727,"about_ca_system_score_codex":0.000060283415,"about_ca_system_score_gemma":0.00017227333,"threshold_uncertainty_score":0.6238036},"labels":[],"label_agreement":null},{"id":"W2900773200","doi":"10.29007/8m31","title":"Predicting SAT Solver Performance on Heterogeneous Hardware","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Solver; Reuse; Boolean satisfiability problem; Set (abstract data type); Cache; Parallel computing; Feature (linguistics); Theoretical computer science; Programming language","score_opus":0.009734830571931433,"score_gpt":0.21960126893353335,"score_spread":0.2098664383616019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900773200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455931,0.00001832041,0.04771587,0.00022366109,0.0013243323,0.0001541872,5.1425667e-7,0.00021723835,0.00475277],"genre_scores_gemma":[0.9854997,0.0000070417473,0.013916563,0.00032101208,0.00006890729,0.0000017200477,0.0000026156313,0.000007935648,0.00017454155],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.000042542888,0.00023298507,0.0003180398,0.00018108483,0.00024259115],"domain_scores_gemma":[0.99943316,0.00010009011,0.00008546662,0.00031175633,0.000032529097,0.00003702603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019852135,0.00011649437,0.00013094879,0.00010380122,0.000118104144,0.00009957594,0.00028604557,0.00004828033,0.00008339741],"category_scores_gemma":[0.000034217184,0.000120499986,0.000034305074,0.00024086105,0.00002270982,0.000385454,0.00017690693,0.00016808756,0.0001085036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001225003,0.000018549907,0.5333466,0.000035591744,0.000008328483,0.00001125088,0.0014254595,0.3217851,0.00007997417,0.0020954423,0.000029322608,0.14115214],"study_design_scores_gemma":[0.00030707862,0.00011252419,0.08904713,0.00012281636,9.671718e-7,0.000055363776,0.00006662585,0.90859914,0.000894703,0.00007514401,0.00054642675,0.00017205815],"about_ca_topic_score_codex":0.0000070804786,"about_ca_topic_score_gemma":0.000009783092,"teacher_disagreement_score":0.5868141,"about_ca_system_score_codex":0.00007197442,"about_ca_system_score_gemma":0.00003283377,"threshold_uncertainty_score":0.49138469},"labels":[],"label_agreement":null},{"id":"W2904082109","doi":"10.1109/ictai.2018.00056","title":"Constrained Optimization with Preferentially Ordered Outcomes","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Ceteris paribus; Mathematical optimization; Net (polyhedron); Preference; Computer science; Extension (predicate logic); Pareto principle; Set (abstract data type); Stochastic dominance; Constrained optimization; Mathematics; Statistics; Economics","score_opus":0.009887388673829456,"score_gpt":0.22543652069509393,"score_spread":0.21554913202126447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904082109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010305294,8.0778887e-7,0.9497482,0.0011793852,0.00016954119,0.00014150982,8.5715044e-7,0.00035823786,0.047370926],"genre_scores_gemma":[0.5175772,0.0000015925456,0.4810552,0.00039023825,0.000019075394,0.000004661465,0.0000048624916,0.0000046435903,0.0009425599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927485,0.000026222231,0.00014596601,0.00023833259,0.00017022771,0.00014437875],"domain_scores_gemma":[0.9993553,0.000026580095,0.000061647705,0.00026871407,0.00022419117,0.00006353373],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000064011074,0.000102185986,0.00009695254,0.0000873809,0.00011965267,0.00016046003,0.00020824857,0.00003841958,0.0011898256],"category_scores_gemma":[0.00002209725,0.00007445443,0.00002191391,0.00027860605,0.00010494897,0.00045493286,0.00004622005,0.00003995715,0.000054178017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082730585,0.00026656373,0.053900886,0.000018988707,0.00025069332,0.0000083554505,0.0016937997,0.10219991,0.0003838128,0.618894,0.0023115778,0.2199887],"study_design_scores_gemma":[0.0015081387,0.00027731378,0.019186562,0.000012058197,0.000013001103,0.000024354325,0.000058953556,0.9761002,0.0011115923,0.0003740821,0.000987023,0.00034673652],"about_ca_topic_score_codex":0.000012360677,"about_ca_topic_score_gemma":0.00011398434,"teacher_disagreement_score":0.8739003,"about_ca_system_score_codex":0.000015300102,"about_ca_system_score_gemma":0.0000998462,"threshold_uncertainty_score":0.9997232},"labels":[],"label_agreement":null},{"id":"W2906226597","doi":"10.32920/ryerson.14649945","title":"Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint satisfaction dual problem; Local consistency; Complexity of constraint satisfaction; Constraint logic programming; Constraint graph; Constraint (computer-aided design); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Tree (set theory); Time complexity; Mathematical optimization; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.049607082559805,"score_gpt":0.2449211411669999,"score_spread":0.1953140586071949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906226597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018693214,0.00004426604,0.96676594,0.00063327013,0.00056290673,0.00053786277,0.000015792453,0.00027372243,0.0124729965],"genre_scores_gemma":[0.88733286,0.000053923486,0.11232333,0.000105244624,0.000017504486,0.000023304034,0.00005260237,0.000012486336,0.000078721285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979617,0.000115482566,0.0004998018,0.00070680724,0.0004807614,0.00023541902],"domain_scores_gemma":[0.9980964,0.000055436678,0.00045216468,0.00082630944,0.00044892952,0.00012074775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023414745,0.000290695,0.00044869384,0.00019443083,0.000083241204,0.0002834698,0.00039031205,0.0002148134,0.0006626194],"category_scores_gemma":[0.000023885364,0.00026742954,0.00013597573,0.00034395908,0.00039807826,0.00031336886,0.0004109464,0.0004578466,0.0000062773065],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025790145,0.000304528,0.06876218,0.001343421,0.00070099055,0.00005795721,0.0047877315,0.09805588,0.0019475009,0.55711657,0.0003913932,0.26650605],"study_design_scores_gemma":[0.0036389234,0.0005473352,0.63502353,0.0023296499,0.00023747742,0.00074946485,0.0024632167,0.30846033,0.007874134,0.034691513,0.00045252062,0.0035319037],"about_ca_topic_score_codex":0.00084331987,"about_ca_topic_score_gemma":0.0018625684,"teacher_disagreement_score":0.86863965,"about_ca_system_score_codex":0.00013136274,"about_ca_system_score_gemma":0.00071798987,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W2909573631","doi":"10.1109/smc.2018.00569","title":"Constrained Optimization with Partial CP-Nets","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Directed acyclic graph; Topological sorting; Computer science; Pruning; Partially ordered set; Preference; Set (abstract data type); Beam search; Bidirectional search; Theoretical computer science; Mathematics; Search algorithm; Algorithm; Combinatorics; Best-first search","score_opus":0.008978296104518087,"score_gpt":0.22024015984057804,"score_spread":0.21126186373605996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909573631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005576277,0.0000015145127,0.95406806,0.0013854362,0.00018460449,0.00010216744,5.5910664e-7,0.00029011932,0.043409884],"genre_scores_gemma":[0.54632103,0.0000018240232,0.4526634,0.00059869885,0.00005351434,0.0000042532483,0.0000032898192,0.0000039020856,0.00035006503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993415,0.000024549556,0.00012039843,0.0002211573,0.0001469828,0.0001454505],"domain_scores_gemma":[0.99949867,0.000019864814,0.00004799126,0.00021966554,0.00014186425,0.0000719772],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000076810225,0.00008077406,0.00006706485,0.00006309288,0.00011939141,0.00012672115,0.00015491333,0.0000347294,0.0009980383],"category_scores_gemma":[0.000014786967,0.00006394559,0.000015871847,0.00028152112,0.00013108543,0.00042758722,0.000033864282,0.000037838858,0.00007797082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075854034,0.00014381608,0.0068944492,0.000008836059,0.000076212775,0.000022392247,0.0014373634,0.19828895,0.0006037507,0.5538676,0.005531771,0.23304902],"study_design_scores_gemma":[0.00047853333,0.00014991999,0.0005925848,0.0000058961155,0.000003529279,0.000041072166,0.00002393949,0.9937017,0.0020065226,0.000104217295,0.0027489043,0.00014317443],"about_ca_topic_score_codex":0.0000091875,"about_ca_topic_score_gemma":0.000029119274,"teacher_disagreement_score":0.7954128,"about_ca_system_score_codex":0.00001524281,"about_ca_system_score_gemma":0.00008032972,"threshold_uncertainty_score":0.9999152},"labels":[],"label_agreement":null},{"id":"W2910976537","doi":"10.2478/rmm-2018-0007","title":"Reflections on the <i>n</i> + <i>k</i> dragon kings problem","year":2018,"lang":"en","type":"article","venue":"Recreational mathematics magazine","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Diagonal; Combinatorics; Rotation (mathematics); Mathematics; Triple system; Square (algebra); Jump; Quarter (Canadian coin); Physics; Geometry; History; Quantum mechanics","score_opus":0.03804929393957694,"score_gpt":0.3021567296784002,"score_spread":0.2641074357388232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910976537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036971344,0.000003892955,0.6707572,0.008185578,0.0001481136,0.00023428745,0.000003844334,0.00017842425,0.32011896],"genre_scores_gemma":[0.15221646,0.00003704563,0.8336884,0.004294868,0.00047367183,0.000136819,0.000025469175,0.00003246423,0.009094842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989619,0.000044258057,0.00025631257,0.00022956169,0.00034647898,0.00016148362],"domain_scores_gemma":[0.9988175,0.00033426948,0.0001388875,0.0004053404,0.00025261642,0.000051402163],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003336874,0.00012804719,0.000103436876,0.00010019247,0.00035828212,0.00017460542,0.0003353331,0.00004607441,0.00032580615],"category_scores_gemma":[0.00014544402,0.000089938294,0.00005501202,0.00052569376,0.00010640157,0.00022779088,0.0000684227,0.00011730419,0.0011363425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025980146,0.00007010281,0.000012122718,0.0000068853574,0.000012032391,4.846517e-7,0.0004882428,0.00006558897,0.0015636393,0.98697484,0.0075469855,0.0032564728],"study_design_scores_gemma":[0.00070231035,0.0004644221,0.0016386886,0.00031250928,0.000037755504,0.0002021647,0.00012325279,0.15740328,0.008044024,0.69466764,0.13576297,0.00064098754],"about_ca_topic_score_codex":0.0000018308073,"about_ca_topic_score_gemma":0.000014246289,"teacher_disagreement_score":0.3110241,"about_ca_system_score_codex":0.000055376167,"about_ca_system_score_gemma":0.000071935036,"threshold_uncertainty_score":0.99964136},"labels":[],"label_agreement":null},{"id":"W2912055746","doi":"","title":"Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Computer science; Constraint (computer-aided design); Mathematical optimization; Operations research; Mathematics; Stochastic programming","score_opus":0.01873547709619573,"score_gpt":0.26214105082452716,"score_spread":0.24340557372833144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912055746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004313318,0.0000014437327,0.9879336,0.0015296057,0.00019222224,0.0009397619,0.000003345387,0.00005865332,0.005028064],"genre_scores_gemma":[0.81972796,0.0000054350985,0.18011516,0.00003291438,0.000013738147,0.000051726925,0.0000036596018,0.0000027150982,0.000046713358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931705,0.0000090757885,0.00029821685,0.00015410737,0.00015099703,0.00007053652],"domain_scores_gemma":[0.999346,0.000032832744,0.00018217917,0.00005688127,0.00037080902,0.000011272234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020504429,0.00007248947,0.000100481055,0.00009683557,0.00003135047,0.000072489194,0.00016605704,0.00005474452,0.000008737579],"category_scores_gemma":[0.00006002786,0.000048622027,0.000024142191,0.0002121958,0.00009337417,0.00030442377,0.000039724655,0.00006836777,3.6248377e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028502853,0.000082848885,0.001985007,0.000025283394,0.0000034330294,3.5946616e-8,0.00019039346,0.0012816166,0.0028019156,0.9604096,0.000057306614,0.03313406],"study_design_scores_gemma":[0.001082983,0.00031642098,0.002023029,0.00027881592,0.000005745314,0.0000076076926,0.00022190192,0.9156226,0.059490807,0.020665351,0.00013941509,0.00014533564],"about_ca_topic_score_codex":0.000046611287,"about_ca_topic_score_gemma":0.00005665019,"teacher_disagreement_score":0.93974423,"about_ca_system_score_codex":0.000030623316,"about_ca_system_score_gemma":0.0000660747,"threshold_uncertainty_score":0.19827487},"labels":[],"label_agreement":null},{"id":"W2915068361","doi":"","title":"Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming - Volume 9255","year":2015,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Volume (thermodynamics); Constraint (computer-aided design); Computer science; Constraint programming; Mathematics; Engineering; Mathematical optimization; Mechanical engineering; Stochastic programming; Thermodynamics; Physics","score_opus":0.05994328146795754,"score_gpt":0.28546861597758105,"score_spread":0.2255253345096235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915068361","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035798807,0.000015463163,0.23979257,0.020366192,0.0006848698,0.00073294045,0.0000064261044,0.00013922728,0.7024635],"genre_scores_gemma":[0.90254986,0.0000089558725,0.09703739,0.000098327204,0.000009218281,0.000003941925,3.7025657e-7,0.0000018680967,0.00029007503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999339,0.000014989355,0.00018445156,0.00013677547,0.00025923675,0.000065560336],"domain_scores_gemma":[0.9990532,0.000051170744,0.0002116955,0.000083482104,0.0005559447,0.000044501485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034048734,0.000056574692,0.00007219286,0.00004540146,0.000025572157,0.00007429393,0.00024208796,0.000026932685,0.000021975036],"category_scores_gemma":[0.0004637305,0.000040182997,0.000018698845,0.00012635086,0.00016318311,0.0003931689,0.0001347858,0.00006091481,0.0000014373636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001029027,0.000045783094,0.0046308264,0.000008100352,0.000012716184,1.6739357e-7,0.0009236105,0.00007386106,0.00041093983,0.9457645,0.0000752189,0.048043985],"study_design_scores_gemma":[0.004743131,0.0013331193,0.06750013,0.000646042,0.00008727277,0.00083125365,0.043014873,0.75246245,0.021302022,0.010329576,0.096686065,0.001064061],"about_ca_topic_score_codex":0.000019061727,"about_ca_topic_score_gemma":0.0000052883347,"teacher_disagreement_score":0.93543494,"about_ca_system_score_codex":0.000019206696,"about_ca_system_score_gemma":0.00009888605,"threshold_uncertainty_score":0.1638615},"labels":[],"label_agreement":null},{"id":"W2944995129","doi":"10.1007/978-3-030-18305-9_31","title":"Lexicographic Preference Trees with Hard Constraints","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Lexicographical order; Computer science; Preference; Artificial intelligence; Mathematics; Combinatorics; Statistics","score_opus":0.022598848560566903,"score_gpt":0.22166688238641669,"score_spread":0.19906803382584978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944995129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012199566,0.00009650608,0.98549163,0.00055312394,0.0009994558,0.0005014852,0.000007792838,0.00022996205,0.011998073],"genre_scores_gemma":[0.48366937,0.00008276004,0.5138417,0.00122406,0.00015266192,0.000009553368,0.000011103408,0.000039294344,0.0009695277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964844,0.00003238648,0.00042157248,0.0015449884,0.0009606053,0.0005560281],"domain_scores_gemma":[0.9976658,0.00028110418,0.00030855055,0.0012710548,0.000295185,0.00017828216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041356974,0.0005296172,0.00048230565,0.0010172629,0.00019542182,0.00063948485,0.0019915358,0.0002846853,0.00014170885],"category_scores_gemma":[0.00003611171,0.00044394008,0.00010611071,0.00073702296,0.0015069952,0.00079255115,0.00047231463,0.0007268054,0.00008551777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009487673,0.000020662497,0.0012254991,0.000028340302,0.00002070995,0.000042667587,0.00034755672,0.038274143,0.00008895473,0.056545556,0.000013004418,0.90338343],"study_design_scores_gemma":[0.002020312,0.0011012602,0.01492671,0.0020894217,0.000046167974,0.0006835087,0.0000012052665,0.87890226,0.0016035421,0.092736,0.002644266,0.003245368],"about_ca_topic_score_codex":0.00001008723,"about_ca_topic_score_gemma":0.0002210201,"teacher_disagreement_score":0.900138,"about_ca_system_score_codex":0.00015422548,"about_ca_system_score_gemma":0.0011414828,"threshold_uncertainty_score":0.9998012},"labels":[],"label_agreement":null},{"id":"W2949059408","doi":"10.48550/arxiv.0909.3273","title":"Decomposition of the NVALUE constraint","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Local consistency; Heuristics; Consistency (knowledge bases); Decomposition; Constraint (computer-aided design); Decomposition method (queueing theory); Mathematical optimization; Computer science; Range (aeronautics); Upper and lower bounds; Global optimization; Benders' decomposition; Constraint programming; Theoretical computer science; Constraint satisfaction; Mathematics; Discrete mathematics; Artificial intelligence; Engineering","score_opus":0.027802404866107334,"score_gpt":0.2749630706695686,"score_spread":0.24716066580346127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949059408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4132513,0.000070120885,0.5767061,0.0032449416,0.001395551,0.00038670472,0.000010588732,0.00015156792,0.004783094],"genre_scores_gemma":[0.9833328,0.00004040022,0.015983494,0.00049733685,0.000058192927,0.000007988669,0.000009721169,0.0000063108705,0.0000637594],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987468,0.0001312464,0.00035653362,0.00036952473,0.00024128669,0.00015459378],"domain_scores_gemma":[0.99861294,0.000050187355,0.00033185043,0.0008097706,0.00014216908,0.000053103457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021201733,0.00017269484,0.00020490692,0.00008376329,0.00010028759,0.00006236305,0.0007583589,0.0001721207,0.000058243008],"category_scores_gemma":[0.00004304187,0.00014027106,0.00017971855,0.00018988544,0.00012382441,0.00012331775,0.0004912937,0.00037711454,0.000025418387],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023248216,0.00041245192,0.48887303,0.00025097848,0.00023702296,0.000021911752,0.0023744237,0.079590976,0.009016642,0.12549701,0.0020595805,0.2916427],"study_design_scores_gemma":[0.00034179285,0.0000394817,0.9450827,0.0002779034,0.000035221743,0.00003649398,0.00002732778,0.037439484,0.008505443,0.007458285,0.00041109492,0.0003447204],"about_ca_topic_score_codex":0.000028288794,"about_ca_topic_score_gemma":0.000015503567,"teacher_disagreement_score":0.5700815,"about_ca_system_score_codex":0.00006960913,"about_ca_system_score_gemma":0.00023277209,"threshold_uncertainty_score":0.5720088},"labels":[],"label_agreement":null},{"id":"W2949591167","doi":"10.1137/1.9781611973082.52","title":"The Local Lemma is Tight for SAT","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lemma (botany); Combinatorics; Variable (mathematics); Function (biology); Discrete mathematics; Binary tree; Class (philosophy); Binary number; Discretization; Upper and lower bounds; Order (exchange); Mathematical analysis; Computer science; Arithmetic","score_opus":0.03308395663944832,"score_gpt":0.254220605228909,"score_spread":0.22113664858946067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949591167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027289701,0.0000481236,0.9738355,0.0038904499,0.001092632,0.0003263033,0.000004992826,0.00015099254,0.02062369],"genre_scores_gemma":[0.27272147,0.00034778976,0.6890712,0.0047835,0.00035693057,0.0003059057,0.00004363948,0.00003837511,0.032331187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917734,0.000023417382,0.00018359412,0.00033286508,0.00012450591,0.000158289],"domain_scores_gemma":[0.9990713,0.00009621946,0.00009075241,0.0005757246,0.000114365044,0.000051653387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017918387,0.00012391772,0.00010226738,0.000039364255,0.00018378421,0.00024193284,0.00067395536,0.00012915724,0.00020311457],"category_scores_gemma":[0.000010677905,0.00008142433,0.00011373334,0.000053881,0.00006803771,0.0000900827,0.0004998775,0.00015776495,0.000088565925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004973097,0.000009880711,0.00009261436,0.000015941647,0.000030921394,5.2990293e-7,0.00046948937,0.00041278373,0.0000022739102,0.3390902,0.0329769,0.6268935],"study_design_scores_gemma":[0.0003171217,0.000041601805,0.0015436711,0.00002946208,0.000017508924,0.000010366651,0.000048003705,0.64596653,0.0013045241,0.10182727,0.24846303,0.00043092415],"about_ca_topic_score_codex":0.000044500342,"about_ca_topic_score_gemma":0.00010896736,"teacher_disagreement_score":0.6455537,"about_ca_system_score_codex":0.000035291578,"about_ca_system_score_gemma":0.00014175382,"threshold_uncertainty_score":0.3320388},"labels":[],"label_agreement":null},{"id":"W2949860269","doi":"10.48550/arxiv.1201.5426","title":"Constraint Propagation as Information Maximization","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Western University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint satisfaction dual problem; Correctness; Constraint (computer-aided design); Local consistency; Mathematical optimization; Constraint logic programming; Maximization; Mathematics; Complexity of constraint satisfaction; Computation; Computer science; Algorithm; Constraint programming; Artificial intelligence","score_opus":0.040876565277885746,"score_gpt":0.17346541842643726,"score_spread":0.1325888531485515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949860269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012895857,0.000010406646,0.9733661,0.00023668341,0.00089587155,0.00048004865,0.000011897041,0.0004258774,0.011677281],"genre_scores_gemma":[0.9928593,0.0000823669,0.0063566216,0.00019917196,0.000054844586,0.0000022175163,0.00017117125,0.000008312699,0.0002660158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998807,0.00011276048,0.00027951517,0.00041723796,0.00012692485,0.00025655306],"domain_scores_gemma":[0.99843836,0.00003701712,0.00042499963,0.0006205601,0.00032003486,0.00015902155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002411974,0.00024150925,0.00018461305,0.00034830056,0.00016568079,0.00025635926,0.0005555936,0.00029895437,0.00019395893],"category_scores_gemma":[0.00006565502,0.00029030722,0.000110213536,0.00047772782,0.00008911391,0.002421235,0.00052127324,0.00035793753,0.00044550514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001347532,0.000039076396,0.0015567781,0.000059579237,0.00003684443,0.000008834436,0.0005435555,0.35754564,0.000012704557,0.61804074,0.00015915785,0.021983642],"study_design_scores_gemma":[0.00048742653,0.000024825875,0.0030247592,0.00005639899,0.00004829215,0.00002092289,0.00012293675,0.9761724,0.0001569698,0.01821885,0.0011974872,0.00046871862],"about_ca_topic_score_codex":0.00006059871,"about_ca_topic_score_gemma":0.000010862937,"teacher_disagreement_score":0.9799634,"about_ca_system_score_codex":0.00027726372,"about_ca_system_score_gemma":0.0003230354,"threshold_uncertainty_score":0.9999549},"labels":[],"label_agreement":null},{"id":"W2950057631","doi":"","title":"Is SP BP","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Unification; Belief propagation; Probabilistic logic; Reduction (mathematics); Constraint (computer-aided design); Constraint satisfaction problem; Token passing; Computer science; Security token; Algorithm; Local consistency; Propagation of uncertainty; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Computer security","score_opus":0.07663108943392101,"score_gpt":0.18211950926483275,"score_spread":0.10548841983091174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950057631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030979432,0.000018811277,0.9520226,0.00034093764,0.0006835763,0.00015066516,0.000009523313,0.00031821485,0.015476236],"genre_scores_gemma":[0.99036586,0.00065086974,0.005261726,0.00048459193,0.000047622467,3.0965435e-7,0.000009551712,0.000009382394,0.003170068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987792,0.000055898825,0.000132025,0.0007533699,0.00007616654,0.0002033907],"domain_scores_gemma":[0.99872714,0.000033004362,0.00014890786,0.00084723963,0.0001187596,0.00012497349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000065103835,0.00019792235,0.00018098156,0.00021762522,0.00014412282,0.000080913705,0.0008652963,0.00021219689,0.00017712355],"category_scores_gemma":[0.000010739101,0.0002461163,0.00016382287,0.0004043826,0.00008190217,0.00030833937,0.00086695876,0.000351682,0.0002665177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022063296,0.00013802147,0.01857871,0.00007319098,0.00017690253,0.00082470605,0.0014181687,0.6554354,0.000020265055,0.29306322,0.015358782,0.014890616],"study_design_scores_gemma":[0.00036988163,0.000019226774,0.005649006,0.000037758746,0.000023646964,0.000022711685,0.000027789043,0.9751778,0.00010055819,0.012255865,0.0058537056,0.00046203856],"about_ca_topic_score_codex":0.00006977078,"about_ca_topic_score_gemma":0.000016108792,"teacher_disagreement_score":0.95938647,"about_ca_system_score_codex":0.00013018209,"about_ca_system_score_gemma":0.00020364234,"threshold_uncertainty_score":0.9999991},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Algorithm; Artificial intelligence","score_opus":0.13179899937845035,"score_gpt":0.43309781396368274,"score_spread":0.3012988145852324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950680102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006466527,0.000058693076,0.98937416,0.0031543614,0.0003754575,0.000127318,4.5530112e-7,0.000041301842,0.00040169933],"genre_scores_gemma":[0.7044448,0.00009123165,0.2950411,0.00013210559,0.00026637298,0.0000012720097,6.720128e-7,0.000004098448,0.000018308147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974569,0.00037881732,0.00067554764,0.00018789757,0.0009853191,0.00031553878],"domain_scores_gemma":[0.9977697,0.00036220616,0.00022099205,0.00030853128,0.0011173037,0.00022126186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002695411,0.000093840885,0.00017200992,0.00051036954,0.00024118823,0.00055955333,0.00069289265,0.000105619365,0.00021520023],"category_scores_gemma":[0.00069983315,0.00008234097,0.00007489429,0.0009714768,0.00010691856,0.0012857876,0.000028599256,0.00064890576,0.000095776835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072336425,0.000105951134,0.0000071972336,0.0000018572133,0.0000054138955,0.000025043566,0.0008360335,0.0016532827,0.00083429203,0.09942779,0.00006404477,0.89703184],"study_design_scores_gemma":[0.000019991923,0.00074337394,0.00056951947,0.000058839385,0.0000027423837,0.00008036155,0.0006867655,0.7412845,0.012791139,0.2435119,0.00015359254,0.00009727454],"about_ca_topic_score_codex":0.00000784536,"about_ca_topic_score_gemma":0.0000044904664,"teacher_disagreement_score":0.89693457,"about_ca_system_score_codex":0.000102983315,"about_ca_system_score_gemma":0.00031202912,"threshold_uncertainty_score":0.53957856},"labels":[],"label_agreement":null},{"id":"W2950777251","doi":"10.48550/arxiv.1506.08905","title":"Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Multiplicative function; Computer science; Centrality; Heuristic; Branching (polymer chemistry); Variable (mathematics); Artificial intelligence; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.23117326404198263,"score_gpt":0.216561740353726,"score_spread":0.014611523688256634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950777251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045967124,0.000018466038,0.9464623,0.00009537577,0.00072056474,0.0002144255,0.000005309862,0.00030870613,0.00620776],"genre_scores_gemma":[0.9958343,0.00013600844,0.003368615,0.00006983774,0.000043999487,4.1200533e-7,0.000027356577,0.000019173185,0.0005002836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981914,0.00021974678,0.00025829265,0.00083629077,0.00013927203,0.0003550031],"domain_scores_gemma":[0.99873006,0.00014520594,0.0002739612,0.00053116865,0.00012228543,0.00019728832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003105586,0.00028690454,0.00032450823,0.00052623404,0.00018442026,0.00022864788,0.0007685475,0.00031494544,0.00003527993],"category_scores_gemma":[0.000095832416,0.00037784,0.000117005126,0.0006116812,0.00011136768,0.00047330113,0.0009499098,0.001048842,0.000044425957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012620921,0.000018423083,0.023246285,0.0000276015,0.000029455257,0.00013710231,0.0009856271,0.90340626,0.000008002462,0.07174246,0.00020346824,0.00018269583],"study_design_scores_gemma":[0.0007387162,0.000029125997,0.0014073547,0.0001316971,0.000026906835,0.0000046394284,0.00066939637,0.98568225,0.0000047559256,0.0103887655,0.00049693766,0.00041944484],"about_ca_topic_score_codex":0.00012230803,"about_ca_topic_score_gemma":0.00027169858,"teacher_disagreement_score":0.9498672,"about_ca_system_score_codex":0.001128077,"about_ca_system_score_gemma":0.00035289174,"threshold_uncertainty_score":0.9998674},"labels":[],"label_agreement":null},{"id":"W2950918115","doi":"","title":"UCP-Networks: A Directed Graphical Representation of Conditional Utilities","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regret; Ceteris paribus; Representation (politics); Preference; Minimax; Computer science; Semantics (computer science); Theoretical computer science; Computation; Function (biology); Mathematical optimization; Mathematics; Algorithm; Machine learning; Statistics; Economics","score_opus":0.05403827366692957,"score_gpt":0.19382915299336756,"score_spread":0.139790879326438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950918115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10479106,0.000022528342,0.8924181,0.00009840457,0.00040653994,0.00024624987,0.000021566017,0.00027429484,0.0017212889],"genre_scores_gemma":[0.99603117,0.00012890596,0.0031517516,0.000040909345,0.000036948302,0.0000021554126,0.000119223405,0.0000072512175,0.00048168423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987007,0.00016816465,0.0002427397,0.00060769246,0.00010975583,0.0001709799],"domain_scores_gemma":[0.99854076,0.00017281095,0.00029196506,0.00056873995,0.0003295303,0.00009621702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009353182,0.00017838538,0.00025346328,0.00029904273,0.000088698864,0.000071302406,0.0005244469,0.00022849733,0.00028356758],"category_scores_gemma":[0.000049437454,0.0002131036,0.00017850798,0.0006299185,0.00021445264,0.00040885338,0.00047721356,0.0003026541,0.000016873346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015172956,0.000057218087,0.008838202,0.000031924472,0.00009244014,0.000018333116,0.00013587406,0.49754864,0.000011243917,0.49165228,0.0006831897,0.0009154909],"study_design_scores_gemma":[0.00027082197,0.00001707357,0.030212328,0.000039606744,0.00002829049,0.0000036372116,0.00005647446,0.8992214,0.00004331407,0.06987746,0.00003954182,0.00019002364],"about_ca_topic_score_codex":0.0001747987,"about_ca_topic_score_gemma":0.00003331446,"teacher_disagreement_score":0.8912401,"about_ca_system_score_codex":0.00006668921,"about_ca_system_score_gemma":0.000119251315,"threshold_uncertainty_score":0.8690113},"labels":[],"label_agreement":null},{"id":"W2952340783","doi":"10.48550/arxiv.1103.3745","title":"The AllDifferent Constraint with Precedences","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Constraint programming; Constraint logic programming; Consistency (knowledge bases); Decomposition method (queueing theory); Constraint satisfaction problem; Constraint satisfaction; Constraint graph; Binary constraint; Computer science; Mathematical optimization; Mathematics; Theoretical computer science; Discrete mathematics; Probabilistic logic; Artificial intelligence","score_opus":0.06913467774796436,"score_gpt":0.17079071652098987,"score_spread":0.10165603877302551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952340783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034637086,0.000033742926,0.9485502,0.0002550485,0.0005524446,0.00032681721,0.0000042953457,0.00023773649,0.01540258],"genre_scores_gemma":[0.9961882,0.00031469567,0.0024694062,0.000046365665,0.000023349121,0.0000016665418,0.0000039356282,0.000007459534,0.0009449062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987585,0.00011787921,0.00014271744,0.000645952,0.00008971152,0.00024522105],"domain_scores_gemma":[0.9985747,0.00011909714,0.0002224819,0.0008162382,0.00014754002,0.000119964636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015915134,0.00022412404,0.00016618328,0.00008771297,0.0003071017,0.00022012828,0.0012076073,0.00013603561,0.00008413082],"category_scores_gemma":[0.000015669953,0.00016433741,0.00009293492,0.0002277153,0.00032459362,0.00021217433,0.0006779428,0.00038897226,0.000036094145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041812902,0.0000531442,0.006374373,0.000022881937,0.00015846756,0.0000772225,0.00051293586,0.06044405,0.0000047599683,0.9193884,0.0002548391,0.01266709],"study_design_scores_gemma":[0.0012105342,0.00028549982,0.030740822,0.00028700603,0.00017459059,0.0000665153,0.00089646096,0.8190234,0.00031661036,0.14417927,0.0013625984,0.0014567057],"about_ca_topic_score_codex":0.00006620488,"about_ca_topic_score_gemma":0.00036430627,"teacher_disagreement_score":0.96155113,"about_ca_system_score_codex":0.000090351576,"about_ca_system_score_gemma":0.00026518773,"threshold_uncertainty_score":0.67014855},"labels":[],"label_agreement":null},{"id":"W2952606068","doi":"10.48550/arxiv.1301.2278","title":"Discovering Multiple Constraints that are Frequently Approximately\\n Satisfied","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Business; Computer science; Economics","score_opus":0.09568724604856205,"score_gpt":0.1828545794301189,"score_spread":0.08716733338155686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952606068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2909806,0.000044342163,0.7006026,0.00017171439,0.0018440923,0.0011482135,0.000106506435,0.00037412168,0.0047277994],"genre_scores_gemma":[0.99011755,0.00073017756,0.007156489,0.00018128094,0.00011237071,0.0000070042124,0.00006754585,0.000061018654,0.0015665625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946323,0.0004177578,0.00070558366,0.002822583,0.00033672593,0.0010850683],"domain_scores_gemma":[0.9950986,0.0003560927,0.0013847229,0.0020619987,0.0004250512,0.0006735455],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038900354,0.001064021,0.000969567,0.00059308595,0.00072770944,0.0010464189,0.0021045299,0.0007836833,0.0021050004],"category_scores_gemma":[0.00014794823,0.0013124923,0.0005806875,0.0009664603,0.0010847268,0.0022777324,0.0022611048,0.0012954981,0.00085067336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082663144,0.00031486948,0.18567245,0.000400899,0.00050180056,0.0005871506,0.001559098,0.65544885,0.0002585741,0.13292907,0.0002720416,0.021972537],"study_design_scores_gemma":[0.001950085,0.000050518065,0.060955822,0.00052471424,0.0001464747,0.000048743503,0.0014908642,0.9261533,0.00036373848,0.0065572443,0.00022966255,0.0015288522],"about_ca_topic_score_codex":0.0008620199,"about_ca_topic_score_gemma":0.00049814244,"teacher_disagreement_score":0.6991369,"about_ca_system_score_codex":0.00069568906,"about_ca_system_score_gemma":0.0005025596,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null},{"id":"W2954536846","doi":"","title":"Chaos-based Discrete Firefly Algorithm for Constraint Satisfaction Problems.","year":2019,"lang":"en","type":"article","venue":"International Conference on Agents and Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; CHAOS (operating system); Constraint satisfaction; Constraint (computer-aided design); Computer science; Firefly algorithm; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.07331704690796252,"score_gpt":0.3251311481515182,"score_spread":0.2518141012435557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954536846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061827777,0.0000047994786,0.9852048,0.0037050885,0.0013036605,0.0005397135,0.000052719257,0.000095370284,0.002911064],"genre_scores_gemma":[0.97048044,0.00003938173,0.028372267,0.0007254448,0.0000654664,0.00005257514,0.00003170202,0.000008881787,0.00022386484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860364,0.000032880533,0.00035424926,0.0004876502,0.000314782,0.00020682046],"domain_scores_gemma":[0.99918246,0.00009625173,0.0001585679,0.000205325,0.0002601199,0.0000972924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019518497,0.00017640064,0.00014645541,0.00015726894,0.00012588719,0.00036623215,0.00031065007,0.000071570605,0.0008304266],"category_scores_gemma":[0.000036238984,0.00016629433,0.00007033989,0.00011268364,0.000107693326,0.0003750851,0.000055274035,0.00012631167,0.00012260138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013987046,0.000033254295,0.00043974005,0.0000072601806,0.000017364517,0.0000012495584,0.0001576469,0.0021355285,0.00036281708,0.3096458,0.000029653509,0.68715566],"study_design_scores_gemma":[0.000120098615,0.00016941692,0.0013085345,0.00006568989,0.0000040712544,0.000004677585,0.00016337146,0.9759278,0.0024524843,0.018410062,0.0011601066,0.00021368383],"about_ca_topic_score_codex":0.00004588364,"about_ca_topic_score_gemma":0.000037475682,"teacher_disagreement_score":0.97379225,"about_ca_system_score_codex":0.000057194906,"about_ca_system_score_gemma":0.0000902617,"threshold_uncertainty_score":0.9092589},"labels":[],"label_agreement":null},{"id":"W2954987224","doi":"10.1007/978-3-030-22999-3_72","title":"Pareto Optimality for Conditional Preference Networks with Comfort","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Preference; Pareto optimal; Computer science; Pareto principle; Mathematical optimization; Outcome (game theory); Multi-objective optimization; Mathematical economics; Mathematics; Machine learning; Statistics","score_opus":0.023647710679425584,"score_gpt":0.2384754124040585,"score_spread":0.21482770172463292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954987224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019460083,0.000055873505,0.9949228,0.00040864377,0.00076959893,0.0008507944,0.000025769015,0.00013861682,0.0028084],"genre_scores_gemma":[0.21833599,0.00002436951,0.7791092,0.0015597515,0.00026040658,0.000033743963,0.00011176205,0.000031004696,0.0005338062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971889,0.000020279886,0.00039679144,0.0012436096,0.0006655194,0.00048485206],"domain_scores_gemma":[0.997851,0.0004596285,0.0002979594,0.0008783982,0.00037388268,0.000139096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004934466,0.00040985763,0.00041853767,0.0003393431,0.00023921086,0.0004483989,0.0014224092,0.00026137763,0.000053141313],"category_scores_gemma":[0.00003073115,0.000355027,0.000095906566,0.00031813548,0.0005534933,0.0006369722,0.00036858872,0.00048633286,0.000012223006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016150738,0.000013514172,0.00045182282,0.000026002772,0.000013482617,0.000006424476,0.000075006086,0.7771589,0.000002595825,0.07558385,0.00004026624,0.14661194],"study_design_scores_gemma":[0.0004337454,0.00022254823,0.0011151307,0.00015664926,0.0000089934365,0.000054640048,1.03346416e-7,0.96840364,0.000045764707,0.027943645,0.0011050772,0.00051006506],"about_ca_topic_score_codex":0.0000065713825,"about_ca_topic_score_gemma":0.000103226055,"teacher_disagreement_score":0.21831653,"about_ca_system_score_codex":0.00022393173,"about_ca_system_score_gemma":0.00087844545,"threshold_uncertainty_score":0.99989015},"labels":[],"label_agreement":null},{"id":"W2961830567","doi":"10.1109/ismvl.2019.00037","title":"Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint (computer-aided design); Constraint satisfaction; Universal algebra; Computational complexity theory; Computer science; Domain (mathematical analysis); Mathematics; Theoretical computer science; Algebra over a field; Local consistency; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.05076496366989229,"score_gpt":0.26143388627274083,"score_spread":0.21066892260284853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961830567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11570522,0.00001152504,0.8759959,0.0008271363,0.00051593804,0.00045427872,0.000025883963,0.00020319725,0.0062609646],"genre_scores_gemma":[0.95948493,0.0000047531125,0.04012556,0.00013687379,0.000015146071,0.0000073096794,0.000024840827,0.000006822614,0.00019374561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99852836,0.00016648321,0.0004260404,0.0003598754,0.0002930795,0.00022617048],"domain_scores_gemma":[0.9989753,0.00013346258,0.000211246,0.00044180418,0.00017288786,0.00006529913],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038536082,0.00015256446,0.00025036355,0.00008240735,0.00006401868,0.0000667747,0.00023318053,0.00007694552,0.0013689736],"category_scores_gemma":[0.00005754747,0.0001404041,0.00008000226,0.00041306432,0.00019811113,0.0005686014,0.000091398804,0.00010872462,0.000109565764],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003854714,0.00011630319,0.39013243,0.000045748573,0.000072080315,0.0000017056149,0.0010248227,0.0035936497,0.0063576037,0.5608294,0.0007080073,0.037079718],"study_design_scores_gemma":[0.0014343861,0.00019917436,0.8598943,0.00003449908,0.000007776471,0.000032420405,0.000053258093,0.12692335,0.0044528707,0.00624265,0.0003490688,0.0003762918],"about_ca_topic_score_codex":0.0022442618,"about_ca_topic_score_gemma":0.0021970593,"teacher_disagreement_score":0.84377974,"about_ca_system_score_codex":0.00004114459,"about_ca_system_score_gemma":0.00013400258,"threshold_uncertainty_score":0.9995439},"labels":[],"label_agreement":null},{"id":"W2963002110","doi":"10.1002/rsa.20740","title":"Inside the clustering window for random linear equations","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Mathematics; Statistical physics; Cluster (spacecraft); Partition (number theory); Random variable; Combinatorics; Physics; Computer science; Statistics","score_opus":0.023716603420420194,"score_gpt":0.28154028905786654,"score_spread":0.25782368563744634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963002110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014266849,0.0000974011,0.99437785,0.0025881457,0.0006426465,0.00046547802,0.000011007276,0.000049744547,0.00034103415],"genre_scores_gemma":[0.881757,0.000095693445,0.11729376,0.00031851706,0.0003306789,0.00004413844,0.000006570663,0.0000090338335,0.00014458584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929315,0.000036824298,0.0001708162,0.00021936289,0.00012350388,0.00015637101],"domain_scores_gemma":[0.99897003,0.00035212428,0.00014138878,0.00041353915,0.00006732172,0.00005561092],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026183252,0.000111978414,0.00016298359,0.000037756028,0.0013637117,0.0005695805,0.00036475004,0.000046588197,0.000012810418],"category_scores_gemma":[0.00025654348,0.000072413495,0.00007553594,0.000036487734,0.00010323942,0.00034430323,0.00012589496,0.000087513305,0.0000010051551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017481,0.000007978625,0.00020059859,0.000020969033,0.0000696581,0.0000029139114,0.00097476796,0.008735551,0.00030120093,0.02611332,0.00016119434,0.96323705],"study_design_scores_gemma":[0.009377827,0.000027664104,0.0062803943,0.000011572236,0.000019155957,0.000024239689,0.000038484217,0.9713415,0.00026920892,0.009661714,0.0028006674,0.00014755658],"about_ca_topic_score_codex":0.000044761866,"about_ca_topic_score_gemma":0.00006297957,"teacher_disagreement_score":0.96308947,"about_ca_system_score_codex":0.000008277745,"about_ca_system_score_gemma":0.00003081322,"threshold_uncertainty_score":0.9999364},"labels":[],"label_agreement":null},{"id":"W2963295189","doi":"10.1145/3134757","title":"Asking the Metaquestions in Constraint Tractability","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Champlain Regional College; Université du Québec à Montréal","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Homomorphism; Algebraic structure; Bounded function; Discrete mathematics; Combinatorics; Set (abstract data type); Time complexity; Class (philosophy); Computational complexity theory; Computer science; Algorithm; Pure mathematics","score_opus":0.027864218014865466,"score_gpt":0.29713080067809094,"score_spread":0.26926658266322545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963295189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069002155,0.000010970151,0.98266685,0.0070107454,0.00058294873,0.00029519098,0.0000059388194,0.00016203901,0.0023651116],"genre_scores_gemma":[0.9631971,0.000012450464,0.036304295,0.00033257407,0.000017812537,0.000040633116,0.0000022407598,0.0000076158935,0.00008527005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985723,0.00035801955,0.0003162409,0.00034448778,0.00022015577,0.00018880809],"domain_scores_gemma":[0.997565,0.00096740667,0.00018168926,0.0011282972,0.0000967363,0.000060921393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002729,0.00014405047,0.00014050156,0.00017219492,0.0011718083,0.00044197278,0.00096158846,0.00006856003,0.00011450868],"category_scores_gemma":[0.00032060017,0.00011892954,0.000103068574,0.00019411257,0.0002833178,0.0007974052,0.000021660726,0.00034114387,0.000045414105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014738937,0.00011369344,0.00023703526,0.000004123826,0.000022234846,0.0000037997875,0.0007980784,0.0844228,0.000038894574,0.11960597,0.000007354484,0.79473126],"study_design_scores_gemma":[0.0014846941,0.000103851184,0.17159651,0.000077212135,0.00004326411,0.00008058206,0.00059879874,0.32568783,0.0010343794,0.49828526,0.0005016144,0.000505996],"about_ca_topic_score_codex":0.000038619524,"about_ca_topic_score_gemma":0.00014338944,"teacher_disagreement_score":0.9562969,"about_ca_system_score_codex":0.00008718465,"about_ca_system_score_gemma":0.000105735526,"threshold_uncertainty_score":0.90127206},"labels":[],"label_agreement":null},{"id":"W2963353587","doi":"","title":"From quantity to intensity: process configuration and grammatical markers","year":2012,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Linguistic Association","funders":"","keywords":"Process (computing); Intensity (physics); Computer science; Artificial intelligence; Mathematics; Physics; Optics; Programming language","score_opus":0.016718396402027484,"score_gpt":0.2653632433019554,"score_spread":0.24864484689992788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963353587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15504834,0.0000041799913,0.8410215,0.0017173407,0.00019095527,0.00008912959,5.385441e-7,0.00008427886,0.001843767],"genre_scores_gemma":[0.9459943,0.0000015013877,0.053255852,0.0006557953,0.000033708064,0.0000032727871,0.0000026310029,0.0000016724695,0.000051274954],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99956775,0.000017618122,0.000093370036,0.000118558484,0.00009783812,0.000104893654],"domain_scores_gemma":[0.9996514,0.000035476,0.000019707137,0.000106174564,0.00006207991,0.0001251723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111725436,0.000049878112,0.00006318411,0.000030257379,0.000046983365,0.00010197728,0.00006753096,0.000027059228,0.00012534148],"category_scores_gemma":[0.000067218636,0.00004377408,0.000009453387,0.00011280799,0.000018233615,0.000558216,0.000035291745,0.000036679685,0.00006137291],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006480341,0.00012681645,0.18108667,0.00002994663,0.00004775398,0.0000025396757,0.008401583,0.00016405435,0.002393895,0.3677077,0.004224109,0.43575013],"study_design_scores_gemma":[0.00041982112,0.00006477057,0.7782387,0.000022086484,0.000013634924,0.000022775199,0.0010727942,0.20889479,0.0049389303,0.004714318,0.0012181418,0.0003792365],"about_ca_topic_score_codex":0.000071799775,"about_ca_topic_score_gemma":0.000037529328,"teacher_disagreement_score":0.79094595,"about_ca_system_score_codex":0.000010775601,"about_ca_system_score_gemma":0.000013199175,"threshold_uncertainty_score":0.17850551},"labels":[],"label_agreement":null},{"id":"W2964537984","doi":"10.1609/socs.v10i1.18488","title":"Enriching Non-Parametric Bidirectional Search Algorithms — Extended Abstract","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Parametric statistics; Node (physics); Computer science; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Engineering; Statistics","score_opus":0.016066502135636738,"score_gpt":0.2688725451607133,"score_spread":0.25280604302507653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964537984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8607569,0.00003861394,0.008952842,0.019221345,0.020170383,0.00067213614,0.000024047631,0.0002510469,0.08991268],"genre_scores_gemma":[0.9952764,0.00004660187,0.003433792,0.00013261515,0.00038428692,0.000014263652,0.000004500652,0.000014331629,0.00069323886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971731,0.000021830381,0.0003728887,0.0004846597,0.001674236,0.0002733382],"domain_scores_gemma":[0.997814,0.00024174649,0.00015041632,0.00019195481,0.0014946127,0.00010726635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208692,0.0001631744,0.00017526391,0.00025282204,0.00025790813,0.00043153705,0.001316844,0.000101073376,0.00012691494],"category_scores_gemma":[0.000276054,0.00014248145,0.00016997606,0.0012108422,0.00007378295,0.0005518948,0.0005809436,0.00047472116,0.000031659136],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018051096,0.0014422573,0.014097569,0.00008628584,0.00033248364,0.000014167021,0.0010089275,0.004255677,0.21674266,0.7199289,0.0023951046,0.039515447],"study_design_scores_gemma":[0.0029098568,0.00027204337,0.08740695,0.00021594406,0.000022115824,0.00015575468,0.00023295112,0.13690004,0.75179666,0.015695997,0.0037824174,0.00060925866],"about_ca_topic_score_codex":0.00008093036,"about_ca_topic_score_gemma":0.0000015396937,"teacher_disagreement_score":0.70423293,"about_ca_system_score_codex":0.000294732,"about_ca_system_score_gemma":0.0002453123,"threshold_uncertainty_score":0.58102256},"labels":[],"label_agreement":null},{"id":"W2964774113","doi":"10.24963/ijcai.2019/900","title":"Conditional Preference Network with Constraints and Uncertainty","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Preference; Ceteris paribus; Computer science; Net (polyhedron); Probabilistic logic; Extension (predicate logic); Stochastic dominance; Semantics (computer science); Preference relation; Graphical model; Set (abstract data type); Theoretical computer science; Artificial intelligence; Mathematical optimization; Mathematics; Economics; Programming language; Microeconomics; Statistics","score_opus":0.010300432731754173,"score_gpt":0.19389511757208905,"score_spread":0.18359468484033487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964774113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022746392,0.0000072186435,0.93856484,0.00050239905,0.00009465795,0.00015820313,0.0000023071639,0.00011171821,0.03781229],"genre_scores_gemma":[0.9505699,0.0000047199205,0.048387434,0.00049804687,0.000013216268,0.0000036954593,0.000007219229,0.0000019374615,0.0005138092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947125,0.000018453073,0.00007701102,0.00019866323,0.000116753276,0.000117871445],"domain_scores_gemma":[0.99966496,0.000059884715,0.000033127995,0.00013405841,0.000052416308,0.000055563713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006843384,0.00006481607,0.00006742616,0.00002339261,0.000051585488,0.00007914374,0.00009423262,0.000025233143,0.0009112236],"category_scores_gemma":[0.0000039808992,0.000049489317,0.000008897178,0.000115454364,0.00008967485,0.00026309263,0.000038357735,0.000053794294,0.000058149628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075788457,0.00000953573,0.047291566,0.00000545892,0.000015163761,0.0000020131706,0.00007301811,0.02349544,0.000028067552,0.89508045,0.00060491776,0.03338679],"study_design_scores_gemma":[0.0020970025,0.00029166974,0.3662906,0.0000619293,0.000009084297,0.00026809584,0.00012833456,0.6049078,0.00008930396,0.020948203,0.0043470343,0.0005609277],"about_ca_topic_score_codex":0.000005694035,"about_ca_topic_score_gemma":0.000021174506,"teacher_disagreement_score":0.92782354,"about_ca_system_score_codex":0.000010578431,"about_ca_system_score_gemma":0.000064136715,"threshold_uncertainty_score":0.99772596},"labels":[],"label_agreement":null},{"id":"W2965238025","doi":"10.24963/ijcai.2019/901","title":"Constraint Solving and Optimization Using Evolutionary Techniques","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Metaheuristic; Computer science; Optimization problem; Constraint (computer-aided design); Evolutionary algorithm; Scheduling (production processes); Set (abstract data type); Resource allocation; Binary constraint; Constraint programming; Constraint logic programming; Mathematics; Stochastic programming","score_opus":0.011297376320911663,"score_gpt":0.2317355549140854,"score_spread":0.22043817859317374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965238025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031174333,0.000022732573,0.9873347,0.00026698114,0.00011401344,0.00015396491,4.911426e-7,0.00026689033,0.008722778],"genre_scores_gemma":[0.32491812,0.000014593105,0.6748075,0.00015254242,0.000009128985,0.0000010581285,0.000001375258,0.0000028854872,0.00009279842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994683,0.000021590693,0.00012036219,0.00019452425,0.00009582362,0.000099352204],"domain_scores_gemma":[0.99968195,0.000028717628,0.000044199114,0.00014429759,0.00006192206,0.00003892509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092831695,0.000066345245,0.000066658846,0.000097963064,0.00007361729,0.00008975983,0.00008470455,0.000042681084,0.0002519994],"category_scores_gemma":[0.000011849238,0.00006515652,0.000016662781,0.00014368867,0.00003567417,0.00059824093,0.00007769358,0.000047488702,0.000007943649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006318858,0.000048411843,0.04124919,0.000039763705,0.000028285058,0.0000051988054,0.00043144845,0.35570285,0.0073669334,0.40300527,0.00029816604,0.19181816],"study_design_scores_gemma":[0.000086329754,0.000014417148,0.0012475088,0.0000132469995,0.0000016306783,0.00005769411,0.00003678701,0.99758154,0.0003897011,0.00033229752,0.00014431286,0.00009450578],"about_ca_topic_score_codex":0.000013578927,"about_ca_topic_score_gemma":0.0000010897485,"teacher_disagreement_score":0.6418787,"about_ca_system_score_codex":0.000037572165,"about_ca_system_score_gemma":0.000052643565,"threshold_uncertainty_score":0.27592164},"labels":[],"label_agreement":null},{"id":"W2966242139","doi":"10.24963/ijcai.2019/175","title":"Direction-Optimizing Breadth-First Search with External Memory Storage","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Heuristics; Computer science; Heuristic; Auxiliary memory; Cube (algebra); Incremental heuristic search; Graph; Search algorithm; Parallel computing; Theoretical computer science; Algorithm; Beam search; Artificial intelligence; Mathematics","score_opus":0.008246674108310384,"score_gpt":0.21201638811704615,"score_spread":0.20376971400873578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966242139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035983026,0.000014708776,0.9168855,0.0005721317,0.00035424158,0.00016266966,3.9373032e-7,0.000277651,0.04574967],"genre_scores_gemma":[0.8355921,0.000011650571,0.15565906,0.00022113752,0.00003895622,0.000005660563,8.723306e-7,0.000009373389,0.008461177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990808,0.00003144149,0.00011437163,0.00030204802,0.00028181484,0.00018952509],"domain_scores_gemma":[0.9994174,0.00005200096,0.0000371625,0.0003281519,0.000081532264,0.00008373771],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015269867,0.000099330464,0.00009685727,0.00011919389,0.000123357,0.00019093677,0.00023677091,0.000035104295,0.0009325495],"category_scores_gemma":[0.0000036754063,0.000080992475,0.00003181571,0.00028135482,0.000027294336,0.0006443212,0.00007196888,0.00011768481,0.00029740154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008569637,0.00021160589,0.07123012,0.000083618324,0.00010424739,0.000069205526,0.0039321906,0.5443063,0.004712734,0.055267524,0.0011710884,0.3188257],"study_design_scores_gemma":[0.0012569212,0.00019705393,0.06930225,0.00008022157,0.00000742377,0.0002431681,0.00032406786,0.92378193,0.0028280304,0.000062006504,0.0014382788,0.00047862812],"about_ca_topic_score_codex":0.0001245797,"about_ca_topic_score_gemma":0.00008047826,"teacher_disagreement_score":0.79960907,"about_ca_system_score_codex":0.000060135662,"about_ca_system_score_gemma":0.00006633362,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W2966464227","doi":"10.48550/arxiv.1908.00089","title":"A Model of Random Industrial SAT","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Satisfiability; Disjoint sets; Generalization; Set (abstract data type); Focus (optics); Boolean satisfiability problem; Mathematics; Computer science; Discrete mathematics; Algorithm; Combinatorics","score_opus":0.13359209454881715,"score_gpt":0.1843312370561455,"score_spread":0.05073914250732836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966464227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09337823,0.0000069114353,0.90237325,0.000060095717,0.0005748907,0.0002687971,0.000017746313,0.000093626106,0.0032264385],"genre_scores_gemma":[0.9956999,0.000051379615,0.0029803037,0.000035384102,0.000028186816,2.8661935e-7,0.00001271149,0.000006921207,0.0011849166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998973,0.00007998312,0.00018450862,0.0005337952,0.000079955076,0.00014874041],"domain_scores_gemma":[0.99874747,0.00007185313,0.00026595092,0.00071588735,0.00012572552,0.000073137795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615259,0.00016521945,0.00028405729,0.00022854346,0.000041981893,0.00004378189,0.00074270606,0.00029005512,0.000042151827],"category_scores_gemma":[0.00003160356,0.00019286397,0.00017409389,0.0002868532,0.000061632585,0.00024933353,0.00077057513,0.00036195523,0.00003714549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042670457,0.000021294312,0.0020703943,0.00001621501,0.000033118416,0.000005327655,0.000094146555,0.9500936,0.00002728798,0.046432942,0.0001459853,0.0010169942],"study_design_scores_gemma":[0.0015786346,0.00001556211,0.00014138012,0.00004187041,0.00003107658,8.8483176e-7,0.000015334901,0.98969555,0.000072170056,0.008182764,0.00003997811,0.00018481113],"about_ca_topic_score_codex":0.000042299715,"about_ca_topic_score_gemma":0.000014930749,"teacher_disagreement_score":0.9023217,"about_ca_system_score_codex":0.00009091044,"about_ca_system_score_gemma":0.0003950506,"threshold_uncertainty_score":0.78647643},"labels":[],"label_agreement":null},{"id":"W2966663453","doi":"10.1609/socs.v10i1.18508","title":"Improving Bidirectional Heuristic Search by Bounds Propagation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Heuristics; Heuristic; Computer science; Node (physics); Bidirectional search; Incremental heuristic search; Algorithm; Mathematical optimization; Running time; Search algorithm; Beam search; Upper and lower bounds; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","score_opus":0.009862664804386103,"score_gpt":0.2391165904643839,"score_spread":0.2292539256599978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966663453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8001244,0.000083885025,0.041966602,0.05592831,0.026329236,0.0012886992,0.000073617266,0.0005055548,0.07369968],"genre_scores_gemma":[0.99719304,0.00002066749,0.0010728101,0.00014502711,0.00026024293,0.000018205146,0.0000103513385,0.000012860052,0.0012667904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976985,0.000031402717,0.000309036,0.00041118203,0.0013344538,0.00021542647],"domain_scores_gemma":[0.9980445,0.00011591888,0.0001395221,0.00014976093,0.001471971,0.000078360834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052096567,0.00013156632,0.00012729352,0.00009804309,0.00026033202,0.00043761238,0.00092786003,0.000078966514,0.00007740251],"category_scores_gemma":[0.0002628646,0.00011590802,0.00010083886,0.0005641627,0.000085392385,0.00048922736,0.0004508355,0.00030303223,0.000015831583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008143534,0.00037822226,0.005751733,0.000051596533,0.00007290903,0.0000016209021,0.00030055814,0.00037104698,0.43802723,0.5435933,0.003700097,0.0076702847],"study_design_scores_gemma":[0.0014072829,0.00017845335,0.0025775305,0.000100482706,0.000012452666,0.00005539775,0.000087464236,0.08109336,0.90380687,0.005955313,0.004428997,0.0002963791],"about_ca_topic_score_codex":0.00007821547,"about_ca_topic_score_gemma":0.0000019877696,"teacher_disagreement_score":0.53763795,"about_ca_system_score_codex":0.0003109464,"about_ca_system_score_gemma":0.00023824583,"threshold_uncertainty_score":0.4726592},"labels":[],"label_agreement":null},{"id":"W2966682271","doi":"10.1609/icaps.v29i1.3490","title":"Error-Tolerant Anytime Approach to Plan Recognition Using a Particle Filter","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"AGE-WELL","keywords":"Computer science; Plan (archaeology); Extension (predicate logic); Particle filter; Filter (signal processing); Artificial intelligence; Tree (set theory); Machine learning; Kalman filter; Programming language; Computer vision; Mathematics","score_opus":0.10255879337915103,"score_gpt":0.2977517847957307,"score_spread":0.1951929914165797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966682271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.962821,0.000012272293,0.028951421,0.0016730968,0.00022663,0.00009962389,0.000009189226,0.00020595679,0.0060008327],"genre_scores_gemma":[0.9280688,0.0000018659515,0.07152045,0.0003223391,0.000022306993,0.0000050530516,0.0000058632268,0.000004999521,0.000048321413],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991222,0.000011379288,0.00020971941,0.00026420728,0.00026412794,0.00012837931],"domain_scores_gemma":[0.9993613,0.00002846384,0.00012874744,0.00006869408,0.00035155515,0.00006128405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018866586,0.00009885305,0.00010977761,0.00007782997,0.00012366723,0.00028594246,0.0002771916,0.000050722494,0.000018830688],"category_scores_gemma":[0.00012666157,0.000083721636,0.000030235622,0.00021806858,0.000024117095,0.00028374075,0.00013498175,0.00013389911,0.0000041534286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026909067,0.0005489492,0.041832533,0.0002137567,0.00038283507,0.0000179651,0.017271971,0.21804692,0.5393788,0.15767977,0.0008978257,0.023459578],"study_design_scores_gemma":[0.00019847798,0.00001646606,0.0026479731,0.00026929166,0.0000067678857,0.00006679277,0.00055600726,0.9760384,0.019628674,0.00044743903,0.000017393666,0.000106340194],"about_ca_topic_score_codex":0.0000074196337,"about_ca_topic_score_gemma":3.285092e-7,"teacher_disagreement_score":0.75799143,"about_ca_system_score_codex":0.000028593337,"about_ca_system_score_gemma":0.000059772065,"threshold_uncertainty_score":0.3414069},"labels":[],"label_agreement":null},{"id":"W2967250176","doi":"10.1613/jair.1.11635","title":"Autonomous Target Search with Multiple Coordinated UAVs","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Holloway, University of London; Engineering and Physical Sciences Research Council; Massachusetts Institute of Technology","keywords":"Submodular set function; Computer science; Greedy algorithm; Exploit; Scalability; Mathematical optimization; Constraint (computer-aided design); Heuristic; Limit (mathematics); Greedy randomized adaptive search procedure; Property (philosophy); Artificial intelligence; Algorithm; Mathematics","score_opus":0.07474897448577872,"score_gpt":0.35415188283743887,"score_spread":0.27940290835166015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967250176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11149906,0.00004916711,0.8843252,0.0020643263,0.00034574926,0.00026619533,0.0000012306948,0.00003265559,0.0014164174],"genre_scores_gemma":[0.9498043,0.000031412146,0.04973138,0.000031715423,0.00008780883,0.0000020844093,7.2743495e-7,0.000010145379,0.00030042615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740344,0.00030749993,0.0005214972,0.00025191993,0.0010591834,0.00045644792],"domain_scores_gemma":[0.99699676,0.0005175643,0.00015387034,0.00033795115,0.0017788344,0.00021501163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027535239,0.000109894616,0.00021615614,0.00066909235,0.0001801228,0.00035899263,0.000834075,0.000076157165,0.00052174926],"category_scores_gemma":[0.00026288003,0.00008522745,0.000074869444,0.0013403732,0.00016901604,0.0007856794,0.00014374706,0.00077976094,0.00040913754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063856016,0.0005488784,0.0216779,0.00005898705,0.00013109886,0.00032638226,0.0037728667,0.17843701,0.022675095,0.08387392,0.00060723786,0.68725204],"study_design_scores_gemma":[0.00018199022,0.0015592726,0.0019028354,0.00010442617,0.0000039547836,0.00029563467,0.0019675458,0.89027697,0.096232556,0.0055246213,0.0016997178,0.00025047964],"about_ca_topic_score_codex":0.00005541185,"about_ca_topic_score_gemma":0.000026792937,"teacher_disagreement_score":0.83830523,"about_ca_system_score_codex":0.00016767885,"about_ca_system_score_gemma":0.00070505036,"threshold_uncertainty_score":0.57127887},"labels":[],"label_agreement":null},{"id":"W296762978","doi":"10.1007/978-1-4614-6170-8_327","title":"Spatiotemporal Reasoning and Decision Support Tools","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Management science; Engineering","score_opus":0.019044735820670167,"score_gpt":0.23574373673727586,"score_spread":0.21669900091660568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W296762978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004934351,0.000011048344,0.5909973,0.00011684296,0.00017180895,0.00007169071,0.000001495845,0.00009557332,0.40852934],"genre_scores_gemma":[0.004643923,0.00015349242,0.5851897,0.0007228744,0.000116333234,0.0000027537233,0.000041736752,0.000025989953,0.4091032],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990396,0.0000062499075,0.00024063057,0.0003747513,0.00023053818,0.00010824759],"domain_scores_gemma":[0.9992492,0.0001003559,0.00013572864,0.0003466969,0.000074702904,0.000093294635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017934231,0.0001711705,0.0001879796,0.00013203827,0.00007772833,0.00026205496,0.00018563459,0.00017876942,0.0010248453],"category_scores_gemma":[0.000031008807,0.00015946366,0.00005082952,0.000020601548,0.000037264315,0.00026928048,0.00015419636,0.00013967232,0.00015173292],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010197273,4.940878e-7,0.00002516392,0.0000023770947,0.0000033716433,0.0000026728894,0.000012581677,0.000010432992,4.4386587e-7,0.44573182,0.0015062526,0.5527034],"study_design_scores_gemma":[0.00076531916,0.00019999317,0.0019408864,0.00029357505,0.000028729402,0.00021043509,0.000004525646,0.12092929,0.000031129894,0.08429077,0.7902338,0.0010715317],"about_ca_topic_score_codex":0.0000060108478,"about_ca_topic_score_gemma":0.000030250894,"teacher_disagreement_score":0.7887276,"about_ca_system_score_codex":0.00002571742,"about_ca_system_score_gemma":0.000067042165,"threshold_uncertainty_score":0.99988836},"labels":[],"label_agreement":null},{"id":"W2967642867","doi":"10.1109/cec.2019.8789903","title":"Self-Adaptive Discrete Firefly Algorithm for Minimal Perturbation in Dynamic Constraint Satisfaction Problems","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Mathematical optimization; Constraint satisfaction; Computer science; Constraint logic programming; Algorithm; Scheduling (production processes); Dynamic priority scheduling; Constraint programming; Mathematics; Artificial intelligence","score_opus":0.008030081502091758,"score_gpt":0.2306136238375643,"score_spread":0.22258354233547256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967642867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006799317,0.000014068055,0.9880106,0.0007410963,0.00040360435,0.0011374016,0.000011114831,0.00024626777,0.0026365267],"genre_scores_gemma":[0.5455369,0.000012263668,0.45381722,0.00011644459,0.000010271047,0.00006207381,0.000014816406,0.000007872947,0.00042216913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987839,0.000047054687,0.000308431,0.0004313682,0.0001874733,0.00024179925],"domain_scores_gemma":[0.9993805,0.00012337616,0.00011830296,0.0002156196,0.00010284691,0.000059307356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002142862,0.00015446109,0.0001627419,0.0001766103,0.0000669806,0.00011549103,0.00014786964,0.00009469867,0.0000977526],"category_scores_gemma":[0.000013758353,0.00014541126,0.00006704125,0.00026461715,0.00002652514,0.0008120841,0.00004262685,0.00010805488,0.00004847649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014128019,0.000053515207,0.0036450394,0.000034027966,0.000031796248,0.0000014404256,0.0015305909,0.0026364492,0.0004090602,0.044475228,0.000048364695,0.94712037],"study_design_scores_gemma":[0.00087889144,0.00017261434,0.022671575,0.000019895502,0.000004194671,0.000013325959,0.00020070505,0.9736696,0.000075091855,0.0018105131,0.0002824409,0.00020113544],"about_ca_topic_score_codex":0.000055415643,"about_ca_topic_score_gemma":0.00023813704,"teacher_disagreement_score":0.97103316,"about_ca_system_score_codex":0.00021845165,"about_ca_system_score_gemma":0.00011362761,"threshold_uncertainty_score":0.5929699},"labels":[],"label_agreement":null},{"id":"W2970703080","doi":"10.4230/lipics.mfcs.2019.60","title":"Approximate Counting CSP Seen from the Other Side","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science","score_opus":0.010326148565543786,"score_gpt":0.2228140260968382,"score_spread":0.21248787753129442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970703080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0925627,0.000028018278,0.883701,0.0016654495,0.0015255269,0.0013921565,0.0003148952,0.00038499048,0.018425252],"genre_scores_gemma":[0.9155736,0.000019569541,0.07597386,0.0069538034,0.00023992691,0.0000807621,0.00027404056,0.000052319283,0.0008320975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981202,0.00003938059,0.0006906787,0.00025323406,0.0004243497,0.00047214146],"domain_scores_gemma":[0.9982498,0.00025907526,0.0003897881,0.0008347347,0.00017332094,0.00009322821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050066813,0.00026523796,0.00026341053,0.00009175993,0.00029227027,0.0006952898,0.0009901315,0.00013386057,0.00016986454],"category_scores_gemma":[0.00005593453,0.00019699443,0.00015985213,0.00025933434,0.00006755964,0.0017023839,0.00030688033,0.00028559737,0.0005681406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024353883,0.000558185,0.31718668,0.00081256527,0.0010906468,0.000008116987,0.07876648,0.013420091,0.00095582893,0.2426079,0.021828145,0.3225218],"study_design_scores_gemma":[0.0024761118,0.000071622155,0.0083845565,0.00013124665,0.000027277154,0.00002459704,0.001465135,0.82616764,0.00058004557,0.0014486299,0.15864451,0.00057859137],"about_ca_topic_score_codex":0.00008913584,"about_ca_topic_score_gemma":0.000047406316,"teacher_disagreement_score":0.8230109,"about_ca_system_score_codex":0.00007578124,"about_ca_system_score_gemma":0.000070177826,"threshold_uncertainty_score":0.80332},"labels":[],"label_agreement":null},{"id":"W2972724272","doi":"10.1613/jair.1.11487","title":"From Support Propagation to Belief Propagation in Constraint Programming","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arity; Solver; Computer science; Local consistency; Belief propagation; Constraint (computer-aided design); Constraint programming; Inference; Mathematical optimization; Convergence (economics); Theoretical computer science; Variable (mathematics); Constraint logic programming; Boolean data type; Constraint satisfaction; Algorithm; Mathematics; Artificial intelligence; Stochastic programming; Discrete mathematics","score_opus":0.08579345085781687,"score_gpt":0.3838650013356858,"score_spread":0.29807155047786893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972724272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19820906,0.0000110474975,0.79688275,0.003300307,0.0004661659,0.0006518352,0.0000012160323,0.000020044334,0.00045755756],"genre_scores_gemma":[0.9521128,0.000012795817,0.04760198,0.00004891413,0.00015341985,0.000010063988,0.0000021709068,0.000006954919,0.000050898758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972983,0.00026042428,0.00080936524,0.00027541598,0.0010032333,0.00035326977],"domain_scores_gemma":[0.998109,0.00024986558,0.00021334126,0.0002448701,0.0010111033,0.00017182715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032041713,0.00009784304,0.00019107047,0.00083746546,0.000081786086,0.0003520946,0.00052825134,0.00007788459,0.00029395678],"category_scores_gemma":[0.00055366097,0.00008846561,0.00006061448,0.0013269923,0.00008182457,0.0008213199,0.000110586625,0.00052169623,0.00035084548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006256281,0.0001350209,0.0015148752,0.000011316788,0.0000086694,0.000031967378,0.0031965552,0.005850549,0.016341195,0.019226896,0.00005379315,0.9535666],"study_design_scores_gemma":[0.00048892107,0.004598605,0.01018512,0.00091502967,0.000013433358,0.00021865747,0.015091013,0.54909897,0.34814948,0.06531841,0.005001518,0.0009208529],"about_ca_topic_score_codex":0.000096455195,"about_ca_topic_score_gemma":0.0001179096,"teacher_disagreement_score":0.9526457,"about_ca_system_score_codex":0.00024707956,"about_ca_system_score_gemma":0.0005877,"threshold_uncertainty_score":0.4509526},"labels":[],"label_agreement":null},{"id":"W2990034237","doi":"10.1109/smc.2019.8914046","title":"Constrained LP-trees","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Lexicographical order; Outcome (game theory); Tree (set theory); Mathematical optimization; Computer science; Preference; Search tree; Set (abstract data type); Mathematics; Search algorithm; Combinatorics; Statistics; Mathematical economics","score_opus":0.006319064842535145,"score_gpt":0.20864751644265456,"score_spread":0.20232845160011942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990034237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074362927,0.000003927557,0.7970736,0.0011533231,0.00028298516,0.00007646507,3.1907342e-7,0.0002230209,0.19375005],"genre_scores_gemma":[0.9381367,0.000002369453,0.057162743,0.0005504842,0.000009178288,0.00000120588,9.561534e-7,0.0000017262241,0.0041346387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999611,0.000010924342,0.00007536569,0.00013425137,0.00008451719,0.00008394639],"domain_scores_gemma":[0.9996957,0.000028362996,0.000019860196,0.00019244805,0.000028085138,0.00003550137],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00005153646,0.000043499575,0.000048512713,0.00004310886,0.00002250001,0.00006534865,0.00015039217,0.000020846928,0.001723686],"category_scores_gemma":[0.0000072804764,0.00003764346,0.000022726166,0.00012243066,0.00001527275,0.00026084646,0.00003703873,0.000031312975,0.00081347756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011208183,0.0000135583305,0.0144811245,0.0000024587255,0.0000071570307,0.0000018005895,0.00011489615,0.00073600526,0.0014228111,0.8493509,0.001125046,0.1327431],"study_design_scores_gemma":[0.0014873529,0.00012202922,0.10368114,0.000016852619,0.0000041421818,0.00007849561,0.00018282309,0.8532524,0.0036513098,0.0055597886,0.031426433,0.0005372054],"about_ca_topic_score_codex":0.000006089698,"about_ca_topic_score_gemma":0.0000120214545,"teacher_disagreement_score":0.9307004,"about_ca_system_score_codex":0.000008601565,"about_ca_system_score_gemma":0.0000334494,"threshold_uncertainty_score":0.9999645},"labels":[],"label_agreement":null},{"id":"W2991311469","doi":"10.1109/smc.2019.8914496","title":"Discrete Particle Swarm Optimization Algorithm for Dynamic Constraint Satisfaction with Minimal Perturbation","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Mathematical optimization; Computer science; Constraint satisfaction; Particle swarm optimization; Algorithm; Constraint logic programming; Local consistency; Scheduling (production processes); Constraint programming; Mathematics; Artificial intelligence","score_opus":0.006169122267158296,"score_gpt":0.2247085650377693,"score_spread":0.218539442770611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991311469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012121316,0.0000078160965,0.984761,0.00093703525,0.00027742304,0.00074073055,0.000009125101,0.0002678387,0.0008777135],"genre_scores_gemma":[0.50911874,0.0000064328133,0.49003464,0.00013913907,0.000013061285,0.000036888716,0.000026966667,0.000009445549,0.0006147142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988682,0.00003489374,0.00023993634,0.00040276675,0.00022152651,0.00023262901],"domain_scores_gemma":[0.99925333,0.00009452753,0.00012315244,0.0002713371,0.00017391743,0.00008375759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014649234,0.00015168668,0.00013948312,0.0000791389,0.00012366123,0.00019400721,0.00012626254,0.000066412416,0.00022263984],"category_scores_gemma":[0.000016353173,0.00012744045,0.000052579435,0.00025759454,0.00004539777,0.00096604635,0.00002907938,0.000067275854,0.00003543676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044989793,0.00004494742,0.0061164396,0.000022158978,0.00005050359,0.0000013715327,0.00044743574,0.36741453,0.00067580125,0.037295837,0.00006137786,0.5878246],"study_design_scores_gemma":[0.0010405144,0.00023530354,0.0061071757,0.000012589075,0.000011254637,0.000024130315,0.00016032577,0.99130625,0.000602878,0.00021361248,0.00007698215,0.00020896753],"about_ca_topic_score_codex":0.000022072745,"about_ca_topic_score_gemma":0.000055654127,"teacher_disagreement_score":0.6238917,"about_ca_system_score_codex":0.000097786164,"about_ca_system_score_gemma":0.00008942339,"threshold_uncertainty_score":0.51968706},"labels":[],"label_agreement":null},{"id":"W2991440942","doi":"10.1109/smc.2019.8914624","title":"Solving Weighted Constraint Satisfaction Problems Using a new Self-Adaptive Discrete Firefly Algorithm","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Firefly algorithm; Constraint (computer-aided design); Constraint satisfaction; Firefly protocol; Computer science; Constraint satisfaction problem; Algorithm; Mathematical optimization; Algorithm design; Mathematics; Artificial intelligence","score_opus":0.01430815026089015,"score_gpt":0.2319421320822326,"score_spread":0.21763398182134244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991440942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007950343,0.000021960557,0.9851179,0.00034150435,0.00062405743,0.00051482394,0.0000028546137,0.0006081319,0.0048184134],"genre_scores_gemma":[0.3424828,0.000011977656,0.6569145,0.00014948478,0.000048588587,0.0000037299637,0.0000031342688,0.00001136501,0.00037443076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984673,0.00006513029,0.000328537,0.0004999298,0.00031671854,0.0003223507],"domain_scores_gemma":[0.99913204,0.000064935935,0.00017011137,0.0003505014,0.000112021655,0.00017038458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016609704,0.00020957144,0.00020232746,0.00016242231,0.00015602745,0.0002678272,0.00020943912,0.00010189264,0.0005935215],"category_scores_gemma":[0.000007527619,0.00019292612,0.000084297426,0.00042510597,0.00003217259,0.0012118932,0.00011555916,0.00017692067,0.00015794237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007312818,0.000038221,0.006855217,0.000023172846,0.0001280988,0.000008376419,0.0023072588,0.0049735657,0.0030567558,0.04407538,0.00024372687,0.9382829],"study_design_scores_gemma":[0.0005966024,0.00007329593,0.0050095986,0.000042150437,0.000012303201,0.00007207345,0.00013560028,0.9915119,0.00044652677,0.0014709076,0.00033473576,0.00029431464],"about_ca_topic_score_codex":0.0006587303,"about_ca_topic_score_gemma":0.000092107264,"teacher_disagreement_score":0.98653835,"about_ca_system_score_codex":0.00019593445,"about_ca_system_score_gemma":0.00032612792,"threshold_uncertainty_score":0.7867299},"labels":[],"label_agreement":null},{"id":"W3000553024","doi":"10.1007/s10601-019-09306-w","title":"Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem","year":2020,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"","keywords":"Integer programming; Solver; Exploit; Computer science; Set (abstract data type); Mathematical optimization; Integer (computer science); Inductive logic programming; Tree (set theory); Linear programming; Space (punctuation); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Combinatorics; Programming language","score_opus":0.022001028728399662,"score_gpt":0.26294755684758375,"score_spread":0.2409465281191841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000553024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032665525,0.000008574455,0.961895,0.003969362,0.000036437712,0.00091218314,0.0000061106434,0.00017681945,0.00032998042],"genre_scores_gemma":[0.8209844,0.0000037533869,0.17824008,0.00065190083,0.000023478684,0.00006835464,0.000015189762,0.000008539422,0.000004266899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868894,0.000070823866,0.00020710705,0.00049422804,0.0003124442,0.0002264489],"domain_scores_gemma":[0.99912643,0.00006499364,0.000056374436,0.00030512267,0.00016578769,0.00028127083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043126,0.00015088658,0.00012490519,0.000079369536,0.0001639552,0.0003844951,0.00041409954,0.000059687332,0.000030785468],"category_scores_gemma":[0.00003743898,0.00010012079,0.00002132116,0.00062047795,0.00016436877,0.00034492576,0.00014611978,0.0002312772,0.00003732678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027563141,0.000019296682,0.0022133128,0.000005503136,0.000009366535,0.0000046484506,0.0021673338,0.00067284144,0.00012188864,0.003304961,0.000042237207,0.99141103],"study_design_scores_gemma":[0.0022354536,0.0014550019,0.027583774,0.00016179893,0.00003518491,0.00030852717,0.005351298,0.9473659,0.0008872527,0.0024779884,0.0112448465,0.00089299574],"about_ca_topic_score_codex":0.000029394834,"about_ca_topic_score_gemma":0.00024881,"teacher_disagreement_score":0.99051803,"about_ca_system_score_codex":0.000037424605,"about_ca_system_score_gemma":0.00013032768,"threshold_uncertainty_score":0.40828076},"labels":[],"label_agreement":null},{"id":"W3000821546","doi":"10.5555/1704843.1705075","title":"Typical case complexity of Satisfiability Algorithms and the threshold phenomenon","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Satisfiability; Mathematics; Algorithm; Phenomenon; Computational complexity theory; Boolean satisfiability problem; Subject (documents); Theoretical computer science; Computer science","score_opus":0.02678851015357779,"score_gpt":0.2563801699547778,"score_spread":0.2295916598012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000821546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026626147,0.000029340006,0.9604689,0.0012173926,0.000030704392,0.0004117238,0.000007560614,0.00006670132,0.011141559],"genre_scores_gemma":[0.6732351,0.000007244889,0.32663462,0.00007850912,0.000017214175,0.000012825245,0.0000014142847,0.0000039926276,0.000009090746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991837,0.000019653982,0.00031507498,0.00018493501,0.00017125225,0.00012536049],"domain_scores_gemma":[0.99917525,0.00017491473,0.00013215536,0.00042893286,0.000035443885,0.000053316362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014759,0.00010790833,0.00021068518,0.000029219676,0.00011690285,0.00005878961,0.0001939509,0.00003967436,0.00004683148],"category_scores_gemma":[0.000023098026,0.00007241317,0.000039644725,0.00013451578,0.00051631953,0.000106976884,0.00015373428,0.0000986799,0.0000071426584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009947344,0.000033017925,0.000021870219,0.000032225482,0.000012114572,0.000001646492,0.0022471375,0.00019775449,0.000051532475,0.9722166,0.000018745523,0.025157416],"study_design_scores_gemma":[0.0012457909,0.000016938084,0.0004549253,0.000009455972,0.000024813817,0.00018863806,0.00055701606,0.7922133,0.00039547202,0.20463213,0.00009982687,0.00016167235],"about_ca_topic_score_codex":0.0000062027734,"about_ca_topic_score_gemma":0.000023679311,"teacher_disagreement_score":0.79201555,"about_ca_system_score_codex":0.00001864964,"about_ca_system_score_gemma":0.000018262934,"threshold_uncertainty_score":0.29529232},"labels":[],"label_agreement":null},{"id":"W3006499216","doi":"10.1109/ictai.2019.00062","title":"A Divide and Conquer Algorithm for Dominance Testing in Acyclic CP-Nets","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Divide and conquer algorithms; Computer science; Dominance (genetics); Ceteris paribus; Preference; Net (polyhedron); Algorithm; Theoretical computer science; Mathematics; Statistics","score_opus":0.01346909831196018,"score_gpt":0.23720795961943297,"score_spread":0.22373886130747278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006499216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019296061,0.00001843064,0.97723144,0.0005289527,0.00012261991,0.0002507419,9.321868e-7,0.000051190615,0.002499615],"genre_scores_gemma":[0.5273614,0.000004889495,0.47159114,0.00039767605,0.000010259879,0.000015284682,8.178198e-7,0.000003026883,0.00061548647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952435,0.000010919509,0.000107949134,0.00019151233,0.0000516196,0.00011366202],"domain_scores_gemma":[0.9996022,0.00019242204,0.000033686414,0.00011248972,0.00003263206,0.00002656458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012098024,0.000052916894,0.000074954245,0.000051738225,0.000027206132,0.000062672494,0.000084216976,0.000024695688,0.000018971885],"category_scores_gemma":[0.000047055335,0.000048841277,0.000010224251,0.00014153568,0.00001376139,0.00029129777,0.000050277777,0.000034940535,0.000011890358],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.982857e-7,0.000006704552,0.019912224,0.0000046592263,0.0000013257159,7.5015254e-7,0.00010232654,0.00019530635,0.00028691828,0.005151937,0.00008190351,0.97425514],"study_design_scores_gemma":[0.0007072107,0.000031252493,0.064832106,0.000019477831,8.1919393e-7,0.000011915108,0.0000106834705,0.9309997,0.00030304817,0.0015431353,0.0014388196,0.00010181441],"about_ca_topic_score_codex":0.000035344925,"about_ca_topic_score_gemma":0.000031591917,"teacher_disagreement_score":0.97415334,"about_ca_system_score_codex":0.000013041696,"about_ca_system_score_gemma":0.000022670256,"threshold_uncertainty_score":0.19916895},"labels":[],"label_agreement":null},{"id":"W3009355918","doi":"10.1080/03155986.2020.1729064","title":"K-best feasible clusters - ranking optimal solutions from an infeasible LP","year":2020,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ranking (information retrieval); Mathematical optimization; Computer science; Simple (philosophy); Decision maker; Task (project management); Mathematics; Operations research; Artificial intelligence; Engineering","score_opus":0.1186137847136109,"score_gpt":0.34989336145287137,"score_spread":0.23127957673926047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009355918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017876614,0.000102267004,0.9647758,0.0056582103,0.0003241381,0.0008014995,0.00008551368,0.00016659162,0.010209337],"genre_scores_gemma":[0.98599887,0.000058011607,0.012043378,0.0012327491,0.00019297175,0.00008756984,0.00027814828,0.0000065557924,0.00010177347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785936,0.00014362052,0.00053756754,0.00021196275,0.00093061535,0.00031690465],"domain_scores_gemma":[0.9983658,0.00016198977,0.00009621235,0.00022896026,0.0008314671,0.00031552732],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091583794,0.00012761945,0.00014870056,0.00029848475,0.00087059505,0.002369047,0.0003616225,0.00010283709,0.00008763343],"category_scores_gemma":[0.00023993729,0.00012224731,0.000033308683,0.00061780773,0.00008775469,0.00903404,0.00023156354,0.00027314073,0.0003228747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009591814,0.000055136665,0.0040657474,0.00011550608,0.00006792885,0.000003847526,0.017560944,0.3414475,0.00029585903,0.57641244,0.006638819,0.05324036],"study_design_scores_gemma":[0.0006825465,0.00012180837,0.0018719843,0.000032520744,0.0000023914238,0.000013877657,0.0017547591,0.9542053,0.000042927855,0.000057013796,0.04105258,0.00016234275],"about_ca_topic_score_codex":0.00060444506,"about_ca_topic_score_gemma":0.000031356492,"teacher_disagreement_score":0.96812224,"about_ca_system_score_codex":0.00008738143,"about_ca_system_score_gemma":0.00044433045,"threshold_uncertainty_score":0.9986666},"labels":[],"label_agreement":null},{"id":"W301099071","doi":"","title":"Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Clique problem; Satisfiability; Monotone polygon; Clique; Computer science; Time complexity; Random graph; Local search (optimization); Mathematics; Boolean satisfiability problem; Graph; Theoretical computer science; Mathematical optimization; Algorithm; Combinatorics; Line graph; Pathwidth","score_opus":0.09141986618334437,"score_gpt":0.35647440367216593,"score_spread":0.2650545374888216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W301099071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073686555,0.0000031092457,0.90246624,0.019815972,0.00009042734,0.00034336996,0.000048614176,0.000043129414,0.003502589],"genre_scores_gemma":[0.94518733,0.000017602946,0.05443461,0.0002599064,0.000033481312,0.000040645853,0.000008315342,0.0000051109414,0.0000129846685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985495,0.00008789967,0.000628841,0.0003836068,0.00017641539,0.00017373188],"domain_scores_gemma":[0.9989244,0.00017764668,0.000104548795,0.00025183885,0.00043716066,0.00010441575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045244733,0.00013351355,0.00016581961,0.00034446953,0.000075898184,0.00012238862,0.0003482124,0.00005305394,0.000110119036],"category_scores_gemma":[0.00018000332,0.00013168732,0.000044451015,0.00035434347,0.000116151416,0.00029721126,0.00008740664,0.00018848844,0.000024310328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015512145,0.00025975585,0.0001546583,0.000004507134,0.000004814066,4.216086e-7,0.0019092065,0.005792379,0.009029129,0.5308443,0.0000050233207,0.45198035],"study_design_scores_gemma":[0.00017513061,0.00025772062,0.0038919877,0.0001297086,0.0000025328784,0.000014124948,0.0005673896,0.8173297,0.06507365,0.11220253,0.0001116389,0.00024389499],"about_ca_topic_score_codex":0.000051040566,"about_ca_topic_score_gemma":0.00041187566,"teacher_disagreement_score":0.8715008,"about_ca_system_score_codex":0.00010256647,"about_ca_system_score_gemma":0.0001295617,"threshold_uncertainty_score":0.53700536},"labels":[],"label_agreement":null},{"id":"W3023400052","doi":"10.4230/lipics.icalp.2020.110","title":"Sensitive Instances of the Constraint Satisfaction Problem","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Idempotence; Tuple; Mathematics; Context (archaeology); Subalgebra; Variety (cybernetics); Consistency (knowledge bases); Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.018631219693516422,"score_gpt":0.24485251207343764,"score_spread":0.22622129237992122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023400052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019967837,0.000021363878,0.9639385,0.0026645935,0.002530564,0.0027341445,0.0011119755,0.00029136855,0.006739689],"genre_scores_gemma":[0.90120435,0.00006352152,0.09736729,0.0009149231,0.00009457943,0.00010001656,0.00018451155,0.000027771695,0.000043052514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969325,0.00009927643,0.0014429588,0.0004290165,0.0006704547,0.00042576116],"domain_scores_gemma":[0.9966461,0.00014619438,0.0015490182,0.000917471,0.00058670394,0.00015452325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003879596,0.0004860998,0.0006185361,0.00020101848,0.00028907086,0.00039592237,0.0010283892,0.0004031434,0.000021195667],"category_scores_gemma":[0.00012337613,0.00039159783,0.00045243822,0.00038790028,0.00032333442,0.0008933954,0.0012968675,0.00095773826,0.000021532915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035983062,0.00051086454,0.038562343,0.0084205065,0.0020596394,0.000015067236,0.0925054,0.042806067,0.0008910018,0.38505036,0.009569276,0.41924965],"study_design_scores_gemma":[0.0065220166,0.00041812635,0.05247996,0.0028710165,0.00032762138,0.0002503382,0.0061783264,0.8716562,0.011173632,0.0266973,0.018610327,0.0028151711],"about_ca_topic_score_codex":0.000048689595,"about_ca_topic_score_gemma":0.00013646406,"teacher_disagreement_score":0.8812365,"about_ca_system_score_codex":0.00021230835,"about_ca_system_score_gemma":0.00050579605,"threshold_uncertainty_score":0.9998536},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04400025295225241,"score_gpt":0.2862828622392445,"score_spread":0.24228260928699208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033044509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004494737,0.00001650323,0.9883503,0.0021135719,0.00061803637,0.00050903537,0.0000010005011,0.00009588645,0.0038009402],"genre_scores_gemma":[0.94082123,0.000044906898,0.058896657,0.000074008196,0.000031683518,0.000034114746,0.0000022463023,0.0000074295913,0.00008774458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875665,0.000017208462,0.00040858984,0.00034435053,0.00026020088,0.00021300367],"domain_scores_gemma":[0.9985519,0.000114930146,0.00030243816,0.00010312987,0.00086213776,0.00006543025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003616845,0.00014066562,0.00017666238,0.000058443202,0.00030779932,0.0003552356,0.00030706136,0.000069015296,0.00003847718],"category_scores_gemma":[0.00062630285,0.00012548729,0.00006652033,0.00035373025,0.00017244303,0.00030157884,0.00018621491,0.00017975252,0.0000020109758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021546035,0.0000386939,0.00020491095,0.000032506916,0.000012046351,2.0671611e-7,0.0006026276,0.011562902,0.0030441203,0.8797358,0.000007985888,0.1047366],"study_design_scores_gemma":[0.00012080141,0.00019816968,0.000021383717,0.00016328857,0.000014354829,0.00001038676,0.0011190147,0.83533067,0.13532117,0.027287813,0.00022807324,0.0001848817],"about_ca_topic_score_codex":0.0000043152054,"about_ca_topic_score_gemma":0.0000013100126,"teacher_disagreement_score":0.93632644,"about_ca_system_score_codex":0.00003453405,"about_ca_system_score_gemma":0.0001297115,"threshold_uncertainty_score":0.5117223},"labels":[],"label_agreement":null},{"id":"W3035688374","doi":"10.24963/ijcai.2020/156","title":"Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Deutsche Forschungsgemeinschaft; Trond Mohn stiftelse; Norges Forskningsråd; Univerzita Karlova v Praze","keywords":"Computer science; Variety (cybernetics); Diversity (politics); Mathematical optimization; Decomposition; Theoretical computer science; Relevance (law); Tree (set theory); Dynamic programming; Fixed point; Combinatorial optimization; Through-the-lens metering; Mathematics; Algorithm; Lens (geology); Artificial intelligence; Combinatorics","score_opus":0.14002491952542329,"score_gpt":0.2924585757050936,"score_spread":0.1524336561796703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035688374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011510528,0.00002562216,0.9831547,0.0028247475,0.00033181018,0.00037395052,0.000022871014,0.0000996117,0.0016561744],"genre_scores_gemma":[0.95072615,0.000059337723,0.04894689,0.00020132831,0.00002075156,0.000009344999,0.000017625089,0.0000036903539,0.000014879853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843377,0.0004051299,0.0003761103,0.0003860867,0.00028816375,0.00011076339],"domain_scores_gemma":[0.9982688,0.00030931048,0.00034296946,0.0008175798,0.00022951038,0.000031828487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005343781,0.0001378612,0.00022989456,0.000043341774,0.0002725939,0.000037632795,0.00072535925,0.00013275226,0.00012659669],"category_scores_gemma":[0.0001995164,0.00010477878,0.000152429,0.00018457917,0.0002110418,0.0013047814,0.0021988428,0.00027026594,0.000003174074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054527616,0.00030908838,0.0018713163,0.00015523472,0.00012273763,6.240138e-7,0.038948912,0.03813657,0.00029358815,0.8859396,0.00021597336,0.033951808],"study_design_scores_gemma":[0.0003764498,0.0001764356,0.028393822,0.000053219454,0.00010017885,0.000002127988,0.0023414188,0.2640626,0.002612253,0.70131195,0.00016156158,0.0004079732],"about_ca_topic_score_codex":0.00023425488,"about_ca_topic_score_gemma":0.0001083236,"teacher_disagreement_score":0.9392156,"about_ca_system_score_codex":0.000037740112,"about_ca_system_score_gemma":0.0001391846,"threshold_uncertainty_score":0.42727548},"labels":[],"label_agreement":null},{"id":"W3037149420","doi":"10.4230/lipics.icalp.2020.110","title":"Sensitive instances of the constraint satisfaction problem","year":2020,"lang":"en","type":"article","venue":"Homo Politicus (Academy of Humanities and Economics in Lodz)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; European Commission","keywords":"Constraint satisfaction problem; Tuple; Idempotence; Mathematics; Context (archaeology); Local consistency; Variety (cybernetics); Subalgebra; Discrete mathematics; Unanimity; Theoretical computer science; Computer science; Algebra over a field; Pure mathematics","score_opus":0.0315697858156033,"score_gpt":0.21868054898892733,"score_spread":0.18711076317332404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037149420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97079766,0.00011454267,0.005496582,0.005584215,0.00015754568,0.00033824396,0.000061008945,0.00003617644,0.017414],"genre_scores_gemma":[0.9965633,0.00018512447,0.0022094012,0.0009784797,0.000033046617,0.0000034456236,6.446574e-7,0.0000045187016,0.00002199776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991957,0.000041096737,0.0003743342,0.00018358609,0.00005584304,0.0001494553],"domain_scores_gemma":[0.9995766,0.0000825745,0.00021088312,0.00007042147,0.000023833249,0.00003564356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010255292,0.00009703392,0.00019664131,0.000065604094,0.00007363657,0.00004016118,0.00014537941,0.000060635048,0.0000208299],"category_scores_gemma":[0.000016365952,0.00008753093,0.000046165766,0.00006858386,0.0003707715,0.000326854,0.00009500549,0.0001475637,0.0000011941889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005334243,0.0000062669224,0.0047405264,0.000048397156,0.000013183357,2.219033e-7,0.003412458,0.00088288024,0.00006865278,0.9850771,0.000028020342,0.005716957],"study_design_scores_gemma":[0.0038664604,0.00037860457,0.6334648,0.0004908048,0.0000665804,0.00013537517,0.023768708,0.10665169,0.030276699,0.19313267,0.006505245,0.0012623619],"about_ca_topic_score_codex":0.00013547727,"about_ca_topic_score_gemma":0.0001974174,"teacher_disagreement_score":0.79194444,"about_ca_system_score_codex":0.000044736178,"about_ca_system_score_gemma":0.00005545881,"threshold_uncertainty_score":0.35694078},"labels":[],"label_agreement":null},{"id":"W3037187695","doi":"10.1609/aaai.v34i09.7068","title":"AISpace2: An Interactive Visualization Tool for Learning and Teaching Artificial Intelligence","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Universities Space Research Association","keywords":"Python (programming language); Computer science; Visualization; Java; Programming language; Artificial intelligence","score_opus":0.07395202084952299,"score_gpt":0.33647357932639266,"score_spread":0.26252155847686964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037187695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050133266,0.000005290742,0.9422735,0.005427125,0.00024650336,0.00058350863,0.000003913014,0.00017006794,0.001156833],"genre_scores_gemma":[0.9816331,0.000019835703,0.017764982,0.00039418475,0.00010716084,0.000030706746,0.0000022055797,0.000015741145,0.000032033164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998196,0.00005260892,0.0005601949,0.0006040061,0.0003220936,0.00026508552],"domain_scores_gemma":[0.99854195,0.00019408972,0.00043651566,0.00012842382,0.00057154405,0.00012747836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000530056,0.00023023497,0.0002454752,0.00011906105,0.00041468497,0.0005320133,0.0006978222,0.000094064126,0.000047010664],"category_scores_gemma":[0.0016061378,0.00019824896,0.00008452315,0.00032267426,0.00017620121,0.0010914302,0.00023540002,0.00037364854,0.00001444459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008482234,0.00004935993,0.0002302422,0.000027982864,0.000009005961,1.1610778e-7,0.004068836,0.00056052074,0.019761847,0.7143612,0.000010449002,0.2608356],"study_design_scores_gemma":[0.0000212567,0.000461746,0.00007824175,0.000095331554,0.000013686673,0.0000033554961,0.0025663772,0.7543561,0.1836418,0.058389682,0.00013164333,0.00024075563],"about_ca_topic_score_codex":0.000013039745,"about_ca_topic_score_gemma":0.0000075559683,"teacher_disagreement_score":0.9314999,"about_ca_system_score_codex":0.00003861718,"about_ca_system_score_gemma":0.00007415498,"threshold_uncertainty_score":0.8084358},"labels":[],"label_agreement":null},{"id":"W3037624080","doi":"10.1609/socs.v11i1.18529","title":"Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Heuristics; Constraint programming; Plan (archaeology); Computer science; Constraint (computer-aided design); Mathematical optimization; Combinatorial optimization; Class (philosophy); Theoretical computer science; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.03583909945246017,"score_gpt":0.29308537026771975,"score_spread":0.2572462708152596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037624080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176597,0.000057762438,0.06219974,0.010514124,0.0032067206,0.00035650947,0.0000046175423,0.00010624806,0.005894591],"genre_scores_gemma":[0.99737895,0.000011652447,0.0021574635,0.0001396288,0.00019870535,0.000006226962,0.0000017757176,0.000014408222,0.00009117106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976788,0.000033796176,0.00033734285,0.00045890326,0.0012128244,0.0002782954],"domain_scores_gemma":[0.9986598,0.00011459908,0.00010386706,0.00012873231,0.00088761863,0.00010539202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132744,0.00015326578,0.00017251249,0.00013300832,0.00030097648,0.0005652319,0.0007671046,0.00010371267,0.000012877525],"category_scores_gemma":[0.00013456694,0.00013640942,0.00008000037,0.00033152362,0.00008297025,0.0005740272,0.0008685203,0.00049765385,0.000001874217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109353045,0.00026144402,0.026818167,0.000106063184,0.00013936941,0.000011348733,0.003009275,0.30711204,0.18375632,0.47672525,0.00013702906,0.0018143518],"study_design_scores_gemma":[0.00072285515,0.000053445125,0.00051528186,0.00030892843,0.000008033023,0.00006367345,0.0001828782,0.95820767,0.034944803,0.0046957866,0.00013560623,0.00016101697],"about_ca_topic_score_codex":0.000037657053,"about_ca_topic_score_gemma":7.366075e-7,"teacher_disagreement_score":0.6510957,"about_ca_system_score_codex":0.00022569743,"about_ca_system_score_gemma":0.00018213084,"threshold_uncertainty_score":0.5562614},"labels":[],"label_agreement":null},{"id":"W3037639738","doi":"10.1609/socs.v11i1.18537","title":"A Guide to Budgeted Tree Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Tree (set theory); Heuristic; Mathematical optimization; Search tree; Incremental heuristic search; Exponential function; Exponential growth; Computer science; Search algorithm; Depth-first search; Mathematics; Beam search; Algorithm; Combinatorics","score_opus":0.013054752370937027,"score_gpt":0.2718941346757287,"score_spread":0.2588393823047917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037639738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39868966,0.000018709807,0.017577952,0.1676407,0.015075946,0.0011429959,0.00002656539,0.00034628494,0.39948118],"genre_scores_gemma":[0.9917717,0.000013295728,0.0041289576,0.0005979092,0.00023139716,0.000017680291,0.000002458623,0.000012817758,0.0032237864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977755,0.000028179189,0.00030326121,0.00039354054,0.0012701575,0.00022937245],"domain_scores_gemma":[0.99787146,0.00012583399,0.00007273359,0.00020539873,0.0016027243,0.00012187213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986888,0.0001221842,0.00013766233,0.00013102758,0.00014224724,0.0003049316,0.0015307689,0.000064073116,0.00007678892],"category_scores_gemma":[0.00032915553,0.00010476417,0.00011186394,0.0007674368,0.000058147125,0.0002920313,0.000849212,0.00022793043,0.000047044647],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000712356,0.00020137572,0.0023964709,0.000015485632,0.000057759116,0.0000026360156,0.00047435882,0.00056853297,0.16322352,0.8164431,0.005287129,0.011258434],"study_design_scores_gemma":[0.0017153762,0.00020707394,0.0064729275,0.00014531377,0.000009622186,0.00004341481,0.00016775737,0.018254433,0.9293912,0.00554734,0.037724335,0.00032119005],"about_ca_topic_score_codex":0.00006386213,"about_ca_topic_score_gemma":0.000005871404,"teacher_disagreement_score":0.81089574,"about_ca_system_score_codex":0.00024106045,"about_ca_system_score_gemma":0.0001867705,"threshold_uncertainty_score":0.4272159},"labels":[],"label_agreement":null},{"id":"W3039702553","doi":"10.1007/978-3-030-51825-7_4","title":"Trail Saving on Backtrack","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"History; Computer science","score_opus":0.020114391603266862,"score_gpt":0.23654481545452494,"score_spread":0.21643042385125807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039702553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013054248,0.00005497702,0.97707146,0.0031829234,0.0015182045,0.00024939646,0.000003731402,0.0002406809,0.017665539],"genre_scores_gemma":[0.2637127,0.00005863728,0.7256925,0.009083571,0.00077556423,0.0000073646383,0.000009858329,0.00005633822,0.0006034636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970106,0.000025740075,0.00040522483,0.0013396385,0.0008200628,0.00039877478],"domain_scores_gemma":[0.9983443,0.00030904857,0.00020302429,0.0008125742,0.00012582538,0.00020519693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033314948,0.00041281854,0.00036598236,0.00053509383,0.00020713733,0.00054550474,0.0017740554,0.00023463475,0.00010856815],"category_scores_gemma":[0.00009251296,0.0003993084,0.000122293,0.0005346714,0.0003537133,0.000491811,0.00046332297,0.0007966797,0.0002108124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034527498,0.000010440739,0.000018541377,0.000013537785,0.0000052374694,0.000055040804,0.0003890943,0.06747065,0.000060849783,0.0498834,0.000044625907,0.88204515],"study_design_scores_gemma":[0.00035196674,0.0002535011,0.00055303646,0.00035757877,0.000006736532,0.000069896814,1.9525366e-7,0.93158156,0.00056177855,0.061117087,0.004278974,0.0008677096],"about_ca_topic_score_codex":0.0000041291373,"about_ca_topic_score_gemma":0.000039845683,"teacher_disagreement_score":0.8811774,"about_ca_system_score_codex":0.0002348207,"about_ca_system_score_gemma":0.0004291137,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W3041675392","doi":"10.24963/ijcai.2020/715","title":"From Support Propagation to Belief Propagation in Constraint Programming (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Belief propagation; Convergence (economics); Constraint (computer-aided design); Computer science; Constraint programming; Mathematical optimization; Variable (mathematics); Local consistency; Work (physics); Theoretical computer science; Constraint satisfaction; Algorithm; Mathematics; Artificial intelligence; Stochastic programming; Engineering","score_opus":0.020296565012923398,"score_gpt":0.252317522457479,"score_spread":0.23202095744455561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041675392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019692903,0.0000023752468,0.96137744,0.014128984,0.00014990963,0.00087397604,0.0000042184597,0.00038618463,0.0033840006],"genre_scores_gemma":[0.8563573,0.0000012811162,0.14201957,0.001429291,0.00006483199,0.00004654532,0.000035291338,0.0000071803183,0.000038745253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985785,0.000033667264,0.00040016643,0.00047653812,0.00028805406,0.00022307539],"domain_scores_gemma":[0.9993709,0.00003539157,0.00009918693,0.00019344754,0.00010265376,0.00019845061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018165876,0.00013712878,0.00014260678,0.00011625843,0.00005831681,0.00021988749,0.00024874654,0.000065238426,0.00037657892],"category_scores_gemma":[0.00011999661,0.00013396869,0.00003609,0.0005701185,0.000029849476,0.000652418,0.000079998106,0.00013924665,0.00020555123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018616893,0.00008606156,0.001592312,0.000016121625,0.000009400549,0.000024930454,0.004604256,0.0019090367,0.0063306307,0.014739183,0.00041682392,0.97025263],"study_design_scores_gemma":[0.0036360002,0.001003092,0.2121277,0.00014769223,0.000023478253,0.00003810904,0.0024388721,0.71434885,0.047134962,0.002954771,0.014420988,0.0017254489],"about_ca_topic_score_codex":0.000103972765,"about_ca_topic_score_gemma":0.00012897802,"teacher_disagreement_score":0.9685272,"about_ca_system_score_codex":0.00007282561,"about_ca_system_score_gemma":0.00017355262,"threshold_uncertainty_score":0.54630846},"labels":[],"label_agreement":null},{"id":"W3041741830","doi":"10.24963/ijcai.2020/664","title":"Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound","year":2020,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Heuristics; Upper and lower bounds; Computer science; Heuristic; Mathematical optimization; Branch and bound; Bidirectional search; Algorithm; Search algorithm; Theoretical computer science; Best-first search; Beam search; Mathematics; Artificial intelligence","score_opus":0.03374550677601711,"score_gpt":0.2613294497068696,"score_spread":0.2275839429308525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041741830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006471632,0.000021333657,0.97953516,0.004799414,0.00021054462,0.00004978812,0.000002375036,0.00024543755,0.0086643165],"genre_scores_gemma":[0.9760641,0.000011824034,0.02139332,0.0016759274,0.000052350653,0.0000029912744,0.0000038454777,0.0000043620894,0.0007913127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938554,0.000024539493,0.00009622074,0.0002046075,0.00017287329,0.00011620659],"domain_scores_gemma":[0.99970436,0.000049027134,0.000017114695,0.000084783765,0.000036999092,0.00010770479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000593853,0.00005957024,0.000057097306,0.00003462632,0.0001107638,0.00018054139,0.00013917078,0.000022163167,0.0007334237],"category_scores_gemma":[0.000037157213,0.000056304405,0.000028294044,0.00025553317,0.000027198903,0.00027869156,0.000059971255,0.00006733075,0.00014322162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009972466,0.0003796641,0.030709665,0.00009453914,0.00017708156,0.00009158552,0.0060999487,0.0128014535,0.061736494,0.21580237,0.31261486,0.3593926],"study_design_scores_gemma":[0.000622782,0.000109989254,0.0039562453,0.000011566698,0.0000052800297,0.000030381052,0.00012246793,0.96370155,0.0060769124,0.0005347746,0.024453372,0.00037469843],"about_ca_topic_score_codex":0.000015682379,"about_ca_topic_score_gemma":0.0000024630676,"teacher_disagreement_score":0.96959245,"about_ca_system_score_codex":0.000022205597,"about_ca_system_score_gemma":0.00004307887,"threshold_uncertainty_score":0.80304754},"labels":[],"label_agreement":null},{"id":"W3043139694","doi":"10.1142/s1469026820500108","title":"A Novel Nature-Inspired Technique Based on Mushroom Reproduction for Constraint Solving and Optimization","year":2020,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Reproduction; Optimization problem; Set (abstract data type); Computation; Process (computing); Mushroom; Algorithm; Mathematics; Ecology; Biology","score_opus":0.02621352050204756,"score_gpt":0.2998587408069799,"score_spread":0.2736452203049323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043139694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008643018,0.00007428039,0.984416,0.014653201,0.00016362006,0.00042954803,0.000020861062,0.00004416869,0.00011190898],"genre_scores_gemma":[0.4945905,0.000044422934,0.50369036,0.0014102951,0.00018919073,0.00004826007,0.000018398874,0.000006203023,0.0000023634875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987608,0.000022379747,0.00048307446,0.00030863026,0.0003360868,0.00008901817],"domain_scores_gemma":[0.9980929,0.00032170519,0.00039210435,0.00009877568,0.0009817642,0.00011278225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028692576,0.000121587036,0.00014126125,0.00022513031,0.00012800674,0.0001943059,0.00031181882,0.00008101869,0.00001196868],"category_scores_gemma":[0.00022803388,0.0001217707,0.00006593945,0.00022619597,0.00009245372,0.0003991787,0.00004467658,0.000202921,0.0000011328668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034907614,0.000059419835,0.000046968285,0.000010281259,0.000026888983,9.795048e-7,0.00010251543,0.83112574,0.00034550353,0.08379485,0.00004676351,0.08440518],"study_design_scores_gemma":[0.00032456897,0.00014894031,0.00022738737,0.00004848078,0.000011685935,0.00013091558,0.00006359536,0.98606926,0.0016359858,0.009266056,0.0019452424,0.00012789898],"about_ca_topic_score_codex":0.0000014584496,"about_ca_topic_score_gemma":4.4548182e-7,"teacher_disagreement_score":0.49450406,"about_ca_system_score_codex":0.000045907855,"about_ca_system_score_gemma":0.00015185522,"threshold_uncertainty_score":0.4965665},"labels":[],"label_agreement":null},{"id":"W3083041626","doi":"10.1007/978-3-030-58475-7_2","title":"Combinatorial Search in CP-Based Iterated Belief Propagation","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Heuristics; Constraint programming; Constraint satisfaction problem; Iterated function; Computer science; Constraint satisfaction; Combinatorial optimization; Combinatorial search; Iterated local search; Constraint (computer-aided design); Theoretical computer science; Benchmark (surveying); Set (abstract data type); Combinatorial explosion; Mathematical optimization; Local search (optimization); Search algorithm; Algorithm; Artificial intelligence; Mathematics; Beam search; Stochastic programming; Combinatorics; Programming language","score_opus":0.015918711317595764,"score_gpt":0.24043512632256184,"score_spread":0.22451641500496608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083041626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090455265,0.000037897073,0.9928131,0.0024209954,0.0018475362,0.0005654407,0.0000040135405,0.00017684017,0.0020436968],"genre_scores_gemma":[0.8150576,0.000010926023,0.1824699,0.0019805087,0.00034941325,0.00001385975,0.00003321004,0.00003297364,0.000051619027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968005,0.00007555981,0.0005176688,0.0012248143,0.00096048677,0.00042101057],"domain_scores_gemma":[0.9984987,0.00025208457,0.00017604147,0.0006186529,0.00029410596,0.00016045963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006333132,0.00036887827,0.00037803466,0.0009733971,0.00016181862,0.0005883696,0.0013694643,0.000281737,0.00004225527],"category_scores_gemma":[0.0001045991,0.00037254943,0.000073986004,0.0012757417,0.0003502831,0.00057805475,0.00041217968,0.0008632846,0.00004714971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025754602,0.00005857239,0.00048495657,0.00006087508,0.0000063999646,0.00013454522,0.0008817079,0.34007022,0.00031242485,0.08906576,0.000013825533,0.56888497],"study_design_scores_gemma":[0.00070613076,0.00015965552,0.0004600302,0.00022308993,0.000002424983,0.00001096158,1.1421377e-7,0.9697587,0.0014205185,0.026609348,0.0002302621,0.00041876046],"about_ca_topic_score_codex":0.00002427343,"about_ca_topic_score_gemma":0.00007183523,"teacher_disagreement_score":0.81496716,"about_ca_system_score_codex":0.00042148773,"about_ca_system_score_gemma":0.001176708,"threshold_uncertainty_score":0.9998726},"labels":[],"label_agreement":null},{"id":"W3083392746","doi":"10.1007/978-3-030-58475-7_44","title":"The Confidence Constraint: A Step Towards Stochastic CP Solvers","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Satisfiability; Scheduling (production processes); Computation; Constraint satisfaction; Random variable; Constraint programming; Binary constraint; Probability distribution; Constraint logic programming; Algorithm; Stochastic programming; Mathematics; Artificial intelligence","score_opus":0.016476273938045665,"score_gpt":0.23629550182278874,"score_spread":0.2198192278847431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083392746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021164558,0.00022067975,0.98583406,0.005418984,0.0022231697,0.00048876187,0.000008205527,0.00022198787,0.005582023],"genre_scores_gemma":[0.42551464,0.00019823862,0.5654872,0.0073294872,0.0007579971,0.000031680313,0.000011729471,0.000071968876,0.0005970317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963695,0.000046728215,0.00056119426,0.0013210321,0.0011145773,0.0005869719],"domain_scores_gemma":[0.9970928,0.0009316641,0.00033897744,0.0010601704,0.00030976487,0.00026666422],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007035371,0.00049047824,0.0004160523,0.00032133752,0.0006108324,0.0011281588,0.0029246663,0.00023673395,0.00005645466],"category_scores_gemma":[0.00033515392,0.00039071334,0.00015207466,0.0005782351,0.0018519863,0.0004935915,0.000924227,0.0009275289,0.000081025166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000497073,0.000004768268,0.0000029067514,0.0000095909245,0.000012272528,0.0000382856,0.0004796052,0.04004697,0.000020987263,0.14264902,0.000047096622,0.81668353],"study_design_scores_gemma":[0.00029807843,0.00012239852,0.000046337973,0.00019456027,0.000010908537,0.00013332325,0.0000015365493,0.9258599,0.00010670001,0.06962634,0.0030084492,0.00059143425],"about_ca_topic_score_codex":0.000020142072,"about_ca_topic_score_gemma":0.00013250938,"teacher_disagreement_score":0.88581294,"about_ca_system_score_codex":0.00027781771,"about_ca_system_score_gemma":0.0015152041,"threshold_uncertainty_score":0.99990875},"labels":[],"label_agreement":null},{"id":"W3085023755","doi":"10.1109/iri49571.2020.00030","title":"Data Driven Relational Constraint Programming","year":2020,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Constraint programming; Debugging; Programming language; Constraint logic programming; Constraint (computer-aided design); Relational algebra; Concurrent constraint logic programming; Relational database; Declarative programming; Constraint satisfaction; Theoretical computer science; Query language; Logic programming; Relational model; Inductive programming; Programming paradigm; Functional logic programming; Database; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.08184727823465124,"score_gpt":0.27460689485845663,"score_spread":0.1927596166238054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085023755","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009473607,0.0000047078843,0.97569525,0.01550834,0.00007302127,0.00008993591,0.0000066721864,0.00027306666,0.008254262],"genre_scores_gemma":[0.3318235,0.0000020463362,0.6666782,0.0013526445,0.00004081044,0.000001783652,0.00004768085,0.000002396476,0.00005096791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.000017578997,0.00012180432,0.00025779926,0.00013808416,0.00008687061],"domain_scores_gemma":[0.999534,0.000034388497,0.000034597248,0.0002716882,0.00003482877,0.000090489935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006618253,0.000049525843,0.000049018552,0.000019859524,0.000059373906,0.00009237076,0.0004141727,0.000022886046,0.0003002582],"category_scores_gemma":[0.000069769434,0.00004672379,0.000014201503,0.00018284813,0.00003330211,0.0005732183,0.00025156222,0.0000661174,0.000106474225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014864551,0.000013627688,0.0032314404,0.000004072848,0.000013363333,0.0000063810803,0.00030048934,0.0022442376,0.0000714817,0.5576854,0.0038701615,0.4325579],"study_design_scores_gemma":[0.00015013704,0.000014394229,0.0019614869,0.0000022203415,0.0000018986849,0.00001006464,0.000036457634,0.9502275,0.000016191672,0.00014537967,0.047355928,0.000078373014],"about_ca_topic_score_codex":0.0000019862418,"about_ca_topic_score_gemma":0.0000058068176,"teacher_disagreement_score":0.9479832,"about_ca_system_score_codex":0.000008215326,"about_ca_system_score_gemma":0.000075597556,"threshold_uncertainty_score":0.32876167},"labels":[],"label_agreement":null},{"id":"W3102502824","doi":"10.1109/cec.2014.6900262","title":"Coevolutionary genetic algorithm for variable ordering in CSPs","year":2014,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Backtracking; Computer science; Heuristics; Mathematical optimization; Constraint satisfaction problem; Constraint (computer-aided design); Variable (mathematics); Genetic algorithm; Algorithm; Random variable; Mathematics; Artificial intelligence","score_opus":0.006923770097924319,"score_gpt":0.2101092728668885,"score_spread":0.20318550276896416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102502824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001246477,0.000010144004,0.9944581,0.00024909512,0.00019779912,0.000111026915,6.22699e-7,0.000083983585,0.004764591],"genre_scores_gemma":[0.028455826,0.000003892469,0.9708454,0.0002543251,0.000027805712,0.000015351348,0.0000020316677,0.000003045558,0.00039232627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995391,0.000017304343,0.000110485606,0.00015498043,0.00006106879,0.00011705859],"domain_scores_gemma":[0.99972266,0.000064435524,0.000019827421,0.00012716015,0.0000369488,0.000028978098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012241294,0.000045985485,0.000054409782,0.00006896661,0.000047883917,0.000036142228,0.00012302736,0.000027088667,0.000066261084],"category_scores_gemma":[0.000023968565,0.000046871046,0.000014011169,0.00018340684,0.000009491752,0.0001610384,0.00003728717,0.000028558123,0.000012074429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.298515e-7,0.00002045382,0.0013003798,0.000005345987,0.0000026351145,3.4337438e-7,0.000045698514,0.028494602,0.00008601205,0.11100987,0.00049342855,0.8585405],"study_design_scores_gemma":[0.00025023412,0.000018112101,0.009878467,0.0000036402791,6.3871573e-7,0.0000058080586,0.000004377292,0.97860485,0.000035713958,0.0048339865,0.0062987534,0.00006543792],"about_ca_topic_score_codex":0.000032610915,"about_ca_topic_score_gemma":0.000016239976,"teacher_disagreement_score":0.95011026,"about_ca_system_score_codex":0.00002461407,"about_ca_system_score_gemma":0.00003417813,"threshold_uncertainty_score":0.19113457},"labels":[],"label_agreement":null},{"id":"W3103675051","doi":"10.1007/978-3-030-63461-2_21","title":"Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Leverage (statistics); Solver; Computer science; Mathematical optimization; Boolean data type; Polynomial; Boolean satisfiability problem; True quantified Boolean formula; Optimization problem; Constraint (computer-aided design); Constrained optimization problem; Function (biology); Mathematics; Applied mathematics; Algorithm; Theoretical computer science","score_opus":0.010560714340691654,"score_gpt":0.22565879945845727,"score_spread":0.21509808511776563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103675051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017630262,0.00005081982,0.9935389,0.0015626001,0.0006561788,0.00049412233,0.000005367962,0.00016260527,0.0035117452],"genre_scores_gemma":[0.18002187,0.000019317215,0.8192377,0.0004542539,0.00016492611,0.0000047850754,0.000026375144,0.000020548154,0.00005023354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972059,0.000033175547,0.00072402036,0.0010109715,0.0007222515,0.00030368974],"domain_scores_gemma":[0.9982198,0.00014920637,0.00052832236,0.00063760416,0.00031437224,0.00015068699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040295196,0.00037842858,0.00045195004,0.0007489803,0.00016801452,0.00024804918,0.0011583451,0.00029163898,0.000047792248],"category_scores_gemma":[0.00008366378,0.00036753644,0.00012128402,0.0007383752,0.0004977116,0.0008335256,0.00050247373,0.00042700933,0.000013071145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009267489,0.000010169701,0.000041388354,0.000036919006,0.00000784229,0.0000065111576,0.00069339765,0.61448616,0.00020793689,0.010123121,0.000006249726,0.37437102],"study_design_scores_gemma":[0.00036946862,0.0001449672,0.00006370697,0.00018804296,0.000008641453,0.000026024145,3.0222884e-7,0.977825,0.00093138526,0.019915432,0.00014288182,0.0003841357],"about_ca_topic_score_codex":0.000024948546,"about_ca_topic_score_gemma":0.00005461707,"teacher_disagreement_score":0.37398687,"about_ca_system_score_codex":0.00030776957,"about_ca_system_score_gemma":0.0007678351,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W3107248814","doi":"10.31274/rtd-20201118-272","title":"Enriching representable functors","year":2002,"lang":"en","type":"dissertation","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Functor; Object (grammar); Mathematics; Class (philosophy); Idempotence; Set (abstract data type); Commutative property; Algebra over a field; Algebraic structure; Vector space; Algebraic number; Category theory; Ring (chemistry); Pure mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.012299121364289147,"score_gpt":0.23641396689974806,"score_spread":0.2241148455354589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107248814","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093974575,0.00012729198,0.3527024,0.00014831107,0.0023997778,0.00015594161,8.2950197e-7,0.00046610495,0.64305955],"genre_scores_gemma":[0.12598136,0.00029814817,0.06904674,0.00043752426,0.0002251626,0.000036729147,0.00037842756,0.00004389723,0.80355203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989756,0.000026595975,0.00021071012,0.00037817872,0.00024757758,0.0001613683],"domain_scores_gemma":[0.9992921,0.000038427494,0.00011811392,0.00041633277,0.00007191067,0.000063137566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000073136944,0.00015031059,0.00014008995,0.00018285924,0.00011748289,0.00023498751,0.00033894493,0.00014061124,0.0021221447],"category_scores_gemma":[0.00003569667,0.00014426421,0.000075708944,0.000299638,0.0000052295277,0.00042232385,0.000030961353,0.00018288662,0.00028325658],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000844283,0.00009332119,0.0014722175,0.00009221766,0.00009357665,0.000024674551,0.003050339,0.0014764922,0.00045188368,0.11410872,0.0734586,0.80566955],"study_design_scores_gemma":[0.0017016265,0.00016641531,0.041604474,0.0003249725,0.00012399144,0.00008763436,0.0024098833,0.7458566,0.0068544187,0.008026266,0.18905164,0.0037920615],"about_ca_topic_score_codex":0.000069561946,"about_ca_topic_score_gemma":0.00014800821,"teacher_disagreement_score":0.80187744,"about_ca_system_score_codex":0.00003664693,"about_ca_system_score_gemma":0.000043431224,"threshold_uncertainty_score":0.99879},"labels":[],"label_agreement":null},{"id":"W3111889198","doi":"10.1609/aaai.v35i14.17473","title":"Bayes DistNet - A Robust Neural Network for Algorithm Runtime Distribution Predictions","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Algorithm; Solver; Bayesian probability; Constraint (computer-aided design); State (computer science); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.06105650913797547,"score_gpt":0.278330767030751,"score_spread":0.21727425789277552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111889198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031030276,0.000044236487,0.98887414,0.0035980437,0.002327574,0.0010126937,0.00023927026,0.00019301518,0.00060802215],"genre_scores_gemma":[0.9108136,0.000119745,0.087872334,0.00014971397,0.00042291885,0.00025942427,0.0001507257,0.000024959852,0.00018655253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973805,0.00003246941,0.0007882739,0.0008772756,0.0004911574,0.00043032464],"domain_scores_gemma":[0.99714833,0.00013441865,0.00073389587,0.00045018242,0.0014173015,0.00011587303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004475192,0.00037238558,0.00042481007,0.00008559656,0.00044057312,0.0009058063,0.0015658581,0.0002773205,0.000082394305],"category_scores_gemma":[0.00038616813,0.00032572277,0.0003364029,0.00060516596,0.0002595233,0.00041755257,0.0010029342,0.00063054246,0.000007125225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005767901,0.00028070324,0.00026543823,0.00020152063,0.000117601354,0.0000010906225,0.0009144939,0.1565433,0.00040896836,0.5109928,0.0025996848,0.3276167],"study_design_scores_gemma":[0.00003241516,0.000090236696,0.0006339673,0.00039829794,0.000051228042,0.0000066551906,0.00020204544,0.95342815,0.005250408,0.039465953,0.0001308825,0.0003097735],"about_ca_topic_score_codex":0.000052543965,"about_ca_topic_score_gemma":0.000030563166,"teacher_disagreement_score":0.9077106,"about_ca_system_score_codex":0.00012413287,"about_ca_system_score_gemma":0.00030126833,"threshold_uncertainty_score":0.9999195},"labels":[],"label_agreement":null},{"id":"W3112462397","doi":"10.23977/cpcs.2020.41003","title":"Procedure of Solving 3-SAT Problem by Combining Quantum Search Algorithm and DPLL Algorithm","year":2020,"lang":"en","type":"article","venue":"Computing Performance and Communication systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"DPLL algorithm; Algorithm; Quantum algorithm; Satisfiability; Quantum computer; Boolean satisfiability problem; Computer science; Simple (philosophy); Quantum sort; Qubit; Mathematics; Quantum; Theoretical computer science; Quantum error correction","score_opus":0.019132563092185827,"score_gpt":0.23832481703258213,"score_spread":0.2191922539403963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112462397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0862623,0.0023935016,0.9095232,0.00088359456,0.000078209196,0.00035814423,0.000005131514,0.00017227895,0.0003236193],"genre_scores_gemma":[0.91756076,0.0006927422,0.081557155,0.00011472298,0.00002116053,0.0000065704776,0.000017200697,0.000009007425,0.000020714902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878955,0.00012936546,0.00041293853,0.00027029822,0.00021665325,0.00018120694],"domain_scores_gemma":[0.99905604,0.00010694349,0.00022710761,0.00033368493,0.00017068852,0.00010553282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048305432,0.00013395965,0.0002317819,0.000069396985,0.00037834677,0.00021004121,0.0004297685,0.00006420443,0.0000014566461],"category_scores_gemma":[0.00001236348,0.0001348722,0.000020748705,0.0003385967,0.00010091965,0.00046967913,0.00042488595,0.00021820978,0.0000033358492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006437445,0.000051446117,0.018133346,0.0006250919,0.000046339817,6.0063263e-7,0.014845114,0.0056186393,0.00052676996,0.0041460646,0.00077349914,0.95522666],"study_design_scores_gemma":[0.0003568758,0.00008934238,0.0020234985,0.0002645082,0.0000041583926,0.000028944767,0.0007743719,0.9955787,0.00014041808,0.000013841534,0.00058084785,0.00014448255],"about_ca_topic_score_codex":0.000034642944,"about_ca_topic_score_gemma":4.0513652e-7,"teacher_disagreement_score":0.9899601,"about_ca_system_score_codex":0.000017933271,"about_ca_system_score_gemma":0.000054809378,"threshold_uncertainty_score":0.54999286},"labels":[],"label_agreement":null},{"id":"W3118093767","doi":"10.1093/logcom/exaa079","title":"Parameterized complexity of abduction in Schaefer’s framework","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Parameterized complexity; Computer science; Dimension (graph theory); Artificial intelligence; Kernelization; Set (abstract data type); Satisfiability; Theoretical computer science; Mathematics; Mathematical economics; Algorithm; Combinatorics; Programming language","score_opus":0.08801501108235356,"score_gpt":0.3011803870368022,"score_spread":0.21316537595444868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118093767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1706652,0.000047586596,0.82579243,0.003286961,0.00010685746,0.00004106545,2.2255442e-7,0.000008775747,0.00005090598],"genre_scores_gemma":[0.78911906,0.000036299658,0.21057169,0.0002419393,0.000028861623,1.3583211e-7,4.3306918e-7,0.0000011538484,4.0962533e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993266,0.00007191201,0.00033575983,0.00008088051,0.00013324502,0.000051611256],"domain_scores_gemma":[0.99942076,0.0000662625,0.00032073676,0.000034600525,0.00011015251,0.00004746265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016522846,0.000049538226,0.00015522107,0.00008851435,0.000022585387,0.000029418983,0.000082927996,0.000038079117,0.000008332637],"category_scores_gemma":[0.0000875624,0.000043658783,0.000033461754,0.0002476443,0.000050587016,0.00028148963,0.000024891564,0.0001228877,7.717269e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034264525,0.00022796034,0.017777577,0.00013247128,0.000065770284,0.000039667608,0.00880076,0.2285163,0.0051711756,0.33132473,0.00020517698,0.40739578],"study_design_scores_gemma":[0.00096612173,0.00048442197,0.07554845,0.00006746848,0.000009081846,0.00007650491,0.0002764236,0.75369585,0.00029115472,0.16844189,0.000035016426,0.0001076345],"about_ca_topic_score_codex":0.0000029171254,"about_ca_topic_score_gemma":5.792722e-7,"teacher_disagreement_score":0.61845386,"about_ca_system_score_codex":0.000013576551,"about_ca_system_score_gemma":0.000030618197,"threshold_uncertainty_score":0.17803535},"labels":[],"label_agreement":null},{"id":"W3120817185","doi":"","title":"Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey (Dedicated to the memory of Professor Ivo Rosenberg)","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Universal algebra; Constraint satisfaction; Constraint (computer-aided design); Domain (mathematical analysis); Computer science; Algebra over a field; Computational complexity theory; Theoretical computer science; Mathematics; Local consistency; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.038512690590153616,"score_gpt":0.2551080795167891,"score_spread":0.2165953889266355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120817185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09166909,0.00013929253,0.8833651,0.018388744,0.000709126,0.0017538517,0.0003148825,0.0001716008,0.0034883358],"genre_scores_gemma":[0.9405334,0.00006565123,0.057876285,0.00010970722,0.000016426415,0.000088915214,0.00034550802,0.000027467971,0.0009366336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99059385,0.0062922547,0.0011320068,0.0008639043,0.0007478565,0.00037012645],"domain_scores_gemma":[0.9914445,0.0014565266,0.0014249803,0.0027038956,0.0028230292,0.00014705103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0061100572,0.00038296767,0.00063539547,0.00022453598,0.0002572167,0.0001976115,0.001714869,0.00030032103,0.00021036537],"category_scores_gemma":[0.0016498843,0.0003436737,0.00024093987,0.0008884528,0.00070858165,0.00025313225,0.001558641,0.0006209548,0.00003330933],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022281881,0.002314344,0.09973233,0.001550895,0.0010214067,0.000005982554,0.086124465,0.034230143,0.022272998,0.5620969,0.0070816795,0.18334603],"study_design_scores_gemma":[0.0027855968,0.000011039823,0.5541226,0.003870052,0.00014769456,0.000037326634,0.000344896,0.30521953,0.120647855,0.009382022,0.0018439417,0.0015874029],"about_ca_topic_score_codex":0.009789581,"about_ca_topic_score_gemma":0.024946736,"teacher_disagreement_score":0.8488643,"about_ca_system_score_codex":0.000118123935,"about_ca_system_score_gemma":0.00081811834,"threshold_uncertainty_score":0.99990153},"labels":[],"label_agreement":null},{"id":"W3122005880","doi":"10.1016/j.disc.2023.113537","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Euler's formula; Traverse; Enhanced Data Rates for GSM Evolution; Combinatorics; Euler characteristic; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03766042132327078,"score_gpt":0.2887181465537514,"score_spread":0.2510577252304806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122005880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55236334,0.00001732552,0.44348446,0.000774,0.00027604762,0.00020561881,0.000005528245,0.00016479958,0.0027088928],"genre_scores_gemma":[0.7387111,0.000059176855,0.26045296,0.0002119603,0.000030929357,0.000015391946,0.000005564102,0.000021636159,0.000491286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.000020937163,0.00020063006,0.00020427402,0.0001586557,0.00019310015],"domain_scores_gemma":[0.99950427,0.000118207696,0.00004374379,0.00023273217,0.000029086794,0.00007195281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017290683,0.00010738373,0.00013915203,0.00029487122,0.0000692226,0.00011996523,0.00016192524,0.00004198793,0.00001672598],"category_scores_gemma":[0.00010218554,0.0000994627,0.000028781204,0.00076344586,0.000031965883,0.0002147968,0.00015395011,0.000063986074,0.000046872614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002422141,0.00028299843,0.050645713,0.00085718336,0.00015306116,0.00016954358,0.13380113,0.0695492,0.020906495,0.5256294,0.008167203,0.18981384],"study_design_scores_gemma":[0.0003531392,0.000027767652,0.0311558,0.0001491639,0.0000097183165,0.000022859684,0.0017677984,0.9565844,0.00042070792,0.008614814,0.00054190325,0.0003519133],"about_ca_topic_score_codex":0.000012557377,"about_ca_topic_score_gemma":0.000026936112,"teacher_disagreement_score":0.8870352,"about_ca_system_score_codex":0.000019009092,"about_ca_system_score_gemma":0.000023582845,"threshold_uncertainty_score":0.4055971},"labels":[],"label_agreement":null},{"id":"W3124752832","doi":"10.2139/ssrn.423560","title":"Approximate Local Search in Combinatorial Optimization","year":2003,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorial optimization; Local search (optimization); Tabu search; Mathematics; Mathematical optimization; Combinatorics; Computer science","score_opus":0.0070705041636849675,"score_gpt":0.22773203553636864,"score_spread":0.22066153137268368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124752832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023024934,0.00012740516,0.9946032,0.00030340467,0.00048093149,0.00009499175,1.3439465e-7,0.000042348584,0.0020450898],"genre_scores_gemma":[0.9825959,0.0004951701,0.016710036,0.000050614784,0.00003866139,0.0000029199225,0.0000012864014,0.000008473147,0.000096894844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798006,0.00021555973,0.0002357647,0.00018863798,0.00026127763,0.0011187027],"domain_scores_gemma":[0.9996083,0.000030739164,0.00006551622,0.00014445082,0.000083383355,0.0000676304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016517997,0.000097289485,0.00010644147,0.00020520094,0.00013470973,0.00013031211,0.0002581798,0.00007305001,0.000038927],"category_scores_gemma":[0.00005091551,0.00009678963,0.000042386244,0.0004914364,0.00003411574,0.00051012746,0.000026152205,0.0010454878,0.00001182583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000573199,0.00003453909,0.00062232086,0.0000011234241,0.000007630491,0.0000025493387,0.00009276285,0.21005896,0.000007952623,0.7694842,0.0000044695826,0.019677732],"study_design_scores_gemma":[0.0021030915,0.00017327472,0.00022937614,0.00001231922,0.000004239982,0.0006461661,0.0006414606,0.79182833,0.00017292472,0.20370752,0.00024276486,0.00023853988],"about_ca_topic_score_codex":0.0000139391095,"about_ca_topic_score_gemma":0.0000627957,"teacher_disagreement_score":0.98029345,"about_ca_system_score_codex":0.00074638345,"about_ca_system_score_gemma":0.0016933745,"threshold_uncertainty_score":0.45421824},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0072608252045867055,"score_gpt":0.20831054522986675,"score_spread":0.20104972002528004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131262006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019395845,0.00011220494,0.99412286,0.00034752864,0.001498789,0.00018794795,5.3936236e-7,0.00025205503,0.0015384757],"genre_scores_gemma":[0.6245389,0.00014415508,0.3749311,0.0001745187,0.00009441446,0.00001583108,0.00005773379,0.000012729528,0.000030596893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.00008050631,0.00018537848,0.0005257414,0.0001926045,0.00016174631],"domain_scores_gemma":[0.9991865,0.00003950193,0.0001373048,0.00037520134,0.0001693773,0.00009208601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115514726,0.00019124325,0.00019795803,0.00009986808,0.00012471127,0.00082479324,0.00021184384,0.00017741135,0.00004777846],"category_scores_gemma":[0.000017135815,0.00017379523,0.000040845076,0.00025943873,0.000048389327,0.00034593354,0.00050873106,0.00034194635,1.901713e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038280064,0.000010320331,0.0013600212,0.000009208373,0.000019456855,0.000008947775,0.00009933175,0.97318554,3.1442576e-7,0.01831652,0.000023779456,0.006962706],"study_design_scores_gemma":[0.00032588225,0.000024134748,0.0012589289,0.000052670093,0.000013769156,0.000037196965,0.00003204841,0.99778676,0.0000063474727,0.00023507749,0.000008033841,0.00021917325],"about_ca_topic_score_codex":0.000050455954,"about_ca_topic_score_gemma":0.000024722827,"teacher_disagreement_score":0.62259936,"about_ca_system_score_codex":0.000026033993,"about_ca_system_score_gemma":0.00008771492,"threshold_uncertainty_score":0.79535},"labels":[],"label_agreement":null},{"id":"W3133297755","doi":"10.1017/mag.2021.30","title":"diverges while converges","year":2021,"lang":"en","type":"article","venue":"The Mathematical Gazette","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Paul University","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","score_opus":0.017867358630135687,"score_gpt":0.22323549024556447,"score_spread":0.20536813161542877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133297755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029438417,0.000052866664,0.9461971,0.018566208,0.00021506827,0.000072991,0.000001267425,0.00016632574,0.03178432],"genre_scores_gemma":[0.9018148,0.000055435776,0.086832926,0.0038714472,0.0001032758,0.000020672986,0.0000037215882,0.000013271207,0.00728441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993073,0.00006709012,0.00014198244,0.00015403856,0.00019096071,0.00013865375],"domain_scores_gemma":[0.9992333,0.00020385277,0.000035246536,0.0004135729,0.00006420508,0.000049800303],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016660953,0.00007307368,0.00009893212,0.000017053528,0.000116627445,0.00012592277,0.00029385876,0.00002763609,0.0013216315],"category_scores_gemma":[0.00010927437,0.000048366313,0.00005320467,0.00019913792,0.000060443897,0.00013967023,0.00018276373,0.00008484508,0.00063392264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.2628045e-7,0.00004097857,0.000096841424,0.000017628898,0.000020640204,0.00001657947,0.0006950982,0.00010738498,0.0004917695,0.97889966,0.005204997,0.014407483],"study_design_scores_gemma":[0.00087991374,0.00004929884,0.007953842,0.000115743685,0.000061147206,0.00049460126,0.00044738836,0.3616631,0.021328483,0.5671178,0.03918431,0.00070439564],"about_ca_topic_score_codex":6.676352e-7,"about_ca_topic_score_gemma":0.0000015233403,"teacher_disagreement_score":0.898871,"about_ca_system_score_codex":0.000011039725,"about_ca_system_score_gemma":0.000032426946,"threshold_uncertainty_score":0.9995913},"labels":[],"label_agreement":null},{"id":"W3150279801","doi":"10.1007/978-3-030-68514-0_3","title":"Selection of Constituent Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Selection (genetic algorithm); Computer science; Complementarity (molecular biology); Portfolio; Algorithm; Mathematical optimization; Machine learning; Mathematics","score_opus":0.01408037519752507,"score_gpt":0.22694016065549363,"score_spread":0.21285978545796858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150279801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024788249,0.00015362602,0.8100996,0.000119605014,0.0005488506,0.00022792588,0.0000051061006,0.000100959354,0.18874186],"genre_scores_gemma":[0.004108255,0.0022346089,0.91051203,0.00019983124,0.00017718719,0.00002457941,0.00016123064,0.00007687945,0.08250543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983005,0.00003140119,0.0006151883,0.00052258925,0.0003543485,0.00017600857],"domain_scores_gemma":[0.99876606,0.000052620784,0.00040763937,0.00037940755,0.0003339613,0.000060292776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020225969,0.000255454,0.00036610803,0.0004519204,0.000055676584,0.00008238182,0.00026070568,0.00031434034,0.00081118377],"category_scores_gemma":[0.00005615938,0.0003155134,0.000110716406,0.0002392607,0.00008406327,0.00033536466,0.00014345163,0.00028705798,0.000010568807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045333804,0.000027950271,0.00015619081,0.000053828808,0.000033929464,0.0000128655365,0.00008003145,0.5174189,0.000033779128,0.45103678,0.000085934895,0.03105525],"study_design_scores_gemma":[0.00058392464,0.000051223215,0.00016386363,0.0005022015,0.000028674222,0.00004423892,0.0000071124027,0.98592687,0.0007031818,0.0016254463,0.009818096,0.0005451535],"about_ca_topic_score_codex":0.00001652,"about_ca_topic_score_gemma":0.000044999568,"teacher_disagreement_score":0.46850795,"about_ca_system_score_codex":0.00021850118,"about_ca_system_score_gemma":0.0003220945,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W3157599687","doi":"","title":"DC3: A learning method for optimization with hard constraints","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Differentiable function; Grid; Mathematical optimization; Optimization problem; Deep learning; ENCODE; Constrained optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.05739591779876293,"score_gpt":0.20252985600406614,"score_spread":0.1451339382053032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157599687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019868095,0.000012590119,0.99516857,0.00016602129,0.00030683202,0.00043354472,0.000008640619,0.00029913877,0.0016178812],"genre_scores_gemma":[0.4307016,0.000055602737,0.5682597,0.0000849862,0.000027505686,0.0000031660938,0.00008857794,0.000016149741,0.00076267595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.00019918675,0.00017879363,0.0009936913,0.00008720896,0.00025562636],"domain_scores_gemma":[0.9984634,0.00017429685,0.00028377087,0.0005124583,0.00043765228,0.00012840735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027620333,0.00025658525,0.0002951476,0.00022350904,0.00022494438,0.00029750945,0.00049415417,0.0002303154,0.0001425377],"category_scores_gemma":[0.00008002813,0.00029364356,0.00015496496,0.0004903903,0.00009964307,0.00043973853,0.00040441166,0.00042092675,0.0000066666944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020205458,0.000024434183,0.00067395385,0.000043325657,0.000081801685,0.000046599846,0.00020939032,0.96688235,0.000012328546,0.026918447,0.000024518667,0.005062637],"study_design_scores_gemma":[0.00069569604,0.000054555516,0.00025612686,0.000094281095,0.00007243761,0.000020293188,0.0002608485,0.99735445,0.00006631217,0.0006021805,0.00017016262,0.00035263743],"about_ca_topic_score_codex":0.000029667939,"about_ca_topic_score_gemma":0.000031160747,"teacher_disagreement_score":0.4287148,"about_ca_system_score_codex":0.00015067263,"about_ca_system_score_gemma":0.00040770054,"threshold_uncertainty_score":0.99995154},"labels":[],"label_agreement":null},{"id":"W3158310650","doi":"10.1109/lics52264.2021.9470557","title":"Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical proof; Mathematics; Constraint satisfaction problem; Class (philosophy); Consistency (knowledge bases); Algebraic number; Constraint satisfaction; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.09699595766824509,"score_gpt":0.27993012959292374,"score_spread":0.18293417192467865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158310650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014309653,0.00024821085,0.9073755,0.08584232,0.0016474624,0.0016331648,0.000010058767,0.00020640394,0.0016059174],"genre_scores_gemma":[0.46298996,0.000025232555,0.5283178,0.0068141744,0.0003998897,0.00092199823,0.000034252083,0.00003126042,0.0004654093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979098,0.0001183886,0.0003951709,0.0008111757,0.00041509225,0.0003503893],"domain_scores_gemma":[0.9965552,0.0012469508,0.00018870155,0.0017776256,0.00011155016,0.00011996518],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005916331,0.0003329967,0.00031405973,0.00008798932,0.00046182994,0.0013455689,0.0021166254,0.00031088758,0.00029456383],"category_scores_gemma":[0.00027665906,0.00019828249,0.0003093605,0.00040898894,0.000095680814,0.00015496965,0.0020057862,0.0007126281,0.000065303204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015154189,0.00004703501,0.0002429643,0.00003445673,0.00014806636,0.0000025727286,0.0031017028,0.013207768,0.0000025830645,0.68693167,0.0024403713,0.2938257],"study_design_scores_gemma":[0.00025412056,0.00010082577,0.006457412,0.00010750114,0.00009608425,0.000040834584,0.0010581518,0.7690893,0.00033322832,0.21157305,0.010187782,0.00070175616],"about_ca_topic_score_codex":0.00018157139,"about_ca_topic_score_gemma":0.0018692449,"teacher_disagreement_score":0.7558815,"about_ca_system_score_codex":0.000060308703,"about_ca_system_score_gemma":0.00025427592,"threshold_uncertainty_score":0.9996911},"labels":[],"label_agreement":null},{"id":"W3171562582","doi":"","title":"Guide canadien de conception géométrique des routes : Chapitre 2 – Contraintes, classification et uniformité de la conception","year":2017,"lang":"fr","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Computer science; Psychology; Philosophy","score_opus":0.03413959852600691,"score_gpt":0.3070919851619015,"score_spread":0.2729523866358946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171562582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021262174,0.00029135108,0.8559916,0.014071496,0.0006493542,0.00036780475,0.000037464182,0.0001851967,0.10714358],"genre_scores_gemma":[0.9067741,0.0013025496,0.06411404,0.0010129771,0.00026451028,0.00003831723,0.0000410026,0.00002280082,0.026429713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975506,0.00063033536,0.0004686868,0.0005007937,0.00023257584,0.0006169724],"domain_scores_gemma":[0.99767095,0.00032892896,0.00047737805,0.00070151995,0.00046280655,0.0003583914],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017437217,0.00028289214,0.00023981814,0.00012853094,0.0009947582,0.0013973683,0.0006454932,0.00037935257,0.0007371872],"category_scores_gemma":[0.0009027902,0.0003129848,0.00012017501,0.00014402381,0.0013792069,0.0022980457,0.00011755491,0.00034791854,0.000070280395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009154037,0.000041748037,0.023052199,0.000021616292,0.000024847102,0.000017463244,0.0034266673,0.0008557093,0.0010498719,0.5888618,0.002069424,0.3805695],"study_design_scores_gemma":[0.0012208072,0.00012230659,0.3992142,0.0002569318,0.000043177544,0.00034587522,0.0014751279,0.52791995,0.00075046945,0.010391307,0.05777522,0.00048459903],"about_ca_topic_score_codex":0.037461627,"about_ca_topic_score_gemma":0.061673265,"teacher_disagreement_score":0.88551193,"about_ca_system_score_codex":0.001087805,"about_ca_system_score_gemma":0.0013204799,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W3175105319","doi":"10.1007/s10288-021-00486-x","title":"Measures of balance in combinatorial optimization","year":2021,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Balance (ability); Computer science; Measure (data warehouse); Balance problems; Risk analysis (engineering); Psychology; Data mining; Business","score_opus":0.016674304008264203,"score_gpt":0.22979742081215712,"score_spread":0.21312311680389293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175105319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024954234,0.000051461884,0.99320364,0.00042449433,0.00059703155,0.000041628027,8.04322e-7,0.000029908148,0.0031556028],"genre_scores_gemma":[0.90630126,0.000032562584,0.093518056,0.00006710003,0.00001898814,0.0000025994757,0.0000034684658,0.0000021765954,0.000053800868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995738,0.000035949553,0.00011615912,0.000106519234,0.00011055437,0.000056987843],"domain_scores_gemma":[0.9996992,0.000021353539,0.000037660295,0.00013182282,0.000093213355,0.00001679825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008030963,0.00003255458,0.00006478215,0.000041646246,0.000014516845,0.00002129824,0.00008701879,0.000025567952,0.000053097494],"category_scores_gemma":[0.00007733677,0.000035455567,0.000016069134,0.000301408,0.00001144667,0.00015332534,0.00002883915,0.000033585336,0.0000028331804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015250295,0.00020531264,0.040463638,0.00003199776,0.000014664915,0.000027320879,0.0008827046,0.5508402,0.0029267017,0.31951922,0.0004617331,0.08461126],"study_design_scores_gemma":[0.0012084544,0.000024684092,0.022065401,0.00003585856,0.00000255858,0.000010451075,0.00003701192,0.96144164,0.011548196,0.0024126677,0.0010757489,0.0001373506],"about_ca_topic_score_codex":0.0000066167504,"about_ca_topic_score_gemma":0.000007789545,"teacher_disagreement_score":0.90380585,"about_ca_system_score_codex":0.000016159662,"about_ca_system_score_gemma":0.00007387919,"threshold_uncertainty_score":0.1445836},"labels":[],"label_agreement":null},{"id":"W3177472273","doi":"10.1609/aaai.v35i14.17473","title":"Bayes DistNet - A Robust Neural Network for Algorithm Runtime Distribution Predictions","year":2021,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Algorithm; Solver; Bayesian probability; Constraint (computer-aided design); Mathematical optimization; Machine learning; Artificial intelligence; Mathematics","score_opus":0.01312113907669746,"score_gpt":0.22514818537128736,"score_spread":0.2120270462945899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177472273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080431455,0.000040440664,0.9955729,0.0022095614,0.00080018025,0.00016058722,0.00010187755,0.00029024514,0.0007437621],"genre_scores_gemma":[0.06638945,0.000030744293,0.9288347,0.00051156577,0.0004356125,0.00008101231,0.001161563,0.000010998128,0.002544356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991785,0.000033900706,0.00017415272,0.00028387466,0.000119543794,0.00021000968],"domain_scores_gemma":[0.999404,0.00007993902,0.0000451225,0.00023230557,0.00016345925,0.00007517642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091715345,0.00008870334,0.00009284731,0.000018192031,0.00027417607,0.00020303787,0.00013208341,0.00004781785,0.00017955729],"category_scores_gemma":[0.000040448285,0.00008746726,0.00007697121,0.0003768911,0.000025763868,0.00038641796,0.00007388075,0.00006238904,0.000010354257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054259253,0.00010663017,0.0012187734,0.00001171882,0.00005331517,0.00001296881,0.00008375519,0.37249398,0.000024773366,0.13461852,0.08648054,0.4048896],"study_design_scores_gemma":[0.00023830793,0.0000242812,0.009869408,0.0000051524107,0.000009555803,0.000032219017,0.0000151341055,0.9760034,0.000039434504,0.0008461184,0.012814222,0.00010274852],"about_ca_topic_score_codex":0.000010189453,"about_ca_topic_score_gemma":0.00004765839,"teacher_disagreement_score":0.6035094,"about_ca_system_score_codex":0.00003986976,"about_ca_system_score_gemma":0.00007405629,"threshold_uncertainty_score":0.35668117},"labels":[],"label_agreement":null},{"id":"W3183228818","doi":"10.5220/0010823400003122","title":"Relative Position φ-Descriptor Computation for Complex Polygonal Objects","year":2022,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computation; Position (finance); Computer science; Artificial intelligence; Computer vision; Computer graphics (images); Algorithm","score_opus":0.0301766244275591,"score_gpt":0.26287403685436816,"score_spread":0.23269741242680908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183228818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010984308,0.000006212969,0.99041164,0.0020743972,0.00040936808,0.0003107476,0.000017472441,0.00020455448,0.005467178],"genre_scores_gemma":[0.7469065,3.9274894e-7,0.25148168,0.0009797245,0.000022229056,0.00005303207,0.00009566326,0.0000045826364,0.0004561581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923784,0.00007023683,0.00015185522,0.0002182093,0.0001993838,0.0001224618],"domain_scores_gemma":[0.9996175,0.00009017218,0.000076414864,0.00009372266,0.00008045667,0.000041711675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014124149,0.000070188726,0.00007279283,0.0001115219,0.00046871055,0.00007330601,0.0001429591,0.000016475049,0.00034695788],"category_scores_gemma":[0.000013279392,0.00007739395,0.000053053303,0.00025518416,0.000017685794,0.0004411177,0.00009110599,0.00007169108,0.000010704941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004798179,0.00012464712,0.00031483878,0.0000096004715,0.00003827666,0.0000029762791,0.0019627842,0.045308825,0.004930655,0.8615979,0.014328809,0.07133271],"study_design_scores_gemma":[0.0005962375,0.00023131033,0.004956469,0.0000015969632,0.000004859807,0.000032529355,0.00021076133,0.9796442,0.0001676992,0.012273431,0.0017449012,0.00013603103],"about_ca_topic_score_codex":0.000014514405,"about_ca_topic_score_gemma":0.000007936801,"teacher_disagreement_score":0.93433535,"about_ca_system_score_codex":0.0001347997,"about_ca_system_score_gemma":0.00006716525,"threshold_uncertainty_score":0.37989452},"labels":[],"label_agreement":null},{"id":"W3184117305","doi":"10.4230/lipics.icalp.2021.2","title":"Symmetries and Complexity (Invited Talk)","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Homogeneous space; Computer science; Theoretical computer science; Algebraic number; Algebra over a field; Constraint (computer-aided design); Mathematical optimization; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.027038361841987664,"score_gpt":0.2497060505491352,"score_spread":0.22266768870714754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184117305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042085752,0.00008730009,0.9475189,0.004314656,0.0009281728,0.00050555385,0.00023504221,0.00032051947,0.004004111],"genre_scores_gemma":[0.67685354,0.0001934509,0.30816182,0.01324311,0.00013895893,0.000063246654,0.00077825034,0.000038426693,0.0005291661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984084,0.000036787882,0.0006134014,0.00024764542,0.00030707647,0.00038673062],"domain_scores_gemma":[0.99838495,0.00012792725,0.0002167676,0.00050118554,0.0005895026,0.00017967288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026040678,0.00022991998,0.0002862099,0.00020426375,0.0003548344,0.00065373327,0.00035342778,0.00012596698,0.000059057493],"category_scores_gemma":[0.0002416829,0.0002272915,0.000111909176,0.00052415964,0.00016621797,0.0015668195,0.00037499296,0.0002122447,0.000030231802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013661095,0.0008291483,0.0359443,0.0016473011,0.0006650418,0.000077676355,0.023417722,0.0007508356,0.00056721957,0.5456335,0.0434085,0.34692216],"study_design_scores_gemma":[0.0068090158,0.00028083596,0.024540603,0.00022352577,0.00006991844,0.00089837133,0.003552455,0.6827029,0.0062835724,0.009974557,0.26315737,0.0015068961],"about_ca_topic_score_codex":0.00001058352,"about_ca_topic_score_gemma":0.000047798312,"teacher_disagreement_score":0.68195206,"about_ca_system_score_codex":0.000060826053,"about_ca_system_score_gemma":0.00007062386,"threshold_uncertainty_score":0.92686784},"labels":[],"label_agreement":null},{"id":"W3191331128","doi":"10.24963/ijcai.2021/190","title":"Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP","year":2021,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Lagrangian relaxation; Lagrangian; Travelling salesman problem; Relaxation (psychology); Context (archaeology); Mathematical optimization; Constraint (computer-aided design); Constraint programming; Computer science; Augmented Lagrangian method; Filter (signal processing); State space; Mathematics; Algorithm; Applied mathematics; Stochastic programming","score_opus":0.00848941902042515,"score_gpt":0.21787479956806394,"score_spread":0.20938538054763878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191331128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012008118,0.0000035493306,0.98833257,0.0048894794,0.000042040727,0.00027844874,8.299157e-7,0.00016976461,0.0050825137],"genre_scores_gemma":[0.6166601,5.872304e-7,0.38133582,0.0015937171,0.000024900637,0.00005724796,0.000033650147,0.000004890775,0.0002890567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.00005571073,0.00010343193,0.00029552146,0.00014845969,0.00010428473],"domain_scores_gemma":[0.99919593,0.000022093349,0.000048789763,0.0005093968,0.00015438566,0.0000694269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015035136,0.0000710973,0.000053536845,0.00004374989,0.00013917254,0.00016903237,0.00020978595,0.00003209868,0.000026511689],"category_scores_gemma":[0.000014974272,0.00004727555,0.000019348168,0.0005930176,0.000014065364,0.0002714392,0.000026264219,0.00005945473,0.000019430197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039460876,0.00025635454,0.0015329174,0.000017409664,0.000023646966,0.0000020495397,0.0015459451,0.13388346,0.008774066,0.16444086,0.0005486985,0.68893516],"study_design_scores_gemma":[0.00023779918,0.00005439746,0.0064915786,0.0000021162898,0.0000044027493,0.000008403203,0.00013841415,0.98734075,0.0034082683,0.00005763293,0.0021529472,0.00010328933],"about_ca_topic_score_codex":0.000047256955,"about_ca_topic_score_gemma":0.00041795484,"teacher_disagreement_score":0.8534573,"about_ca_system_score_codex":0.000028062535,"about_ca_system_score_gemma":0.00010824414,"threshold_uncertainty_score":0.1927841},"labels":[],"label_agreement":null},{"id":"W3192289992","doi":"10.1111/coin.12438","title":"Improving stochastic local search for uniform <scp><i>k</i>‐SAT</scp> by generating appropriate initial assignment","year":2021,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nutrasource","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Heuristics; Random variable; Local search (optimization); Heuristic; Algorithm; Computer science; Variable (mathematics); Mathematical optimization; Mathematics; Statistics","score_opus":0.02984284784506302,"score_gpt":0.2886217986190427,"score_spread":0.25877895077397967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192289992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023576254,0.00011054854,0.9961988,0.00023442494,0.00047700753,0.00029156514,0.000031848427,0.00012187983,0.00017634877],"genre_scores_gemma":[0.686659,0.0000032642206,0.31249934,0.0003765535,0.00009480875,0.000041281994,0.00016906169,0.0000127428375,0.00014394952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981111,0.00009401964,0.0004298317,0.0005481318,0.00047131756,0.00034558837],"domain_scores_gemma":[0.9978796,0.0010351143,0.00012938264,0.00020880369,0.0005986519,0.00014842518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040292804,0.00018135594,0.00016276704,0.00009410284,0.00039925164,0.0003629157,0.00035141868,0.00007811813,0.000031265627],"category_scores_gemma":[0.00026197516,0.000199479,0.00008438185,0.00039950368,0.000099825156,0.00041164213,0.00020653044,0.0002194452,0.000038372094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015578986,0.00003973649,0.000017556446,0.000015303049,0.000014699273,0.0000036230977,0.00039030993,0.80041605,0.0007002324,0.015811054,0.0001615143,0.18242837],"study_design_scores_gemma":[0.0001646383,0.00006197656,0.0000325316,0.00002048944,0.0000065504028,0.000041246672,0.0004135949,0.97999734,0.014567719,0.004464034,0.00012630982,0.00010357037],"about_ca_topic_score_codex":0.000012889084,"about_ca_topic_score_gemma":0.000005849084,"teacher_disagreement_score":0.6843014,"about_ca_system_score_codex":0.00015548326,"about_ca_system_score_gemma":0.0005115766,"threshold_uncertainty_score":0.8134517},"labels":[],"label_agreement":null},{"id":"W3198437945","doi":"10.1609/socs.v12i1.18547","title":"Scaling Up Search with Partial Initial States in Optimization Crosswords","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Solver; Computer science; Heuristic; Constraint (computer-aided design); Local search (optimization); Scaling; State (computer science); Mathematical optimization; Optimization problem; Competition (biology); Algorithm; Mathematics; Artificial intelligence","score_opus":0.015698394768455106,"score_gpt":0.2746142410077062,"score_spread":0.2589158462392511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198437945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92995656,0.000012102101,0.035561003,0.015869359,0.0064285393,0.0005519607,0.000015715268,0.00012205883,0.011482721],"genre_scores_gemma":[0.996142,0.000030400115,0.003351015,0.0001194794,0.00018056874,0.000015748714,0.00000879447,0.00001290619,0.00013902984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978961,0.000035739286,0.00032878257,0.00037977909,0.0011138105,0.00024578936],"domain_scores_gemma":[0.9984348,0.00013503873,0.000107844986,0.00013623635,0.0011176364,0.000068444555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005126728,0.00013279857,0.00015009775,0.0001341742,0.00014797639,0.00043232774,0.0008161932,0.000073679024,0.000066915796],"category_scores_gemma":[0.00013311589,0.000109243294,0.00006082259,0.00073441566,0.00010507248,0.00056563516,0.00039195534,0.00030679101,0.000004384432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007070858,0.0005771788,0.035349842,0.000062147636,0.00010169469,0.000012299183,0.002984782,0.47300494,0.0097019775,0.4718306,0.00022606285,0.0054413658],"study_design_scores_gemma":[0.0034668061,0.000200795,0.0032340754,0.00026216422,0.00000889244,0.00003982292,0.00039027698,0.6394478,0.34939048,0.0026887055,0.0005571894,0.00031297613],"about_ca_topic_score_codex":0.0000872575,"about_ca_topic_score_gemma":0.0000071145914,"teacher_disagreement_score":0.4691419,"about_ca_system_score_codex":0.0002109955,"about_ca_system_score_gemma":0.0002350425,"threshold_uncertainty_score":0.44548124},"labels":[],"label_agreement":null},{"id":"W3202312471","doi":"10.1142/s0218194023500171","title":"Exact Learning of Qualitative Constraint Networks from Membership Queries","year":2023,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Constraint (computer-aided design); Theoretical computer science; Mathematics","score_opus":0.01972674333613996,"score_gpt":0.28053784320917546,"score_spread":0.2608110998730355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202312471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06074102,0.00047686842,0.9369972,0.0000828217,0.0014655176,0.000029077246,0.0000043275277,0.0001747462,0.000028423243],"genre_scores_gemma":[0.9546154,0.00020546159,0.0449285,0.0000041402573,0.00019315221,0.0000018051667,0.0000060815073,0.00001381496,0.000031631822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906397,0.00003478326,0.00040196592,0.00012465758,0.00021900065,0.00015561681],"domain_scores_gemma":[0.99844897,0.0009056161,0.00017166264,0.00007134764,0.00031743478,0.0000849693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300614,0.00013151308,0.00020796618,0.00040932585,0.000025585397,0.000070027156,0.0002700755,0.0000614136,0.000013737376],"category_scores_gemma":[0.0009257596,0.00013477281,0.00008292806,0.00027912908,0.000027954959,0.0003621112,0.000091848684,0.00029849567,0.0000026729667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000986449,0.000014491673,0.0017824956,0.00003045205,0.00024777887,0.000029827223,0.008471517,0.9514465,0.0006676945,0.009137313,0.00004715877,0.028114941],"study_design_scores_gemma":[0.00045761085,0.00005291451,0.006560249,0.00037426339,0.000012853719,0.00006586497,0.0007777363,0.9898115,0.00066305225,0.00012642777,0.00090169534,0.00019586358],"about_ca_topic_score_codex":0.00000771331,"about_ca_topic_score_gemma":0.0000013098503,"teacher_disagreement_score":0.8938744,"about_ca_system_score_codex":0.000057565852,"about_ca_system_score_gemma":0.000058733985,"threshold_uncertainty_score":0.5495876},"labels":[],"label_agreement":null},{"id":"W3203204833","doi":"10.21203/rs.3.rs-4259901/v1","title":"Constrained Optimization with Qualitative Preferences","year":2024,"lang":"en","type":"preprint","venue":"Research Square","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Ceteris paribus; Computer science; Outcome (game theory); Lexicographical order; Mathematical optimization; Preference; Set (abstract data type); Net (polyhedron); Mathematics; Statistics; Mathematical economics; Economics; Combinatorics","score_opus":0.09511010004674755,"score_gpt":0.42617843946815276,"score_spread":0.33106833942140523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203204833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014879688,0.0003689919,0.9676791,0.0038270396,0.0003853256,0.0011329402,0.00007868075,0.00056550634,0.024474435],"genre_scores_gemma":[0.80055207,0.00023815973,0.19759734,0.000037191458,0.00011697347,0.00030172383,0.00015994292,0.000032358377,0.00096424605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612606,0.0009281387,0.00031728944,0.0009180029,0.0012699552,0.00044052952],"domain_scores_gemma":[0.99739015,0.0005377975,0.00010612491,0.000687519,0.0011008483,0.0001775421],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016144984,0.00025801134,0.00026412762,0.000732127,0.00021960276,0.0011631275,0.00074332603,0.0002495687,0.0002883391],"category_scores_gemma":[0.00023362924,0.00020670987,0.000081735096,0.0010634543,0.00035989145,0.00024596037,0.0013943184,0.0014993489,0.000117541116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006883906,0.00015433798,0.00019154148,0.0019646424,0.00030120762,0.000120237135,0.0429553,0.5740969,0.00002173069,0.30400515,0.003036168,0.07308393],"study_design_scores_gemma":[0.00039859503,0.000380307,0.00023413464,0.0017603957,0.000018734952,0.000022415968,0.0059950845,0.92669845,0.0001293247,0.06335969,0.00042682068,0.00057607336],"about_ca_topic_score_codex":0.00010003007,"about_ca_topic_score_gemma":0.000088720975,"teacher_disagreement_score":0.7990641,"about_ca_system_score_codex":0.00020390745,"about_ca_system_score_gemma":0.0015230324,"threshold_uncertainty_score":0.99987376},"labels":[],"label_agreement":null},{"id":"W3206014156","doi":"10.3390/s21206840","title":"A Decentralized Fuzzy Rule-Based Approach for Computing Topological Relations between Spatial Dynamic Continuous Phenomena with Vague Boundaries Using Sensor Data","year":2021,"lang":"en","type":"article","venue":"Sensors","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Spatial analysis; Fuzzy logic; Node (physics); Representation (politics); Spatial relation; Artificial intelligence; Kernel (algebra); Data mining; Topology (electrical circuits); Mathematics; Geography; Remote sensing; Engineering","score_opus":0.04115397266296152,"score_gpt":0.2839326605503584,"score_spread":0.24277868788739684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206014156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13248916,0.000024229836,0.86584663,0.0006181621,0.00014812779,0.00033847487,0.00010097656,0.00018077486,0.00025348467],"genre_scores_gemma":[0.5422051,6.8934156e-7,0.4572866,0.00006727576,0.000044943386,0.0000020844109,0.00034594772,0.000009773601,0.000037562295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982707,0.00018377452,0.00032996948,0.00063082913,0.00023089613,0.00035384466],"domain_scores_gemma":[0.99860305,0.000296908,0.0001752208,0.00061544444,0.00020329618,0.000106086656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443301,0.00018540505,0.00029700005,0.000082943174,0.00076643215,0.000629101,0.00031711467,0.00009605452,0.000020647938],"category_scores_gemma":[0.00017267671,0.00017106537,0.00005774395,0.00035531627,0.0002734591,0.00021970476,0.00015329139,0.00015777754,0.0000027854226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021431134,0.00038446407,0.093273565,0.00014626174,0.0004420411,0.00011226727,0.0028104947,0.7958365,0.00087746157,0.022200845,0.00010572703,0.08359602],"study_design_scores_gemma":[0.0012693913,0.00003815672,0.006281056,0.00002042751,0.000056327342,0.000044069377,0.00026157402,0.99088097,0.00010731462,0.000208916,0.00058487937,0.0002469033],"about_ca_topic_score_codex":0.00007986909,"about_ca_topic_score_gemma":0.00008926958,"teacher_disagreement_score":0.40971595,"about_ca_system_score_codex":0.00009872997,"about_ca_system_score_gemma":0.0005046489,"threshold_uncertainty_score":0.69758433},"labels":[],"label_agreement":null},{"id":"W3206580908","doi":"10.1609/aaai.v36i4.20293","title":"Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Backdoor; Computer science; Integer programming; Benchmark (surveying); Search tree; Monte Carlo method; Theoretical computer science; Tree (set theory); Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Search algorithm; Combinatorics","score_opus":0.09239255901222973,"score_gpt":0.3095931301770247,"score_spread":0.217200571164795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206580908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48759338,0.000027236545,0.45933107,0.02711152,0.0021348393,0.0024184138,0.00001752856,0.0004923896,0.020873614],"genre_scores_gemma":[0.9838458,0.00000871343,0.015205653,0.00039688585,0.00004244064,0.00011804376,4.078684e-7,0.000013974384,0.00036813697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977077,0.000042108233,0.0004809014,0.0005644849,0.00079844805,0.00040632958],"domain_scores_gemma":[0.9987491,0.000098935336,0.00021287275,0.00033082126,0.00046530992,0.00014299387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684843,0.00020817766,0.00022482104,0.00026907815,0.000500078,0.00034809066,0.0019872996,0.00006318445,0.00031319767],"category_scores_gemma":[0.00033435592,0.0001788637,0.00013236272,0.0016814603,0.00014360582,0.000383775,0.0009691384,0.00061641965,0.00006949464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005960504,0.00013313621,0.001078349,0.000016445389,0.000015477019,9.130183e-7,0.006387986,0.0040464755,0.002881096,0.6892931,0.00012563568,0.29596183],"study_design_scores_gemma":[0.00011427864,0.0016499171,0.0017268918,0.00064046663,0.000034459896,0.0000449317,0.01709748,0.71260345,0.15576299,0.107138574,0.0019754386,0.0012111228],"about_ca_topic_score_codex":0.00007117637,"about_ca_topic_score_gemma":0.000020629735,"teacher_disagreement_score":0.70855695,"about_ca_system_score_codex":0.00015107912,"about_ca_system_score_gemma":0.00015323688,"threshold_uncertainty_score":0.729385},"labels":[],"label_agreement":null},{"id":"W3210928534","doi":"10.1007/978-3-030-87756-9_1","title":"Aggregating Preferences Represented by Conditional Preference Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Preference; Artificial intelligence; Operations research; Statistics; Mathematics","score_opus":0.022759261580288456,"score_gpt":0.2396448238417689,"score_spread":0.21688556226148045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210928534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035070836,0.0006047255,0.9926533,0.0006153329,0.0011563089,0.00028505293,0.000015206934,0.0001927636,0.00444225],"genre_scores_gemma":[0.4630899,0.000492596,0.5302009,0.0031218755,0.00067470304,0.000039680537,0.0003347105,0.000058928636,0.0019866717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962667,0.0000668349,0.0005736755,0.0016094686,0.0009621684,0.0005211492],"domain_scores_gemma":[0.9974949,0.0005441158,0.00041821855,0.00096469885,0.00042029942,0.00015780937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004673532,0.000446115,0.00042677324,0.0003881526,0.00033176606,0.0008334972,0.0017220026,0.00033356753,0.00021962168],"category_scores_gemma":[0.00017090472,0.00044178,0.00010840723,0.00065416074,0.0006037987,0.00077843206,0.000897449,0.0008502147,0.0000158681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033542676,0.000026445727,0.0002862831,0.000020029564,0.000020427615,0.00004201601,0.00019623607,0.22414806,0.0000731909,0.021150704,0.00028201877,0.7537512],"study_design_scores_gemma":[0.00023613404,0.00006065338,0.00030620495,0.00042431377,0.0000068806885,0.000080085825,3.3762097e-7,0.95048004,0.0004530474,0.04644205,0.0009206696,0.00058957783],"about_ca_topic_score_codex":0.000020167014,"about_ca_topic_score_gemma":0.00009063119,"teacher_disagreement_score":0.75316167,"about_ca_system_score_codex":0.0002010454,"about_ca_system_score_gemma":0.000632887,"threshold_uncertainty_score":0.9998034},"labels":[],"label_agreement":null},{"id":"W3215520796","doi":"10.21203/rs.3.rs-597492/v1","title":"Nature-Inspired Techniques For Dynamic Constraint Satisfaction Problems","year":2021,"lang":"en","type":"preprint","venue":"Research Square","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Mathematical optimization; Computer science; Artificial intelligence; Mathematics","score_opus":0.03656909079605409,"score_gpt":0.37458182146391517,"score_spread":0.3380127306678611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215520796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039619906,0.0005874752,0.9852901,0.0033719598,0.0008801131,0.0034523916,0.00010032946,0.00081474596,0.0015408751],"genre_scores_gemma":[0.83801335,0.00058528123,0.15948983,0.0000954279,0.00010686265,0.0011619687,0.00030791512,0.00003736323,0.00020199476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962311,0.00042921238,0.00048046533,0.001167496,0.0010490607,0.0006426832],"domain_scores_gemma":[0.99632263,0.00039917105,0.00019398677,0.001140503,0.0017491145,0.0001945982],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016267361,0.00031425172,0.00037879354,0.00070594146,0.00041339805,0.0011718987,0.0007524194,0.0009206117,0.00009939979],"category_scores_gemma":[0.00054252014,0.00033035138,0.00026723175,0.000658645,0.00020321296,0.0004017161,0.0010936979,0.0023283525,0.0000105024865],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029557383,0.00017526765,0.0026678618,0.0026942084,0.00017095495,0.000045778404,0.0012280188,0.0028867244,0.003960988,0.040583488,0.0020792643,0.94347787],"study_design_scores_gemma":[0.0016094113,0.0007865754,0.059625313,0.005128221,0.000048603706,0.00016728252,0.001356535,0.8564893,0.012087874,0.044906806,0.015446373,0.0023477331],"about_ca_topic_score_codex":0.00015840343,"about_ca_topic_score_gemma":0.0006955167,"teacher_disagreement_score":0.94113016,"about_ca_system_score_codex":0.00068781327,"about_ca_system_score_gemma":0.0013592765,"threshold_uncertainty_score":0.9999733},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023701134907869622,"score_gpt":0.3029840092867271,"score_spread":0.27928287437885746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32539537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003740852,0.0002247043,0.9948905,0.0012022426,0.0019994054,0.00066978397,0.000029708992,0.0002575462,0.0006886636],"genre_scores_gemma":[0.056768015,0.000013899717,0.9400156,0.0025183177,0.00047084785,0.000023084436,0.00003178265,0.00003240774,0.00012604243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960841,0.00006380043,0.00060763344,0.0011938224,0.0012345004,0.0008161733],"domain_scores_gemma":[0.9971917,0.00041056197,0.00030480477,0.00096775213,0.00070897344,0.00041620486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001311103,0.0004986848,0.0004748005,0.0011077822,0.00042989725,0.00041854923,0.0014600618,0.00027412144,0.00018778784],"category_scores_gemma":[0.00014791239,0.0004962869,0.0001505101,0.00093524385,0.00030724637,0.0005263388,0.00057880994,0.0006433725,0.00011638154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024984615,0.000026347054,0.00006152478,0.0000064158207,0.000008822287,0.000010227701,0.00015190596,0.10616995,0.00020511661,0.003783045,0.000031011812,0.8895431],"study_design_scores_gemma":[0.0003745675,0.0001450249,0.0005285112,0.00017421777,0.00001547123,0.000038953774,9.601641e-8,0.98902476,0.0013786525,0.0062377513,0.0014375406,0.00064445834],"about_ca_topic_score_codex":0.000030185032,"about_ca_topic_score_gemma":0.000040308423,"teacher_disagreement_score":0.8888987,"about_ca_system_score_codex":0.00080730347,"about_ca_system_score_gemma":0.0011469653,"threshold_uncertainty_score":0.9997489},"labels":[],"label_agreement":null},{"id":"W32549655","doi":"10.4103/iju.iju_84_20","title":"Solving a stochastic queueing design and control problem with constraint programming","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Mathematical optimization; Constraint programming; Constraint (computer-aided design); Stochastic programming; Decomposition; Benders' decomposition; Variety (cybernetics); Constraint satisfaction; Operations research; Mathematics; Artificial intelligence; Computer network","score_opus":0.06487848277850274,"score_gpt":0.3006697614736803,"score_spread":0.23579127869517758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32549655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065725454,0.000010225203,0.99582595,0.0010895905,0.000081218226,0.0005518762,0.0000016903432,0.00015378027,0.001628433],"genre_scores_gemma":[0.79350835,0.0000020558052,0.20617968,0.00023540476,0.000031141968,0.000023349108,0.0000014527432,0.0000063733246,0.0000122152915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982493,0.00006993715,0.00037619504,0.00043305033,0.0005569634,0.00031454238],"domain_scores_gemma":[0.99835306,0.00057924306,0.0001607474,0.00012413267,0.0006434471,0.00013938037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011862201,0.00017688145,0.00015099924,0.00024303116,0.00026470542,0.00039234478,0.00022772004,0.00007241316,0.000047498197],"category_scores_gemma":[0.00021324761,0.00016025317,0.000025279856,0.00036846858,0.00022064062,0.00040067706,0.00003248174,0.00022095046,0.000024768487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005062202,0.00003612407,0.00003352103,0.0000040391774,0.000010616333,0.000006262332,0.00032232012,0.024079377,0.0005914552,0.60415447,0.0000017960407,0.3707094],"study_design_scores_gemma":[0.00013017174,0.00028954513,0.00042280596,0.00011616159,0.000007738885,0.000062567575,0.00035317952,0.9420835,0.0031777022,0.05301795,0.000025522091,0.00031318958],"about_ca_topic_score_codex":0.00001607535,"about_ca_topic_score_gemma":0.00007369498,"teacher_disagreement_score":0.9180041,"about_ca_system_score_codex":0.00009093934,"about_ca_system_score_gemma":0.0003586957,"threshold_uncertainty_score":0.6534934},"labels":[],"label_agreement":null},{"id":"W33113097","doi":"10.1007/978-3-642-18879-4_2","title":"Overview of Spatial Reasoning and Planning Techniques","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Spatial intelligence; Qualitative reasoning; Computer science; Motion planning; Management science; Kinematics; Data science; Artificial intelligence; Human–computer interaction; Engineering","score_opus":0.030426919680390897,"score_gpt":0.2698631192573698,"score_spread":0.23943619957697887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33113097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018889044,0.00031156422,0.5788149,0.000054535205,0.000058817197,0.00007674409,0.0000013875309,0.00011336675,0.42056677],"genre_scores_gemma":[0.028045794,0.0022398583,0.8832186,0.00055662397,0.00018845439,0.0000058993646,0.000021937756,0.000048982853,0.08567383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940926,0.0000046140412,0.00018533866,0.00020434454,0.00013154656,0.00006492259],"domain_scores_gemma":[0.9995596,0.000021123584,0.00014631283,0.00018100119,0.000058229736,0.000033756965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073836105,0.00011916762,0.00017188342,0.00011669431,0.000032121814,0.000037937287,0.000118926386,0.00012038106,0.00022151406],"category_scores_gemma":[0.000009591295,0.00011444112,0.000038394566,0.000017356602,0.00003927362,0.00012642614,0.00010339708,0.00010608565,0.0000027484837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.795842e-7,0.0000012182817,0.000048128994,0.000029282668,0.000007962392,0.000003957207,0.00006626157,0.000020014508,0.000006404369,0.81366175,0.00004036013,0.18611391],"study_design_scores_gemma":[0.002511528,0.0010260005,0.009580507,0.021796318,0.0002643865,0.0006631727,0.000075615404,0.06303454,0.009972585,0.6866093,0.1993164,0.005149607],"about_ca_topic_score_codex":0.000056809884,"about_ca_topic_score_gemma":0.000011901832,"teacher_disagreement_score":0.33489293,"about_ca_system_score_codex":0.000025921427,"about_ca_system_score_gemma":0.000069393456,"threshold_uncertainty_score":0.46667737},"labels":[],"label_agreement":null},{"id":"W34058408","doi":"10.1016/j.cgh.2021.05.052","title":"L'´elargissement aleatoire progressif","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; Allergan; National Institutes of Health; Valeant Pharmaceuticals International","keywords":"Mathematics; Heuristic; Algorithm; Value (mathematics); Combinatorics; Discrete mathematics; Mathematical optimization; Statistics","score_opus":0.006582542185047076,"score_gpt":0.24502563066506647,"score_spread":0.23844308848001938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34058408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016886913,0.000019338719,0.94273084,0.00089943636,0.00016886443,0.00007397507,7.0641676e-8,0.00021916062,0.054199602],"genre_scores_gemma":[0.78228796,0.000003860089,0.21560052,0.00044947106,0.000023103745,0.0000023732373,9.4577257e-7,0.0000023825232,0.0016293688],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99949914,0.0000063611474,0.000104901505,0.00013111669,0.00012819556,0.00013029206],"domain_scores_gemma":[0.99970055,0.000015356247,0.000025165837,0.00016608159,0.000034763063,0.00005811399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018571348,0.00004565976,0.000036118872,0.000054448985,0.00006320998,0.000059114125,0.00014551314,0.000021451298,0.00021568855],"category_scores_gemma":[0.000006803888,0.000038800452,0.000019381681,0.00017237061,0.0000150347805,0.00020827392,0.0000440079,0.000033911267,0.000076740966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013166779,0.000026281876,0.008973453,0.00000178479,0.0000046490727,0.000010381754,0.00014802991,0.0000380288,0.00015855918,0.20094946,0.0011214049,0.78856665],"study_design_scores_gemma":[0.0021853023,0.00028005365,0.4306204,0.000057012643,0.000013013775,0.0002228942,0.00057097676,0.2159284,0.045775853,0.0050373226,0.29809222,0.001216547],"about_ca_topic_score_codex":0.0000034112766,"about_ca_topic_score_gemma":0.000026056698,"teacher_disagreement_score":0.7873501,"about_ca_system_score_codex":0.000019850602,"about_ca_system_score_gemma":0.000017245971,"threshold_uncertainty_score":0.23616384},"labels":[],"label_agreement":null},{"id":"W34131768","doi":"10.3233/978-1-58603-891-5-30","title":"Reasoning about Dynamic Depth Profiles","year":2008,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.023673690180070744,"score_gpt":0.25977950067696737,"score_spread":0.23610581049689663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34131768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003618828,0.0011828864,0.9114119,0.0002530973,0.0002358383,0.0005114313,0.000011734634,0.000108739005,0.08628075],"genre_scores_gemma":[0.03914308,0.029892465,0.8197288,0.00061132316,0.00049887,0.00090478006,0.00028429602,0.00013422435,0.108802184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986471,0.000012816573,0.00043456513,0.00053976657,0.00016890041,0.00019686401],"domain_scores_gemma":[0.99922955,0.000033876342,0.0001780077,0.00039889172,0.00007440246,0.000085246225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009640865,0.00021838378,0.00023883642,0.0003153924,0.00022953349,0.000113791706,0.00035867913,0.00020513167,0.000033266293],"category_scores_gemma":[0.000012701467,0.0002445877,0.000063120075,0.00015788183,0.00022236128,0.00020006437,0.00006886231,0.00030471117,0.00006452568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017748921,0.000010713996,0.00006165408,0.000007685272,0.0000081760045,0.000002673845,0.00017583134,0.00036608885,0.0000028338836,0.35438487,0.0005811236,0.6443966],"study_design_scores_gemma":[0.000058938032,0.000055619636,0.0005251546,0.00031101296,0.00003544783,0.00006586269,0.00033104533,0.39222115,0.0003050116,0.37387714,0.23103054,0.0011831074],"about_ca_topic_score_codex":0.000009437825,"about_ca_topic_score_gemma":0.00009583383,"teacher_disagreement_score":0.64321345,"about_ca_system_score_codex":0.00008764018,"about_ca_system_score_gemma":0.00010596156,"threshold_uncertainty_score":0.9973997},"labels":[],"label_agreement":null},{"id":"W34943095","doi":"10.1007/978-3-642-40627-0_6","title":"Parallel Discrepancy-Based Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Backtracking; Computer science; Scalability; Heuristic; Parallel computing; Computation; Supercomputer; Load balancing (electrical power); Massively parallel; Constraint satisfaction problem; Algorithm; Artificial intelligence; Grid","score_opus":0.01845673057410436,"score_gpt":0.2484697395635229,"score_spread":0.23001300898941854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34943095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014429597,0.000099120974,0.98691815,0.0025484166,0.001009367,0.000427186,0.0000031359768,0.00022364642,0.008756545],"genre_scores_gemma":[0.034434192,0.00003239171,0.96243554,0.0018155901,0.00021585594,0.000014198759,0.00000961601,0.000028539325,0.0010140709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967517,0.000036911617,0.00041901428,0.0012667761,0.0009600485,0.0005655247],"domain_scores_gemma":[0.99785364,0.000284903,0.00016308449,0.0012204661,0.00027045156,0.00020748776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048202253,0.00041082734,0.0003609931,0.00076960644,0.00024340874,0.0007192634,0.0020333452,0.0002591342,0.0003137737],"category_scores_gemma":[0.000044689852,0.0003723116,0.00012553709,0.00051707675,0.0006017265,0.0006443711,0.0006004529,0.0006625,0.00028043627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023715581,0.000014984294,0.000074352196,0.000018126912,0.0000050385024,0.000024510693,0.00017342782,0.187487,0.000018604851,0.049228773,0.000035201083,0.7629176],"study_design_scores_gemma":[0.00025821512,0.00007232288,0.00033976664,0.0001471461,0.000003129152,0.00002210763,7.5326604e-8,0.9436241,0.00019202028,0.053848617,0.0010158693,0.0004766649],"about_ca_topic_score_codex":0.00003804863,"about_ca_topic_score_gemma":0.000067891146,"teacher_disagreement_score":0.7624409,"about_ca_system_score_codex":0.00024578057,"about_ca_system_score_gemma":0.0008621884,"threshold_uncertainty_score":0.99987286},"labels":[],"label_agreement":null},{"id":"W35056265","doi":"10.3390/mi13010101","title":"SATzilla2007: a New & Improved Algorithm Portfolio for SAT","year":2007,"lang":"en","type":"article","venue":"Micromachines","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Portfolio; Computer science; Empirical research; Uncorrelated; Algorithm; Artificial intelligence; Mathematics; Statistics; Economics; Finance","score_opus":0.007452344533701575,"score_gpt":0.25352043485746584,"score_spread":0.24606809032376425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35056265","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965186,0.00014368881,0.99320054,0.00059549935,0.0006828403,0.00026168983,0.0000070548663,0.00023002911,0.0009134818],"genre_scores_gemma":[0.045004122,0.000012757098,0.95077837,0.0009367566,0.00034281786,0.0000058495198,0.00002748086,0.000016824368,0.0028750298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911916,0.000009464766,0.00023642545,0.0002820663,0.00008781471,0.00026503814],"domain_scores_gemma":[0.9993943,0.000070696144,0.00008553524,0.00025323438,0.000067985115,0.00012825977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025832618,0.00013228183,0.00012291767,0.00013575828,0.00011752218,0.00010769804,0.00026051232,0.000061159044,0.000052959585],"category_scores_gemma":[0.000033414883,0.00012161983,0.00009040829,0.00023375737,0.000020931377,0.00023354775,0.00005954993,0.00006243849,0.00002252671],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000857094,0.000018024946,0.00089798245,0.000004213071,0.000013737713,0.0000036651145,0.00015722956,0.000013915325,0.014875958,0.0016456565,0.0041062916,0.97825474],"study_design_scores_gemma":[0.0070775314,0.00048031492,0.12466654,0.000049328348,0.00006113448,0.0005915719,0.00010791159,0.50529814,0.042135198,0.013090653,0.30466333,0.0017783268],"about_ca_topic_score_codex":0.00012280328,"about_ca_topic_score_gemma":0.00014165744,"teacher_disagreement_score":0.97647643,"about_ca_system_score_codex":0.00003435986,"about_ca_system_score_gemma":0.00008213987,"threshold_uncertainty_score":0.49595127},"labels":[],"label_agreement":null},{"id":"W35099975","doi":"10.1007/3-540-26772-7_19","title":"Representing Topological Relationships between Complex Regions by F-Histograms","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Histogram; Partition (number theory); Mathematics; Fuzzy logic; Topology (electrical circuits); Object (grammar); Computer science; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Combinatorics; Image (mathematics)","score_opus":0.08995383854206918,"score_gpt":0.2610121479383096,"score_spread":0.17105830939624045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35099975","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014979406,0.000029250297,0.497825,0.0015000753,0.000084514046,0.000119921155,0.0000101701235,0.0003177353,0.5001119],"genre_scores_gemma":[0.02170772,0.00002783393,0.070714235,0.00019191968,0.00019114865,0.000007336638,0.00059526047,0.00002780538,0.90653676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829584,0.000057725472,0.0004947272,0.0006070134,0.00031910546,0.00022556155],"domain_scores_gemma":[0.9985844,0.0002699317,0.00028025027,0.00064374023,0.00010228249,0.000119399374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022054368,0.0002554552,0.00029428554,0.00016049691,0.00041157176,0.00017801485,0.00046171944,0.00040927928,0.00077120494],"category_scores_gemma":[0.00004749985,0.0002501522,0.00016899408,0.000086608845,0.00017199675,0.00021066224,0.00020560152,0.000579196,0.00018749591],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.180376e-7,0.0000066289485,0.00096495,0.0000033653112,0.00001784057,0.000004452141,0.000021737189,0.000065171385,0.0000028276654,0.8308323,0.15941632,0.00866398],"study_design_scores_gemma":[0.00021796099,0.00003061432,0.0031987678,0.000035402445,0.00003896048,0.000027494245,0.000010388629,0.0064591356,0.0000042102097,0.0957434,0.89361066,0.00062300934],"about_ca_topic_score_codex":0.000073853924,"about_ca_topic_score_gemma":0.000050320148,"teacher_disagreement_score":0.7350889,"about_ca_system_score_codex":0.00009197139,"about_ca_system_score_gemma":0.00004340863,"threshold_uncertainty_score":0.99999505},"labels":[],"label_agreement":null},{"id":"W4205095874","doi":"10.5311/josis.2021.23.155","title":"Deriving topological relations from topologically augmented direction relation matrices","year":2021,"lang":"en","type":"article","venue":"Journal of Spatial Information Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Relation (database); Topological conjugacy; Mathematics; Matrix (chemical analysis); Topology (electrical circuits); Spatial relation; Pure mathematics; Computer science; Geometry; Combinatorics; Data mining","score_opus":0.012821357578306393,"score_gpt":0.2528888854785233,"score_spread":0.2400675279002169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205095874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081949405,0.000034013286,0.9108396,0.0023350294,0.0010317919,0.000053307893,0.0000018969972,0.000049449478,0.0037054587],"genre_scores_gemma":[0.9128237,0.00007955462,0.08669128,0.00030674305,0.00006543287,0.0000010998697,0.000004926482,0.0000012024187,0.000026103522],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99829745,0.000067926565,0.0006910301,0.00012533597,0.0006735911,0.00014464896],"domain_scores_gemma":[0.9977759,0.00015197851,0.0007101712,0.00016660648,0.0010845936,0.000110725814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259635,0.00008102252,0.00013050111,0.000340008,0.00037155693,0.0005014955,0.0003507853,0.00007035007,0.00031686312],"category_scores_gemma":[0.0010736592,0.000068262554,0.00006701273,0.0011150069,0.00012825501,0.008582841,0.000113696115,0.00019398399,0.000041424773],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051838862,0.00016488731,0.05000533,0.000010206338,0.00004573231,0.00003089636,0.00474978,0.05040585,0.020460457,0.07421658,0.00051441684,0.799344],"study_design_scores_gemma":[0.00065972336,0.0001473067,0.6773153,0.000055919652,0.000018214501,0.00023613696,0.00055490126,0.30497664,0.0068505094,0.004624365,0.0043387422,0.0002222183],"about_ca_topic_score_codex":0.00006922774,"about_ca_topic_score_gemma":0.000028423947,"teacher_disagreement_score":0.83087426,"about_ca_system_score_codex":0.00017479964,"about_ca_system_score_gemma":0.0004427182,"threshold_uncertainty_score":0.62223524},"labels":[],"label_agreement":null},{"id":"W4205593064","doi":"10.1109/smc52423.2021.9659092","title":"Weighted Constrained CP-nets: an Extension of Constrained CP-nets with Weighted Constraints","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Net (polyhedron); Computer science; Context (archaeology); Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Outcome (game theory); Mathematics; Mathematical economics","score_opus":0.032849906186750204,"score_gpt":0.2699400895791358,"score_spread":0.23709018339238558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205593064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37214965,0.00037326827,0.50912493,0.0059571555,0.005293852,0.0016648927,0.00063803606,0.00044491782,0.104353294],"genre_scores_gemma":[0.98657876,0.00032842314,0.01087871,0.00039872588,0.00012185808,0.000028548731,0.00020245809,0.000027774764,0.0014347329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962968,0.00032404,0.0009473573,0.0010314579,0.0009926345,0.00040768195],"domain_scores_gemma":[0.9962897,0.0002184212,0.0005783016,0.0006844952,0.0019064037,0.00032273633],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039117766,0.00046408878,0.0006143773,0.00033827,0.00016556475,0.0005537857,0.00058603403,0.0002468434,0.0010180797],"category_scores_gemma":[0.00005720065,0.00043181033,0.000098562894,0.0004033643,0.0006900016,0.0004928075,0.00011279038,0.0003366284,0.000039283277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002037295,0.00054703775,0.0023035635,0.00011964732,0.0005014158,0.0005169088,0.0011780073,0.0004797955,0.028886471,0.9102022,0.00092762866,0.054133583],"study_design_scores_gemma":[0.0097718295,0.0015915362,0.0072677364,0.0027826102,0.00020596533,0.0031336187,0.005396425,0.9293276,0.023485567,0.0053626033,0.009131559,0.0025429612],"about_ca_topic_score_codex":0.000106055784,"about_ca_topic_score_gemma":0.0001800197,"teacher_disagreement_score":0.9288478,"about_ca_system_score_codex":0.000090895606,"about_ca_system_score_gemma":0.00071019947,"threshold_uncertainty_score":0.9998951},"labels":[],"label_agreement":null},{"id":"W4207047886","doi":"10.1090/mbk/139/34","title":"Algebraic factorisation","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Algebraic number; Factorization; Mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Algorithm","score_opus":0.015999680857055058,"score_gpt":0.23266671711576137,"score_spread":0.2166670362587063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207047886","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000090290805,0.000019011468,0.52553725,0.0003321519,0.00011699658,0.00014809858,0.0000045344536,0.00022226185,0.47361067],"genre_scores_gemma":[0.0052607246,0.000095934614,0.30566627,0.0025425018,0.0002995406,0.000034428413,0.000051066218,0.000100792844,0.6859487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982377,0.000024858342,0.0004306788,0.00053690054,0.00051167345,0.0002581776],"domain_scores_gemma":[0.9984466,0.0002257814,0.00036554268,0.0006573089,0.00013770271,0.00016705225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001399493,0.0003376907,0.0004981104,0.00004156821,0.00014007019,0.00020140897,0.00038987343,0.00019394283,0.0007963285],"category_scores_gemma":[0.000033873304,0.0003316936,0.000506862,0.00004885935,0.0003658979,0.00009742021,0.00021441531,0.00039321434,0.0002621976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3635634e-7,0.00000868944,0.0000017406021,0.000033386143,0.000087414686,0.000004438729,0.0006484125,0.0000033873728,0.000023651466,0.8973317,0.0014837657,0.10037293],"study_design_scores_gemma":[0.00051169156,0.00018440685,0.00007372478,0.00041209126,0.00018152266,0.00011203976,0.0004343573,0.026999593,0.00024660162,0.7994171,0.16947407,0.0019528219],"about_ca_topic_score_codex":0.0000044188014,"about_ca_topic_score_gemma":0.000002417132,"teacher_disagreement_score":0.21987098,"about_ca_system_score_codex":0.00015623966,"about_ca_system_score_gemma":0.00019746077,"threshold_uncertainty_score":0.9999135},"labels":[],"label_agreement":null},{"id":"W4211178994","doi":"10.1017/9781107358331.009","title":"Parameterized Reductions","year":2019,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Parameterized complexity; Computer science; Mathematics; Algorithm","score_opus":0.021691376111769134,"score_gpt":0.1942023907461636,"score_spread":0.17251101463439447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211178994","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008285216,0.000016803417,0.16222768,0.00005727455,0.0006849261,0.00027304294,0.00004456032,0.0002663124,0.83642113],"genre_scores_gemma":[0.00034038702,0.00006303267,0.0057617147,0.000068800415,0.000049039492,3.4524865e-7,0.000025581325,0.000018162298,0.9936729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989417,0.000029520917,0.0001510764,0.0005008391,0.00019985033,0.0001770024],"domain_scores_gemma":[0.9987703,0.00004695172,0.00018815196,0.0007480169,0.0001325911,0.0001139678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005318078,0.00023795631,0.0002549254,0.00021503074,0.00015022645,0.0001031668,0.00059115636,0.00024458623,0.000014632116],"category_scores_gemma":[0.000006096847,0.00029716737,0.00017981988,0.000012744523,0.000115646006,0.00022000018,0.00032070998,0.0003065338,0.00008009394],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009298912,0.0000031552383,4.6216107e-7,0.000013375776,0.000052954812,0.000030302104,0.00001985298,0.000035102385,0.000036248464,0.98144424,0.012314671,0.006040321],"study_design_scores_gemma":[0.00040446044,0.000029091438,0.000015502428,0.00005223904,0.000056162884,0.00003747616,0.0000068150744,0.0026357179,0.00008722973,0.000023687295,0.9962872,0.00036439553],"about_ca_topic_score_codex":0.00002275324,"about_ca_topic_score_gemma":6.9477136e-7,"teacher_disagreement_score":0.98397255,"about_ca_system_score_codex":0.00014532548,"about_ca_system_score_gemma":0.0002043906,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W4221014517","doi":"10.1287/ijoc.2022.1170","title":"Decision Diagrams for Discrete Optimization: A Survey of Recent Advances","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Influence diagram; Integer programming; Discrete optimization; Constraint programming; Mathematical optimization; Key (lock); Point (geometry); Constraint (computer-aided design); Optimization problem; Theoretical computer science; Algorithm; Mathematics; Stochastic programming; Artificial intelligence; Decision tree","score_opus":0.03050931444026505,"score_gpt":0.3021435660097054,"score_spread":0.2716342515694403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221014517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032190192,0.000093400806,0.99443054,0.00025505302,0.0013982827,0.00016441812,0.000008243902,0.00003634026,0.0003947078],"genre_scores_gemma":[0.60442847,0.00032209934,0.3946271,0.0004796306,0.00008065006,0.00000648078,0.000024639623,0.000011490634,0.000019414372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986324,0.000070234884,0.0005438169,0.00014362611,0.00042941718,0.00018050813],"domain_scores_gemma":[0.9983364,0.00054836035,0.0005326038,0.00016598885,0.00033932665,0.000077363584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013255728,0.00009802973,0.00016191976,0.00018832335,0.0005859896,0.00015221156,0.0004322365,0.000020822179,0.000098573],"category_scores_gemma":[0.00035693287,0.00008275684,0.00007448408,0.0005719235,0.000019454392,0.00055113627,0.0001858329,0.00020774356,0.0000010200939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030613126,0.000011724184,0.0011239069,0.0000019853928,0.0000051238176,7.7074475e-7,0.00010466447,0.581261,5.5613555e-7,0.00072565913,0.000068543195,0.41666546],"study_design_scores_gemma":[0.0006929352,0.00034405894,0.0057526156,0.00002499208,0.0000023553255,0.00008705431,0.000056765442,0.98364645,0.00002611365,0.00049600995,0.008746431,0.0001241986],"about_ca_topic_score_codex":0.000002957999,"about_ca_topic_score_gemma":0.0000058961677,"teacher_disagreement_score":0.60120946,"about_ca_system_score_codex":0.000102201375,"about_ca_system_score_gemma":0.00012904414,"threshold_uncertainty_score":0.45070177},"labels":[],"label_agreement":null},{"id":"W4224237201","doi":"10.1117/12.2628084","title":"Complex number and point-set topology","year":2022,"lang":"en","type":"article","venue":"International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Topology (electrical circuits); Set (abstract data type); Point (geometry); Euler characteristic; Computer science; Euler's formula; Path (computing); Mathematics; Contradiction; Set theory; Theoretical computer science; Discrete mathematics; Pure mathematics; Combinatorics; Geometry","score_opus":0.04288556515571677,"score_gpt":0.3101034692571899,"score_spread":0.2672179041014731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224237201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006965246,0.0000041953176,0.9549625,0.0016212125,0.0007757289,0.00021316728,0.00010171515,0.00008697468,0.03526924],"genre_scores_gemma":[0.67553645,0.000022514023,0.32366747,0.0005443164,0.00004426962,0.000012188112,0.00002389176,0.000007771108,0.00014114287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791,0.000030905267,0.00039755876,0.00063100294,0.0007201779,0.0003103476],"domain_scores_gemma":[0.9987701,0.00029230406,0.0002545489,0.0002951408,0.0002450645,0.00014283595],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007470445,0.00019267059,0.00023154668,0.00022391626,0.00078240875,0.00052651635,0.0007990973,0.000030446698,0.001051803],"category_scores_gemma":[0.00012279673,0.00020545397,0.000021274702,0.0002605427,0.00063171954,0.00019547528,0.00089279684,0.00024939913,0.00004898534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054483307,0.000052216736,0.00020975294,0.000010856759,0.000013508187,0.0000055472783,0.0015081145,0.00028304005,0.00042900853,0.95549077,0.0005834662,0.041408245],"study_design_scores_gemma":[0.00045184695,0.00006965724,0.0013806769,0.000015896572,0.0000074185145,0.000121224766,0.0018611305,0.83340174,0.00006558786,0.16147912,0.0008544297,0.00029128368],"about_ca_topic_score_codex":0.000022508473,"about_ca_topic_score_gemma":0.000008850344,"teacher_disagreement_score":0.8331187,"about_ca_system_score_codex":0.000103984225,"about_ca_system_score_gemma":0.00018531353,"threshold_uncertainty_score":0.99986136},"labels":[],"label_agreement":null},{"id":"W4225962937","doi":"10.1007/s43069-021-00116-6","title":"Nature-Inspired Techniques for Dynamic Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Scheduling (production processes); Set (abstract data type); Constraint satisfaction; Context (archaeology); Optimization problem; Sequence (biology); Mathematics; Artificial intelligence","score_opus":0.02781063245877669,"score_gpt":0.34920630045351386,"score_spread":0.3213956679947372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225962937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024347382,0.00006916948,0.97505754,0.017565036,0.00036637863,0.0020202154,0.00008901687,0.00036382268,0.002034069],"genre_scores_gemma":[0.8986329,0.00003173847,0.097719744,0.00034863967,0.00002238907,0.0020894571,0.00009466734,0.0000150243195,0.0010454773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799514,0.00025735723,0.0002650039,0.00043224808,0.0006130506,0.00043717437],"domain_scores_gemma":[0.9988744,0.00012941385,0.000029854406,0.00043887476,0.00043512374,0.00009230787],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001200297,0.000110890825,0.000112356356,0.0004937067,0.0023595637,0.00040951377,0.00044841616,0.00008353856,0.00026978043],"category_scores_gemma":[0.0001743175,0.00011742131,0.00007036269,0.0008575426,0.0001141907,0.0006270933,0.0003265543,0.0006651841,0.000013197468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019842277,0.00013732925,0.00074521033,0.00002473304,0.000036512833,0.000004231737,0.00055541156,0.037155442,0.014486977,0.55239874,0.009093244,0.38534233],"study_design_scores_gemma":[0.00045583947,0.0004374018,0.0011662338,0.00001189341,0.0000030660128,0.000061695006,0.00071311416,0.9278449,0.0019239006,0.004891458,0.0622419,0.00024862023],"about_ca_topic_score_codex":0.00012431636,"about_ca_topic_score_gemma":0.0012390843,"teacher_disagreement_score":0.89619815,"about_ca_system_score_codex":0.00043264797,"about_ca_system_score_gemma":0.00045038637,"threshold_uncertainty_score":0.9989392},"labels":[],"label_agreement":null},{"id":"W4226079167","doi":"10.4230/lipics.cp.2022.35","title":"Decision Diagrams for Discrete Optimization: A Survey of Recent Advances","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo","keywords":"Computer science; Integer programming; Discrete optimization; Influence diagram; Key (lock); Point (geometry); Constraint programming; Constraint (computer-aided design); Mathematical optimization; Optimization problem; Diagram; Theoretical computer science; Management science; Operations research; Algorithm; Artificial intelligence; Stochastic programming; Mathematics; Decision tree; Engineering","score_opus":0.08826301017131544,"score_gpt":0.2326968505489794,"score_spread":0.14443384037766396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226079167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024721867,0.00013814539,0.9949155,0.0000697563,0.0010772817,0.0004880306,0.00012241495,0.000099559526,0.00061712204],"genre_scores_gemma":[0.884141,0.0061766976,0.108795516,0.000059259477,0.000027963908,0.000008195212,0.0004067432,0.000022307338,0.000362266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985151,0.00018248917,0.00026994356,0.0007337984,0.000119785946,0.00017887252],"domain_scores_gemma":[0.9980039,0.00041083514,0.00039874334,0.0007059636,0.00039302788,0.000087527354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004351539,0.00019059298,0.00027810058,0.00021541576,0.0001717688,0.00006274005,0.00090277276,0.0001167412,0.00036925345],"category_scores_gemma":[0.00020184286,0.00022192903,0.00013663938,0.0008041075,0.000066943765,0.00037906872,0.0009799871,0.0002046229,0.0000019908432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063856474,0.000034492416,0.005184053,0.000026814658,0.000024707555,0.000004434259,0.000051037332,0.9632728,3.7725258e-7,0.01188123,0.00007026356,0.019385913],"study_design_scores_gemma":[0.00048710406,0.000068115776,0.005215717,0.000027638085,0.000023763865,9.774922e-7,0.00003293855,0.9866688,0.00001105486,0.005161715,0.0020450675,0.00025709256],"about_ca_topic_score_codex":0.000065331245,"about_ca_topic_score_gemma":0.00024521237,"teacher_disagreement_score":0.88611996,"about_ca_system_score_codex":0.00015667305,"about_ca_system_score_gemma":0.00023028557,"threshold_uncertainty_score":0.9050003},"labels":[],"label_agreement":null},{"id":"W4229906137","doi":"10.1007/978-1-4939-7131-2_101285","title":"Subgraph Evolution","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.011934011710974496,"score_gpt":0.20465679253709704,"score_spread":0.19272278082612254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229906137","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3399551e-7,0.000020424854,0.49992788,0.00012600489,0.00031430222,0.00004911878,0.0000010073265,0.00016531715,0.4993957],"genre_scores_gemma":[0.000992948,0.00004071557,0.0475617,0.00024229921,0.0001470764,0.0000018539075,0.000010090118,0.000012441373,0.95099086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992657,0.0000052948076,0.0001544842,0.00029122113,0.00018327264,0.000100036035],"domain_scores_gemma":[0.9993344,0.000015218692,0.00008859295,0.00038434015,0.00012234975,0.00005513182],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000066976834,0.00013635648,0.00010554136,0.00018495496,0.00006645618,0.00007743657,0.00025768715,0.00016462106,0.0049870526],"category_scores_gemma":[0.000004874881,0.00013075651,0.000081375394,0.000037673686,0.000061278726,0.00020126445,0.00008086136,0.00009984467,0.0014914928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7749984e-7,0.0000013376343,0.0000073169867,0.0000020306866,0.000008322924,0.0000011944371,0.000017500663,0.0000056604667,0.0000017007682,0.9721685,0.012546271,0.015239674],"study_design_scores_gemma":[0.00021662768,0.00008207515,0.00042229742,0.000058219543,0.000017905904,0.000044362663,0.0000035585233,0.029672004,0.000022602158,0.42882153,0.5400388,0.00059999374],"about_ca_topic_score_codex":0.0000048438897,"about_ca_topic_score_gemma":0.000041427942,"teacher_disagreement_score":0.543347,"about_ca_system_score_codex":0.00006222146,"about_ca_system_score_gemma":0.00007425939,"threshold_uncertainty_score":0.99928594},"labels":[],"label_agreement":null},{"id":"W4231099561","doi":"10.1007/978-1-4939-7131-2_101325","title":"Temporal Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Geography","score_opus":0.017529086503776756,"score_gpt":0.22132254572382004,"score_spread":0.20379345922004327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231099561","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.097287e-7,0.000011887671,0.37150067,0.00019944218,0.0003495029,0.000055145603,0.0000013318463,0.0001863222,0.6276953],"genre_scores_gemma":[0.00051921204,0.000031215244,0.06249198,0.0005095001,0.000075079544,0.0000013280121,0.000012092951,0.000011693786,0.9363479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993007,0.000004156523,0.00015545882,0.00027893356,0.00016839047,0.000092333445],"domain_scores_gemma":[0.9993778,0.000013281692,0.00008545556,0.0003777773,0.00008489282,0.000060800863],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000057824,0.00013941742,0.000115511866,0.00014617162,0.000054208038,0.00009410527,0.00029033862,0.00014132677,0.0077732815],"category_scores_gemma":[0.0000030433753,0.00012707226,0.0000825684,0.000028105933,0.000062525454,0.00016420017,0.000095781106,0.00010006813,0.0012600988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.966298e-7,0.0000013181228,0.000012867128,0.000001961711,0.000009352888,0.0000031780132,0.000025646945,0.0000012203182,5.2497114e-7,0.94912714,0.023312705,0.027503707],"study_design_scores_gemma":[0.00012018322,0.000047233796,0.000055876848,0.000026806332,0.0000067739475,0.000025045025,0.0000017443407,0.003999213,0.000014165087,0.2464346,0.74893075,0.0003376173],"about_ca_topic_score_codex":0.000004683176,"about_ca_topic_score_gemma":0.000037901333,"teacher_disagreement_score":0.72561806,"about_ca_system_score_codex":0.000019096104,"about_ca_system_score_gemma":0.00006193339,"threshold_uncertainty_score":0.99951756},"labels":[],"label_agreement":null},{"id":"W4231853226","doi":"10.1007/978-3-0348-0018-1_4","title":"Lattice Constructions","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Geology; Materials science; Mathematics","score_opus":0.026875215496491446,"score_gpt":0.21309186417359538,"score_spread":0.18621664867710394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231853226","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.965274e-8,0.000015425734,0.43727052,0.00014095599,0.00038638132,0.000052044543,0.0000020716238,0.00019099063,0.56194156],"genre_scores_gemma":[0.0002543605,0.000092056755,0.1104612,0.0003337161,0.000053354608,0.000002216044,0.0000057310667,0.000012310155,0.88878506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993304,0.000005196415,0.00017619648,0.00026922382,0.00012279564,0.000096209806],"domain_scores_gemma":[0.9993109,0.000027618156,0.00009674197,0.00039914,0.00009448331,0.00007112615],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000041771178,0.00014385689,0.00012483788,0.00013595821,0.00007898055,0.00006543758,0.00025911437,0.00015606332,0.008969127],"category_scores_gemma":[0.0000052965815,0.00014171416,0.00007552096,0.000026165491,0.00007617454,0.00020881886,0.00009195072,0.00016578399,0.0009293816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.629529e-7,0.0000014800622,0.0000037270063,0.0000019495808,0.000013586855,0.0000026593232,0.00002465203,0.0000021224234,4.5946254e-7,0.9235558,0.0017053589,0.07468792],"study_design_scores_gemma":[0.00014302225,0.00002229188,0.00006739734,0.000029133038,0.00002502391,0.00016327004,0.000003205945,0.0014813448,0.00001906453,0.26714575,0.73050547,0.0003950172],"about_ca_topic_score_codex":0.000009062201,"about_ca_topic_score_gemma":0.000028322771,"teacher_disagreement_score":0.7288001,"about_ca_system_score_codex":0.000026056641,"about_ca_system_score_gemma":0.00008501657,"threshold_uncertainty_score":0.9998485},"labels":[],"label_agreement":null},{"id":"W4232237715","doi":"10.4018/9781605666181.ch004.ch000","title":"A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Computer science; Schedule; Interval (graph theory); Constraint satisfaction problem; Constraint (computer-aided design); Multi-agent system; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.02643260533925744,"score_gpt":0.22747487936153352,"score_spread":0.2010422740222761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232237715","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001897479,0.000055710847,0.36688966,0.00013004853,0.0011426148,0.0011145752,0.00013307651,0.00071811466,0.62962645],"genre_scores_gemma":[0.9564064,0.0000034661698,0.037492268,0.00039528243,0.00008097906,0.00005025668,0.000008537744,0.000036800287,0.0055259974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978239,0.00007374763,0.0005609086,0.0008258628,0.00041338135,0.00030222588],"domain_scores_gemma":[0.99857354,0.000050666415,0.00036684022,0.0006212543,0.00015944136,0.00022823294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020917074,0.0005277752,0.00047435716,0.00015969947,0.00015569261,0.00023880404,0.00029298867,0.00037386606,0.00006097323],"category_scores_gemma":[0.000017833228,0.0005149056,0.00019984465,0.000018260189,0.0002671853,0.00014174967,0.00016053775,0.00030757216,0.000071996896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031634445,0.0000130493745,0.00029139413,0.00012717131,0.000057062727,0.000040074912,0.00020269922,0.000057910816,0.0000024647281,0.9525457,0.00011611483,0.0465147],"study_design_scores_gemma":[0.017591057,0.00593077,0.023137037,0.013588545,0.00092454295,0.002871754,0.0013584541,0.5496806,0.00029875923,0.342082,0.02994541,0.012591092],"about_ca_topic_score_codex":0.0002227211,"about_ca_topic_score_gemma":0.00044990116,"teacher_disagreement_score":0.9562167,"about_ca_system_score_codex":0.0005514432,"about_ca_system_score_gemma":0.00032292807,"threshold_uncertainty_score":0.9997302},"labels":[],"label_agreement":null},{"id":"W4234230435","doi":"10.4018/978-1-5225-7659-4.ch021","title":"A Fast and Space-Economical Algorithm for the Tree Inclusion Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Advances in library and information science (ALIS) book series","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Set (abstract data type); Bounded function; Mathematics; Order (exchange); Combinatorics; Space (punctuation); Algorithm; Inclusion (mineral); Computer science; Discrete mathematics; Chemistry","score_opus":0.00541216385640624,"score_gpt":0.20993984082811806,"score_spread":0.2045276769717118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234230435","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014766331,0.0017930038,0.13683742,0.0045546833,0.0005420956,0.0009545317,0.000057943194,0.00019441752,0.85505116],"genre_scores_gemma":[0.0007381589,0.7250133,0.25734916,0.0038107752,0.00031089122,0.00015244797,0.000074340176,0.000043644028,0.012507262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885786,0.000009299628,0.00042054022,0.00029377124,0.00021859632,0.00019993252],"domain_scores_gemma":[0.9991712,0.00014666848,0.00029340253,0.00024525862,0.000057184814,0.00008627946],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027525108,0.00020365187,0.00018745766,0.00029862346,0.0007956183,0.0005026027,0.0004425603,0.00010093927,0.00007469939],"category_scores_gemma":[0.000018607077,0.00015424489,0.000033870492,0.00014191573,0.0011862745,0.46977457,0.0007746632,0.00013692494,0.0000050627896],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001011649,0.0000012443926,0.000012425175,0.000014724074,0.0000018227818,1.4417785e-7,0.0012898949,0.00007658027,7.003038e-7,0.7986881,0.000012499779,0.19989176],"study_design_scores_gemma":[0.00025128826,0.0001232539,0.00011618463,0.00008628515,0.0000038739518,0.000027973972,0.00015866829,0.03736068,0.00008242033,0.0072627473,0.95429903,0.00022759297],"about_ca_topic_score_codex":6.908114e-7,"about_ca_topic_score_gemma":0.0000063880043,"teacher_disagreement_score":0.9542865,"about_ca_system_score_codex":0.00002567593,"about_ca_system_score_gemma":0.00017157492,"threshold_uncertainty_score":0.62899244},"labels":[],"label_agreement":null},{"id":"W4234267841","doi":"10.1002/rsa.20225","title":"Sharp thresholds for constraint satisfaction problems and homomorphisms","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Homomorphism; Constraint satisfaction; Mathematics; Satisfiability; Random graph; Constraint (computer-aided design); Hypergraph; Complexity of constraint satisfaction; Backtracking; Constraint graph; Discrete mathematics; Graph; Binary number; Combinatorics; Local consistency; Mathematical optimization; Statistics; Arithmetic","score_opus":0.021293882123815177,"score_gpt":0.2314728767151354,"score_spread":0.21017899459132022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234267841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06678541,0.00048738104,0.93082494,0.0005497221,0.00036982715,0.000620906,0.000031622356,0.00012638824,0.00020380155],"genre_scores_gemma":[0.91230184,0.0005570567,0.08679266,0.00016056666,0.00008377222,0.00003588161,0.000010530549,0.000008795943,0.000048886606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906725,0.000026639227,0.00021371868,0.00035277076,0.00014475986,0.00019486865],"domain_scores_gemma":[0.9994723,0.00011060168,0.00008774404,0.0001504871,0.00006779077,0.00011106493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012865945,0.00015968518,0.00022010507,0.000083945924,0.0003965097,0.00013063147,0.00008597368,0.00008202828,0.000028292827],"category_scores_gemma":[0.000025904345,0.00013333677,0.00005029632,0.00009958062,0.00019003871,0.0003134794,0.00004708815,0.00009440674,6.1630607e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084925996,0.000016660992,0.008414672,0.00007350939,0.000080462596,0.000015688196,0.0015790308,0.0010294197,0.00089335913,0.08726814,0.00044925057,0.90009487],"study_design_scores_gemma":[0.027208174,0.0005248731,0.30478787,0.00007585963,0.000072094204,0.004914505,0.00019880779,0.5576561,0.001384266,0.09550214,0.0063554966,0.0013197701],"about_ca_topic_score_codex":0.000037675934,"about_ca_topic_score_gemma":0.00001587016,"teacher_disagreement_score":0.8987751,"about_ca_system_score_codex":0.000013848668,"about_ca_system_score_gemma":0.000033550805,"threshold_uncertainty_score":0.5437316},"labels":[],"label_agreement":null},{"id":"W4234417767","doi":"10.32920/ryerson.14653842","title":"Constraint Satisfaction Problems and Their Reduction to Directed Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Backtracking; Constraint satisfaction; Complexity of constraint satisfaction; Homomorphism; Constraint satisfaction dual problem; Constraint graph; Local consistency; Constraint programming; Digraph; Constraint logic programming; Theoretical computer science; Mathematics; Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.018694246288047056,"score_gpt":0.22954099764006597,"score_spread":0.2108467513520189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234417767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07714057,0.00010857882,0.91484886,0.002299871,0.0017381952,0.00073009945,0.000009122802,0.0009584284,0.0021662742],"genre_scores_gemma":[0.8837913,0.00023116273,0.11548397,0.00018174468,0.000042924323,0.00007884295,0.000038504353,0.000013686904,0.00013783919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824274,0.00012382501,0.00036093383,0.0008662029,0.00018877484,0.00021750086],"domain_scores_gemma":[0.9987973,0.000039380677,0.00015287069,0.00055766245,0.0002676949,0.00018506894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021266231,0.00029357287,0.00029034264,0.00032102168,0.00014313802,0.00067995716,0.00019380535,0.00023417702,0.00014054716],"category_scores_gemma":[0.000045302564,0.00027054106,0.000093448165,0.00043359757,0.00006864832,0.00032914573,0.00056593696,0.0003781114,0.0000070553256],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062234935,0.000049676208,0.0019100321,0.00012608533,0.00013447089,0.0000047401886,0.005576698,0.01278213,0.0077781887,0.018251326,0.0006505192,0.9527299],"study_design_scores_gemma":[0.001965038,0.00037274952,0.31700528,0.0015851576,0.00011741646,0.0016503823,0.0048207757,0.5962882,0.02076075,0.047675192,0.0030757023,0.0046833805],"about_ca_topic_score_codex":0.00038403753,"about_ca_topic_score_gemma":0.00041556393,"teacher_disagreement_score":0.9480465,"about_ca_system_score_codex":0.00009522016,"about_ca_system_score_gemma":0.00017348776,"threshold_uncertainty_score":0.99997467},"labels":[],"label_agreement":null},{"id":"W4237364350","doi":"10.1007/978-3-319-42849-9_2","title":"Historical Overview","year":2016,"lang":"en","type":"book-chapter","venue":"Artificial intelligence: foundations, theory, and algorithms/Artificial intelligence: Foundations, theory, and algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Influence diagram; Computer science; Bounding overwatch; Constraint (computer-aided design); Markov decision process; Constraint programming; Relation (database); Key (lock); Mathematical optimization; Operations research; Theoretical computer science; Decision tree; Artificial intelligence; Mathematics; Stochastic programming; Markov process; Data mining","score_opus":0.06708833421551957,"score_gpt":0.32119383096606013,"score_spread":0.25410549675054056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237364350","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004681491,0.005982028,0.9602116,0.003947516,0.0064582992,0.0017824229,0.00023024285,0.0007531494,0.02058793],"genre_scores_gemma":[0.0889802,0.14844176,0.18572277,0.0060613886,0.024235452,0.0021177668,0.0027978637,0.002137343,0.5395055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98863184,0.0013539627,0.0038622634,0.003112334,0.0015732851,0.0014663367],"domain_scores_gemma":[0.9893559,0.0046638255,0.0016873708,0.001935775,0.0014268515,0.0009302362],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0074361176,0.0018781436,0.0018420625,0.0016362726,0.003195483,0.0027568652,0.001805344,0.0012711905,0.004092547],"category_scores_gemma":[0.0017536905,0.0017783422,0.00076656824,0.00086567685,0.0024009044,0.0022598007,0.0007911441,0.0015123689,0.0014342995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008541886,0.00012353169,0.000005191679,0.00005247318,0.0001624425,0.000016089916,0.00070242805,0.00004240357,0.000024927956,0.5219471,0.00017982388,0.47665817],"study_design_scores_gemma":[0.00009623333,0.00037614183,0.000015713777,0.000444907,0.00032383934,0.00014684197,0.0009500975,0.012199745,0.00070215465,0.891265,0.09147208,0.0020072921],"about_ca_topic_score_codex":0.00013402576,"about_ca_topic_score_gemma":0.00022241185,"teacher_disagreement_score":0.7744888,"about_ca_system_score_codex":0.0010147439,"about_ca_system_score_gemma":0.0009192907,"threshold_uncertainty_score":0.99939626},"labels":[],"label_agreement":null},{"id":"W4240313103","doi":"10.1007/978-94-007-0753-5_102840","title":"Order-Preserving Mapping","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Northern British Columbia","funders":"","keywords":"Order (exchange); Computer science; Business","score_opus":0.021721776832981713,"score_gpt":0.2106347552183427,"score_spread":0.188912978385361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240313103","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.933374e-8,0.000013278057,0.50348747,0.0005151009,0.00020699605,0.000048816208,4.6326304e-7,0.00017219184,0.49555558],"genre_scores_gemma":[0.00024842756,0.000041374373,0.13826919,0.0007706569,0.000100049976,0.000001952602,0.000009557828,0.000015728305,0.8605431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912673,0.000008848817,0.00020467852,0.00032898126,0.00020238389,0.00012839204],"domain_scores_gemma":[0.9991226,0.000052900417,0.000111936715,0.0005276011,0.00012074194,0.000064202206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000113442824,0.00016394582,0.0001609427,0.00016700849,0.00008137871,0.00015458249,0.00048733014,0.00015488331,0.002950578],"category_scores_gemma":[0.000021610036,0.00016123,0.00006300766,0.000042578908,0.00002245566,0.00014336426,0.00027983086,0.00017063691,0.00077778555],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.602373e-7,6.2343713e-7,0.000006232989,0.000009692243,0.000010229476,0.0000020193638,0.000032323624,0.00013819698,0.0000038430876,0.8678829,0.005993341,0.12592041],"study_design_scores_gemma":[0.00011146434,0.000010526529,0.000052135016,0.00007724351,0.000004249402,0.000015393915,0.0000024867747,0.085199565,0.000006093119,0.02084458,0.89335245,0.00032379638],"about_ca_topic_score_codex":0.000008139683,"about_ca_topic_score_gemma":0.000027051186,"teacher_disagreement_score":0.88735914,"about_ca_system_score_codex":0.00003156985,"about_ca_system_score_gemma":0.000060001294,"threshold_uncertainty_score":0.9997119},"labels":[],"label_agreement":null},{"id":"W4248037716","doi":"10.4018/9781605666181.ch004","title":"A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Interval (graph theory); Constraint satisfaction problem; Constraint satisfaction; Algebra over a field; Constraint (computer-aided design); Mathematics; Computer science; Artificial intelligence; Pure mathematics; Combinatorics; Geometry","score_opus":0.02643260533925744,"score_gpt":0.22747487936153352,"score_spread":0.2010422740222761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248037716","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001897479,0.000055710847,0.36688966,0.00013004853,0.0011426148,0.0011145752,0.00013307651,0.00071811466,0.62962645],"genre_scores_gemma":[0.9564064,0.0000034661698,0.037492268,0.00039528243,0.00008097906,0.00005025668,0.000008537744,0.000036800287,0.0055259974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978239,0.00007374763,0.0005609086,0.0008258628,0.00041338135,0.00030222588],"domain_scores_gemma":[0.99857354,0.000050666415,0.00036684022,0.0006212543,0.00015944136,0.00022823294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020917074,0.0005277752,0.00047435716,0.00015969947,0.00015569261,0.00023880404,0.00029298867,0.00037386606,0.00006097323],"category_scores_gemma":[0.000017833228,0.0005149056,0.00019984465,0.000018260189,0.0002671853,0.00014174967,0.00016053775,0.00030757216,0.000071996896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031634445,0.0000130493745,0.00029139413,0.00012717131,0.000057062727,0.000040074912,0.00020269922,0.000057910816,0.0000024647281,0.9525457,0.00011611483,0.0465147],"study_design_scores_gemma":[0.017591057,0.00593077,0.023137037,0.013588545,0.00092454295,0.002871754,0.0013584541,0.5496806,0.00029875923,0.342082,0.02994541,0.012591092],"about_ca_topic_score_codex":0.0002227211,"about_ca_topic_score_gemma":0.00044990116,"teacher_disagreement_score":0.9562167,"about_ca_system_score_codex":0.0005514432,"about_ca_system_score_gemma":0.00032292807,"threshold_uncertainty_score":0.9997302},"labels":[],"label_agreement":null},{"id":"W4248372346","doi":"10.1007/978-3-030-68514-0_7","title":"Epilogue","year":2021,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; State (computer science); Position (finance); Mathematical economics; Algorithm; Mathematics; Economics","score_opus":0.014415038769228146,"score_gpt":0.21600351903874357,"score_spread":0.20158848026951542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248372346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6441095e-7,0.00023902635,0.6288466,0.00037017692,0.0005594356,0.00016131805,0.0000033377885,0.00015431122,0.36966512],"genre_scores_gemma":[0.0010860524,0.0026771256,0.60764986,0.00083808985,0.00026832585,0.000028734981,0.00028884385,0.000110773864,0.3870522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823695,0.000031100164,0.0005006175,0.0006718605,0.00032612082,0.00023337637],"domain_scores_gemma":[0.9987408,0.000060123075,0.00024866234,0.000685272,0.0001817933,0.00008337906],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019969733,0.00030439819,0.00033150992,0.00039925406,0.000076565884,0.00021078333,0.00041179438,0.00036856634,0.0011651474],"category_scores_gemma":[0.00006736823,0.00037617088,0.00011209744,0.00017749636,0.000053007985,0.00042358323,0.00024586834,0.0003842243,0.00006988826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020290552,0.000011834382,0.00004010783,0.000019987672,0.00001485644,0.000046395555,0.000064938395,0.4080342,0.0000024283777,0.5684419,0.00023111328,0.023090186],"study_design_scores_gemma":[0.0008579022,0.000052015672,0.0002554425,0.00063087884,0.00002915124,0.000070739,0.000008841115,0.8934624,0.00008800351,0.0102076335,0.09302308,0.0013138712],"about_ca_topic_score_codex":0.000009693054,"about_ca_topic_score_gemma":0.000052414,"teacher_disagreement_score":0.5582343,"about_ca_system_score_codex":0.00023044691,"about_ca_system_score_gemma":0.00022615239,"threshold_uncertainty_score":0.99986905},"labels":[],"label_agreement":null},{"id":"W4248849603","doi":"10.1023/a:1020137029547","title":"Balancing consensus and conflict with a GIS-based multi-participant, multi-criteria decision support tool","year":2001,"lang":"en","type":"article","venue":"GeoJournal","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"International Development Research Centre","keywords":"Human geography; Political science; Geography; Economic geography","score_opus":0.052080703040704945,"score_gpt":0.3067712578996395,"score_spread":0.25469055485893455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248849603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22329085,0.000031874508,0.775671,0.0005619011,0.00017427084,0.00011534187,0.000003143736,0.00007532637,0.00007628297],"genre_scores_gemma":[0.690938,0.000020083653,0.308423,0.00047131436,0.000027130878,0.000004073349,0.0000018975917,0.0000074038157,0.00010707357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878216,0.00006134673,0.00031639083,0.00028647043,0.00023520725,0.00031841025],"domain_scores_gemma":[0.99919,0.000117745556,0.00013647461,0.00022804015,0.00014109662,0.00018667318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038793124,0.00014856798,0.00017821889,0.00013829344,0.00022861082,0.00027997667,0.00015229023,0.00005323882,0.00024164682],"category_scores_gemma":[0.000085996886,0.0001223569,0.000037189588,0.00020447455,0.00007910103,0.00023470465,0.000047331345,0.0001650992,0.00002246018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007248221,0.0005362546,0.39744666,0.000042183103,0.0001532544,0.002180681,0.0037487203,0.03298231,0.009802803,0.0008353869,0.0019727878,0.54957414],"study_design_scores_gemma":[0.0035708097,0.00013580573,0.14904916,0.0000644645,0.000017623379,0.0015720944,0.0000663803,0.8422518,0.0002634068,0.000014562473,0.0027684667,0.00022543586],"about_ca_topic_score_codex":0.000026274509,"about_ca_topic_score_gemma":0.00011337706,"teacher_disagreement_score":0.8092695,"about_ca_system_score_codex":0.00003057597,"about_ca_system_score_gemma":0.00016215204,"threshold_uncertainty_score":0.49895695},"labels":[],"label_agreement":null},{"id":"W4249224228","doi":"10.32920/ryerson.14653140.v1","title":"Constraint satisfaction problems in the logic LFP +rank","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Homomorphism; Complexity of constraint satisfaction; Discrete mathematics; Constraint satisfaction; Mathematics; Conjecture; Generalization; Finite field; Algebra over a field; Computer science; Theoretical computer science; Local consistency; Pure mathematics; Artificial intelligence","score_opus":0.03150150169072341,"score_gpt":0.25906680708276103,"score_spread":0.22756530539203762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249224228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045654536,0.000111102025,0.972174,0.005949457,0.0009951751,0.00065609213,0.0000030913186,0.00020336763,0.015342254],"genre_scores_gemma":[0.9335302,0.000205615,0.06448502,0.0015134057,0.000048555296,0.00009576491,0.000031180985,0.000007477823,0.000082791485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801224,0.0003100303,0.00043371378,0.00062503817,0.00037924934,0.000239705],"domain_scores_gemma":[0.99872184,0.00014194369,0.00018052469,0.00078800356,0.00012022242,0.000047440142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061815075,0.00023628506,0.00023903801,0.00017720813,0.0001026421,0.0007706292,0.00062050496,0.00024698096,0.00043212457],"category_scores_gemma":[0.00006453151,0.00017634469,0.00012398299,0.0003897983,0.000087508306,0.00028884658,0.00043475276,0.00075066654,0.00002660782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003541293,0.00019392093,0.025044933,0.00024177722,0.00008376722,0.000083937346,0.008480405,0.18587942,0.00027950917,0.3038854,0.0010626251,0.47476077],"study_design_scores_gemma":[0.001489742,0.00011219715,0.46171507,0.00056536164,0.00005326569,0.00060131383,0.0037289064,0.46526164,0.00017475664,0.062451836,0.002041995,0.0018039126],"about_ca_topic_score_codex":0.00052185386,"about_ca_topic_score_gemma":0.0022503957,"teacher_disagreement_score":0.92896473,"about_ca_system_score_codex":0.00011224007,"about_ca_system_score_gemma":0.0003248125,"threshold_uncertainty_score":0.74311954},"labels":[],"label_agreement":null},{"id":"W4249623748","doi":"10.1007/978-3-319-08638-5_6","title":"Étalé Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Formalism (music); Trajectory; sort; Sheaf; Mathematics; Pure mathematics; Physics","score_opus":0.005193542043350769,"score_gpt":0.1680308470496346,"score_spread":0.16283730500628385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249623748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036002413,0.00073756423,0.9871445,0.00007613313,0.0007044785,0.0001578312,6.6590803e-7,0.00027314638,0.010869688],"genre_scores_gemma":[0.51716465,0.003399776,0.31796387,0.0022402476,0.0064815707,0.00015664549,0.000055250428,0.00061058876,0.1519274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863327,0.000010524664,0.00034513196,0.00050278933,0.00021283916,0.00029547262],"domain_scores_gemma":[0.99937695,0.00009058778,0.00007848389,0.00029541296,0.000037653197,0.0001209323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013331076,0.00029568718,0.0003627561,0.0003590402,0.000036881123,0.0002134654,0.000302275,0.00022101092,0.000007785321],"category_scores_gemma":[0.00000753838,0.00031625092,0.0000679094,0.00010904759,0.000018219358,0.00010803209,0.00019115611,0.00046473084,0.000020028465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013861782,0.0000050705676,0.000044537537,0.000053748463,0.000024532856,0.000028971623,0.000026330456,0.029321373,0.000007076009,0.8186527,0.00015630924,0.15167797],"study_design_scores_gemma":[0.00018346483,0.00004453553,0.0006230773,0.00014706247,0.0000055730316,0.00007248252,6.284686e-8,0.9334168,0.000005000842,0.0005208414,0.064603336,0.00037777217],"about_ca_topic_score_codex":0.0000094580155,"about_ca_topic_score_gemma":0.0000016265315,"teacher_disagreement_score":0.9040954,"about_ca_system_score_codex":0.00008888668,"about_ca_system_score_gemma":0.00002966336,"threshold_uncertainty_score":0.99992895},"labels":[],"label_agreement":null},{"id":"W4249638726","doi":"10.1007/978-3-030-68514-0_2","title":"Algorithm Portfolios","year":2021,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science","score_opus":0.010719138724090662,"score_gpt":0.21492336137617626,"score_spread":0.2042042226520856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249638726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7044972e-7,0.00034811886,0.7027534,0.00024700133,0.0006458255,0.00019332553,0.000005682543,0.00018040334,0.29562604],"genre_scores_gemma":[0.000044784167,0.0010544788,0.80965716,0.00034704502,0.00014384357,0.000014751095,0.00013780131,0.000056907822,0.18854323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802107,0.000024764806,0.00059350143,0.00074470026,0.00035602407,0.0002599136],"domain_scores_gemma":[0.9986424,0.000036447826,0.00031592092,0.00070636225,0.00019850447,0.00010037224],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020954435,0.00033489172,0.00037440174,0.00047574064,0.000079161124,0.0002311294,0.00041555063,0.00039512434,0.001323998],"category_scores_gemma":[0.00004273654,0.0004275061,0.00012993967,0.00021405573,0.000052056053,0.000471803,0.00025007385,0.00039847902,0.00006272937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016115015,0.000022192193,0.000032804848,0.000023610211,0.000030826108,0.0001345397,0.000096361524,0.325241,0.0000016432857,0.498526,0.00028336913,0.17560603],"study_design_scores_gemma":[0.00055895594,0.000030856667,0.00010081839,0.0003643018,0.000019063675,0.00007646617,0.000006532475,0.9350731,0.00004234789,0.009633298,0.05320709,0.00088716275],"about_ca_topic_score_codex":0.000011228963,"about_ca_topic_score_gemma":0.000017572267,"teacher_disagreement_score":0.6098321,"about_ca_system_score_codex":0.00023381774,"about_ca_system_score_gemma":0.00023471378,"threshold_uncertainty_score":0.99981767},"labels":[],"label_agreement":null},{"id":"W4250129294","doi":"10.1007/978-3-319-74451-3_2","title":"Prerequisites","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Mathematical proof; Encyclopedia; Mathematics education; Calculus (dental); Algebra over a field; Pure mathematics; Computer science; Library science; Geometry","score_opus":0.016933296315070005,"score_gpt":0.23986473308551512,"score_spread":0.2229314367704451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250129294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005586407,0.00010708449,0.80163723,0.0002415862,0.00022690799,0.00018173736,0.0000033495928,0.00012849738,0.19746804],"genre_scores_gemma":[0.003876987,0.00011675593,0.9511398,0.0006312096,0.00032434205,0.000010275966,0.000021061915,0.000070869835,0.04380866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989007,0.000009680815,0.00034079503,0.00032282216,0.000255789,0.0001701966],"domain_scores_gemma":[0.9987376,0.00030280222,0.00020718713,0.0006209481,0.00008679606,0.00004467746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001433321,0.00025639316,0.00028542482,0.00021170861,0.00004464963,0.00011909888,0.00045813347,0.00032767642,0.001503813],"category_scores_gemma":[0.00015486652,0.000233548,0.00008317922,0.00007177512,0.00007321247,0.00011296817,0.00014376243,0.00029591765,0.00036865246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027582678,0.000046011108,0.000040968414,0.0002965193,0.00006379579,0.000034708257,0.004319168,0.0015153767,0.000045068646,0.89819944,0.0009034834,0.09453268],"study_design_scores_gemma":[0.000117331794,0.00003561233,0.000007859943,0.00028884315,0.0000130469325,0.00003449351,0.0000011425038,0.04701922,0.00018250596,0.9455422,0.0064333715,0.00032433541],"about_ca_topic_score_codex":8.020864e-7,"about_ca_topic_score_gemma":0.000042265645,"teacher_disagreement_score":0.15365939,"about_ca_system_score_codex":0.00006882406,"about_ca_system_score_gemma":0.000063355394,"threshold_uncertainty_score":0.99940896},"labels":[],"label_agreement":null},{"id":"W4250207449","doi":"10.1007/978-3-319-09743-5_7","title":"Conclusions","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.012454380976567002,"score_gpt":0.21141442914261066,"score_spread":0.19896004816604365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250207449","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6479959e-8,0.000007581526,0.49312305,0.0005317079,0.00019916645,0.00003715483,6.8801813e-7,0.0001312949,0.50596935],"genre_scores_gemma":[0.00043223644,0.00003652425,0.034893546,0.0011419615,0.000062419786,0.0000011244657,0.0000074033983,0.0000088873685,0.9634159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994285,0.0000048685797,0.0001334085,0.00021854021,0.00014005021,0.00007460468],"domain_scores_gemma":[0.99941456,0.000040647337,0.000067952074,0.00035732257,0.000057743957,0.000061790546],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000053244887,0.000112875925,0.00012023169,0.000084721985,0.00007458782,0.00006130632,0.00026341982,0.00012434785,0.0031706325],"category_scores_gemma":[0.0000065961763,0.000102685015,0.000064150176,0.000013715383,0.000029304216,0.00005795375,0.00017294957,0.00011161409,0.0010222393],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.45618e-8,4.6437756e-7,8.269116e-7,0.0000011870244,0.0000041374215,0.0000011814905,0.000009211789,0.000017115377,0.0000010108917,0.89649767,0.0080862325,0.09538086],"study_design_scores_gemma":[0.00007088629,0.000014446332,0.0000101409705,0.00001670117,0.000004356436,0.0000133109725,4.3256188e-7,0.013040974,0.0000047694652,0.0313614,0.9552896,0.00017298489],"about_ca_topic_score_codex":0.000001916681,"about_ca_topic_score_gemma":0.00001111022,"teacher_disagreement_score":0.94720334,"about_ca_system_score_codex":0.000022537226,"about_ca_system_score_gemma":0.00005343591,"threshold_uncertainty_score":0.99975556},"labels":[],"label_agreement":null},{"id":"W4251679034","doi":"10.32920/ryerson.14653140","title":"Constraint satisfaction problems in the logic LFP +rank","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Homomorphism; Complexity of constraint satisfaction; Constraint satisfaction; Mathematics; Discrete mathematics; Generalization; Conjecture; Algebra over a field; Constraint logic programming; Computer science; Theoretical computer science; Local consistency; Pure mathematics; Artificial intelligence","score_opus":0.03150150169072341,"score_gpt":0.25906680708276103,"score_spread":0.22756530539203762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251679034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045654536,0.000111102025,0.972174,0.005949457,0.0009951751,0.00065609213,0.0000030913186,0.00020336763,0.015342254],"genre_scores_gemma":[0.9335302,0.000205615,0.06448502,0.0015134057,0.000048555296,0.00009576491,0.000031180985,0.000007477823,0.000082791485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801224,0.0003100303,0.00043371378,0.00062503817,0.00037924934,0.000239705],"domain_scores_gemma":[0.99872184,0.00014194369,0.00018052469,0.00078800356,0.00012022242,0.000047440142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061815075,0.00023628506,0.00023903801,0.00017720813,0.0001026421,0.0007706292,0.00062050496,0.00024698096,0.00043212457],"category_scores_gemma":[0.00006453151,0.00017634469,0.00012398299,0.0003897983,0.000087508306,0.00028884658,0.00043475276,0.00075066654,0.00002660782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003541293,0.00019392093,0.025044933,0.00024177722,0.00008376722,0.000083937346,0.008480405,0.18587942,0.00027950917,0.3038854,0.0010626251,0.47476077],"study_design_scores_gemma":[0.001489742,0.00011219715,0.46171507,0.00056536164,0.00005326569,0.00060131383,0.0037289064,0.46526164,0.00017475664,0.062451836,0.002041995,0.0018039126],"about_ca_topic_score_codex":0.00052185386,"about_ca_topic_score_gemma":0.0022503957,"teacher_disagreement_score":0.92896473,"about_ca_system_score_codex":0.00011224007,"about_ca_system_score_gemma":0.0003248125,"threshold_uncertainty_score":0.74311954},"labels":[],"label_agreement":null},{"id":"W4252714558","doi":"10.1007/978-1-4614-6170-8_100619","title":"Subgraph Evolution","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.008996404569286206,"score_gpt":0.19096098639984638,"score_spread":0.18196458183056016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252714558","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.714873e-8,0.000018425577,0.5126889,0.00019309254,0.00024155376,0.00004434071,5.369276e-7,0.00016215131,0.486651],"genre_scores_gemma":[0.003569569,0.000038505565,0.03733192,0.0003549848,0.0000956825,0.0000021502622,0.000011033169,0.000013252339,0.9585829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992767,0.000007314183,0.00016018664,0.00027728462,0.00018219043,0.00009633003],"domain_scores_gemma":[0.9993625,0.000024282725,0.000094239775,0.00038344538,0.00007839764,0.000057081725],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000080392914,0.00013827607,0.00012309384,0.0001809053,0.00005759721,0.000071979564,0.000247773,0.00016113147,0.000976621],"category_scores_gemma":[0.0000057135235,0.00013309738,0.00008952033,0.000029812249,0.000033019965,0.00010701566,0.00006548301,0.00012251979,0.0006698314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.885702e-7,7.237572e-7,0.000008522118,0.0000026385853,0.000005897593,6.807723e-7,0.0000051329557,0.00004455898,0.0000013153269,0.94406164,0.003719355,0.052149232],"study_design_scores_gemma":[0.00022724074,0.000050219864,0.0004860101,0.00005138571,0.000016656883,0.000035269422,0.0000011054689,0.07153403,0.000010049639,0.24173905,0.6852747,0.0005742893],"about_ca_topic_score_codex":0.0000059527406,"about_ca_topic_score_gemma":0.000030547013,"teacher_disagreement_score":0.7023226,"about_ca_system_score_codex":0.000052686737,"about_ca_system_score_gemma":0.000052076826,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W4252874416","doi":"10.22215/etd/2011-08613","title":"Learning by imitation using inductive logic programming","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Imitation; Computer science; Humanities; Psychology; Art","score_opus":0.0317101202690793,"score_gpt":0.27690469886896313,"score_spread":0.24519457859988383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252874416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008679676,0.000054679283,0.9683649,0.000023227409,0.0008005977,0.00031235514,6.3729203e-7,0.0003712676,0.021392636],"genre_scores_gemma":[0.22215626,0.00006825018,0.75487053,0.00012556743,0.000095201,0.000057845253,0.00081088656,0.00005698141,0.02175851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988257,0.00007613072,0.00025925564,0.00042332095,0.00021504684,0.00020053862],"domain_scores_gemma":[0.9992142,0.00003008773,0.00031455283,0.00016169714,0.00021980982,0.000059669284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001271723,0.00020214911,0.0001666976,0.0002058088,0.00020591533,0.00020174134,0.00023274317,0.00023553401,0.00010899879],"category_scores_gemma":[0.000057430545,0.00020396044,0.00006671397,0.00034029072,0.000017210816,0.00063463766,0.000026521215,0.00033938815,0.000032291067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112115695,0.00005135059,0.00031724325,0.000044594617,0.000050457864,0.0000033754939,0.005846222,0.00050831505,0.0012652839,0.02922002,0.00015973479,0.9625222],"study_design_scores_gemma":[0.003039921,0.0015143061,0.01377681,0.0009836367,0.0004734026,0.00012535714,0.036884584,0.8592998,0.024595452,0.029981287,0.021796111,0.0075293733],"about_ca_topic_score_codex":0.00017213152,"about_ca_topic_score_gemma":0.00009510448,"teacher_disagreement_score":0.95499283,"about_ca_system_score_codex":0.00008466469,"about_ca_system_score_gemma":0.00012063417,"threshold_uncertainty_score":0.83172655},"labels":[],"label_agreement":null},{"id":"W4253239026","doi":"10.1007/978-0-387-39940-9_3760","title":"Temporal Domain","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.01230186145791586,"score_gpt":0.22293361822071633,"score_spread":0.21063175676280046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253239026","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032450466,0.00065731234,0.22877416,0.00010620471,0.0013922368,0.00039937504,0.0002724673,0.00014943068,0.7682456],"genre_scores_gemma":[0.0014180936,0.002586091,0.09000916,0.00014741937,0.0010202766,0.000025173154,0.001390798,0.00007894187,0.90332407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979772,0.000046009343,0.0007054192,0.0005250709,0.00054104766,0.00020526018],"domain_scores_gemma":[0.9979602,0.00006876915,0.00057657214,0.0011222676,0.00013175399,0.00014040424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033194665,0.00032417485,0.0004829085,0.0002982079,0.00006371834,0.00006586085,0.00063234894,0.0002130878,0.00016758186],"category_scores_gemma":[0.000021809792,0.00032070873,0.00013215527,0.000079617224,0.00006269066,0.00045771647,0.00016246454,0.00026397157,0.00017232882],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060766233,0.000025468202,0.000071172835,0.00017091975,0.000054872653,0.000084045154,0.00016879669,0.000102687256,0.000013504132,0.91969675,0.029251566,0.050354138],"study_design_scores_gemma":[0.00028309488,0.000059681523,0.00004116392,0.0004223264,0.00001972536,0.000058537888,0.000013974346,0.0011655029,0.0000036571128,0.002173044,0.9953314,0.0004278956],"about_ca_topic_score_codex":0.00006114974,"about_ca_topic_score_gemma":0.000029333845,"teacher_disagreement_score":0.96607983,"about_ca_system_score_codex":0.00006276224,"about_ca_system_score_gemma":0.00024013907,"threshold_uncertainty_score":0.9999245},"labels":[],"label_agreement":null},{"id":"W4253947573","doi":"10.4018/978-1-60566-618-1.ch004","title":"A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Schedule; Computer science; Interval (graph theory); Constraint satisfaction problem; Constraint (computer-aided design); Multi-agent system; Mathematical optimization; Directed graph; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.019300501078401668,"score_gpt":0.23096917951786275,"score_spread":0.21166867843946108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253947573","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022841831,0.00008233993,0.31495455,0.00045027063,0.0010574642,0.0014713597,0.00014589535,0.000991912,0.6806178],"genre_scores_gemma":[0.93970025,0.000004007847,0.052179784,0.00082116027,0.000112779104,0.000035956597,0.000012202302,0.000033781933,0.007100097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977236,0.000073341165,0.0005735416,0.00083408493,0.000486063,0.00030938757],"domain_scores_gemma":[0.9986318,0.00005518046,0.0003481029,0.00058904476,0.000151125,0.00022475005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020749713,0.0005366339,0.0004929859,0.0001651336,0.00016523177,0.00032767977,0.00027452546,0.00037027948,0.000028128117],"category_scores_gemma":[0.000019134857,0.0005305576,0.00020515182,0.000021599562,0.00020572718,0.00013895106,0.00010647197,0.00032073347,0.000045581546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002800391,0.000013606862,0.00014065857,0.00009391349,0.000042280524,0.00004876433,0.00010971867,0.0002482387,0.0000032517717,0.86814433,0.00013997438,0.13098726],"study_design_scores_gemma":[0.011847645,0.00435119,0.015795019,0.008920104,0.0004965388,0.0019267556,0.00076186267,0.7653871,0.00012989671,0.15811804,0.024630781,0.0076350607],"about_ca_topic_score_codex":0.00009851,"about_ca_topic_score_gemma":0.0003233657,"teacher_disagreement_score":0.93947184,"about_ca_system_score_codex":0.0006966228,"about_ca_system_score_gemma":0.0003278771,"threshold_uncertainty_score":0.9997146},"labels":[],"label_agreement":null},{"id":"W4254176946","doi":"10.1007/978-1-4614-8265-9_5048","title":"Monotone Constraints","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Monotone polygon; Computer science; Mathematics; Geometry","score_opus":0.015481822394652255,"score_gpt":0.23148243672362864,"score_spread":0.21600061432897638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254176946","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007775107,0.00032731143,0.3013436,0.000034800654,0.0021988803,0.00043850817,0.0005460855,0.00013953976,0.6949635],"genre_scores_gemma":[0.0059177997,0.004202989,0.040033143,0.00013552098,0.0017694054,0.00006163237,0.0012682925,0.00014077402,0.94647044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785244,0.000042161613,0.0007514677,0.0006016768,0.0005228188,0.00022942259],"domain_scores_gemma":[0.99755394,0.00011317751,0.00063918135,0.0012584943,0.00027322417,0.00016200116],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033481032,0.0003462997,0.00050852145,0.0003001692,0.000071159615,0.00006107721,0.00068412157,0.00024304111,0.001437937],"category_scores_gemma":[0.000055292265,0.00035031955,0.00012389194,0.0000755886,0.00031636405,0.00044021383,0.00027835125,0.00023973826,0.0006600242],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009211961,0.00003493635,0.00007712728,0.00035676663,0.0001756014,0.00007389959,0.0004418499,0.000054454867,0.00005048687,0.9135848,0.05887981,0.02626102],"study_design_scores_gemma":[0.00054760213,0.000105488645,0.000041478568,0.0009637435,0.000063596395,0.00014020319,0.00004377254,0.004971063,0.00004840357,0.0013783731,0.99088615,0.00081013754],"about_ca_topic_score_codex":0.000034004108,"about_ca_topic_score_gemma":0.000015475092,"teacher_disagreement_score":0.9320063,"about_ca_system_score_codex":0.000058913916,"about_ca_system_score_gemma":0.00030303883,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W4255413586","doi":"10.1007/978-3-540-45193-8_41","title":"An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Kent","keywords":"Cardinality (data modeling); Consistency (knowledge bases); Local consistency; Constraint (computer-aided design); Algorithm; Computer science; Mathematics; Constraint satisfaction; Artificial intelligence; Data mining","score_opus":0.016376349289765564,"score_gpt":0.263311045854145,"score_spread":0.24693469656437944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255413586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007557873,0.00038999264,0.992097,0.0010825634,0.003062851,0.00082897267,0.00005498708,0.00014141838,0.0023346513],"genre_scores_gemma":[0.05350469,0.000030435725,0.9430206,0.0030151268,0.00028792743,0.000031378306,0.000011767875,0.000021495001,0.00007658751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668133,0.00006527706,0.00052977283,0.0013396877,0.0007986349,0.0005852846],"domain_scores_gemma":[0.9971407,0.000517986,0.00027796667,0.0013759654,0.00048111155,0.00020624514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012847217,0.0004575094,0.0004278838,0.00020841746,0.0007038479,0.0008932867,0.0018856905,0.0002593273,0.000027099679],"category_scores_gemma":[0.0000894082,0.0003595975,0.00021557623,0.0005065794,0.0016318299,0.00027676535,0.0002749666,0.00041782114,0.0000074942645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018498993,0.000021276712,0.000041689134,0.00000832307,0.000014813613,0.000009991379,0.00013960821,0.0938897,0.000002412974,0.06781745,0.00001568283,0.8380372],"study_design_scores_gemma":[0.00031503817,0.00012417621,0.00021499366,0.000056702516,0.000019969064,0.00017624114,9.598488e-7,0.95199186,0.000043143813,0.044068266,0.0025385597,0.0004500673],"about_ca_topic_score_codex":0.000028799126,"about_ca_topic_score_gemma":0.00008122605,"teacher_disagreement_score":0.8581022,"about_ca_system_score_codex":0.00057130004,"about_ca_system_score_gemma":0.0010092444,"threshold_uncertainty_score":0.9998856},"labels":[],"label_agreement":null},{"id":"W4280555761","doi":"10.1145/3486680","title":"Random \\( \\Theta (\\log n) \\) -CNFs are Hard for Cutting Planes","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University; McGill University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability; Combinatorics; Exponential function; Benchmark (surveying); Mathematics; Binary logarithm; Discrete mathematics; Mathematical analysis","score_opus":0.02479693373973376,"score_gpt":0.24360324796330304,"score_spread":0.21880631422356928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280555761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09541703,0.00039451892,0.7831964,0.11181299,0.0077648647,0.0005186841,0.000021870246,0.00007007436,0.00080355915],"genre_scores_gemma":[0.90893406,0.000020957594,0.08790362,0.0016721813,0.00031844043,0.000008977612,7.3693496e-7,0.000009539388,0.0011314743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993411,0.00008466149,0.00020594207,0.00006666432,0.00021589598,0.00008576347],"domain_scores_gemma":[0.9989153,0.00019665726,0.00041427647,0.00037461924,0.00007098698,0.000028124634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541955,0.000046393237,0.000104835075,0.0000567043,0.00030475104,0.000065904336,0.001344097,0.000011798094,0.000056675723],"category_scores_gemma":[0.0005446789,0.000031368465,0.00013118605,0.00012088811,0.000012106107,0.00017086946,0.00041487435,0.00014852005,0.0000013144866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009011222,0.0002889648,0.06762769,0.00007847887,0.0004538304,0.000077297314,0.0068107997,0.43714184,0.0046752836,0.011906198,0.23954473,0.23049377],"study_design_scores_gemma":[0.019902328,0.00081821857,0.10769353,0.00022505883,0.00022747811,0.006203121,0.0030325572,0.36744723,0.004345319,0.10131148,0.38788572,0.00090797053],"about_ca_topic_score_codex":0.0000013150736,"about_ca_topic_score_gemma":0.0000015879052,"teacher_disagreement_score":0.81351703,"about_ca_system_score_codex":0.000039166505,"about_ca_system_score_gemma":0.000056553174,"threshold_uncertainty_score":0.24976888},"labels":[],"label_agreement":null},{"id":"W4283791599","doi":"10.1609/aaai.v36i11.21655","title":"Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"Integer programming; Constraint (computer-aided design); Integer (computer science); Constraint programming; Computer science; Latin square; Constraint satisfaction problem; Order (exchange); Orthogonal array; Mathematics; Scheme (mathematics); Mathematical optimization; Programming language; Artificial intelligence","score_opus":0.058133838320357914,"score_gpt":0.3001416664436412,"score_spread":0.2420078281232833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283791599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54003984,0.000104785184,0.42480245,0.015172211,0.0013611229,0.0044938275,0.0000943839,0.00047645206,0.013454953],"genre_scores_gemma":[0.9889779,0.000012116851,0.010533575,0.00022862744,0.00002992254,0.00012229953,0.0000022635568,0.000009030386,0.000084248975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983301,0.0000170587,0.00051792234,0.00043655006,0.00044710204,0.00025127124],"domain_scores_gemma":[0.99881005,0.00014617004,0.00038661662,0.00015864796,0.0004235647,0.00007495911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064125215,0.00017383521,0.00020251138,0.00017166432,0.00044318373,0.0002951782,0.000784503,0.00004306588,0.00018651437],"category_scores_gemma":[0.00025344663,0.00014658534,0.00009758962,0.00049213145,0.00022924221,0.00021846379,0.00040886583,0.00028266638,0.0000040087507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040605242,0.00008398961,0.0007725815,0.000030399922,0.00001372551,3.364364e-7,0.0014842555,0.00019917675,0.0037434448,0.7656571,0.00005545868,0.22791892],"study_design_scores_gemma":[0.00064238,0.0026763037,0.016788365,0.0008305636,0.00012613263,0.00013179635,0.026998494,0.5252592,0.16515657,0.2517094,0.007571392,0.00210938],"about_ca_topic_score_codex":0.000009097832,"about_ca_topic_score_gemma":0.0000064218016,"teacher_disagreement_score":0.52506006,"about_ca_system_score_codex":0.000054607233,"about_ca_system_score_gemma":0.000116191564,"threshold_uncertainty_score":0.5977577},"labels":[],"label_agreement":null},{"id":"W4283813030","doi":"10.1609/aaai.v36i4.20296","title":"The SoftCumulative Constraint with Quadratic Penalty","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Penalty method; Mathematical optimization; Constraint (computer-aided design); Computer science; Quadratic equation; Quadratic growth; Scheduling (production processes); Decomposition; Function (biology); Algorithm; Mathematics","score_opus":0.05134186170215016,"score_gpt":0.2721420053701765,"score_spread":0.22080014366802636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283813030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16768686,0.00006329122,0.7018859,0.058058843,0.0019140946,0.0028593792,0.000031690895,0.00047685194,0.06702309],"genre_scores_gemma":[0.9967705,0.000010244545,0.002607877,0.00026192734,0.000017769738,0.00006261904,3.9718392e-7,0.0000072126422,0.00026145543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834853,0.000043203025,0.00038481093,0.00034203794,0.0006247143,0.00025668627],"domain_scores_gemma":[0.998619,0.00021113263,0.00039730946,0.00026003452,0.00045184343,0.00006063363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057509245,0.00016035097,0.0001517816,0.000071990886,0.0011169555,0.00029373163,0.0014170522,0.000025335246,0.00018953848],"category_scores_gemma":[0.00019226439,0.00009580156,0.000073255884,0.0006898405,0.00048434388,0.00026576055,0.00037517835,0.0003668867,0.000018501742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052974392,0.000048691603,0.00026706504,0.0000052966047,0.000014816453,4.238268e-7,0.0014345788,0.0018165617,0.0011935274,0.92993397,0.00007844297,0.06515363],"study_design_scores_gemma":[0.00012815357,0.0009373255,0.0012432024,0.00011583076,0.000030496973,0.00007857928,0.011101927,0.61343175,0.09384478,0.27753153,0.0009846126,0.00057178887],"about_ca_topic_score_codex":0.000022162287,"about_ca_topic_score_gemma":0.00002578782,"teacher_disagreement_score":0.8290836,"about_ca_system_score_codex":0.00007720812,"about_ca_system_score_gemma":0.00022767067,"threshold_uncertainty_score":0.8590832},"labels":[],"label_agreement":null},{"id":"W4285464797","doi":"10.32920/ryerson.14649945.v1","title":"Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint satisfaction dual problem; Local consistency; Constraint logic programming; Complexity of constraint satisfaction; Constraint graph; Constraint (computer-aided design); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Tree (set theory); Mathematical optimization; Combinatorics; Artificial intelligence","score_opus":0.049607082559805,"score_gpt":0.2449211411669999,"score_spread":0.1953140586071949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285464797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018693214,0.00004426604,0.96676594,0.00063327013,0.00056290673,0.00053786277,0.000015792453,0.00027372243,0.0124729965],"genre_scores_gemma":[0.88733286,0.000053923486,0.11232333,0.000105244624,0.000017504486,0.000023304034,0.00005260237,0.000012486336,0.000078721285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979617,0.000115482566,0.0004998018,0.00070680724,0.0004807614,0.00023541902],"domain_scores_gemma":[0.9980964,0.000055436678,0.00045216468,0.00082630944,0.00044892952,0.00012074775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023414745,0.000290695,0.00044869384,0.00019443083,0.000083241204,0.0002834698,0.00039031205,0.0002148134,0.0006626194],"category_scores_gemma":[0.000023885364,0.00026742954,0.00013597573,0.00034395908,0.00039807826,0.00031336886,0.0004109464,0.0004578466,0.0000062773065],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025790145,0.000304528,0.06876218,0.001343421,0.00070099055,0.00005795721,0.0047877315,0.09805588,0.0019475009,0.55711657,0.0003913932,0.26650605],"study_design_scores_gemma":[0.0036389234,0.0005473352,0.63502353,0.0023296499,0.00023747742,0.00074946485,0.0024632167,0.30846033,0.007874134,0.034691513,0.00045252062,0.0035319037],"about_ca_topic_score_codex":0.00084331987,"about_ca_topic_score_gemma":0.0018625684,"teacher_disagreement_score":0.86863965,"about_ca_system_score_codex":0.00013136274,"about_ca_system_score_gemma":0.00071798987,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W4285601267","doi":"10.24963/ijcai.2022/660","title":"Efficient Budgeted Graph Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative deepening depth-first search; Heuristics; Search tree; Mathematical optimization; Graph; Computer science; Search algorithm; Best-first search; Range (aeronautics); Beam search; Tree (set theory); Incremental heuristic search; Limit (mathematics); Local search (optimization); Search problem; Iterative method; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.05721922264094473,"score_gpt":0.27423593535655627,"score_spread":0.21701671271561154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36097944,0.000032631502,0.48582655,0.0744604,0.0076084533,0.0017409546,0.00009446442,0.00061441795,0.06864268],"genre_scores_gemma":[0.9958848,0.0000148057425,0.003324556,0.00040330287,0.00005382925,0.000054935586,0.0000024118979,0.000011463339,0.0002498987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972506,0.00003678702,0.00061330287,0.00051648123,0.0012959458,0.00028686883],"domain_scores_gemma":[0.9983719,0.000083094266,0.00036953474,0.00026442687,0.0008223559,0.00008870841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075213093,0.00020183089,0.00019434959,0.0003991464,0.00060756976,0.00025220175,0.0021299082,0.000047007696,0.0008192682],"category_scores_gemma":[0.00021422969,0.0001721311,0.00018613899,0.00090144906,0.00021348256,0.00018378023,0.0010381965,0.00050472806,0.000060824943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055041593,0.00021770032,0.00034030696,0.000010861048,0.000029244628,0.0000010968536,0.0013144468,0.049334265,0.005625276,0.92622703,0.00018393285,0.016660789],"study_design_scores_gemma":[0.00008433239,0.00019315496,0.0013949936,0.00008246358,0.000009289601,0.000037808368,0.0015835852,0.85377413,0.08577254,0.056286786,0.00046520407,0.00031574434],"about_ca_topic_score_codex":0.000054237895,"about_ca_topic_score_gemma":0.000009055361,"teacher_disagreement_score":0.8699403,"about_ca_system_score_codex":0.00020302803,"about_ca_system_score_gemma":0.00013194353,"threshold_uncertainty_score":0.89704126},"labels":[],"label_agreement":null},{"id":"W4286834951","doi":"","title":"A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Complexity of constraint satisfaction; Constraint satisfaction dual problem; Constraint satisfaction; Computer science; Psychology; Local consistency; Mathematics; Artificial intelligence","score_opus":0.04137035341322668,"score_gpt":0.24223625551004493,"score_spread":0.20086590209681826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286834951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02478961,0.000044017335,0.92791575,0.029843591,0.0006063958,0.0011910731,0.0004367423,0.00033235562,0.014840465],"genre_scores_gemma":[0.980376,0.000024431001,0.018007355,0.00033447635,0.0000118459975,0.00013067592,0.00057122344,0.000026710673,0.0005172655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9876252,0.009634158,0.00070795795,0.0008646558,0.0008510112,0.00031706283],"domain_scores_gemma":[0.9918767,0.0033966086,0.00092087965,0.0025794841,0.0010897296,0.00013655207],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0072925086,0.00036959868,0.00040397188,0.00029562123,0.00057258934,0.00034319237,0.0014688745,0.00018245692,0.0009581169],"category_scores_gemma":[0.0017397938,0.00033541763,0.00025279453,0.0006711073,0.0005644491,0.00010581639,0.00090768543,0.00089848664,0.000016324615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008020656,0.0011516354,0.019573836,0.000116954216,0.0001462423,0.00000543589,0.0053162854,0.051088393,0.0006655817,0.83426934,0.0028173833,0.08476868],"study_design_scores_gemma":[0.00086285674,0.0000057744987,0.18913986,0.00068974664,0.000024342105,0.0000040402683,0.000042057087,0.7963275,0.0061502983,0.005230735,0.0009640373,0.0005587993],"about_ca_topic_score_codex":0.0034206756,"about_ca_topic_score_gemma":0.0068875276,"teacher_disagreement_score":0.95558643,"about_ca_system_score_codex":0.00020473605,"about_ca_system_score_gemma":0.0006011076,"threshold_uncertainty_score":0.9999551},"labels":[],"label_agreement":null},{"id":"W4287326329","doi":"10.48550/arxiv.2102.09193","title":"SeaPearl: A Constraint Programming Solver guided by Reinforcement\\n Learning","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Solver; Heuristics; Computer science; Leverage (statistics); Constraint programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Programming language; Stochastic programming","score_opus":0.05221672463766503,"score_gpt":0.19461771072214112,"score_spread":0.1424009860844761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287326329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018207686,0.00003992737,0.9733552,0.00015423195,0.00042555333,0.00034018426,0.000002298655,0.0004789643,0.006995963],"genre_scores_gemma":[0.98453724,0.00015056398,0.010842213,0.00014854185,0.000030197565,0.0000020533153,0.00010449426,0.000017332053,0.004167369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979839,0.00016198757,0.00028861308,0.0010183041,0.00014866493,0.00039856465],"domain_scores_gemma":[0.9984661,0.000061680614,0.00031897903,0.00068502617,0.00026904338,0.00019916813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025899385,0.00031227194,0.0002969255,0.0001915944,0.000255743,0.00048884924,0.00074223825,0.00026987895,0.00029136517],"category_scores_gemma":[0.00006730981,0.0003996919,0.00022263528,0.00052926905,0.00013788733,0.0005242471,0.0012946456,0.0007423162,0.00003803349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005488915,0.000049776234,0.00281274,0.000068971975,0.00014928613,0.00020283888,0.00057242997,0.9509031,0.00009303042,0.031056635,0.00097524154,0.0131104635],"study_design_scores_gemma":[0.00062756334,0.000039438026,0.000192489,0.00012836122,0.00005428392,0.000020414383,0.0004992151,0.9911109,0.00013292761,0.0003838995,0.0062303087,0.0005801585],"about_ca_topic_score_codex":0.00013710343,"about_ca_topic_score_gemma":0.000026687527,"teacher_disagreement_score":0.9663296,"about_ca_system_score_codex":0.0002519655,"about_ca_system_score_gemma":0.00038385228,"threshold_uncertainty_score":0.9998455},"labels":[],"label_agreement":null},{"id":"W4293248785","doi":"10.1145/3559736.3559739","title":"Complexity column","year":2022,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Column (typography); Constraint satisfaction problem; Generalization; Constraint (computer-aided design); Computer science; Quarter (Canadian coin); Theoretical computer science; Mathematics; Artificial intelligence; Geography; Telecommunications","score_opus":0.04491169681758451,"score_gpt":0.260486389094718,"score_spread":0.2155746922771335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293248785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02052529,0.000057821904,0.9256755,0.020031128,0.001813411,0.00036897234,0.000017591277,0.00067065866,0.03083961],"genre_scores_gemma":[0.90733516,0.0000063666325,0.0876517,0.0038642667,0.000043363434,0.00003680197,0.0000144265,0.0000060195184,0.0010418933],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992663,0.00008512787,0.00011892833,0.00020685354,0.0001891912,0.00013358989],"domain_scores_gemma":[0.99926686,0.00006429245,0.00005227419,0.000543241,0.000022892364,0.000050454928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001165722,0.0000579371,0.00007356167,0.00005351978,0.00032519028,0.00006467655,0.0007205642,0.000014008324,0.0013749931],"category_scores_gemma":[0.000061765044,0.00006646523,0.000036552272,0.00031751188,0.000034162967,0.0001694545,0.00068758824,0.000115321636,0.00006978307],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014533993,0.00016676536,0.03367389,0.000007015933,0.000028392044,0.00004166594,0.0015089326,0.007336902,0.00084718404,0.37183297,0.13189295,0.45264882],"study_design_scores_gemma":[0.0014608507,0.00029668375,0.09496084,0.0000034896286,0.0000104815235,0.00020178322,0.0005047158,0.14407933,0.000270844,0.075097516,0.68244094,0.0006725103],"about_ca_topic_score_codex":0.00011951453,"about_ca_topic_score_gemma":0.00010874641,"teacher_disagreement_score":0.8868099,"about_ca_system_score_codex":0.000059646285,"about_ca_system_score_gemma":0.000057934496,"threshold_uncertainty_score":0.9995379},"labels":[],"label_agreement":null},{"id":"W4297336581","doi":"10.48550/arxiv.1803.06775","title":"Comparing and Integrating Constraint Programming and Temporal Planning\\n for Quantum Circuit Compilation","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Exploration Systems; National Aeronautics and Space Administration","keywords":"Computer science; Satisficing; Time horizon; Task (project management); Constraint (computer-aided design); Constraint programming; Class (philosophy); Quantum; Mathematical optimization; Baseline (sea); Job shop scheduling; Artificial intelligence; Mathematics; Routing (electronic design automation)","score_opus":0.14116714983807227,"score_gpt":0.2275043781560747,"score_spread":0.08633722831800242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297336581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28331262,0.00005561138,0.71442974,0.000061850384,0.0005226976,0.0009027125,0.00002049394,0.00015200675,0.0005422904],"genre_scores_gemma":[0.9791138,0.000058165882,0.020483425,0.000042872718,0.00011389188,0.0000038766493,0.00007589315,0.000025277537,0.000082802224],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699616,0.00018063097,0.00056404853,0.0016149879,0.00011792142,0.00052626175],"domain_scores_gemma":[0.9976269,0.00035001396,0.0007590835,0.00048211092,0.0004589842,0.00032288925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073880656,0.0005347111,0.00061783404,0.0004060795,0.0008887271,0.0007778805,0.00045439694,0.0003601575,0.000022905948],"category_scores_gemma":[0.000103721715,0.00066594774,0.00014664746,0.00043736206,0.00092418835,0.000802446,0.0008020316,0.0005609329,0.000004467865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014830993,0.0001084151,0.49786317,0.0005365661,0.00023795766,0.000054486947,0.0050589847,0.042270403,0.000060824186,0.41717345,0.00004450466,0.036442935],"study_design_scores_gemma":[0.0012731141,0.0002186264,0.01982038,0.0006272431,0.00012430605,0.000050152088,0.0017756491,0.963885,0.00001981201,0.011207967,0.0003270067,0.00067075575],"about_ca_topic_score_codex":0.0001148831,"about_ca_topic_score_gemma":0.00009133834,"teacher_disagreement_score":0.9216146,"about_ca_system_score_codex":0.0002008658,"about_ca_system_score_gemma":0.0002629416,"threshold_uncertainty_score":0.9995792},"labels":[],"label_agreement":null},{"id":"W4300205762","doi":"10.17615/7tn7-7q95","title":"ELEVEN MULTIPLANET SYSTEMS FROM K2 CAMPAIGNS 1 AND 2 AND THE MASSES OF TWO HOT SUPER-EARTHS","year":2020,"lang":"en","type":"article","venue":"UNC Libraries","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Astrophysics Division; Alfred P. Sloan Foundation; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy; California Institute of Technology; European Commission; Space Telescope Science Institute; Ames Research Center; Office of Science; National Aeronautics and Space Administration; Oak Ridge Associated Universities; National Science Foundation","keywords":"Environmental science; Computer science","score_opus":0.016568821209709043,"score_gpt":0.1928610955010911,"score_spread":0.17629227429138206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300205762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2514095,0.003053955,0.7318434,0.010104027,0.0005292874,0.00067543925,0.00015671304,0.00034176838,0.0018858939],"genre_scores_gemma":[0.96842134,0.00003093011,0.031052403,0.000389655,0.000049509516,0.0000035783119,0.000012017279,0.000003820123,0.000036742575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994582,0.00007929277,0.00013402577,0.000156085,0.00009940997,0.00007300546],"domain_scores_gemma":[0.99942404,0.00032779842,0.00005092258,0.0001258297,0.000016616692,0.000054786397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005568594,0.00007147302,0.00013503809,0.000020288027,0.00007254316,0.00028705416,0.00012803084,0.000025380314,0.0000267902],"category_scores_gemma":[0.000050665567,0.000048868736,0.000013810382,0.00009463543,0.00017602359,0.0005170869,0.00010550409,0.000054081826,0.0000025621935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007007953,0.000009405331,0.049814142,0.000039759012,0.000057107936,0.0000062022887,0.012886825,0.0009786909,0.00039242383,0.9283495,0.0010442216,0.00635166],"study_design_scores_gemma":[0.0052098795,0.00015356416,0.036762677,0.000075952215,0.000051150633,0.00003560665,0.0038802612,0.9133157,0.0024387748,0.025774973,0.011829867,0.00047159567],"about_ca_topic_score_codex":0.00020248703,"about_ca_topic_score_gemma":0.000021080301,"teacher_disagreement_score":0.912337,"about_ca_system_score_codex":0.0000014579514,"about_ca_system_score_gemma":0.000037336293,"threshold_uncertainty_score":0.27680698},"labels":[],"label_agreement":null},{"id":"W4300632646","doi":"10.1109/case.1995.465302","title":"Program understanding as constraint satisfaction","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constraint satisfaction; Heuristics; Constraint programming; Source code; Programming language; Constraint satisfaction problem; Code (set theory); Heuristic; Template; Constraint (computer-aided design); Theoretical computer science; Software engineering; Artificial intelligence; Mathematical optimization","score_opus":0.056210156874070875,"score_gpt":0.26476183145956994,"score_spread":0.20855167458549906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300632646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097078923,0.000009032389,0.8502918,0.0018539778,0.00025126454,0.00018419635,2.726136e-7,0.0007099323,0.14572874],"genre_scores_gemma":[0.923883,0.000023928598,0.07516255,0.0003245604,0.000017784423,0.000011039264,6.815113e-7,0.000003831742,0.0005725761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929506,0.000025183852,0.00013962969,0.00021124045,0.00016863884,0.00016026438],"domain_scores_gemma":[0.9996251,0.00003503357,0.000044081306,0.00018661517,0.000028467828,0.00008069226],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000712719,0.000081955266,0.000066984925,0.00009377829,0.0001355414,0.00021177849,0.00010718201,0.000044319557,0.002335391],"category_scores_gemma":[0.000020726755,0.000077771816,0.00003784001,0.00026349296,0.000052010724,0.00047472396,0.00003138933,0.00007656013,0.000339202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0567997e-7,0.000019209188,0.0013239995,0.000001767226,0.0000064324227,0.0000037156767,0.00015286313,0.000103108156,0.00004444192,0.5315173,0.0008955271,0.46593118],"study_design_scores_gemma":[0.000884801,0.00024840035,0.01002185,0.000021068165,0.000009194004,0.00032201255,0.0007053129,0.9559153,0.00042945793,0.023976441,0.0069637783,0.0005024032],"about_ca_topic_score_codex":0.000025810008,"about_ca_topic_score_gemma":0.00004204551,"teacher_disagreement_score":0.95581216,"about_ca_system_score_codex":0.00011584989,"about_ca_system_score_gemma":0.000015627134,"threshold_uncertainty_score":0.9985766},"labels":[],"label_agreement":null},{"id":"W4306681017","doi":"10.1609/aiide.v18i1.21950","title":"Tiered State Expansion in Optimization Crosswords","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Compute Canada","keywords":"Computer science; Constraint (computer-aided design); Set (abstract data type); State (computer science); Domain (mathematical analysis); Mathematical optimization; Algorithm; Mathematics","score_opus":0.027722020215602685,"score_gpt":0.26111488462899146,"score_spread":0.23339286441338877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306681017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6976756,0.00001880991,0.27661005,0.0047362344,0.0008890101,0.0011451367,0.0000465926,0.00009399315,0.01878457],"genre_scores_gemma":[0.9989159,0.000024883459,0.00052390655,0.00019566822,0.000006772622,0.000049678958,0.0000028346274,0.0000064512706,0.0002738894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987222,0.000018529316,0.00039123226,0.00034469075,0.00034215313,0.0001811946],"domain_scores_gemma":[0.9993805,0.000046421934,0.00024608345,0.00011711861,0.0001622934,0.000047544694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016865619,0.00014410238,0.00014734745,0.00016871873,0.00017440594,0.0003611434,0.0004615152,0.000020499361,0.00013191818],"category_scores_gemma":[0.00008287876,0.00012158629,0.00005786721,0.00033069254,0.000095589865,0.00082011474,0.00048024592,0.00021824244,0.000004441783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006725808,0.0010170292,0.004641719,0.000035502155,0.000045948924,0.0000031920786,0.013486578,0.08755522,0.0052798097,0.20045291,0.00013765594,0.68667185],"study_design_scores_gemma":[0.00016247328,0.000668351,0.001248066,0.00015673574,0.000005006021,0.000015209561,0.0063737887,0.92418355,0.043953158,0.022667611,0.00024030884,0.0003257565],"about_ca_topic_score_codex":0.00001957463,"about_ca_topic_score_gemma":0.000005027864,"teacher_disagreement_score":0.8366283,"about_ca_system_score_codex":0.00014383649,"about_ca_system_score_gemma":0.00004485431,"threshold_uncertainty_score":0.49581447},"labels":[],"label_agreement":null},{"id":"W4307227826","doi":"10.1017/s0140525x22001078","title":"Probably, approximately useful frames of mind: A quasi-algorithmic approach","year":2022,"lang":"en","type":"letter","venue":"Behavioral and Brain Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Indeterminacy (philosophy); Action (physics); Computer science; Face (sociological concept); Frame (networking); Artificial intelligence; Mathematical economics; Cognitive science; Epistemology; Psychology; Mathematics; Philosophy; Linguistics","score_opus":0.055211576640119435,"score_gpt":0.28786422050927435,"score_spread":0.2326526438691549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307227826","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039446622,0.0009047755,0.33331126,0.614937,0.0025406783,0.0030329372,0.00032422107,0.0005443214,0.004958134],"genre_scores_gemma":[0.03780607,0.00013219287,0.76695067,0.18791431,0.0011066758,0.0006004429,0.00037713538,0.000080376034,0.0050321133],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726206,0.0001743511,0.00040833832,0.0008849917,0.0008822274,0.00038802737],"domain_scores_gemma":[0.9990569,0.00011132465,0.00034401202,0.00035466457,0.0000679599,0.00006517556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006242635,0.0002812176,0.00037990185,0.00038213236,0.00040025535,0.00036924056,0.001096674,0.00025936015,0.00018541169],"category_scores_gemma":[0.000022267126,0.00023524325,0.000113547125,0.00084720337,0.00070525636,0.00055460207,0.00042807884,0.00065183244,0.0000032700414],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000162898,0.00089780963,0.008565282,0.0004598384,0.000047312948,0.000194048,0.0063133645,0.0003263619,0.00025066925,0.00557252,0.4200063,0.5573502],"study_design_scores_gemma":[0.0017400782,0.0042033833,0.006330785,0.00024789266,0.00018609552,0.0013121197,0.0024701194,0.13412486,0.0004274187,0.005899719,0.83929056,0.0037669917],"about_ca_topic_score_codex":0.00013332421,"about_ca_topic_score_gemma":0.0000067434244,"teacher_disagreement_score":0.5535832,"about_ca_system_score_codex":0.000037221547,"about_ca_system_score_gemma":0.00026634583,"threshold_uncertainty_score":0.95929414},"labels":[],"label_agreement":null},{"id":"W4309374308","doi":"10.1109/smc53654.2022.9945151","title":"Portfolio Selection for SAT Instances","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Portfolio; Solver; Context (archaeology); Cluster analysis; Complement (music); Mathematical optimization; Greedy algorithm; Set (abstract data type); Boolean satisfiability problem; Limit (mathematics); Selection (genetic algorithm); Theoretical computer science; Artificial intelligence; Mathematics; Algorithm","score_opus":0.04584683663469806,"score_gpt":0.2846385741773983,"score_spread":0.23879173754270022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309374308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081013344,0.00037548566,0.7962163,0.0041638482,0.015055543,0.0017862202,0.0003373073,0.0005065603,0.10054541],"genre_scores_gemma":[0.9900216,0.0001516193,0.0011873364,0.00039079448,0.0001635496,0.00021829773,0.00005802058,0.000012371602,0.0077964095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983641,0.00009078875,0.000350408,0.00044413854,0.0005614319,0.00018914643],"domain_scores_gemma":[0.9991964,0.00007496671,0.00023202175,0.00017697761,0.00024525018,0.000074355296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032623007,0.00016114688,0.00017003022,0.00024313919,0.00032527017,0.00035860165,0.00044659054,0.000047868925,0.0003630203],"category_scores_gemma":[0.00002068201,0.00017416372,0.00005584055,0.00020305524,0.000039756782,0.00024718881,0.000101576625,0.00018199421,0.000015084285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060373775,0.000082165934,0.002917061,0.00002618436,0.00007450455,0.000005229895,0.00043223344,0.0070098257,0.00068110024,0.9653485,0.007774495,0.01558832],"study_design_scores_gemma":[0.00108845,0.00043543882,0.002380215,0.000045490757,0.000018469613,0.00015008634,0.0010381715,0.84327644,0.00025059166,0.0049230163,0.14592588,0.0004677265],"about_ca_topic_score_codex":0.00009227714,"about_ca_topic_score_gemma":0.00009398078,"teacher_disagreement_score":0.9604255,"about_ca_system_score_codex":0.00015998342,"about_ca_system_score_gemma":0.00011979597,"threshold_uncertainty_score":0.7102191},"labels":[],"label_agreement":null},{"id":"W4312577582","doi":"10.1609/icaps.v32i1.19826","title":"Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Fujitsu","keywords":"Computer science; Quadratic unconstrained binary optimization; Scheduling (production processes); Constraint programming; Integer programming; Job shop scheduling; Mathematical optimization; Theoretical computer science; Algorithm; Quantum; Quantum computer; Mathematics; Operating system; Schedule","score_opus":0.033205397598888214,"score_gpt":0.2629384316561554,"score_spread":0.22973303405726717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312577582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92109925,0.000083804196,0.05200675,0.009292482,0.000906473,0.0005027723,0.000020987336,0.0011349021,0.014952558],"genre_scores_gemma":[0.9623804,0.0000045266443,0.03717582,0.0002453243,0.000031590815,0.000031065196,0.000005518325,0.000011912522,0.00011382886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984658,0.00001907037,0.000297406,0.0003656221,0.00065939775,0.00019272085],"domain_scores_gemma":[0.99904007,0.00006403613,0.00036601146,0.000099842124,0.0003715072,0.000058542388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042134497,0.00016928527,0.00017476518,0.0001931231,0.00050556945,0.00039615895,0.00079296925,0.000041728337,0.00007526744],"category_scores_gemma":[0.000115538765,0.0001366209,0.000050850562,0.00034692776,0.0000633426,0.00033734457,0.00027656156,0.00035393727,0.000001340097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002595041,0.00012644207,0.059873544,0.00012399914,0.00017557804,0.000008493125,0.003237605,0.71258897,0.029230824,0.19037108,0.0002619213,0.003742016],"study_design_scores_gemma":[0.0006476158,0.000084208004,0.0020391552,0.00039612153,0.000010240008,0.00003674341,0.0007742454,0.9927581,0.0025040559,0.00043946644,0.00013001003,0.00018002829],"about_ca_topic_score_codex":0.000014182647,"about_ca_topic_score_gemma":0.0000015946998,"teacher_disagreement_score":0.28016913,"about_ca_system_score_codex":0.00008473775,"about_ca_system_score_gemma":0.00016514868,"threshold_uncertainty_score":0.55712384},"labels":[],"label_agreement":null},{"id":"W4312771625","doi":"10.23952/jnva.6.2022.2.06","title":"Constraint qualifications in nonsmooth optimization: Classification and inter-relations","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Delhi; Council of Scientific and Industrial Research, India","keywords":"Constraint (computer-aided design); Computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.018450729628764068,"score_gpt":0.2631960865731967,"score_spread":0.24474535694443264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312771625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035324122,0.00006700675,0.9887482,0.00706476,0.000081840495,0.000061961655,0.000024279067,0.0000103303755,0.00040923915],"genre_scores_gemma":[0.8053048,0.000059059512,0.1943342,0.00015862973,0.00003365222,0.0000040977548,0.000041338088,0.0000030486265,0.000061155835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998793,0.00016613347,0.00053806754,0.00016205493,0.00026548043,0.000075269025],"domain_scores_gemma":[0.9990085,0.00020286709,0.00039909847,0.00011448245,0.00020723106,0.00006783689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067190785,0.00007406893,0.00017679941,0.00087376527,0.00022814909,0.00009500034,0.00014400724,0.000029134695,0.00033352323],"category_scores_gemma":[0.000076733806,0.000074111624,0.000079897545,0.0013710583,0.000041434632,0.0004005637,0.00006775763,0.00018781642,6.936554e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012541394,0.00015379902,0.04691128,0.0000027567366,0.00025136626,0.0000033733813,0.0008290176,0.88019824,0.000038282637,0.06420803,0.00006876294,0.0073225508],"study_design_scores_gemma":[0.00033818293,0.000034388013,0.09120731,0.0000026724065,0.000108257205,0.000051783114,0.00038549805,0.90665084,7.972785e-7,0.0005507061,0.00059694354,0.00007264504],"about_ca_topic_score_codex":0.000013794299,"about_ca_topic_score_gemma":0.000021740047,"teacher_disagreement_score":0.8017724,"about_ca_system_score_codex":0.00008073621,"about_ca_system_score_gemma":0.00016353052,"threshold_uncertainty_score":0.36518455},"labels":[],"label_agreement":null},{"id":"W4312950274","doi":"10.1609/icaps.v21i1.13439","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Library science; Computer science; Operations research; Presentation (obstetrics); Engineering; Medicine","score_opus":0.061109028357754336,"score_gpt":0.2727059875151443,"score_spread":0.21159695915738996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312950274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8667898,0.000025285051,0.015931325,0.002200627,0.0006412949,0.00014638854,0.0000032165797,0.00068584166,0.113576226],"genre_scores_gemma":[0.9733481,0.0000069534776,0.0263892,0.000110827,0.000010371238,0.0000031375234,4.3092868e-7,0.000003239441,0.00012777539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.0000038415587,0.00015422053,0.00016933923,0.0002000392,0.00008658625],"domain_scores_gemma":[0.9995301,0.00001722687,0.0001533209,0.000057803805,0.0002086524,0.00003291605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015028157,0.000078194185,0.00007324387,0.00008484145,0.00008191103,0.000108232205,0.0004972718,0.0000396823,0.000028714887],"category_scores_gemma":[0.00007900767,0.000059164846,0.000025143438,0.000109214474,0.00004008963,0.0002833393,0.00012521884,0.000112184425,0.0000033506176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004341528,0.000055742697,0.05816582,0.000027319931,0.00006932646,0.0000013150009,0.0048231273,0.00085365283,0.018484827,0.91175354,0.0003070699,0.005414821],"study_design_scores_gemma":[0.00018683811,0.000033960554,0.033651687,0.00023159005,0.0000046233063,0.000021618536,0.00032848094,0.94288635,0.018892722,0.0036168823,0.000040501407,0.00010474597],"about_ca_topic_score_codex":0.0000088601555,"about_ca_topic_score_gemma":2.781783e-7,"teacher_disagreement_score":0.9420327,"about_ca_system_score_codex":0.000013143572,"about_ca_system_score_gemma":0.000027336277,"threshold_uncertainty_score":0.24126723},"labels":[],"label_agreement":null},{"id":"W4313193649","doi":"10.1609/icaps.v20i1.13398","title":"Preface","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Operations research; Computer science; Scheduling (production processes); Automated planning and scheduling; Engineering; Artificial intelligence; Operations management","score_opus":0.033752758441679936,"score_gpt":0.28103862567382976,"score_spread":0.24728586723214982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313193649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91175073,0.000078654244,0.01745245,0.013786043,0.0008330183,0.00010612111,0.000005253253,0.0006114197,0.05537628],"genre_scores_gemma":[0.9795981,0.000014435651,0.019861104,0.00020638212,0.000015405567,0.000002301381,0.0000012843542,0.0000030762885,0.00029792966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933565,0.000005240864,0.00015089012,0.00019017636,0.00023496215,0.000083067505],"domain_scores_gemma":[0.999381,0.000030831732,0.00012584124,0.00006195056,0.00036897796,0.00003136332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012686485,0.00007295616,0.00007835607,0.000057151567,0.00009060617,0.00022961614,0.00034780038,0.00003920422,0.000023286324],"category_scores_gemma":[0.00016249054,0.000058598824,0.00002816632,0.00014807908,0.000028964396,0.00023651424,0.00015333481,0.00012009106,0.0000025207019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021259995,0.000056119436,0.03491781,0.000042353407,0.00008670832,0.000004541094,0.0015734297,0.007199224,0.09311926,0.85544056,0.00064725237,0.0068915095],"study_design_scores_gemma":[0.00017982296,0.000012675285,0.011334352,0.00025966758,0.0000039351644,0.000044795714,0.00029674612,0.95006716,0.03558847,0.0019949162,0.00013209588,0.000085333966],"about_ca_topic_score_codex":0.0000024182505,"about_ca_topic_score_gemma":3.3916155e-7,"teacher_disagreement_score":0.942868,"about_ca_system_score_codex":0.000016389127,"about_ca_system_score_gemma":0.00006213276,"threshold_uncertainty_score":0.23895907},"labels":[],"label_agreement":null},{"id":"W4313680212","doi":"10.48550/arxiv.2301.01913","title":"Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver","year":2023,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Heuristics; Solver; Computer science; Heuristic; Mathematical optimization; Artificial intelligence; Graph; Constraint satisfaction problem; Machine learning; Theoretical computer science; Mathematics; Programming language","score_opus":0.019760417735863886,"score_gpt":0.24452852281911164,"score_spread":0.22476810508324774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313680212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007299562,0.00025168786,0.9820794,0.0025766157,0.00080382003,0.0013411887,0.0000138857395,0.0053561246,0.00027771265],"genre_scores_gemma":[0.4717972,0.0003113997,0.525042,0.0006574097,0.00022085568,0.00097650767,0.00008808013,0.000111923066,0.0007946407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957303,0.00040370284,0.0008780797,0.001311933,0.0006802442,0.0009957623],"domain_scores_gemma":[0.9974036,0.00021387165,0.0006929635,0.0009985642,0.00030242838,0.00038852176],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010748678,0.0006619364,0.0006158644,0.001127827,0.0005384161,0.0011837239,0.0010087698,0.00073760544,0.000031571515],"category_scores_gemma":[0.00060164835,0.00075886096,0.00037231995,0.0012411876,0.00015063383,0.00042608008,0.0014376448,0.0019862845,0.00006170627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002614946,0.00016185618,0.013843332,0.00019907123,0.00018616296,0.00016891095,0.0009809269,0.5926001,0.0017877407,0.03603126,0.000916661,0.3530978],"study_design_scores_gemma":[0.0003170843,0.00013135126,0.014490085,0.00019800439,0.00005530569,0.00022887212,0.0000881045,0.97643423,0.0006512827,0.004824984,0.0017813684,0.00079934543],"about_ca_topic_score_codex":0.0053799557,"about_ca_topic_score_gemma":0.002167098,"teacher_disagreement_score":0.46449763,"about_ca_system_score_codex":0.0010352838,"about_ca_system_score_gemma":0.0011405521,"threshold_uncertainty_score":0.99985313},"labels":[],"label_agreement":null},{"id":"W4318603555","doi":"10.1109/ssci51031.2022.10022070","title":"Mother Tree Optimization for Conditional Constraints and Qualitative Preferences","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"A priori and a posteriori; Set (abstract data type); Mathematical optimization; Constraint satisfaction problem; Constraint (computer-aided design); Tree (set theory); Computer science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.03213036417730307,"score_gpt":0.3027704748620733,"score_spread":0.27064011068477023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318603555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017325705,0.000026330119,0.9912733,0.0037191056,0.000682428,0.00059272064,0.00033769268,0.00014847639,0.0014873992],"genre_scores_gemma":[0.83558136,0.000044149383,0.1613937,0.001270777,0.000080834056,0.00045769036,0.0005210279,0.000024901645,0.00062554074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997752,0.00029203418,0.00045348826,0.0006291425,0.0006177477,0.00025557037],"domain_scores_gemma":[0.9984131,0.0007520457,0.00025246656,0.00018935755,0.00028290137,0.00011011558],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051532296,0.00023510672,0.0002160194,0.0002778568,0.0008331166,0.00022159246,0.0004113706,0.000053100557,0.00092364],"category_scores_gemma":[0.000057766105,0.00025950544,0.000084604784,0.00045759662,0.0003552732,0.00069816277,0.00012070418,0.00019796149,0.000012689503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059383103,0.00007001286,0.000031494492,0.00001199867,0.00003511968,0.0000016602206,0.0030607774,0.7595401,0.00005379041,0.22835886,0.000618437,0.008158372],"study_design_scores_gemma":[0.0003049773,0.0006811879,0.00016532557,0.0000107587975,0.000011270097,0.00006472375,0.003523668,0.91912436,0.00039768365,0.07456675,0.0007937223,0.00035558804],"about_ca_topic_score_codex":0.000008734711,"about_ca_topic_score_gemma":0.000013304483,"teacher_disagreement_score":0.83384883,"about_ca_system_score_codex":0.00013727508,"about_ca_system_score_gemma":0.00021941763,"threshold_uncertainty_score":0.9999896},"labels":[],"label_agreement":null},{"id":"W4323244350","doi":"10.5220/0011614900003393","title":"Nature-Inspired Algorithms for Solving Weighted Constraint Satisfaction Problems","year":2023,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Computer science; Constraint satisfaction; Constraint (computer-aided design); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.022315855349479996,"score_gpt":0.2711860027569267,"score_spread":0.24887014740744673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323244350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003259536,0.00001461605,0.98849463,0.0025743563,0.0011033666,0.0005713733,0.000008727062,0.00151325,0.0024601514],"genre_scores_gemma":[0.75326943,0.000040658582,0.24496797,0.00054616085,0.00009988979,0.000121645266,0.000044658707,0.000017481136,0.0008921105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988062,0.000020749041,0.0002614628,0.00039292383,0.00021881619,0.00029986384],"domain_scores_gemma":[0.9992574,0.00014866609,0.00008942859,0.0002608546,0.00015394884,0.00008970892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029491424,0.00013782192,0.00013408749,0.0002442966,0.00024039154,0.00020074633,0.00019683174,0.00015304673,0.00009905074],"category_scores_gemma":[0.00005960028,0.00012905197,0.00008322409,0.00069869665,0.00004211146,0.00050695945,0.00006654645,0.0001554974,0.000086602755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054546886,0.000021711097,0.0027954741,0.000043482352,0.000049846814,0.0000052358546,0.000451613,0.00181144,0.00444595,0.21979912,0.0071385503,0.76343215],"study_design_scores_gemma":[0.0006549335,0.0000532242,0.017609881,0.000021037322,0.000006144423,0.000019917521,0.000076359895,0.9679585,0.002298762,0.0066622673,0.0043895775,0.00024938284],"about_ca_topic_score_codex":0.00003092142,"about_ca_topic_score_gemma":0.000090701855,"teacher_disagreement_score":0.96614707,"about_ca_system_score_codex":0.000062447034,"about_ca_system_score_gemma":0.00009245467,"threshold_uncertainty_score":0.5262587},"labels":[],"label_agreement":null},{"id":"W4353003139","doi":"10.1007/978-3-030-54621-2_752-1","title":"Machine Learning for Combinatorial Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Minnow Environmental (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Combinatorial optimization; Machine learning; Algorithm","score_opus":0.010400940734408988,"score_gpt":0.21953465195359811,"score_spread":0.20913371121918914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353003139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.332627e-8,0.00018920742,0.67506504,0.0001537289,0.0015939397,0.0005967493,0.000029611678,0.00018106212,0.32219058],"genre_scores_gemma":[0.00019336231,0.010203148,0.82396823,0.000099927835,0.00041614758,0.00015014892,0.0031993655,0.00017010678,0.16159953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787354,0.00006166869,0.00072324125,0.0005943503,0.0005227501,0.00022446534],"domain_scores_gemma":[0.9979609,0.00021789134,0.00090938446,0.00043489563,0.00038575902,0.00009117078],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032340945,0.0003636944,0.0004513531,0.0003575827,0.0003211368,0.000076645265,0.0005078394,0.0002864791,0.0025709872],"category_scores_gemma":[0.00018040511,0.0004368926,0.00021491837,0.00017817931,0.000056397574,0.0006063094,0.00022096124,0.00037965836,0.000005289497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020664349,0.00002053362,0.000013463401,0.00003346484,0.000031421474,0.0000011444293,0.00009160219,0.76618594,3.3783652e-7,0.22660898,0.0003564838,0.0066359523],"study_design_scores_gemma":[0.0007883623,0.00019107899,0.0000017647099,0.000028216287,0.000053446434,0.0000056372196,0.0000039575225,0.81588805,0.0000032868327,0.002317826,0.18035841,0.0003599981],"about_ca_topic_score_codex":0.000007996808,"about_ca_topic_score_gemma":0.0000015045605,"teacher_disagreement_score":0.22429115,"about_ca_system_score_codex":0.00017062847,"about_ca_system_score_gemma":0.00025026975,"threshold_uncertainty_score":0.9998083},"labels":[],"label_agreement":null},{"id":"W4361006326","doi":"10.1007/978-3-030-54621-2_838-1","title":"Algorithm Portfolios","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science","score_opus":0.011597134851065236,"score_gpt":0.2189899654966995,"score_spread":0.20739283064563427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361006326","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.668998e-8,0.000035265602,0.55801696,0.00010492992,0.00071795704,0.00017437412,0.000014391703,0.00024978182,0.44068626],"genre_scores_gemma":[0.0000056571475,0.00461889,0.48988807,0.00005478075,0.00015328598,0.000010291619,0.00020834128,0.00005889176,0.5050018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982832,0.000017031622,0.00058136816,0.0004688964,0.00046520864,0.00018428409],"domain_scores_gemma":[0.99847853,0.000073576244,0.00052153826,0.0005527309,0.00027901964,0.00009461384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016211612,0.0002860131,0.0003397558,0.0004936972,0.00007250946,0.00005272264,0.00043664436,0.0003200758,0.000614584],"category_scores_gemma":[0.000047182337,0.00031859716,0.00014614825,0.0002017354,0.000061289895,0.00039960162,0.0001636491,0.00020973262,0.00017222333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029715527,0.000020181624,0.000015630338,0.000042134787,0.00007635099,0.000029418632,0.0001933717,0.3182138,7.0124645e-7,0.18580353,0.005966082,0.48963585],"study_design_scores_gemma":[0.00049832073,0.00009904557,0.00009393403,0.0002000333,0.00007536482,0.000027182878,0.000009104144,0.89424145,0.000012439958,0.015175065,0.08873357,0.0008344801],"about_ca_topic_score_codex":0.0000049401547,"about_ca_topic_score_gemma":0.0000029131602,"teacher_disagreement_score":0.5760277,"about_ca_system_score_codex":0.000055167246,"about_ca_system_score_gemma":0.00020317402,"threshold_uncertainty_score":0.9999266},"labels":[],"label_agreement":null},{"id":"W4366547151","doi":"","title":"Dynamic Path Consistency for Spatial Reasoning","year":2012,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Path (computing); Consistency (knowledge bases); Spatial intelligence; Artificial intelligence; Programming language","score_opus":0.009364379595946878,"score_gpt":0.22192648173131732,"score_spread":0.21256210213537044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366547151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063115545,0.00021831716,0.97093505,0.0043106377,0.00028396325,0.00024994594,0.00000958558,0.00023476333,0.017446173],"genre_scores_gemma":[0.66050553,0.00004177634,0.33788645,0.000097244774,0.00000948309,0.000028714328,0.000042832788,0.0000103544435,0.001377638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997979,0.0009307426,0.00026610584,0.00030778768,0.00020033057,0.00031605066],"domain_scores_gemma":[0.99734575,0.0007252974,0.00019216523,0.0008017584,0.000773856,0.00016114904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024458733,0.00013550854,0.00013916765,0.00009761438,0.00037679463,0.00021218344,0.00049785856,0.000075141485,0.00007211024],"category_scores_gemma":[0.0009321081,0.00014488376,0.000097241005,0.0002728796,0.00008742478,0.00049417856,0.00018051868,0.000112864815,0.000029698718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004518286,0.00021211611,0.006577436,0.000024692483,0.000022219478,5.7297467e-7,0.0050833775,0.0000368876,0.0013228956,0.6504171,0.00042871086,0.3358695],"study_design_scores_gemma":[0.0013842615,0.0000011745288,0.047084805,0.0004185441,0.000033209442,0.000054043983,0.0001906366,0.90870917,0.011771503,0.0032697774,0.026424717,0.00065818726],"about_ca_topic_score_codex":0.00014800575,"about_ca_topic_score_gemma":0.00035429266,"teacher_disagreement_score":0.9086723,"about_ca_system_score_codex":0.0000680779,"about_ca_system_score_gemma":0.00011405737,"threshold_uncertainty_score":0.59081876},"labels":[],"label_agreement":null},{"id":"W4377231228","doi":"10.1007/978-3-031-33271-5_24","title":"A Weighted Counting Algorithm for the Circuit Constraint","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Constraint (computer-aided design); Probabilistic logic; Estimator; Algorithm; Constraint programming; Measure (data warehouse); Graph; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Stochastic programming; Data mining; Statistics","score_opus":0.02418396410470778,"score_gpt":0.24439470522688383,"score_spread":0.22021074112217606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.0126287e-7,0.0000988499,0.99275887,0.001480947,0.0030595977,0.0007414006,0.000019413916,0.00031992927,0.0015200786],"genre_scores_gemma":[0.007153848,0.00010156199,0.9883688,0.0023111007,0.0007820578,0.000059414193,0.000016125468,0.000060141683,0.0011469268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997198,0.000019462863,0.00046202753,0.0010610087,0.00072331016,0.00053623365],"domain_scores_gemma":[0.9967864,0.001628393,0.00027757196,0.00085238606,0.00035664343,0.000098602286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010875425,0.00036761287,0.00033170608,0.00051875075,0.00054117024,0.000753975,0.0019232797,0.00022890822,0.000025791234],"category_scores_gemma":[0.00009521982,0.00028840703,0.00015378722,0.0006574575,0.0007749115,0.0003539089,0.000503758,0.0005320798,0.000042185355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8848934e-7,0.000004012666,0.000005611095,0.000009498255,0.000012514055,0.0000114432105,0.00024740119,0.006189153,0.000009538427,0.049165856,0.00002444759,0.94431996],"study_design_scores_gemma":[0.00021852615,0.00004022084,0.00005841991,0.0001252901,0.000009613077,0.000053653977,4.686383e-7,0.89968985,0.000075022166,0.09755632,0.0018392104,0.0003334101],"about_ca_topic_score_codex":0.000014781501,"about_ca_topic_score_gemma":0.00006794814,"teacher_disagreement_score":0.94398654,"about_ca_system_score_codex":0.00020414629,"about_ca_system_score_gemma":0.00065969984,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W4377231315","doi":"10.1007/978-3-031-33271-5_21","title":"Exploiting Entropy in Constraint Programming","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristics; Constraint programming; Mathematical optimization; Computation; Principle of maximum entropy; Entropy (arrow of time); Benchmark (surveying); Constraint (computer-aided design); Constraint satisfaction; Theoretical computer science; Algorithm; Artificial intelligence; Stochastic programming; Mathematics; Probabilistic logic","score_opus":0.022995697737497572,"score_gpt":0.24927258729502985,"score_spread":0.22627688955753228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377231315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006596858,0.000037043657,0.99465,0.0009712796,0.0014446292,0.00042611823,0.0000021454437,0.00036229726,0.0020405003],"genre_scores_gemma":[0.17615913,0.00006493854,0.8222684,0.00071001373,0.0003093632,0.000028204096,0.000009906151,0.000050299972,0.00039972187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967922,0.000033899472,0.0005814152,0.0012177107,0.00072798907,0.0006467794],"domain_scores_gemma":[0.9984462,0.0003537658,0.00024314602,0.0006665041,0.00015388742,0.00013644944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008715264,0.00038037178,0.00038876824,0.0012452096,0.00016487649,0.0006351201,0.0013523907,0.00023654563,0.000034926208],"category_scores_gemma":[0.00014376988,0.00039112996,0.00009668361,0.00096363004,0.0005302856,0.0005939944,0.0007077429,0.0007440797,0.000064606415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000132713,0.000009610621,0.00017592844,0.000017432645,0.0000035171736,0.00012543588,0.0007294983,0.033696976,0.0000437301,0.05498111,0.0000026256055,0.9102128],"study_design_scores_gemma":[0.000405518,0.000077592995,0.00037545804,0.000676587,0.0000036732931,0.00009328181,0.0000021790247,0.9126123,0.00027561217,0.08421147,0.000559072,0.00070725044],"about_ca_topic_score_codex":0.000021968575,"about_ca_topic_score_gemma":0.00026999827,"teacher_disagreement_score":0.90950555,"about_ca_system_score_codex":0.00034653748,"about_ca_system_score_gemma":0.000511448,"threshold_uncertainty_score":0.9998541},"labels":[],"label_agreement":null},{"id":"W4377249648","doi":"10.1007/978-3-031-33271-5","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Artificial intelligence; Constraint satisfaction; Inductive programming; Operations research; Programming language; Mathematical optimization; Programming paradigm; Stochastic programming; Mathematics","score_opus":0.07773791426702394,"score_gpt":0.3449096081727305,"score_spread":0.26717169390570655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111882866,0.00005011763,0.9971064,0.0007877479,0.0008034528,0.00054337067,0.000005056928,0.00011995202,0.0004720429],"genre_scores_gemma":[0.17742446,0.00008213052,0.8215942,0.00011875786,0.00023557241,0.000037228594,0.000021620699,0.000022207616,0.00046382478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971443,0.00012013444,0.0005752126,0.00088116387,0.00086776144,0.00041142674],"domain_scores_gemma":[0.99796015,0.0005821977,0.00010090868,0.0005748532,0.00067081366,0.00011105879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020932492,0.00022481423,0.00029264082,0.0015771368,0.00030237116,0.00064168003,0.0009952973,0.00022167852,0.000012369935],"category_scores_gemma":[0.0004789228,0.00021055886,0.000051162904,0.002276582,0.0017752815,0.0004614677,0.0006061815,0.00073122664,0.000016949567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014955697,0.000019364523,0.000008347118,0.000019678373,0.000003480881,0.0000066027574,0.0011516286,0.048394054,0.00016970413,0.07001849,0.000011665273,0.8801955],"study_design_scores_gemma":[0.000038366477,0.00014813407,0.00010196795,0.00025232052,0.0000028552045,0.000023011857,0.0000051265356,0.8893281,0.0016467513,0.10815144,0.00008831397,0.0002135819],"about_ca_topic_score_codex":0.000048484915,"about_ca_topic_score_gemma":0.0009945566,"teacher_disagreement_score":0.87998194,"about_ca_system_score_codex":0.00022661018,"about_ca_system_score_gemma":0.0015243021,"threshold_uncertainty_score":0.8586341},"labels":[],"label_agreement":null},{"id":"W4382866772","doi":"10.1609/icaps.v33i1.27251","title":"Frontmatter","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Moonshot Research and Development Program; Office of Naval Research; Office National d'études et de Recherches Aérospatiales; Institute of Software, Chinese Academy of Sciences; U.S. Naval Research Laboratory; Russian Academy of Sciences; Technische Universität Dortmund; Singapore Management University; Universität Konstanz; Libera Università di Bolzano; Università degli Studi di Brescia; Universidade do Porto; Universidad de Granada; Masarykova Univerzita; Universität des Saarlandes; RWTH Aachen University; Danmarks Tekniske Universitet; Universitat Politècnica de València; Ben-Gurion University of the Negev; Universidade Federal do Rio Grande do Sul; Technische Universität Wien; Sapienza Università di Roma; Oregon State University; Queen's University; Linköpings Universitet; University of Alberta; Imperial College London; University of Toronto; University of Southern California; Institució Catalana de Recerca i Estudis Avançats; Arizona State University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; Chinese Academy of Sciences; Sun Yat-sen University; Bar-Ilan University; Universiteit van Amsterdam; Jet Propulsion Laboratory; Monash University; Royal Holloway, University of London; National Aeronautics and Space Administration; Nanyang Technological University; Universität Ulm; National University of Singapore; University of Aberdeen; University of Oxford; Albert-Ludwigs-Universität Freiburg; Centre National de la Recherche Scientifique; King's College London; Invitae; Carnegie Mellon University; Amazon Robotics; Purdue University; Polytechnique Montréal; Institut national de recherche en informatique et en automatique (INRIA); Universite Angers; Colorado State University; KU Leuven; Heriot-Watt University; Simon Fraser University; Università degli Studi di Padova; European Space Agency; Aalborg Universitet; Universidad Carlos III de Madrid; International Science and Technology Center; Università degli Studi di Napoli Federico II; Örebro Universitet; California Institute of Technology; Fondazione Bruno Kessler; Georgia Institute of Technology; Universidad de Oviedo; Universität Basel; Università degli Studi di Trento; University of Science and Technology of China; Microsoft Research; Technische Universiteit Delft; RAND Corporation; České Vysoké Učení Technické v Praze","keywords":"Czech; Computer science; Library science; Scheduling (production processes); Operations research; Political science; Engineering; Operations management","score_opus":0.03892079911777357,"score_gpt":0.2871891253091323,"score_spread":0.24826832619135875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9267484,0.000010992632,0.0061735027,0.016463656,0.000824475,0.00012209054,0.000005038092,0.0013266209,0.04832522],"genre_scores_gemma":[0.9936063,0.0000041713356,0.0052394317,0.0002379505,0.000019507155,0.000004310125,0.0000017729338,0.0000038827015,0.0008826688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933875,0.0000036887493,0.00014932743,0.00016839555,0.00023993237,0.00009991954],"domain_scores_gemma":[0.99960196,0.000033468692,0.0001176767,0.000054025266,0.0001641834,0.000028697481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018762269,0.000073868236,0.000074856674,0.0001427008,0.0000959202,0.00019014128,0.00043472607,0.00003750295,0.000039343504],"category_scores_gemma":[0.00008816106,0.00005631809,0.00002678707,0.0002111197,0.00003117178,0.00023531297,0.00014802549,0.00010624911,0.000034740417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059519472,0.000058132267,0.1141233,0.00009301419,0.00017945237,0.0000063020366,0.0049126362,0.020573013,0.08124087,0.7281887,0.03386089,0.016704196],"study_design_scores_gemma":[0.00013887038,0.000012417891,0.021414623,0.00017040981,0.0000023249277,0.0000094257075,0.00021822122,0.97303796,0.0031550343,0.0016190382,0.00015106592,0.000070607515],"about_ca_topic_score_codex":0.0000034332015,"about_ca_topic_score_gemma":1.7352707e-7,"teacher_disagreement_score":0.95246494,"about_ca_system_score_codex":0.0000134972515,"about_ca_system_score_gemma":0.000022489961,"threshold_uncertainty_score":0.22965851},"labels":[],"label_agreement":null},{"id":"W4382866785","doi":"10.1609/socs.v16i1.27309","title":"Domain-Independent Dynamic Programming (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Formalism (music); Computer science; Solver; Domain (mathematical analysis); Dynamic programming; Problem solver; Theoretical computer science; Heuristic; Programming language; Mathematical optimization; Algorithm; Artificial intelligence; Software engineering; Mathematics","score_opus":0.011695756343109182,"score_gpt":0.27560539589787847,"score_spread":0.2639096395547693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.952247,0.0000041678322,0.0008524384,0.017320467,0.008822244,0.00066453463,0.000005703003,0.00034619292,0.019737255],"genre_scores_gemma":[0.9985637,0.000019793522,0.000798316,0.000063932675,0.00012792076,0.00003371671,0.0000030575263,0.000012371011,0.00037718177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9975938,0.000009142041,0.00031400318,0.00034619743,0.0014781404,0.00025867482],"domain_scores_gemma":[0.9990498,0.0000838586,0.00016477666,0.00015499962,0.00047126075,0.00007533441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821374,0.00013335214,0.00012348278,0.00017692611,0.00018689937,0.00033827085,0.0017483934,0.00007152949,0.000028641578],"category_scores_gemma":[0.000043620497,0.0001089512,0.00012022222,0.00061199197,0.000063621286,0.00034419482,0.0006657167,0.0002608848,0.00006898605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006622708,0.00030461722,0.013030159,0.000035619756,0.00010077972,0.0000037253965,0.0013264912,0.0007722148,0.038001996,0.93355554,0.00086614426,0.01193646],"study_design_scores_gemma":[0.01022915,0.0011848216,0.5862338,0.00084608706,0.000052285035,0.000113992784,0.0025654598,0.06128956,0.14911263,0.11760716,0.06884276,0.0019223216],"about_ca_topic_score_codex":0.000025743035,"about_ca_topic_score_gemma":0.000002974761,"teacher_disagreement_score":0.8159484,"about_ca_system_score_codex":0.0002695111,"about_ca_system_score_gemma":0.000062496,"threshold_uncertainty_score":0.4442901},"labels":[],"label_agreement":null},{"id":"W4382866853","doi":"10.1609/icaps.v33i1.27200","title":"Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Computer science; Solver; Integer programming; State space; Formalism (music); Mathematical optimization; Domain (mathematical analysis); Dynamic programming; Combinatorial optimization; Theoretical computer science; Mathematics; Algorithm; Stochastic programming; Programming language","score_opus":0.03391730746902807,"score_gpt":0.29794611231564133,"score_spread":0.2640288048466133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67370194,0.00001711546,0.3158363,0.0061798804,0.0014429807,0.00060629373,0.000016047863,0.0010761964,0.0011232615],"genre_scores_gemma":[0.9226722,0.000022197519,0.0770739,0.0000404524,0.000023900171,0.000028485594,0.000014116187,0.000010543738,0.00011421172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988535,0.000009886359,0.00023600369,0.00029183595,0.00041362835,0.0001951555],"domain_scores_gemma":[0.9991467,0.00006531327,0.00019395753,0.00007283365,0.00046757975,0.00005358889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045746044,0.00012385673,0.0001238889,0.00019101848,0.00020379624,0.00037600653,0.00048969686,0.000060665872,0.000004322041],"category_scores_gemma":[0.000070182505,0.000104972016,0.000046271813,0.00037207996,0.000046879282,0.00026646932,0.00016686866,0.00013903937,0.0000021418589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013939325,0.000070702416,0.0070877634,0.000110720466,0.00012638875,0.0000024200037,0.0027935451,0.66033757,0.015753308,0.30535936,0.00024552076,0.0079733115],"study_design_scores_gemma":[0.0005115103,0.000058184036,0.0015539705,0.00014505722,0.000004718725,0.000008426479,0.0004052555,0.99247575,0.00262905,0.0020153886,0.00007739749,0.000115270166],"about_ca_topic_score_codex":0.0000044967437,"about_ca_topic_score_gemma":3.308521e-7,"teacher_disagreement_score":0.3321382,"about_ca_system_score_codex":0.00005553717,"about_ca_system_score_gemma":0.00007994932,"threshold_uncertainty_score":0.42806345},"labels":[],"label_agreement":null},{"id":"W4382866883","doi":"10.1609/socs.v16i1.27277","title":"Core Expansion in Optimization Crosswords","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Lagging; Constraint (computer-aided design); Core (optical fiber); Computer science; Focus (optics); Competition (biology); Function (biology); State (computer science); Mathematical optimization; Optimization problem; Algorithm; Mathematics; Biology; Telecommunications; Physics; Statistics; Geometry","score_opus":0.03142551140645574,"score_gpt":0.28867879628436344,"score_spread":0.2572532848779077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940274,0.000004797079,0.004327564,0.019283382,0.010751104,0.00073172053,0.000008700551,0.0003514629,0.02426726],"genre_scores_gemma":[0.9985353,0.000046978403,0.00092336396,0.000089190646,0.0001144091,0.000019677413,0.00000449995,0.00000978316,0.000256807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983983,0.000010681781,0.0002811257,0.000280984,0.000843622,0.00018530159],"domain_scores_gemma":[0.99920535,0.00008901521,0.00011447795,0.00012436416,0.00042316673,0.000043636715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005446163,0.00010195848,0.00010837308,0.00024511266,0.00010980553,0.00016587593,0.0010996812,0.000072474686,0.000029918405],"category_scores_gemma":[0.00015705448,0.00008593895,0.00006475049,0.0011276089,0.000055816567,0.00042606116,0.00041809506,0.00018976568,0.0000207725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014985017,0.00022486194,0.03657438,0.000027958553,0.0000264704,0.000002162182,0.0011653338,0.15616956,0.02898722,0.77055115,0.0022312468,0.003889795],"study_design_scores_gemma":[0.0019419558,0.00015365412,0.022726905,0.00017988532,0.0000028714774,0.0000075270295,0.0001298701,0.91944844,0.041129813,0.013030094,0.0009998517,0.00024914974],"about_ca_topic_score_codex":0.00004306623,"about_ca_topic_score_gemma":0.0000023659877,"teacher_disagreement_score":0.76327884,"about_ca_system_score_codex":0.00017031221,"about_ca_system_score_gemma":0.000061008046,"threshold_uncertainty_score":0.35044888},"labels":[],"label_agreement":null},{"id":"W4385764173","doi":"10.24963/ijcai.2023/768","title":"Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract)","year":2023,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Ministerio de Ciencia e Innovación","keywords":"Maximum satisfiability problem; Computer science; Mathematical optimization; Integer programming; Scheduling (production processes); Constraint programming; Answer set programming; Satisfiability; Job shop scheduling; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Schedule; Stochastic programming; Programming language","score_opus":0.073421568515466,"score_gpt":0.24868891593619852,"score_spread":0.17526734742073252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385764173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012069151,0.000007619931,0.930224,0.042360365,0.0004309343,0.0005875495,0.000001993352,0.00089276244,0.013425617],"genre_scores_gemma":[0.7324719,0.000005634161,0.2663095,0.00078250736,0.00009735155,0.000056758505,0.0000061026144,0.000014729662,0.0002555349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982771,0.00003811495,0.00036605741,0.00052235747,0.0003572656,0.00043906353],"domain_scores_gemma":[0.99888915,0.00014507845,0.0000945778,0.00045016265,0.00026540997,0.00015563208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087073323,0.00019168848,0.00016435716,0.00028679936,0.00043413645,0.0006006909,0.00062612054,0.00006225549,0.00005683559],"category_scores_gemma":[0.0003131311,0.00014421718,0.00004604079,0.0031966679,0.00004095836,0.0004520924,0.00038847662,0.00014555873,0.00043845407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057400434,0.000032022086,0.00080792507,0.0000499496,0.000025689387,0.000012088173,0.002267325,0.6765337,0.0013951934,0.052056395,0.0009455655,0.2658684],"study_design_scores_gemma":[0.0004166236,0.000021443164,0.22843687,0.00022831676,0.00001320991,0.000060327857,0.0023110565,0.76257306,0.0006594082,0.0014724457,0.0031019924,0.00070524024],"about_ca_topic_score_codex":0.00008021308,"about_ca_topic_score_gemma":0.000130282,"teacher_disagreement_score":0.7204027,"about_ca_system_score_codex":0.000049973813,"about_ca_system_score_gemma":0.00018583851,"threshold_uncertainty_score":0.5881006},"labels":[],"label_agreement":null},{"id":"W4389315214","doi":"10.1109/cog57401.2023.10333249","title":"Generating and Solving Champion-Level Romanian Crosswords Puzzles","year":2023,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Champion; Range (aeronautics); Lagging; Constraint (computer-aided design); Task (project management); Grid; Romanian; Thematic map; Artificial intelligence; Word (group theory); Mathematics; Statistics; Cartography","score_opus":0.03242005076873285,"score_gpt":0.2569922962726694,"score_spread":0.22457224550393656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064475626,0.000014923583,0.9298425,0.0018286251,0.0002589116,0.000060935396,0.0000011698553,0.0005180435,0.002999313],"genre_scores_gemma":[0.8228102,0.000035914294,0.17406623,0.0004326736,0.000065903405,0.000006199386,0.000003995958,0.000006309956,0.0025726105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942714,0.000015810492,0.00011110842,0.00019898663,0.00010300148,0.00014396633],"domain_scores_gemma":[0.9997069,0.000046578814,0.000027430839,0.00013542645,0.000031347812,0.00005229746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015771325,0.00006300388,0.000056895064,0.00009159055,0.00024295518,0.00031347902,0.000108265056,0.000028059794,0.00005791469],"category_scores_gemma":[0.000038176986,0.000059077804,0.000016004955,0.00029607277,0.000022871684,0.00035696873,0.00013258845,0.000043350414,0.000049283983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001296472,0.000014135353,0.013693441,0.0000206854,0.000018677301,0.000022360191,0.003359952,0.009142787,0.008035409,0.13302752,0.004693291,0.82797045],"study_design_scores_gemma":[0.00012141199,0.0000075682465,0.037137993,0.000006869009,7.83786e-7,0.000014527515,0.00009779723,0.9609623,0.0003352081,0.00045660313,0.0007547395,0.000104225845],"about_ca_topic_score_codex":0.000024274656,"about_ca_topic_score_gemma":0.00013660238,"teacher_disagreement_score":0.9518195,"about_ca_system_score_codex":0.000011202201,"about_ca_system_score_gemma":0.000030773055,"threshold_uncertainty_score":0.30228856},"labels":[],"label_agreement":null},{"id":"W4390720654","doi":"10.1017/9781009299909.009","title":"Matrix Lie Groups","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lie group; Lie algebra; Algebra over a field; State vector; Vector space; Matrix (chemical analysis); Rotation matrix; State (computer science); Linear algebra; Rotation group SO; Space (punctuation); Adjoint representation; Computer science; Group (periodic table); Mathematics; Pure mathematics; Algorithm; Artificial intelligence; Geometry","score_opus":0.014927589003190874,"score_gpt":0.20023292282623278,"score_spread":0.1853053338230419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390720654","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033634642,0.00013437649,0.11047527,0.00007610926,0.00072574866,0.00019919245,0.00006171919,0.00051730074,0.8878069],"genre_scores_gemma":[0.0004206854,0.00010484257,0.0018859943,0.00006077974,0.00010315335,3.5173204e-7,0.000021260183,0.000026060681,0.99737686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883544,0.000014548737,0.00015400191,0.00055724254,0.0002448253,0.0001939576],"domain_scores_gemma":[0.99903893,0.00003891965,0.00011374513,0.0005693732,0.000098389144,0.00014062758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006227442,0.00027455602,0.0002285247,0.00027415028,0.00013179825,0.00018714428,0.00066600007,0.00026920723,0.000013489893],"category_scores_gemma":[0.000002838901,0.0003288769,0.00019508526,0.000016098806,0.00010533788,0.0001934604,0.0005711316,0.00040492916,0.00017071606],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005116992,0.0000021054389,3.3115117e-7,0.000041822306,0.000056616733,0.00027099045,0.00003335734,0.000014391121,0.000006352934,0.97507286,0.019806145,0.0046898904],"study_design_scores_gemma":[0.00019164964,0.00002242602,0.0000055572295,0.000108875785,0.00007711688,0.000046789635,0.000007150662,0.004056815,0.000036121717,0.0002363132,0.99483836,0.0003728115],"about_ca_topic_score_codex":0.000021165473,"about_ca_topic_score_gemma":0.0000018123245,"teacher_disagreement_score":0.9750322,"about_ca_system_score_codex":0.00018228502,"about_ca_system_score_gemma":0.00011272415,"threshold_uncertainty_score":0.9999163},"labels":[],"label_agreement":null},{"id":"W4390979588","doi":"10.9734/bpi/ratmcs/v8/7354c","title":"SpaceConnect: A Framework for Modelling and Managing Behavioral States of Evolutive Agents","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Psychology; Cognitive science","score_opus":0.04175468218786794,"score_gpt":0.28408873635122306,"score_spread":0.24233405416335513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390979588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019221412,0.00027599873,0.9503082,0.00027651078,0.00027542788,0.00026702773,0.000029511135,0.00009198249,0.048456125],"genre_scores_gemma":[0.014871839,0.00064332614,0.80012137,0.00011236896,0.000057787318,0.000017158347,0.000027786275,0.00004731592,0.18410106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992017,0.0000029537423,0.00020570896,0.00035026643,0.00012110158,0.00011825842],"domain_scores_gemma":[0.9994899,0.00009154508,0.00010541927,0.00018392435,0.000080288475,0.0000489092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070966016,0.0001623505,0.00019584237,0.00018914208,0.00004662738,0.0000933802,0.00012521105,0.00013513178,0.000113898735],"category_scores_gemma":[0.0000025489373,0.00016068242,0.000080985184,0.000031112944,0.00004379636,0.0001437385,0.00011349205,0.00014764484,0.0000072664975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028022675,0.0000032934365,0.000005924337,0.000060377377,0.000031111613,0.0000023751384,0.00049189787,0.008814099,2.765693e-7,0.9751888,0.00011023881,0.01528882],"study_design_scores_gemma":[0.00005211399,0.000032116845,0.0000019011259,0.00017299008,0.000029891444,0.0000025293145,0.000032954125,0.54892796,0.000006729496,0.4490521,0.0015678686,0.00012082517],"about_ca_topic_score_codex":0.00002174681,"about_ca_topic_score_gemma":0.000018853647,"teacher_disagreement_score":0.54011387,"about_ca_system_score_codex":0.0000351461,"about_ca_system_score_gemma":0.00003087572,"threshold_uncertainty_score":0.65524393},"labels":[],"label_agreement":null},{"id":"W4392147330","doi":"10.4230/lipics.cp.2023.17","title":"Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint (computer-aided design); Constraint programming; Computer science; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Stochastic programming","score_opus":0.01863923311543268,"score_gpt":0.19772111852979976,"score_spread":0.1790818854143671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392147330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040894537,0.00007288388,0.97190875,0.006758866,0.00006876276,0.00038215995,0.000011912916,0.00047598276,0.016231237],"genre_scores_gemma":[0.48233962,0.0006521992,0.5065742,0.00016350155,0.000011194354,0.00017822982,0.00017167986,0.000032217136,0.009877172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841106,0.00051787944,0.00023200647,0.00040886994,0.00019421807,0.0002359808],"domain_scores_gemma":[0.99754256,0.00061389117,0.00015023157,0.00057139894,0.0010275708,0.00009432276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015639766,0.00013964178,0.0001423793,0.00018995369,0.00039127722,0.00034850952,0.00036045886,0.00006879017,0.000030459623],"category_scores_gemma":[0.00016518841,0.0001365534,0.0000443606,0.00056076574,0.00013986854,0.00074295636,0.00008765048,0.000093143855,0.000009150504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013642446,0.00009640352,0.00041009928,0.00010904137,0.00005085492,0.0000015352178,0.015564522,0.31295004,0.000643165,0.57500803,0.0012087978,0.093943864],"study_design_scores_gemma":[0.0004757792,0.0000010138107,0.00017727757,0.00018544761,0.000008018891,0.000010037111,0.0001964554,0.98975915,0.0029404014,0.0046495697,0.0014147473,0.00018209788],"about_ca_topic_score_codex":0.00016860268,"about_ca_topic_score_gemma":0.00037702435,"teacher_disagreement_score":0.67680913,"about_ca_system_score_codex":0.0000376164,"about_ca_system_score_gemma":0.0001165249,"threshold_uncertainty_score":0.5568486},"labels":[],"label_agreement":null},{"id":"W4394585993","doi":"10.1109/tc.2024.3386068","title":"LogSay: An Efficient Comprehension System for Log Numerical Reasoning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Comprehension; Computer science; Programming language","score_opus":0.016408016086588015,"score_gpt":0.2538376564882267,"score_spread":0.2374296404016387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394585993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016644467,0.00002483817,0.9903838,0.00047881858,0.0056596315,0.00034224612,0.000013713706,0.001338927,0.0000935826],"genre_scores_gemma":[0.798617,0.0000027258982,0.20110752,0.00013329046,0.00006125942,0.000031732052,0.0000044969934,0.0000168641,0.000025087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986114,0.00008109634,0.00025723848,0.00056210975,0.00023368186,0.00025446014],"domain_scores_gemma":[0.9991782,0.00019804668,0.000039315215,0.00035872014,0.00007412731,0.00015162608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016437133,0.00018449851,0.00017515408,0.00027100905,0.00029939393,0.00034404683,0.00028005653,0.00008173817,0.000011595706],"category_scores_gemma":[0.0000013373726,0.00017977432,0.00015464156,0.00043984898,0.0000359013,0.00028845313,0.000003148641,0.00018415057,0.000060356993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012734484,0.00006190924,0.0000013211147,0.000042023577,0.00002558067,0.00001083627,0.00030502598,0.8137012,0.0001606603,0.007963032,0.00014169565,0.17757398],"study_design_scores_gemma":[0.00029269635,0.00017452425,0.00004040657,0.0001702931,0.000017600003,0.00009788002,0.000042993903,0.9968806,0.0012295246,0.000025525023,0.0008304207,0.00019756435],"about_ca_topic_score_codex":0.000017671802,"about_ca_topic_score_gemma":0.000004148549,"teacher_disagreement_score":0.7969526,"about_ca_system_score_codex":0.00015265994,"about_ca_system_score_gemma":0.00008350347,"threshold_uncertainty_score":0.7330984},"labels":[],"label_agreement":null},{"id":"W4396840563","doi":"10.1017/9781009282284.003","title":"Generalizing from Models","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.030409597276992554,"score_gpt":0.19249994372135762,"score_spread":0.16209034644436507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396840563","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003996147,0.00014294205,0.31093824,0.000036418318,0.00044467577,0.00010960015,0.00010813333,0.00032053876,0.6878955],"genre_scores_gemma":[0.00049035036,0.00012368387,0.006066443,0.00009904538,0.00011004288,3.0224993e-7,0.000038861243,0.000025400268,0.99304587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887794,0.000014669743,0.00014171754,0.000581899,0.0002207574,0.00016301489],"domain_scores_gemma":[0.9991169,0.000033064658,0.00009961538,0.0005445986,0.00008504647,0.00012074788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000038985865,0.0002524017,0.00021651629,0.0001888815,0.000117806616,0.00018329597,0.00059352553,0.00024009457,0.000008001258],"category_scores_gemma":[0.0000012292707,0.00030794082,0.00016513876,0.0000104093415,0.000070695096,0.00027183827,0.00052264135,0.00032311885,0.00004751643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034331842,0.0000011029309,1.4322383e-7,0.000012118232,0.00007119297,0.00015843823,0.000051012245,0.0004645874,0.00001646684,0.9850685,0.0092763705,0.0048766225],"study_design_scores_gemma":[0.00019917633,0.000010520394,0.0000019022159,0.00013463786,0.00009300099,0.0000106219,0.0000059081103,0.14380763,0.00009190757,0.0013358295,0.8538795,0.00042932533],"about_ca_topic_score_codex":0.00018652363,"about_ca_topic_score_gemma":0.0000044803437,"teacher_disagreement_score":0.9837327,"about_ca_system_score_codex":0.00016110722,"about_ca_system_score_gemma":0.00009568088,"threshold_uncertainty_score":0.9999373},"labels":[],"label_agreement":null},{"id":"W4398794954","doi":"10.48550/arxiv.2405.13073","title":"A distance for mixed-variable and hierarchical domains with meta variables","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Office National d'études et de Recherches Aérospatiales; HORIZON EUROPE Framework Programme; Agence Nationale de la Recherche; Fonds de recherche du Québec – Nature et technologies","keywords":"Categorical variable; Computer science; Graph; Machine learning; Weighting; Feature (linguistics); Data mining; Variable (mathematics); Artificial intelligence; Mathematics; Theoretical computer science","score_opus":0.03892718802060015,"score_gpt":0.18186698628221099,"score_spread":0.14293979826161085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398794954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029409158,0.00013836773,0.99274546,0.00033729122,0.00031777655,0.0003768271,0.000060892587,0.00022543197,0.0028570343],"genre_scores_gemma":[0.87423426,0.000114546965,0.12342498,0.00008779663,0.00004080994,0.000008075075,0.000021615173,0.00001829849,0.0020496466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856615,0.00006211345,0.00013249488,0.0009410853,0.00006790885,0.0002302667],"domain_scores_gemma":[0.9989483,0.00018902236,0.00009758289,0.00053298817,0.00010052861,0.00013158904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019857999,0.00024220096,0.00031010702,0.00016603194,0.00015116057,0.00025922543,0.00044557473,0.00016149224,0.000026036498],"category_scores_gemma":[0.00002190493,0.00022202182,0.00011024718,0.0004235856,0.00013492958,0.00020179375,0.0008087821,0.00035420025,0.000004869891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028520795,0.000020130441,0.0001253601,0.00013339575,0.0003961652,0.00003876627,0.00006770862,0.07881406,0.0000059421286,0.91963434,0.00019599183,0.00053963024],"study_design_scores_gemma":[0.00040690994,0.000049192255,0.000105664694,0.00007686762,0.0005962088,0.0000142132185,0.000023512568,0.74209905,0.000018276874,0.25184935,0.0044342526,0.00032648427],"about_ca_topic_score_codex":0.000047890066,"about_ca_topic_score_gemma":0.000106906715,"teacher_disagreement_score":0.8712933,"about_ca_system_score_codex":0.00006217771,"about_ca_system_score_gemma":0.00026213186,"threshold_uncertainty_score":0.9053787},"labels":[],"label_agreement":null},{"id":"W4399048750","doi":"10.1007/978-3-031-60599-4","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pontificia Universidad Católica de Chile; Consejo Superior de Investigaciones Científicas; Università di Bologna; Université de Liège; AgroParisTech; Centre National de la Recherche Scientifique; Linköpings Universitet; Technische Universität Wien; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Technische Universiteit Delft; Université Laval; Monash University; University College Cork; University of Southern California; Polytechnique Montréal; University College Dublin; University of Glasgow; University of Toronto; Université Grenoble Alpes; Albert-Ludwigs-Universität Freiburg; Carnegie Mellon University; Uppsala Universitet; Université de Toulouse; Università degli Studi di Padova; Brown University; Helsingin Yliopisto; University of Cincinnati; Bucknell University; University of Connecticut; Universität Bielefeld; Université Catholique de Louvain","keywords":"Computer science; Artificial intelligence; Constraint programming; Constraint (computer-aided design); Artificial Intelligence System; Programming language; Mathematical optimization; Stochastic programming; Engineering; Mathematics","score_opus":0.061539773790371975,"score_gpt":0.33996193799417457,"score_spread":0.2784221642038026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399048750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082953644,0.00022104937,0.9961526,0.0010024904,0.00094090146,0.0005182796,0.0000052697355,0.0000922386,0.0009842366],"genre_scores_gemma":[0.24657927,0.000066204215,0.75268567,0.00011253825,0.00022499642,0.000026230635,0.000012931005,0.000016042795,0.0002761017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972238,0.00009964806,0.00055974413,0.00093766174,0.0008086702,0.00037046854],"domain_scores_gemma":[0.99834013,0.00037822,0.000071929666,0.0005345278,0.0005684882,0.000106728876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017962793,0.00023485016,0.0002790317,0.0015273158,0.0002271733,0.00095774984,0.00089867937,0.00022036575,0.000017997092],"category_scores_gemma":[0.00026357392,0.00021039756,0.000056090536,0.0018690496,0.0017776293,0.00046184007,0.0006016324,0.0008896334,0.000016628546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012526277,0.000018571158,0.0000030230804,0.00003364318,0.000004071102,0.00000823323,0.0013354279,0.02476525,0.00017934691,0.13085026,0.000014919788,0.842786],"study_design_scores_gemma":[0.000025167883,0.00014138024,0.000021465237,0.00036767774,0.0000043269706,0.00004186592,0.00000387225,0.8528624,0.0019858002,0.14407788,0.00026772983,0.00020040262],"about_ca_topic_score_codex":0.000039777682,"about_ca_topic_score_gemma":0.00062404765,"teacher_disagreement_score":0.8425856,"about_ca_system_score_codex":0.00025633827,"about_ca_system_score_gemma":0.0017173566,"threshold_uncertainty_score":0.9235604},"labels":[],"label_agreement":null},{"id":"W4399058434","doi":"10.1007/978-3-031-60597-0","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pontificia Universidad Católica de Chile; Consejo Superior de Investigaciones Científicas; Università di Bologna; Université de Liège; AgroParisTech; Centre National de la Recherche Scientifique; Linköpings Universitet; Technische Universität Wien; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Technische Universiteit Delft; Université Laval; Monash University; University College Cork; University of Southern California; Polytechnique Montréal; University College Dublin; University of Glasgow; University of Toronto; Université Grenoble Alpes; Albert-Ludwigs-Universität Freiburg; Carnegie Mellon University; Uppsala Universitet; Université de Toulouse; Università degli Studi di Padova; Brown University; Helsingin Yliopisto; University of Cincinnati; Bucknell University; University of Connecticut; Universität Bielefeld; Université Catholique de Louvain","keywords":"Computer science; Constraint programming; Artificial intelligence; Constraint (computer-aided design); Constraint satisfaction; Mathematical optimization; Stochastic programming; Mathematics","score_opus":0.061539773790371975,"score_gpt":0.33996193799417457,"score_spread":0.2784221642038026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082953644,0.00022104937,0.9961526,0.0010024904,0.00094090146,0.0005182796,0.0000052697355,0.0000922386,0.0009842366],"genre_scores_gemma":[0.24657927,0.000066204215,0.75268567,0.00011253825,0.00022499642,0.000026230635,0.000012931005,0.000016042795,0.0002761017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972238,0.00009964806,0.00055974413,0.00093766174,0.0008086702,0.00037046854],"domain_scores_gemma":[0.99834013,0.00037822,0.000071929666,0.0005345278,0.0005684882,0.000106728876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017962793,0.00023485016,0.0002790317,0.0015273158,0.0002271733,0.00095774984,0.00089867937,0.00022036575,0.000017997092],"category_scores_gemma":[0.00026357392,0.00021039756,0.000056090536,0.0018690496,0.0017776293,0.00046184007,0.0006016324,0.0008896334,0.000016628546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012526277,0.000018571158,0.0000030230804,0.00003364318,0.000004071102,0.00000823323,0.0013354279,0.02476525,0.00017934691,0.13085026,0.000014919788,0.842786],"study_design_scores_gemma":[0.000025167883,0.00014138024,0.000021465237,0.00036767774,0.0000043269706,0.00004186592,0.00000387225,0.8528624,0.0019858002,0.14407788,0.00026772983,0.00020040262],"about_ca_topic_score_codex":0.000039777682,"about_ca_topic_score_gemma":0.00062404765,"teacher_disagreement_score":0.8425856,"about_ca_system_score_codex":0.00025633827,"about_ca_system_score_gemma":0.0017173566,"threshold_uncertainty_score":0.9235604},"labels":[],"label_agreement":null},{"id":"W4399058464","doi":"10.1007/978-3-031-60597-0_7","title":"Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Representation (politics); Theoretical computer science; Artificial intelligence; Combinatorial optimization; Algorithm","score_opus":0.04101629006837488,"score_gpt":0.25875006444453313,"score_spread":0.21773377437615826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001745827,0.00015564951,0.9941957,0.0006186491,0.0023590887,0.00065860193,0.0000051027337,0.00014908178,0.0018406723],"genre_scores_gemma":[0.29981595,0.000021560847,0.6990331,0.00018105206,0.00041684674,0.00006391679,0.000036960333,0.000044852415,0.0003857577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976586,0.000026073798,0.00045525085,0.0009775979,0.00060548604,0.00027695176],"domain_scores_gemma":[0.9986094,0.0002679777,0.0002900403,0.00051208574,0.00024750456,0.000072966934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052420265,0.00028483022,0.00037046967,0.00069782895,0.000121998746,0.00030105188,0.0008945425,0.0002167376,0.000010556192],"category_scores_gemma":[0.00010155611,0.00026935159,0.0001590838,0.00069514604,0.00035932046,0.0002785756,0.00028281676,0.0003824594,0.000004912523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005744986,0.000015503447,0.000024515717,0.00011218828,0.000009489334,0.0000025714385,0.00034742136,0.5885199,0.000047183214,0.057725977,0.0000060080565,0.35318357],"study_design_scores_gemma":[0.00029647574,0.00017606688,0.000026479662,0.00016188694,0.000010998297,0.00000692914,2.13377e-7,0.8526843,0.0014481476,0.14445157,0.000495,0.00024192908],"about_ca_topic_score_codex":0.0000141597875,"about_ca_topic_score_gemma":0.000015971696,"teacher_disagreement_score":0.35294163,"about_ca_system_score_codex":0.00016533736,"about_ca_system_score_gemma":0.000626811,"threshold_uncertainty_score":0.99997586},"labels":[],"label_agreement":null},{"id":"W4399895001","doi":"10.18280/ria.380317","title":"MeAR-CP: Evaluation of the Quality of Association Rules Using Constraint Programming","year":2024,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Constraint programming; Association (psychology); Constraint (computer-aided design); Computer science; Association rule learning; Quality (philosophy); Programming language; Mathematics; Artificial intelligence; Psychology; Statistics; Stochastic programming; Philosophy; Epistemology","score_opus":0.11547045329779916,"score_gpt":0.3601265626909797,"score_spread":0.24465610939318055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399895001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14182182,0.00023151738,0.85537463,0.00047852602,0.00062525965,0.0003383303,0.0000060397297,0.000055526027,0.0010683807],"genre_scores_gemma":[0.9859951,0.000012647346,0.013865358,0.00001153019,0.00002231978,0.0000070042993,0.0000017348185,0.000004499743,0.0000798024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982881,0.00027073486,0.00055316,0.00022342229,0.00053309364,0.00013147465],"domain_scores_gemma":[0.99864805,0.00024386653,0.00029346193,0.00032253526,0.0004676019,0.000024493216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028872238,0.00007832174,0.00013573385,0.0000870582,0.00008185757,0.00008147848,0.00025583632,0.00006251103,0.000092902264],"category_scores_gemma":[0.0005880064,0.00006525578,0.00012210636,0.00060018606,0.00008351907,0.00023705348,0.00006910549,0.00010756158,0.000013067331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024185954,0.00006066607,0.002384013,0.00014162429,0.000043238415,3.0633345e-7,0.002772938,0.19813724,0.01902376,0.11017787,0.000022150058,0.66723377],"study_design_scores_gemma":[0.000022160875,0.00001169171,0.00081877084,0.00014790654,0.000025369342,0.0000038130827,0.00031254138,0.94064295,0.05481838,0.0029506076,0.00017479068,0.000071044],"about_ca_topic_score_codex":0.00006283462,"about_ca_topic_score_gemma":0.000023823626,"teacher_disagreement_score":0.8441733,"about_ca_system_score_codex":0.00018423177,"about_ca_system_score_gemma":0.00022922525,"threshold_uncertainty_score":0.26610535},"labels":[],"label_agreement":null},{"id":"W4400615282","doi":"10.5220/0012811800003758","title":"A Web-Based System for Learning Qualitative Constraint Networks with Preferences","year":2024,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); World Wide Web; Human–computer interaction; Artificial intelligence; Multimedia; Engineering","score_opus":0.0235024257238131,"score_gpt":0.2837930731360247,"score_spread":0.2602906474122116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400615282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006444724,0.000047426274,0.99091864,0.0004977128,0.00023113195,0.0002562265,0.0000022528081,0.0008335898,0.00656853],"genre_scores_gemma":[0.86400366,0.0000015356017,0.13560715,0.000050029128,0.000022238057,0.0000579233,0.000005789724,0.000005233794,0.0002464315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992293,0.00009890247,0.0001420929,0.00026544768,0.000119493125,0.0001447698],"domain_scores_gemma":[0.99924535,0.0004812957,0.00003772164,0.000095118936,0.000090047106,0.000050498857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034744697,0.000092770664,0.00009792542,0.00008587722,0.00010389716,0.00033113817,0.000116591196,0.000037988662,0.000036643334],"category_scores_gemma":[0.000018367102,0.00006588924,0.00003861806,0.00026526005,0.000056211225,0.00021685567,0.000014068504,0.00009883955,0.000008916752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021082535,0.000011849374,0.00020924347,0.00018193797,0.0000624783,0.000007773515,0.0032211025,0.27306294,0.000033112727,0.5821484,0.0003687034,0.14067139],"study_design_scores_gemma":[0.00027405084,0.00012907853,0.00003463385,0.00014536941,0.0000073064666,0.000009632461,0.0023631027,0.99579823,0.00006631465,0.00011015407,0.00095121993,0.00011093422],"about_ca_topic_score_codex":0.00000923871,"about_ca_topic_score_gemma":0.000036992784,"teacher_disagreement_score":0.8633592,"about_ca_system_score_codex":0.000042902542,"about_ca_system_score_gemma":0.00021647401,"threshold_uncertainty_score":0.3193173},"labels":[],"label_agreement":null},{"id":"W4400700781","doi":"10.1007/978-3-031-65572-2_23","title":"AGI from the Perspectives of Categorical Logic and Algebraic Geometry","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Centre","funders":"","keywords":"Categorical variable; Computer science; Algebra over a field; Algebraic number; Geometry; Calculus (dental); Mathematics; Pure mathematics; Mathematical analysis; Machine learning","score_opus":0.012348743049535644,"score_gpt":0.2350069216905359,"score_spread":0.22265817864100027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400700781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023019836,0.0027433236,0.991243,0.0029782024,0.0008520562,0.00017080043,0.0000068360223,0.00007610417,0.00169945],"genre_scores_gemma":[0.8519683,0.0003288815,0.14611326,0.00096398126,0.0003271343,0.0000037350308,0.0000042230054,0.000019603787,0.0002708717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980788,0.000022263328,0.00028613702,0.0008974778,0.00049017236,0.0002251529],"domain_scores_gemma":[0.9983814,0.00067811715,0.00013455997,0.00060294825,0.00013237154,0.00007060069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003346778,0.00025580756,0.00027979488,0.00038186804,0.00012645309,0.00033383633,0.0010975512,0.00016629661,0.000049863207],"category_scores_gemma":[0.000080180675,0.00017738927,0.00007675187,0.0005682625,0.00091172755,0.00025097656,0.0007687263,0.00053607515,0.000015916565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028573857,0.000014080503,0.00017432022,0.000019875775,0.000025275334,0.000034134377,0.0047926134,0.006325621,0.000067326546,0.48016807,0.000028078437,0.50834775],"study_design_scores_gemma":[0.00012061505,0.00007614132,0.0013475143,0.00012452091,0.000014882457,0.000058589445,0.0000059892686,0.29826,0.00014124715,0.69922286,0.0003102737,0.00031737608],"about_ca_topic_score_codex":0.000056053683,"about_ca_topic_score_gemma":0.00006762372,"teacher_disagreement_score":0.8517381,"about_ca_system_score_codex":0.000111950765,"about_ca_system_score_gemma":0.00021677176,"threshold_uncertainty_score":0.72337246},"labels":[],"label_agreement":null},{"id":"W4401894174","doi":"10.3390/a17090377","title":"Star Bicolouring of Bipartite Graphs","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Star (game theory); Combinatorics; Mathematics; Computer science; Graph; Mathematical analysis","score_opus":0.012670345737966942,"score_gpt":0.24758944935122024,"score_spread":0.2349191036132533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401894174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013371324,0.00039072038,0.9827158,0.00067555025,0.0009121488,0.000073522206,0.0000035592484,0.00028924792,0.0015681324],"genre_scores_gemma":[0.83690786,0.000095575815,0.1625553,0.00008135576,0.00004015015,0.000006296664,0.000002103367,0.0000071037575,0.00030424286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999498,0.000014268689,0.000121955636,0.000152209,0.000118960095,0.000094601244],"domain_scores_gemma":[0.9997274,0.000037005935,0.00002027404,0.00015009343,0.00003037318,0.000034795758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103066755,0.000050379585,0.000062429826,0.00014360271,0.000029207971,0.00007380399,0.00013688795,0.000023641487,0.0000596534],"category_scores_gemma":[0.0000074189593,0.0000465157,0.000042382097,0.00044484955,0.000025404615,0.00028371485,0.000044655586,0.00005369323,0.000038600774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011327153,0.000024497076,0.00063023,0.00004465285,0.000043389955,0.00004216629,0.00086981547,0.0009828642,0.0016853885,0.16307081,0.00073638937,0.83186865],"study_design_scores_gemma":[0.000119472716,0.00004964775,0.0039115543,0.000053954092,0.0000074676536,0.0000310234,0.000025522377,0.97495705,0.0050093145,0.0062196124,0.009481104,0.00013430492],"about_ca_topic_score_codex":0.0000156065,"about_ca_topic_score_gemma":0.000003781479,"teacher_disagreement_score":0.97397417,"about_ca_system_score_codex":0.000011310039,"about_ca_system_score_gemma":0.00003761255,"threshold_uncertainty_score":0.18968551},"labels":[],"label_agreement":null},{"id":"W4401943806","doi":"10.1109/cog60054.2024.10645649","title":"Extended Seeds in Optimization Crosswords","year":2024,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.008669431223657927,"score_gpt":0.253969886965348,"score_spread":0.24530045574169007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030273534,0.000057383124,0.9732006,0.0013202311,0.000446171,0.000065266206,3.4086935e-7,0.0004053051,0.024201918],"genre_scores_gemma":[0.7408313,0.000041995387,0.25635955,0.00027064158,0.00002873316,0.000008801843,0.000003815613,0.000005929161,0.002449199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944955,0.000018363007,0.00012772481,0.00019918976,0.0001007454,0.00010442083],"domain_scores_gemma":[0.99977136,0.000028431945,0.000009447374,0.0001380705,0.000022306316,0.000030365254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012351075,0.000056676352,0.000048143127,0.0001924515,0.000029164194,0.00032844354,0.0001260526,0.00003509054,0.00041586402],"category_scores_gemma":[0.000012112127,0.000052030977,0.00002246183,0.00066843606,0.00001497771,0.0006240661,0.00004061749,0.00006487293,0.00005823286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018188874,0.000024802064,0.00069128664,0.000014524805,0.00000613481,0.000027396389,0.000557125,0.36757922,0.000089074085,0.3299204,0.00088664744,0.30020154],"study_design_scores_gemma":[0.00008094418,0.000008027123,0.002957656,0.000012939569,7.058465e-7,0.00001144572,0.000013699761,0.99460834,0.0001121562,0.0008706932,0.0012531804,0.00007022291],"about_ca_topic_score_codex":0.00001279849,"about_ca_topic_score_gemma":0.000021977183,"teacher_disagreement_score":0.7405286,"about_ca_system_score_codex":0.000041333496,"about_ca_system_score_gemma":0.00006186744,"threshold_uncertainty_score":0.45534194},"labels":[],"label_agreement":null},{"id":"W4402177478","doi":"10.1007/978-3-031-71033-9_26","title":"Matrix Rationalization via Partial Orders","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rationalization (economics); Computer science; Matrix (chemical analysis); Algorithm; Management; Materials science","score_opus":0.010578561950957502,"score_gpt":0.25027931553513566,"score_spread":0.23970075358417817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402177478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004678341,0.0001936109,0.99069977,0.0018217984,0.0029204437,0.00028513538,0.0000036012166,0.00027692746,0.0037940098],"genre_scores_gemma":[0.16317648,0.000114337076,0.8282014,0.002514279,0.0013225857,0.0000265278,0.00006833475,0.00008618434,0.0044898586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974071,0.000018325423,0.0004261042,0.001055971,0.00076148217,0.00033105366],"domain_scores_gemma":[0.9987666,0.0001494547,0.00015799045,0.0006065778,0.00021030095,0.0001090923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039845877,0.00032986727,0.00025000746,0.00077241607,0.00019000916,0.0007084007,0.00097516505,0.00022962186,0.00015666444],"category_scores_gemma":[0.00003934053,0.00032081627,0.00009482918,0.00069314,0.00032917713,0.00065591757,0.0004299127,0.00042351414,0.00020213521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026075932,0.000009952151,0.00002904015,0.000029870658,0.000010842122,0.00003431507,0.00032739883,0.286584,0.000069507376,0.2908584,0.00005525851,0.42198882],"study_design_scores_gemma":[0.00010499716,0.000035108045,0.000024495743,0.00010280057,0.0000066690463,0.00004849524,5.0463377e-8,0.83414954,0.00022842542,0.16105722,0.0039217495,0.00032045797],"about_ca_topic_score_codex":0.000012025719,"about_ca_topic_score_gemma":0.00006678402,"teacher_disagreement_score":0.5475655,"about_ca_system_score_codex":0.0002532151,"about_ca_system_score_gemma":0.0005012742,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W4403305392","doi":"10.1017/9781009302180.017","title":"Recursion on Trees","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Recursion (computer science); Computer science; Mathematics; Programming language","score_opus":0.01880095087657459,"score_gpt":0.1973917983131952,"score_spread":0.1785908474366206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305392","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004225773,0.00004895048,0.026712429,0.00012010499,0.0007165886,0.00018673787,0.00005621912,0.00041428802,0.9717405],"genre_scores_gemma":[0.0005383977,0.00009263913,0.0006960894,0.00009607249,0.00007166994,2.6352208e-7,0.000017036307,0.000020209498,0.9984676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989438,0.000016231095,0.000118666045,0.0005281551,0.00024204851,0.00015108827],"domain_scores_gemma":[0.9991567,0.000046003042,0.00009490666,0.00051781826,0.00007393914,0.00011063092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005245579,0.00024355206,0.00018739836,0.00028118698,0.00012332221,0.00011907977,0.00050194934,0.00023203509,0.0000095583],"category_scores_gemma":[0.0000034666948,0.0002731738,0.00015880355,0.000013069373,0.00008087864,0.00012137927,0.00029515306,0.00036550406,0.00013123485],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011614738,0.000003013255,1.4231705e-7,0.000018671972,0.000033087323,0.00015511338,0.000027354674,0.000028701177,0.0000074265317,0.95584416,0.027027754,0.016842972],"study_design_scores_gemma":[0.0001757064,0.000058271387,0.000008992589,0.00020908251,0.000039185332,0.000015050142,0.0000051598727,0.0029576558,0.0001004001,0.00011701589,0.9960185,0.00029497952],"about_ca_topic_score_codex":0.000015008329,"about_ca_topic_score_gemma":0.0000022098009,"teacher_disagreement_score":0.96899074,"about_ca_system_score_codex":0.00018068681,"about_ca_system_score_gemma":0.00007330281,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W4403306432","doi":"10.1017/9781009302180.044","title":"Adding-Made-Easy Approximations","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.018550429956550107,"score_gpt":0.19678960556077016,"score_spread":0.17823917560422006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403306432","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.074329e-7,0.00006357114,0.20870492,0.00006165105,0.0004581392,0.00023050584,0.000109523164,0.0004996072,0.7898714],"genre_scores_gemma":[0.00027231136,0.000052834846,0.004714095,0.000065158965,0.00008051466,9.599531e-7,0.000048263384,0.00002630864,0.99473953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878925,0.000017171993,0.00017444929,0.0005639996,0.00025802432,0.00019713023],"domain_scores_gemma":[0.99895376,0.00005134114,0.00013395204,0.00058039726,0.0001342631,0.00014630047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006611192,0.00027777217,0.00022538452,0.00032828833,0.00019549682,0.00021146699,0.00064602913,0.0002588809,0.000014713909],"category_scores_gemma":[0.0000059847976,0.0003369689,0.00019362144,0.000023274699,0.00012043171,0.00024621453,0.00048198726,0.00041809605,0.00013019619],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002991373,0.0000029805992,2.3406531e-7,0.000041503277,0.00006321817,0.00008776293,0.000045048466,0.000040598337,0.000008732556,0.97909194,0.01514184,0.005473155],"study_design_scores_gemma":[0.00017341974,0.000016993925,0.0000054578954,0.00014528458,0.00008538602,0.00003585514,0.0000100624675,0.0139747355,0.000037359587,0.00016494234,0.9849751,0.0003753834],"about_ca_topic_score_codex":0.000017396018,"about_ca_topic_score_gemma":0.0000015418354,"teacher_disagreement_score":0.978927,"about_ca_system_score_codex":0.00019567063,"about_ca_system_score_gemma":0.00014352625,"threshold_uncertainty_score":0.9999082},"labels":[],"label_agreement":null},{"id":"W4403317805","doi":"10.1007/978-3-031-74234-7_11","title":"The Complexity of Data-Free Nfer","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.057302141622705166,"score_gpt":0.28140351492068055,"score_spread":0.2241013732979754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403317805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020833434,0.00050165853,0.9826489,0.004548732,0.0019959372,0.0002238296,0.000032291668,0.000113616086,0.009932926],"genre_scores_gemma":[0.056688186,0.00025885509,0.9394209,0.0010201185,0.0005175808,0.00000581177,0.00003146989,0.000044125944,0.0020129727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.000022476368,0.00046938562,0.0010409809,0.0008045515,0.00032591936],"domain_scores_gemma":[0.99585193,0.00045028137,0.00020665546,0.0032106875,0.00019978467,0.0000806621],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009356395,0.00028042062,0.00028997075,0.00034619807,0.00024950074,0.00056278147,0.0065071476,0.00014562983,0.00003188462],"category_scores_gemma":[0.00010503474,0.00020119551,0.0000760079,0.0005080183,0.0022279439,0.0006007185,0.004175206,0.00055810786,0.000036538462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018206824,0.0000055928244,0.000008699258,0.000020679137,0.000010702757,0.0000104688725,0.00015021958,0.0044204304,0.000010820283,0.41556942,0.00014081685,0.57965034],"study_design_scores_gemma":[0.00007622596,0.000026500285,0.0000708044,0.00010894629,0.0000057437555,0.00002597373,1.0468783e-7,0.53826106,0.00007752615,0.45571104,0.0054562134,0.00017990643],"about_ca_topic_score_codex":0.000022692593,"about_ca_topic_score_gemma":0.0004228404,"teacher_disagreement_score":0.5794704,"about_ca_system_score_codex":0.000108390566,"about_ca_system_score_gemma":0.00047617697,"threshold_uncertainty_score":0.9988681},"labels":[],"label_agreement":null},{"id":"W4403709464","doi":"10.48550/arxiv.2409.04350","title":"The decoupling of moduli about the standard embedding","year":2024,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoupling (probability); Embedding; Moduli; Mathematics; Pure mathematics; Computer science; Physics; Engineering; Artificial intelligence; Control engineering; Quantum mechanics","score_opus":0.03155113842880498,"score_gpt":0.2994529829359077,"score_spread":0.26790184450710275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403709464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29008093,0.0015198768,0.6977657,0.0047448804,0.0034355505,0.00034792698,0.000012735161,0.00019639118,0.0018959864],"genre_scores_gemma":[0.99362856,0.0004985723,0.005275438,0.00011174823,0.00013746605,0.000024141935,0.0000029994178,0.000014946692,0.00030614593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873525,0.000052836192,0.00034641637,0.00037823818,0.00029809927,0.0001891506],"domain_scores_gemma":[0.9985597,0.00020804332,0.00020077698,0.00084269274,0.00014875556,0.000040029514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006303418,0.00016325591,0.00016316165,0.00006328014,0.0002839995,0.00031776863,0.00089512963,0.00010355689,0.000019866391],"category_scores_gemma":[0.00011380714,0.0000998332,0.00014326129,0.00021038644,0.000115031246,0.00006225202,0.0013819176,0.0005449584,0.000034485845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186533,0.0000290609,0.0958763,0.00032388372,0.00043980766,0.000016887227,0.005851164,0.4773853,0.00027820605,0.09048711,0.003304069,0.32597634],"study_design_scores_gemma":[0.00016572181,0.000029460427,0.037496563,0.00041449672,0.000051473617,0.00001168278,0.00024583619,0.94028026,0.0012960181,0.012577931,0.007096367,0.00033421034],"about_ca_topic_score_codex":0.000022526387,"about_ca_topic_score_gemma":0.000045225966,"teacher_disagreement_score":0.7035476,"about_ca_system_score_codex":0.000064809305,"about_ca_system_score_gemma":0.0002492785,"threshold_uncertainty_score":0.407108},"labels":[],"label_agreement":null},{"id":"W4404238465","doi":"10.1109/tkde.2024.3496586","title":"Finding Antagonistic Communities in Signed Uncertain Graphs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Computer science; Signed graph; Theoretical computer science; Graph","score_opus":0.03610903175891978,"score_gpt":0.28217160425459886,"score_spread":0.2460625724956791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404238465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019513617,0.0004901381,0.9961789,0.000080073565,0.00071131875,0.000075024545,0.00004727628,0.00026247252,0.00020341846],"genre_scores_gemma":[0.99217755,0.00026923674,0.0074263955,0.000014367884,0.000013299218,0.0000109509065,0.000022368158,0.000009652536,0.00005620038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994027,0.000025335212,0.00014867347,0.00021633318,0.0000618699,0.00014506206],"domain_scores_gemma":[0.9992944,0.00024961625,0.000008187565,0.00038740074,0.00001222136,0.00004819132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018201255,0.00011000489,0.00009461345,0.0004076826,0.00009852534,0.00020228585,0.0002875841,0.000042149957,0.000025106912],"category_scores_gemma":[0.0000034863046,0.000114577015,0.000020050378,0.00047968558,0.00002197571,0.00062590616,0.000008954918,0.0002087203,0.000015978321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009995444,0.00013096264,0.00006810437,0.00041827763,0.00008261091,0.000058883576,0.005906985,0.358092,0.0013159454,0.029771639,0.0002786062,0.603866],"study_design_scores_gemma":[0.00012468919,0.000019561954,0.00006837948,0.00015842025,0.000007559719,0.000020372489,0.000071802046,0.9974703,0.00028706805,0.000068856876,0.0015703515,0.00013259923],"about_ca_topic_score_codex":0.0000413872,"about_ca_topic_score_gemma":0.00018909606,"teacher_disagreement_score":0.99022615,"about_ca_system_score_codex":0.00003680332,"about_ca_system_score_gemma":0.000040088504,"threshold_uncertainty_score":0.4672315},"labels":[],"label_agreement":null},{"id":"W4404651431","doi":"10.1007/s10601-024-09377-4","title":"Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver","year":2024,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Solver; Heuristic; Selection (genetic algorithm); Constraint (computer-aided design); Computer science; Problem solver; Mathematical optimization; Value (mathematics); Constraint satisfaction problem; Constraint programming; Artificial intelligence; Mathematics; Machine learning; Stochastic programming","score_opus":0.014978644787270816,"score_gpt":0.2519402801471005,"score_spread":0.2369616353598297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404651431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014666397,0.0004295225,0.9792382,0.0004842143,0.00053252233,0.00025303478,0.000002018879,0.0008859407,0.003508128],"genre_scores_gemma":[0.9170159,0.000049758903,0.08254764,0.00009158952,0.00007392181,0.000021566922,0.0000061676146,0.00001671256,0.00017670696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849284,0.000103850754,0.00029689423,0.00054794975,0.00021456959,0.000343914],"domain_scores_gemma":[0.99938494,0.00018949108,0.000069571615,0.00012477042,0.00007826272,0.00015298033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035244954,0.00020488341,0.00017585796,0.00027470684,0.0002664409,0.0006753871,0.00013358773,0.00009559361,0.00014624847],"category_scores_gemma":[0.00018730477,0.00021067674,0.00006766489,0.00057080894,0.0003309993,0.00044025117,0.00010390622,0.00037679158,0.000041141426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019967354,0.000011730467,0.0012625802,0.00004981092,0.000037498212,0.000067775254,0.0006706637,0.0006676386,0.0021332635,0.0421678,0.000056454173,0.9528728],"study_design_scores_gemma":[0.00047422043,0.00015286746,0.0022199145,0.00028896198,0.000042861033,0.0015359912,0.0003415831,0.97936,0.0003741762,0.001753261,0.012925156,0.0005310091],"about_ca_topic_score_codex":0.000012450026,"about_ca_topic_score_gemma":0.000016566037,"teacher_disagreement_score":0.97869235,"about_ca_system_score_codex":0.0000776888,"about_ca_system_score_gemma":0.00026151937,"threshold_uncertainty_score":0.85911477},"labels":[],"label_agreement":null},{"id":"W4406674306","doi":"10.1016/b978-0-08-026348-9.50012-0","title":"10.1016/b978-0-08-026348-9.50012-0","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Current (fluid); Computer science; Geology; Oceanography","score_opus":0.008442615138288605,"score_gpt":0.17285748499725231,"score_spread":0.1644148698589637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406674306","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.108488e-8,0.000064381784,0.0032694442,0.00042073376,0.000013851439,0.000299387,0.000027908603,0.0004425594,0.9954617],"genre_scores_gemma":[7.474116e-7,0.0000013575193,0.0036587527,0.0001289972,0.00016508477,0.000010121859,0.00004812142,0.000044933244,0.9959419],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835837,0.000020903293,0.0003515058,0.00060273416,0.00037855023,0.0002879651],"domain_scores_gemma":[0.99872345,0.000054611766,0.00013480496,0.0007524375,0.00010566289,0.0002290257],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011708234,0.00036068787,0.00032708296,0.00032726573,0.000120621415,0.00020242431,0.00068167294,0.00026944984,0.9951416],"category_scores_gemma":[0.000013092333,0.00039319822,0.00015625771,0.00009893026,0.00005416244,0.0002530378,0.0001843232,0.00029136695,0.9941295],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009222054,0.0000075281,6.135009e-9,0.0000046437017,0.000025028692,0.000012367312,0.00001274132,0.0002313607,9.868285e-7,0.0018350314,0.07971229,0.9181488],"study_design_scores_gemma":[0.00015830333,0.00007298911,0.0000017981428,0.00005852375,0.000018812367,0.00003479113,8.62871e-8,0.0025180983,0.0000044510866,0.000724545,0.9959597,0.00044787664],"about_ca_topic_score_codex":0.0000052386463,"about_ca_topic_score_gemma":5.213395e-7,"teacher_disagreement_score":0.91770095,"about_ca_system_score_codex":0.00009697397,"about_ca_system_score_gemma":0.00012712131,"threshold_uncertainty_score":0.999852},"labels":[],"label_agreement":null},{"id":"W44067585","doi":"10.1007/11564751_105","title":"From Linear Relaxations to Global Constraint Propagation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constraint (computer-aided design); Computer science; Integer (computer science); Variable (mathematics); Domain (mathematical analysis); Binary number; Linear programming; Local consistency; Binary constraint; Mathematical optimization; Integer programming; Algorithm; Constraint satisfaction; Mathematics; Artificial intelligence; Arithmetic; Geometry; Mathematical analysis; Programming language","score_opus":0.013908387299258218,"score_gpt":0.2522268032851565,"score_spread":0.23831841598589829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44067585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006769242,0.00004779056,0.98752356,0.0042379885,0.0014612523,0.00051641895,0.000035682337,0.00024661593,0.0058630113],"genre_scores_gemma":[0.09037525,0.000013794597,0.9063179,0.0022625143,0.0007555344,0.00001103392,0.00002623882,0.000016461034,0.00022128513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704736,0.000029268082,0.0005161673,0.0012405914,0.0007713427,0.00039527292],"domain_scores_gemma":[0.99811786,0.00018216694,0.00025327798,0.00089583953,0.00031469573,0.00023613124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035261078,0.0003724006,0.00031618864,0.00043542884,0.00022806387,0.0004215855,0.0013432802,0.00026488723,0.00013076108],"category_scores_gemma":[0.00014771534,0.0003730747,0.00009110211,0.000718704,0.00036872216,0.00060015736,0.00052604586,0.00042594696,0.00022010635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002526257,0.00001277331,0.00006205073,0.0000032091189,0.0000061887636,0.000012121822,0.00040355997,0.14974523,0.000037499307,0.030623926,0.000030079245,0.81906086],"study_design_scores_gemma":[0.0002982401,0.0001008611,0.0008987499,0.0002438064,0.000010014689,0.00005008719,4.6996306e-7,0.9219646,0.00034458353,0.07169511,0.0037040706,0.00068944436],"about_ca_topic_score_codex":0.00005429595,"about_ca_topic_score_gemma":0.00036271906,"teacher_disagreement_score":0.8183714,"about_ca_system_score_codex":0.0006531586,"about_ca_system_score_gemma":0.00078961084,"threshold_uncertainty_score":0.99987215},"labels":[],"label_agreement":null},{"id":"W4406771488","doi":"10.1051/itmconf/20257004025","title":"Exploring A Better Way to Constraint Propagation Using Naked Pair","year":2025,"lang":"en","type":"article","venue":"ITM Web of Conferences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Constraint (computer-aided design); Computer science; Mathematics; Geometry","score_opus":0.09120704492266128,"score_gpt":0.2803477713926144,"score_spread":0.1891407264699531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406771488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2996223,0.0000073447977,0.69010127,0.0025743998,0.0003739001,0.00018392815,0.0000016086846,0.00008213941,0.007053128],"genre_scores_gemma":[0.9656604,0.0000053110944,0.033978157,0.00027092505,0.000017466175,0.000018711895,0.0000012213794,0.0000020957173,0.000045717476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991567,0.000050544866,0.0002629244,0.00022409686,0.00017054443,0.00013515631],"domain_scores_gemma":[0.9994231,0.000070359456,0.00008573379,0.00019002832,0.00018440763,0.000046395104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018102916,0.000094010844,0.00014392866,0.00025137558,0.000074674084,0.00010474573,0.00024023297,0.000031875697,0.000066957655],"category_scores_gemma":[0.000063768544,0.0000869573,0.000038507522,0.0004208495,0.000069092814,0.0004321901,0.000073489464,0.00006258907,0.0000066292896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010372037,0.000034807133,0.01830954,0.00004336311,0.000037702073,0.0000026249215,0.00083236024,0.0016407479,0.015727947,0.29239687,0.00011971099,0.67084396],"study_design_scores_gemma":[0.001268282,0.00021092081,0.10336695,0.0008798434,0.000044229244,0.00001367003,0.0013871652,0.7452704,0.12860534,0.00673335,0.011489156,0.0007307243],"about_ca_topic_score_codex":0.00004907607,"about_ca_topic_score_gemma":0.000040277067,"teacher_disagreement_score":0.74362963,"about_ca_system_score_codex":0.00002695063,"about_ca_system_score_gemma":0.00054012064,"threshold_uncertainty_score":0.35460156},"labels":[],"label_agreement":null},{"id":"W44082233","doi":"10.1007/s10472-012-9301-2","title":"On the algebra of regular sets","year":2012,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Isomorphism (crystallography); Algebraic number; Topological space; Completeness (order theory); Set (abstract data type); Algebra over a field; Algebraic structure; Representation (politics); Discrete mathematics; Space (punctuation); Pure mathematics; Computer science","score_opus":0.12480186063662461,"score_gpt":0.3278880560106488,"score_spread":0.20308619537402417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44082233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1802482,0.00009232526,0.81572825,0.00246551,0.00009499359,0.00010519436,0.0000022237255,0.000014676644,0.0012486384],"genre_scores_gemma":[0.9824838,0.00006808755,0.01724345,0.0001787191,0.0000105907175,0.0000019411154,2.3826615e-7,0.000002575255,0.0000106157395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.000021153204,0.00026049934,0.00007177084,0.00014899974,0.00010672696],"domain_scores_gemma":[0.999219,0.00028722652,0.0001455793,0.00022470365,0.000085051994,0.000038417664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049594475,0.00005888459,0.000099087556,0.000043591896,0.000049379454,0.000022596221,0.00017377728,0.000024650473,0.00005670186],"category_scores_gemma":[0.00016146073,0.000040088722,0.000036940128,0.00013619663,0.00009321871,0.00012437928,0.00004862705,0.000042009833,0.000011400506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.872704e-7,0.00007497272,0.000020177853,0.000014454006,0.0000060198613,7.767676e-8,0.0011542811,0.00007897752,0.00040392418,0.9320732,0.00009073697,0.06608223],"study_design_scores_gemma":[0.0000075765383,0.000070888585,0.00020200986,0.00007408382,0.0000044702338,0.0000041585554,0.0005821618,0.08488429,0.30640623,0.60757905,0.00009227835,0.00009276993],"about_ca_topic_score_codex":0.0000034431446,"about_ca_topic_score_gemma":0.0000010595242,"teacher_disagreement_score":0.8022356,"about_ca_system_score_codex":0.0000011650184,"about_ca_system_score_gemma":0.000008256639,"threshold_uncertainty_score":0.16347706},"labels":[],"label_agreement":null},{"id":"W4408555454","doi":"10.1017/bsl.2024.4","title":"New Results in Model Theory and Set Theory","year":2024,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Set (abstract data type); Computer science; Mathematical economics; Mathematics; Programming language","score_opus":0.016301755293555473,"score_gpt":0.25096296936856144,"score_spread":0.23466121407500595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408555454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025682268,0.00081916986,0.9571494,0.006843386,0.00015525876,0.00013139892,0.000007069577,0.00015107024,0.03217503],"genre_scores_gemma":[0.9593489,0.00019579702,0.036084514,0.0006027699,0.000029967836,0.0000041614635,0.0000028093443,0.0000065321697,0.0037245522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992068,0.000114936905,0.00020673146,0.00025372568,0.00010072998,0.00011708162],"domain_scores_gemma":[0.9994198,0.00029074404,0.000033699434,0.0001892256,0.000017184871,0.000049327115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008220454,0.00008192266,0.00010997727,0.00013049733,0.000021812197,0.000059431415,0.000172275,0.00005519322,0.00014240254],"category_scores_gemma":[0.00011390863,0.00006895988,0.000027998985,0.0001637189,0.000047840633,0.000048171554,0.00009191516,0.00009605833,0.000041704683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021962749,0.000006368235,0.000017863793,0.000015488962,0.000004884943,0.0000069596967,0.0012029795,0.0033373851,0.00004492706,0.91457266,0.0038225462,0.076945975],"study_design_scores_gemma":[0.00073295966,0.000063352774,0.002267652,0.00014485905,0.000009484536,0.00005046522,0.00018038912,0.18562654,0.00018625717,0.7996445,0.010850751,0.00024280757],"about_ca_topic_score_codex":0.000025993553,"about_ca_topic_score_gemma":0.0000036840113,"teacher_disagreement_score":0.9567807,"about_ca_system_score_codex":0.000014796343,"about_ca_system_score_gemma":0.00007553628,"threshold_uncertainty_score":0.28121024},"labels":[],"label_agreement":null},{"id":"W4409365296","doi":"10.1609/aaai.v39i13.33504","title":"Eliminating Majority Illusion Is Easy","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Illusion; Computer science; Psychology; Cognitive psychology","score_opus":0.04328878055188072,"score_gpt":0.2932474765714565,"score_spread":0.24995869601957577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087059826,0.00003781833,0.698272,0.03246696,0.002014673,0.0008868395,0.00000767339,0.0003515103,0.17890269],"genre_scores_gemma":[0.9901186,0.000030405849,0.008044362,0.00075528695,0.000023072877,0.000006678604,2.2279424e-7,0.0000043112436,0.0010170112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998634,0.000014098493,0.0004187073,0.00038432368,0.00033623184,0.0002126364],"domain_scores_gemma":[0.99875015,0.000072668896,0.00024644486,0.00024092068,0.0006428577,0.000046973568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036023933,0.00015258031,0.00016544136,0.00016581845,0.00028399384,0.00022353661,0.0011231429,0.00008090729,0.00012839532],"category_scores_gemma":[0.0003749011,0.00012185941,0.00009408506,0.0008786514,0.00016488193,0.00036871925,0.00039831235,0.00022563976,0.00004457515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115682815,0.00004372793,0.00043582488,0.000022612403,0.000006265722,9.7422145e-8,0.00054291,0.000039342838,0.0103227915,0.7997154,0.00014244871,0.18871702],"study_design_scores_gemma":[0.000035540517,0.00006558568,0.0016660189,0.00032825372,0.000012068424,0.0000023847203,0.0005016265,0.23578578,0.56674314,0.19421105,0.0004458536,0.00020269578],"about_ca_topic_score_codex":0.000028564638,"about_ca_topic_score_gemma":0.0000057926804,"teacher_disagreement_score":0.9030588,"about_ca_system_score_codex":0.000052603948,"about_ca_system_score_gemma":0.00011050139,"threshold_uncertainty_score":0.49692824},"labels":[],"label_agreement":null},{"id":"W4409365321","doi":"10.1609/aaai.v39i11.33208","title":"Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Dual (grammatical number); Decomposition; Lagrangian; Constraint (computer-aided design); Computer science; Mathematical optimization; Constraint programming; Artificial intelligence; Mathematics; Applied mathematics; Stochastic programming; Chemistry","score_opus":0.02759433636576968,"score_gpt":0.2845751334361449,"score_spread":0.2569807970703752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6866004,0.000022394463,0.27703798,0.0070371036,0.00044504975,0.0014130113,0.0000016002958,0.0006699761,0.0267725],"genre_scores_gemma":[0.9838174,0.000017996652,0.015859572,0.000105140076,0.0000148441895,0.000034452267,0.0000018118702,0.000009111612,0.00013967392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982514,0.000057683625,0.0005128973,0.0004768579,0.00036312942,0.00033804632],"domain_scores_gemma":[0.998858,0.00010958556,0.00028454093,0.00015035417,0.0005309268,0.00006664559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005371284,0.0002235293,0.0002563036,0.00033098808,0.00031692718,0.0004606364,0.00058376935,0.00010526559,0.00003619137],"category_scores_gemma":[0.00020944627,0.00018184008,0.00007799173,0.0013231434,0.00023043666,0.00043946525,0.00015757898,0.00055574556,0.000012356319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013239899,0.00024469706,0.013828319,0.00008759195,0.00004195204,0.000002803478,0.004660676,0.0037225708,0.012692414,0.5950762,0.000010170413,0.3695002],"study_design_scores_gemma":[0.00035819339,0.00086476386,0.004285985,0.0012253905,0.000049212566,0.00003345654,0.006011173,0.81638676,0.15595917,0.013822477,0.00038198332,0.0006214183],"about_ca_topic_score_codex":0.000045086857,"about_ca_topic_score_gemma":0.0000499744,"teacher_disagreement_score":0.8126642,"about_ca_system_score_codex":0.00010319418,"about_ca_system_score_gemma":0.0002207502,"threshold_uncertainty_score":0.7415223},"labels":[],"label_agreement":null},{"id":"W4409975021","doi":"10.3389/fcomp.2025.1543074","title":"NeuralConstraints: integrating a neural generative model with constraint-based composition","year":2025,"lang":"en","type":"article","venue":"Frontiers in Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Generative grammar; Constraint (computer-aided design); Composition (language); Generative model; Computer science; Artificial intelligence; Artificial neural network; Mathematics; Linguistics; Philosophy","score_opus":0.008746104072277812,"score_gpt":0.23497980961002066,"score_spread":0.22623370553774286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409975021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00789871,0.000021910811,0.9871362,0.0026266442,0.0011019188,0.00030644448,0.000003207791,0.00018384882,0.0007211425],"genre_scores_gemma":[0.473232,0.0000010103726,0.5255027,0.0012308644,0.00001008647,0.000011401313,0.000002063667,0.0000027215394,0.0000071822105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803007,0.000086863954,0.00033820458,0.0007536821,0.00037417965,0.0004169945],"domain_scores_gemma":[0.99903893,0.000059527494,0.000118010445,0.00043979535,0.00023640238,0.00010730547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004368509,0.00021991416,0.00023431615,0.00081729406,0.00035437665,0.000551029,0.0009499661,0.00005374595,0.0000027396613],"category_scores_gemma":[0.00002196835,0.0001953629,0.000047707057,0.0021901694,0.0009848762,0.0012011267,0.00016492816,0.00026551186,0.0000010954535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012350275,0.000047208552,0.0056655225,0.000008609834,0.0000068919408,0.000014496306,0.0003235778,0.69998264,0.0005181784,0.02255912,0.0002951342,0.27056628],"study_design_scores_gemma":[0.00066756346,0.00005925675,0.0015423616,0.000092622664,0.0000036549127,0.000016905104,0.000043451404,0.99454015,0.0013490239,0.0014665312,0.0000075246176,0.0002109543],"about_ca_topic_score_codex":0.000008470067,"about_ca_topic_score_gemma":0.000014150451,"teacher_disagreement_score":0.46533328,"about_ca_system_score_codex":0.00024222891,"about_ca_system_score_gemma":0.00087499555,"threshold_uncertainty_score":0.79666674},"labels":[],"label_agreement":null},{"id":"W4410863954","doi":"10.1007/978-3-031-84756-1_5","title":"Constraint-Based PCGML Approaches","year":2025,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on games and computational intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Sudbury; University of Alberta","funders":"","keywords":"Constraint (computer-aided design); Computer science; Mathematics; Geometry","score_opus":0.03381293457507704,"score_gpt":0.23944476744043136,"score_spread":0.20563183286535433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410863954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018916871,0.00042752977,0.81474245,0.0019402851,0.00018162625,0.00022739076,0.000035677458,0.00014567829,0.18229747],"genre_scores_gemma":[0.58739334,0.00067685416,0.3106849,0.009405544,0.00031284263,0.00017412586,0.00017529697,0.00011815589,0.09105895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814105,0.00005184479,0.00042125583,0.0007734011,0.00040025223,0.0002121745],"domain_scores_gemma":[0.9975026,0.0016571095,0.00022425651,0.000354756,0.0001519439,0.000109321525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016541297,0.0004261225,0.00037837206,0.00042890123,0.00019372549,0.00029258762,0.00046538297,0.0002656215,0.00034091316],"category_scores_gemma":[0.00012925144,0.00040130556,0.00017865552,0.00009711875,0.00028886847,0.000095518146,0.00009276319,0.00035753986,0.000044744324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008323085,0.000011866358,0.0000032283572,0.0000277402,0.000042020536,0.0000041220737,0.00002687549,0.075193495,3.2539506e-7,0.5067878,0.0003570864,0.41753715],"study_design_scores_gemma":[0.00010198688,0.00011506926,0.000115507486,0.0006913348,0.0000629217,0.00003288534,0.000020507812,0.7088698,0.00062077504,0.2696413,0.018897401,0.0008304918],"about_ca_topic_score_codex":0.000004241347,"about_ca_topic_score_gemma":0.000007324942,"teacher_disagreement_score":0.6336763,"about_ca_system_score_codex":0.00007221641,"about_ca_system_score_gemma":0.00035348182,"threshold_uncertainty_score":0.9998439},"labels":[],"label_agreement":null},{"id":"W4410907218","doi":"10.21428/d82e957c.be853a08","title":"Adaptformer: Sequence Models as Adaptive Iterative Planners","year":2025,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Computer science; Biology; Genetics","score_opus":0.030658374975443096,"score_gpt":0.27576643488777614,"score_spread":0.24510805991233303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410907218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001692073,0.000014938665,0.7719509,0.0009610854,0.0001598235,0.00009920068,0.0000016521112,0.00015640259,0.22648682],"genre_scores_gemma":[0.849201,0.000019572533,0.141432,0.0021897224,0.000008308334,0.00001542931,0.000003366087,0.0000026058265,0.007127975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.000035028384,0.00013682756,0.0002567717,0.00012652866,0.00014246377],"domain_scores_gemma":[0.9995434,0.00006910259,0.000035184636,0.00020506639,0.00009856963,0.00004867343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093445866,0.000094524046,0.00008632244,0.00013023426,0.000110593624,0.000117726726,0.00025402175,0.00004201423,0.00009205673],"category_scores_gemma":[0.000015065565,0.000083818144,0.000034650013,0.00038438366,0.000042214877,0.0009933744,0.000080194535,0.00008208591,0.000058639886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055815826,0.000007466556,0.000031932384,0.0000012146266,0.000009996919,0.0000032298972,0.00039679013,0.021155598,0.000059632788,0.9235985,0.000934383,0.053795654],"study_design_scores_gemma":[0.00016065154,0.000031132106,0.00006223765,0.000016384836,0.000002440959,0.0000070334813,0.00019959293,0.9567651,0.0007932085,0.041038975,0.0008199105,0.00010329191],"about_ca_topic_score_codex":0.00006911277,"about_ca_topic_score_gemma":0.00003749952,"teacher_disagreement_score":0.9356095,"about_ca_system_score_codex":0.000061599196,"about_ca_system_score_gemma":0.00018699668,"threshold_uncertainty_score":0.34180048},"labels":[],"label_agreement":null},{"id":"W4411115412","doi":"10.1007/978-3-031-93706-4_19","title":"Visualizing Temporal Interval Hierarchies","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Interval (graph theory); Interval temporal logic; Theoretical computer science; Temporal logic; Mathematics; Combinatorics","score_opus":0.015651968258441666,"score_gpt":0.26737659442184936,"score_spread":0.2517246261634077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411115412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001540423,0.00016733128,0.9832705,0.0012356929,0.0022456385,0.0002452009,0.000003698614,0.00024881115,0.012567714],"genre_scores_gemma":[0.09518265,0.0000721344,0.89892036,0.002807283,0.00036282727,0.0000091490565,0.000013264303,0.000027115431,0.0026052336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972792,0.000036931306,0.0004868979,0.0011331916,0.0006302495,0.0004334926],"domain_scores_gemma":[0.9983406,0.00030732728,0.00020729685,0.00084365153,0.00018400668,0.00011709714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005177317,0.00039762596,0.00040199116,0.0012784415,0.000254584,0.00066770415,0.0018882685,0.00022210657,0.0000517414],"category_scores_gemma":[0.00009087711,0.00038671723,0.00013341398,0.0006551037,0.0005474381,0.00064923643,0.0011931072,0.0006485049,0.000026329622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030550984,0.000010510394,0.00015980497,0.00002809563,0.000008864241,0.000030939667,0.0004450119,0.00829934,0.000019796842,0.06683643,0.000060180308,0.92409796],"study_design_scores_gemma":[0.0002829887,0.00010861961,0.000255247,0.0006873098,0.000007671391,0.000057080142,3.3097936e-7,0.8801655,0.000466902,0.111780554,0.0054871254,0.0007006548],"about_ca_topic_score_codex":0.000023327142,"about_ca_topic_score_gemma":0.00012464443,"teacher_disagreement_score":0.9233973,"about_ca_system_score_codex":0.0002543963,"about_ca_system_score_gemma":0.0006992255,"threshold_uncertainty_score":0.9998585},"labels":[],"label_agreement":null},{"id":"W4411745362","doi":"10.1007/978-3-031-95976-9_10","title":"Acquiring and Selecting Implied Constraints with an Application to the BinSeq and Partition Global Constraints","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Partition (number theory); Operations research; Mathematics; Combinatorics","score_opus":0.009250595105475018,"score_gpt":0.24457206056063055,"score_spread":0.23532146545515553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078172307,0.000043038515,0.99508214,0.0014642974,0.00021850657,0.00059389276,0.000008901214,0.00011492587,0.0016925599],"genre_scores_gemma":[0.7766515,0.000014961823,0.22172336,0.0014895452,0.00007601111,0.000016042432,0.000005161525,0.0000076079746,0.000015792388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796885,0.000033282235,0.0002808233,0.0010276153,0.0003602269,0.00032917032],"domain_scores_gemma":[0.99882257,0.00018591252,0.00015470551,0.00050228357,0.00017640209,0.00015814062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051462074,0.00029127617,0.00023597224,0.00024911886,0.00042921683,0.00065634056,0.0005729161,0.00013585851,0.0000071685804],"category_scores_gemma":[0.000045965902,0.00022967544,0.000020619735,0.00054962264,0.0010729182,0.00042417945,0.00037163834,0.00027415727,0.0000028774227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063165876,0.0000053880162,0.0004968211,0.00001331629,0.0000066728285,0.000003960846,0.0003365388,0.008664353,0.00005953221,0.036977574,0.0000027451804,0.9534268],"study_design_scores_gemma":[0.00068632845,0.000342781,0.007231219,0.0004998927,0.000027600832,0.0005731989,0.000006244332,0.9474253,0.00045318552,0.041559402,0.00033734858,0.00085752225],"about_ca_topic_score_codex":0.0000182235,"about_ca_topic_score_gemma":0.00042848056,"teacher_disagreement_score":0.95256925,"about_ca_system_score_codex":0.00016046189,"about_ca_system_score_gemma":0.00038236368,"threshold_uncertainty_score":0.9365893},"labels":[],"label_agreement":null},{"id":"W4411745417","doi":"10.1007/978-3-031-95976-9","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Uppsala Universitet; Université de Montréal; Université de Fribourg; Technische Universiteit Delft; Centre National de la Recherche Scientifique; University of Toronto","keywords":"Computer science; Constraint programming; Constraint satisfaction; Constraint (computer-aided design); Artificial intelligence; Programming language; Operations research; Mathematical optimization; Stochastic programming; Engineering","score_opus":0.054452086918164944,"score_gpt":0.33744593228945874,"score_spread":0.2829938453712938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005588847,0.00010701841,0.9960884,0.0008945239,0.0006639597,0.00057199335,0.0000047432386,0.00006308476,0.0015504231],"genre_scores_gemma":[0.15206608,0.00006131795,0.8471776,0.00016594105,0.00012499357,0.000025735444,0.000013885634,0.000008184536,0.0003562206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973635,0.0001268167,0.0005713446,0.000859596,0.0007162969,0.0003624341],"domain_scores_gemma":[0.99792874,0.0005246302,0.0000933708,0.0005908188,0.00077200454,0.000090466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016942784,0.00022399833,0.0003003277,0.0015864806,0.00029941284,0.000621748,0.0010258626,0.00022634584,0.000014699872],"category_scores_gemma":[0.0004374835,0.00021031026,0.000050850034,0.0019443854,0.0016834739,0.0004404957,0.0005985702,0.000738076,0.0000037005602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017306993,0.000024220844,0.000007975205,0.000024816176,0.00000348233,0.0000032151577,0.0007572982,0.03195061,0.00011575833,0.12159809,0.000011767623,0.84550107],"study_design_scores_gemma":[0.00004555085,0.00013240264,0.00006188295,0.000384072,0.0000039346073,0.000017712786,0.000003808291,0.89809674,0.0027310692,0.09808939,0.0002234889,0.00020996758],"about_ca_topic_score_codex":0.000050573424,"about_ca_topic_score_gemma":0.000698486,"teacher_disagreement_score":0.8661461,"about_ca_system_score_codex":0.00025085866,"about_ca_system_score_gemma":0.002357042,"threshold_uncertainty_score":0.8576203},"labels":[],"label_agreement":null},{"id":"W4411745903","doi":"10.1007/978-3-031-95973-8","title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Uppsala Universitet; Université de Montréal; Université de Fribourg; Technische Universiteit Delft; Centre National de la Recherche Scientifique; University of Toronto","keywords":"Computer science; Constraint programming; Constraint (computer-aided design); Artificial intelligence; Constraint satisfaction; Operations research; Mathematical optimization; Stochastic programming","score_opus":0.054452086918164944,"score_gpt":0.33744593228945874,"score_spread":0.2829938453712938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005588847,0.00010701841,0.9960884,0.0008945239,0.0006639597,0.00057199335,0.0000047432386,0.00006308476,0.0015504231],"genre_scores_gemma":[0.15206608,0.00006131795,0.8471776,0.00016594105,0.00012499357,0.000025735444,0.000013885634,0.000008184536,0.0003562206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973635,0.0001268167,0.0005713446,0.000859596,0.0007162969,0.0003624341],"domain_scores_gemma":[0.99792874,0.0005246302,0.0000933708,0.0005908188,0.00077200454,0.000090466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016942784,0.00022399833,0.0003003277,0.0015864806,0.00029941284,0.000621748,0.0010258626,0.00022634584,0.000014699872],"category_scores_gemma":[0.0004374835,0.00021031026,0.000050850034,0.0019443854,0.0016834739,0.0004404957,0.0005985702,0.000738076,0.0000037005602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017306993,0.000024220844,0.000007975205,0.000024816176,0.00000348233,0.0000032151577,0.0007572982,0.03195061,0.00011575833,0.12159809,0.000011767623,0.84550107],"study_design_scores_gemma":[0.00004555085,0.00013240264,0.00006188295,0.000384072,0.0000039346073,0.000017712786,0.000003808291,0.89809674,0.0027310692,0.09808939,0.0002234889,0.00020996758],"about_ca_topic_score_codex":0.000050573424,"about_ca_topic_score_gemma":0.000698486,"teacher_disagreement_score":0.8661461,"about_ca_system_score_codex":0.00025085866,"about_ca_system_score_gemma":0.002357042,"threshold_uncertainty_score":0.8576203},"labels":[],"label_agreement":null},{"id":"W4412887130","doi":"10.18653/v1/2025.acl-demo.36","title":"FORG3D: Flexible Object Rendering for Generating Vision-Language Spatial Reasoning Data from 3D Scenes","year":2025,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Rendering (computer graphics); Artificial intelligence; Computer vision; Computer graphics (images); Spatial intelligence; Image-based modeling and rendering; Object based; Object (grammar)","score_opus":0.02668598038903537,"score_gpt":0.32082598436422766,"score_spread":0.2941400039751923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412887130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002134809,0.00011320672,0.99264497,0.00039526416,0.0006014439,0.00018667044,0.00002356303,0.00031207982,0.0035880166],"genre_scores_gemma":[0.21233174,0.00000978711,0.7861642,0.0004065885,0.00012239539,0.000011773116,0.0001457405,0.000006869134,0.00080089114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989511,0.000030474588,0.00022303392,0.00048484548,0.00012844415,0.0001821003],"domain_scores_gemma":[0.9989445,0.00018046031,0.000065578526,0.00071693276,0.00005271528,0.000039801114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023705182,0.00010858803,0.00012315362,0.00010460326,0.000272425,0.000358773,0.0005601601,0.00004982619,0.00010336017],"category_scores_gemma":[0.00019823297,0.00010437287,0.00003134585,0.00022731244,0.000015094965,0.0006630619,0.0004746712,0.0000649297,0.0000062332724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011314859,0.00002104033,0.0011021121,0.00001812581,0.00003801672,0.00000237967,0.00043505346,0.008673875,0.006764793,0.007954971,0.0028183968,0.9721599],"study_design_scores_gemma":[0.00035289844,0.000013559537,0.00086843787,0.000052961488,0.000008090015,0.000001354479,0.00012223392,0.9922208,0.004983232,0.00018797173,0.0010675082,0.00012094078],"about_ca_topic_score_codex":0.0007691866,"about_ca_topic_score_gemma":0.001022105,"teacher_disagreement_score":0.9835469,"about_ca_system_score_codex":0.000033285927,"about_ca_system_score_gemma":0.000120937046,"threshold_uncertainty_score":0.4256202},"labels":[],"label_agreement":null},{"id":"W4413019768","doi":"10.1016/j.tcs.2025.115502","title":"On the complexity of temporal arborescence reconfiguration","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Control reconfiguration; Computer science; Theoretical computer science; Mathematics; Combinatorics; Distributed computing; Embedded system","score_opus":0.02032966206416888,"score_gpt":0.2598789923358944,"score_spread":0.2395493302717255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413019768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008472284,0.0000029894338,0.96772087,0.009276794,0.00043722754,0.000157844,9.1997236e-7,0.00007510174,0.013855967],"genre_scores_gemma":[0.94558316,0.0000014250643,0.053315453,0.0010719319,0.000012688785,0.0000033925216,4.392215e-7,0.0000014041232,0.000010076382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987473,0.000114034,0.00023667292,0.00033967083,0.000369849,0.00019248709],"domain_scores_gemma":[0.9987397,0.0003348333,0.000077064746,0.0005992906,0.0001935788,0.000055530254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00095884793,0.000093403134,0.0001124607,0.00015612718,0.00031705652,0.00017709994,0.0012618994,0.000027520387,0.00008044237],"category_scores_gemma":[0.00017845645,0.00006230039,0.00004081279,0.001208213,0.004444206,0.00027100224,0.00024224982,0.00013130467,0.00001551446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051785237,0.00002286717,0.00007780362,0.0000026929063,0.0000017408073,3.7806637e-7,0.00008326186,0.00028009756,0.00024808495,0.9770541,0.00008352475,0.022140272],"study_design_scores_gemma":[0.00007528799,0.000051650204,0.004427812,0.000029595105,0.0000012427275,0.0000017951153,0.000004052205,0.5497103,0.006011894,0.43960893,0.000020918973,0.00005657187],"about_ca_topic_score_codex":0.0000045635848,"about_ca_topic_score_gemma":0.0000017919997,"teacher_disagreement_score":0.9371109,"about_ca_system_score_codex":0.000036731453,"about_ca_system_score_gemma":0.00016307941,"threshold_uncertainty_score":0.99826515},"labels":[],"label_agreement":null},{"id":"W4413423565","doi":"10.1016/b978-0-443-30046-2.00002-8","title":"Employing a large language model to solve constraint satisfaction","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Constraint (computer-aided design); Constraint satisfaction problem; Constraint satisfaction; Psychology; Artificial intelligence; Mathematics","score_opus":0.01494349160787301,"score_gpt":0.2574384219844211,"score_spread":0.24249493037654807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413423565","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010377069,0.00006403989,0.3931191,0.00019030459,0.0003614421,0.00045607646,0.000051676874,0.00026893418,0.60547805],"genre_scores_gemma":[0.003479342,0.000026833002,0.08996642,0.002289508,0.000102475686,0.00005105596,0.000023918847,0.00004343623,0.90401703],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802154,0.000018838065,0.00048387717,0.0007211282,0.00038367778,0.0003709652],"domain_scores_gemma":[0.99860686,0.00006365538,0.00020056035,0.0007817894,0.00015133225,0.00019579197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025189915,0.0004164235,0.0004248524,0.0004459025,0.00021299816,0.00021567082,0.00040753477,0.0003038483,0.00017907502],"category_scores_gemma":[0.00003425045,0.00045095608,0.00022083911,0.000047321886,0.00005043902,0.00015289563,0.00034289696,0.00045876365,0.00017595977],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023944272,0.0000030566487,0.000008629656,0.000027800226,0.0000400977,0.00001433255,0.00077782496,0.0002786047,0.000037245514,0.17805286,0.00029387997,0.8204633],"study_design_scores_gemma":[0.0020160389,0.0001445598,0.00031271015,0.0023701922,0.00028036005,0.00013641482,0.0001845953,0.2009413,0.00026928922,0.045702998,0.74419886,0.003442688],"about_ca_topic_score_codex":0.0000020504026,"about_ca_topic_score_gemma":0.00019525214,"teacher_disagreement_score":0.8170206,"about_ca_system_score_codex":0.00021860214,"about_ca_system_score_gemma":0.00040807028,"threshold_uncertainty_score":0.99979424},"labels":[],"label_agreement":null},{"id":"W4413607422","doi":"10.28924/2291-8639-23-2025-210","title":"b∗-I-Open Sets and Their Role in Weaker Forms of Paracompactness","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.006525533811740857,"score_gpt":0.29377912076507984,"score_spread":0.28725358695333897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413607422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0865891,0.00015503567,0.9090919,0.0023636671,0.000026859725,0.00007779241,0.00000655227,0.0000030205747,0.0016861062],"genre_scores_gemma":[0.99524283,0.0001933387,0.004411186,0.000102442995,0.000007741949,0.0000056166077,0.000003113509,9.457159e-7,0.000032788856],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994369,0.000018162102,0.00031536573,0.000093550625,0.00009465436,0.000041335083],"domain_scores_gemma":[0.9993587,0.00007066557,0.00022563337,0.000094591895,0.00022169159,0.000028679853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002194776,0.000047392852,0.00015583712,0.00048605923,0.000028818455,0.0001248497,0.00041164082,0.00002027416,0.00001263749],"category_scores_gemma":[0.000011188215,0.000036179492,0.000053840366,0.000540702,0.000031148655,0.00034527894,0.00013250737,0.000055661545,2.199114e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021934535,0.00017527452,0.19554576,0.0000058979135,0.0009345823,0.0000012611843,0.00056716695,0.004802786,0.000979592,0.24124207,0.00005382835,0.55566984],"study_design_scores_gemma":[0.00091362506,0.000025283558,0.8082805,0.000052765707,0.00011857954,0.000026822607,0.00060515164,0.12974097,0.0014589939,0.054341044,0.00431515,0.00012107192],"about_ca_topic_score_codex":0.00003761998,"about_ca_topic_score_gemma":0.00012918097,"teacher_disagreement_score":0.90865374,"about_ca_system_score_codex":0.000017784692,"about_ca_system_score_gemma":0.000047750007,"threshold_uncertainty_score":0.1475357},"labels":[],"label_agreement":null},{"id":"W4413966168","doi":"10.70930/tac/p5n2c9jt","title":"On the representability of actionsin a semi-abelian category","year":2005,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Abelian group; Mathematics; Pure mathematics; Computer science","score_opus":0.00919660504193312,"score_gpt":0.24636104432325354,"score_spread":0.23716443928132042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05815215,0.00010476628,0.9273224,0.0031524454,0.000029515963,0.00035954398,0.0000076778,0.000065273314,0.010806226],"genre_scores_gemma":[0.99816823,0.00003928841,0.0014038398,0.000099736426,0.00001879408,0.000059000187,0.0000022300596,0.000002619985,0.00020627388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993945,0.000102533675,0.00019151211,0.00015110313,0.00009444242,0.00006593678],"domain_scores_gemma":[0.998721,0.00054854923,0.000114319744,0.00050167955,0.00008813991,0.000026323596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004925329,0.000063262385,0.000088373825,0.00005803748,0.00014549673,0.000020204181,0.00021737872,0.000029433311,0.00007301102],"category_scores_gemma":[0.000061094324,0.000046209127,0.000030160933,0.000273182,0.00031911035,0.00016961734,0.000051531057,0.00006458443,0.0000061915694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012297595,0.0000384541,0.00008658636,0.000006502637,0.0000071220875,1.3173802e-8,0.00042893342,0.00026931963,0.00065129815,0.9371091,0.00008043092,0.061309934],"study_design_scores_gemma":[0.00020275931,0.000053022824,0.0034385012,0.000008885603,0.000018550845,0.000008714032,0.0011283406,0.0026264056,0.06728316,0.91928166,0.005809045,0.00014097485],"about_ca_topic_score_codex":0.000014111987,"about_ca_topic_score_gemma":0.000009391581,"teacher_disagreement_score":0.9400161,"about_ca_system_score_codex":0.000009828271,"about_ca_system_score_gemma":0.000038662296,"threshold_uncertainty_score":0.18843535},"labels":[],"label_agreement":null},{"id":"W4414360062","doi":"10.24963/ijcai.2025/293","title":"Constrained Sequential Inference in Machine Learning Using Constraint Programming","year":2025,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Sequence (biology); Inference; Constraint (computer-aided design); Context (archaeology); Structured prediction; Constraint programming; Constraint satisfaction; Approximate inference","score_opus":0.02369297047802258,"score_gpt":0.2964788435802679,"score_spread":0.2727858731022453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414360062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009196639,0.000021953107,0.9815275,0.0004601961,0.00021034775,0.00019367665,6.43022e-7,0.00023780455,0.008151238],"genre_scores_gemma":[0.8290366,0.000005410614,0.17062056,0.00015072447,0.00000611458,0.0000050604704,0.0000033064862,0.0000026271666,0.00016959474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897826,0.00008869919,0.0002909249,0.00028777352,0.00012089988,0.0002334283],"domain_scores_gemma":[0.9995363,0.00013188948,0.00006473782,0.00015273454,0.00006694859,0.00004743447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002726834,0.0001173638,0.00014018793,0.00030429038,0.00011540634,0.00020346047,0.00020694158,0.000062246225,0.00013330345],"category_scores_gemma":[0.00018626252,0.00011912734,0.000039410792,0.0006867157,0.00011103072,0.00032803428,0.0001254057,0.00022553555,0.0000051104776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060464795,0.000048665865,0.05252443,0.000022238302,0.000019775041,0.000025047362,0.0003390651,0.041428924,0.0022714825,0.3697979,0.0000036251126,0.53351283],"study_design_scores_gemma":[0.0005685997,0.000016185497,0.0012630426,0.00005444635,0.0000038353305,0.000013709221,0.000116549345,0.9959569,0.000549683,0.0007273013,0.0005856596,0.00014409849],"about_ca_topic_score_codex":0.00022543447,"about_ca_topic_score_gemma":0.00026716493,"teacher_disagreement_score":0.954528,"about_ca_system_score_codex":0.0000853011,"about_ca_system_score_gemma":0.00030059586,"threshold_uncertainty_score":0.48578718},"labels":[],"label_agreement":null},{"id":"W4414360353","doi":"10.24963/ijcai.2025/1086","title":"Towards the 30 by 30 Kunming-Montreal Global Biodiversity Framework Target: Optimising Graph Connectivity in Constraint-Based Spatial Planning","year":2025,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Budget constraint; Biodiversity; Key (lock); Ecosystem services; Landscape connectivity; Graph theory; Ecological network","score_opus":0.012198840981019166,"score_gpt":0.2483735848920476,"score_spread":0.23617474391102844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414360353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148780085,0.00005309694,0.9709166,0.004372136,0.00044828045,0.00023512772,0.00004834977,0.00020221421,0.008846153],"genre_scores_gemma":[0.9536363,0.0000030451602,0.044460002,0.0018582183,0.000012382095,0.0000050729445,0.000012894551,0.0000017590556,0.000010320135],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860984,0.00015891578,0.00023982913,0.0004408637,0.00023933206,0.0003112163],"domain_scores_gemma":[0.9991569,0.00028064538,0.000092571565,0.00031781298,0.000075499185,0.000076562916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003749783,0.00018633158,0.00019753791,0.00011569161,0.00033897895,0.00026060207,0.0004587697,0.00014768713,0.00031150115],"category_scores_gemma":[0.00015487427,0.0001589045,0.0000868833,0.0006916793,0.0002054502,0.00023522873,0.0001495234,0.00026911072,0.000015496342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009338439,0.00032394737,0.4414908,0.000036207635,0.00013080095,0.00007217969,0.0012782897,0.13944057,0.00006311471,0.04437587,0.010251538,0.3624433],"study_design_scores_gemma":[0.0020489683,0.00007878202,0.21258496,0.00014520681,0.000028218166,0.0000083544855,0.0006782335,0.77243334,0.00095157203,0.009435857,0.0010091121,0.00059737347],"about_ca_topic_score_codex":0.0026545464,"about_ca_topic_score_gemma":0.00029070964,"teacher_disagreement_score":0.9387583,"about_ca_system_score_codex":0.00017397321,"about_ca_system_score_gemma":0.00033825648,"threshold_uncertainty_score":0.64799374},"labels":[],"label_agreement":null},{"id":"W4414393610","doi":"10.1142/s0219498827500423","title":"A generalization of (D + M)-construction","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Subring; Multiplicative function; Prime ideal; Algebra over a field; Valuation ring; Ideal (ethics); Integral domain; Von Neumann architecture; Commutative algebra","score_opus":0.0055575224939623255,"score_gpt":0.238142682624167,"score_spread":0.23258516013020467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414393610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014791451,0.00034050617,0.9823854,0.0013200801,0.000097741045,0.00008663119,8.811176e-7,0.000010377127,0.0009669514],"genre_scores_gemma":[0.92601836,0.00058112014,0.0731125,0.00014619406,0.00003716143,0.0000060677507,0.000001110743,0.0000020233322,0.00009547335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999521,0.000016821272,0.0002751713,0.000066155975,0.00008002009,0.00004078957],"domain_scores_gemma":[0.9993555,0.000031841606,0.00022971784,0.00008691363,0.0002679091,0.000028098548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102064405,0.000039180817,0.0000849507,0.00019361291,0.000058800953,0.000029062676,0.00011381849,0.000029045836,0.000010582571],"category_scores_gemma":[0.000021876727,0.000035648973,0.000030622086,0.00039057698,0.000023604596,0.00027936258,0.000022602831,0.000046715304,7.599953e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021863725,0.00002075407,0.0007336949,0.000013619921,0.000017374665,1.0561814e-7,0.00007382591,0.00029513822,0.0035630472,0.8714111,0.00016671784,0.12370244],"study_design_scores_gemma":[0.004705216,0.00045324265,0.13283274,0.000425253,0.00034873642,0.00079770404,0.0007595348,0.2820519,0.1078272,0.378219,0.09076863,0.00081084005],"about_ca_topic_score_codex":7.4387845e-7,"about_ca_topic_score_gemma":8.56813e-7,"teacher_disagreement_score":0.91122687,"about_ca_system_score_codex":0.000012182752,"about_ca_system_score_gemma":0.000078336925,"threshold_uncertainty_score":0.1453723},"labels":[],"label_agreement":null},{"id":"W4415249498","doi":"10.1140/epjc/s10052-025-14836-0","title":"Testing T2K’s Bayesian constraints with priors in alternate parameterisations","year":2025,"lang":"en","type":"article","venue":"The European Physical Journal C","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; TRIUMF; Institute of Particle Physics","funders":"FP7 Ideas: European Research Council; H2020 European Research Council; European Regional Development Fund; Staatssekretariat für Bildung, Forschung und Innovation; Japan Society for the Promotion of Science; Institut National de Physique Nucléaire et de Physique des Particules; Science and Technology Facilities Council; National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; Commissariat à l'Énergie Atomique et aux Énergies Alternatives; Centre National de la Recherche Scientifique; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Agency for Cultural Affairs, Government of Japan; University of Tokyo; Ministerio de Ciencia, Tecnología e Innovación Productiva; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; H2020 Marie Skłodowska-Curie Actions; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Canada Foundation for Innovation; CERN; Ministerstwo Edukacji i Nauki; Centres de Recerca de Catalunya; Deutsche Forschungsgemeinschaft; UK Research and Innovation; Consejería de Economía, Innovación, Ciencia y Empleo, Junta de Andalucía; Russian Science Foundation; Ministerio de Ciencia, Tecnología e Innovación; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche; “la Caixa” Foundation; Instituto Nazionale di Fisica Nucleare; Ministerio de Ciencia e Innovación; Narodowe Centrum Nauki; U.S. Department of Energy","keywords":"Octant (instrument); Prior probability; Mixing (physics); Bayesian probability; Matrix (chemical analysis); Symmetry (geometry); Bayesian inference; Preference","score_opus":0.016609383504525475,"score_gpt":0.2527714085730896,"score_spread":0.23616202506856412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415249498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15006144,0.000007837097,0.7064333,0.0033449845,0.00020141318,0.00014129838,8.931359e-7,0.00009231147,0.13971652],"genre_scores_gemma":[0.98880476,0.0000022904276,0.010782276,0.0002674565,0.0000847854,0.0000010041672,2.4580018e-7,0.0000062318613,0.000050948976],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989624,0.0003997176,0.0001857188,0.00014473562,0.00014646433,0.00016093427],"domain_scores_gemma":[0.9993891,0.00020933595,0.00010529983,0.00017595247,0.00006500227,0.00005529064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042129736,0.00009224136,0.000095020296,0.0000945922,0.00019593207,0.00027245015,0.00040656555,0.000008245812,0.0000025062518],"category_scores_gemma":[0.00009333544,0.000059024755,0.000034907378,0.0004902541,0.00012917952,0.00024853396,0.0000848593,0.00035049373,0.000016077769],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014229439,0.000098078475,0.004150994,0.000005283912,0.00003800729,0.00014635178,0.0021024807,0.011032333,0.0017614632,0.009638074,0.00040479892,0.9706079],"study_design_scores_gemma":[0.0035217805,0.00048006026,0.52703685,0.0008582337,0.00007180046,0.0015991956,0.0007722712,0.38192856,0.00057733065,0.08168369,0.0006176989,0.00085250736],"about_ca_topic_score_codex":0.0000035127246,"about_ca_topic_score_gemma":0.0000038126968,"teacher_disagreement_score":0.9697554,"about_ca_system_score_codex":0.000035726454,"about_ca_system_score_gemma":0.00007997146,"threshold_uncertainty_score":0.2627243},"labels":[],"label_agreement":null},{"id":"W4415594237","doi":"10.1109/jssc.2025.3617458","title":"A Stochastic Analog Boolean Satisfiability Solver","year":2025,"lang":"","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Intelligence Advanced Research Projects Activity","keywords":"Boolean satisfiability problem; Solver; Satisfiability; Maximum satisfiability problem; Scalability; Scrambling; Benchmark (surveying); Computability; True quantified Boolean formula","score_opus":0.016044838638067868,"score_gpt":0.2810729664852668,"score_spread":0.2650281278471989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415594237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030258428,0.0005982464,0.957665,0.002092574,0.0077584595,0.00040857933,0.00004973636,0.000049638256,0.001119326],"genre_scores_gemma":[0.9964614,0.0002933277,0.0010534291,0.0009370597,0.00037299245,0.000003414402,0.0000013423256,0.00002398331,0.0008530597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99481857,0.00045117116,0.002328694,0.0006505799,0.00096787495,0.0007831198],"domain_scores_gemma":[0.9949475,0.0004774311,0.0016014989,0.0007581868,0.0017039615,0.0005114196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018571004,0.0005156916,0.00097313715,0.0010660209,0.00042138738,0.0005016854,0.0011300805,0.00023771114,0.0003074076],"category_scores_gemma":[0.00040132,0.0005313103,0.0005538281,0.0015600761,0.00043114685,0.0015647939,0.00013930367,0.0010779169,0.00006003737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009348705,0.0004868128,0.0031662332,0.00023903562,0.0006971226,0.00021639277,0.004026998,0.30849984,0.003109273,0.0018723529,0.006820267,0.6707722],"study_design_scores_gemma":[0.010808884,0.0016975404,0.1605205,0.0033593986,0.001148991,0.0016706585,0.0008743024,0.75518584,0.005865574,0.053173758,0.0030866426,0.0026078937],"about_ca_topic_score_codex":0.000023803063,"about_ca_topic_score_gemma":0.000059916205,"teacher_disagreement_score":0.966203,"about_ca_system_score_codex":0.00059411663,"about_ca_system_score_gemma":0.0023602196,"threshold_uncertainty_score":0.99971384},"labels":[],"label_agreement":null},{"id":"W4416037303","doi":"10.18653/v1/2025.emnlp-industry.157","title":"Generating Spatial Knowledge Graphs from Automotive Diagrams for Question Answering","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Question answering; Automotive industry; Knowledge graph; Knowledge-based systems; Class (philosophy); Knowledge representation and reasoning","score_opus":0.012839551987213866,"score_gpt":0.28019735396079876,"score_spread":0.2673578019735849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416037303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008321295,0.0005376661,0.9804452,0.0011115727,0.005382405,0.0007959383,0.000029033306,0.00032540376,0.0030514912],"genre_scores_gemma":[0.8123794,0.00011631393,0.18521498,0.00044247002,0.00025136085,0.00007526966,0.000052854903,0.000013971773,0.0014533777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781,0.0001906746,0.0006105055,0.0008367131,0.0001616475,0.00039044855],"domain_scores_gemma":[0.9983305,0.000408955,0.00018049702,0.0003943463,0.0005650123,0.0001207141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038848436,0.00031335882,0.00030523966,0.00029891034,0.0006127407,0.00067308225,0.00034590525,0.00020834396,0.0002181163],"category_scores_gemma":[0.00029878266,0.00034082218,0.00020007018,0.0007165444,0.0000984459,0.0006236576,0.0002000062,0.00019482206,0.000024001301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015122409,0.00009473739,0.0026319493,0.0000356469,0.00008398387,9.666156e-7,0.0014249372,0.013332894,0.00081341853,0.10375316,0.00045363224,0.87735957],"study_design_scores_gemma":[0.000872709,0.00008353602,0.009958856,0.00020055984,0.00005515171,8.401749e-7,0.00012217314,0.9784571,0.0038132216,0.005408097,0.0006992516,0.0003285139],"about_ca_topic_score_codex":0.00095079484,"about_ca_topic_score_gemma":0.003364322,"teacher_disagreement_score":0.9651242,"about_ca_system_score_codex":0.00016993513,"about_ca_system_score_gemma":0.00039432454,"threshold_uncertainty_score":0.9999044},"labels":[],"label_agreement":null},{"id":"W4416620164","doi":"10.48550/arxiv.2510.20519","title":"Metis-HOME: Hybrid Optimized Mixture-of-Experts for Multimodal Reasoning","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Structuring; Inference; Focus (optics); Field (mathematics); Simple (philosophy); Key (lock); Reversing; Reasoning system","score_opus":0.027267407710650945,"score_gpt":0.28669868357627415,"score_spread":0.2594312758656232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416620164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06293106,0.00073670095,0.9240094,0.0013575733,0.0067233685,0.0023147364,0.00020320962,0.00029305226,0.0014309171],"genre_scores_gemma":[0.5594334,0.0008288612,0.43616167,0.00043599823,0.00028632558,0.00037517186,0.0001745289,0.000050035054,0.0022540218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941378,0.00038281796,0.0017839927,0.002174746,0.0006235577,0.0008970859],"domain_scores_gemma":[0.9943222,0.00095113774,0.0013103245,0.0019359438,0.0011352266,0.00034519384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010158322,0.00096430915,0.0015104575,0.0006638658,0.0005522888,0.0003039671,0.0017749288,0.0005905442,0.0004366529],"category_scores_gemma":[0.00094754423,0.0010633713,0.0010046321,0.00071688864,0.000331013,0.0006210259,0.0015888158,0.00078697095,0.00002922557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013795086,0.0012130248,0.12432557,0.0021353527,0.002169532,0.000074431526,0.007106731,0.3977288,0.0024025382,0.010347538,0.004514351,0.4466026],"study_design_scores_gemma":[0.004652574,0.0001793291,0.022645336,0.0014344525,0.00030807804,0.000039087234,0.00016808433,0.9511243,0.0122117,0.00046561979,0.0052971304,0.0014743056],"about_ca_topic_score_codex":0.00021058996,"about_ca_topic_score_gemma":0.000023046052,"teacher_disagreement_score":0.5533955,"about_ca_system_score_codex":0.00029205554,"about_ca_system_score_gemma":0.0012059128,"threshold_uncertainty_score":0.9991816},"labels":[],"label_agreement":null},{"id":"W4417137941","doi":"10.1016/j.artint.2025.104468","title":"Is DIBBS a DXBB algorithm?","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science, Technology and Space; Israel Science Foundation; Israel National Road Safety Authority; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"","score_opus":0.034249568538827324,"score_gpt":0.3096793767285582,"score_spread":0.2754298081897309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417137941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019943429,0.000046197398,0.97985995,0.0043401853,0.00076519436,0.00010401423,0.0000019022287,0.00017388738,0.014509239],"genre_scores_gemma":[0.78268105,0.000075521195,0.21051875,0.004594244,0.0000780187,0.000023305316,0.0000025968125,0.000007020466,0.0020195202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909824,0.000029207256,0.00025113754,0.00030351334,0.00013952519,0.00017840482],"domain_scores_gemma":[0.9993877,0.00007194935,0.000042980493,0.0003452467,0.000103273975,0.0000488953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013908504,0.00009230969,0.00008925116,0.00014242117,0.00014817332,0.00018366816,0.0004097584,0.000050435003,0.0003395635],"category_scores_gemma":[0.000052990617,0.00009436836,0.0000550049,0.00073344074,0.00005048436,0.00028655643,0.00012032312,0.000095773736,0.00038387973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.731366e-7,0.000016928909,0.00009588599,0.0000017766894,0.0000050194003,0.0000017340068,0.00021593705,0.00018028743,0.00007374627,0.27668914,0.0005223876,0.7221962],"study_design_scores_gemma":[0.000016942075,0.000022834769,0.0005304174,0.000017948869,0.0000050546587,0.0000036999977,0.00012064955,0.75998104,0.047394536,0.18439832,0.007345835,0.00016275437],"about_ca_topic_score_codex":0.00004834362,"about_ca_topic_score_gemma":0.000028044666,"teacher_disagreement_score":0.7824816,"about_ca_system_score_codex":0.00003371318,"about_ca_system_score_gemma":0.000082980354,"threshold_uncertainty_score":0.49341252},"labels":[],"label_agreement":null},{"id":"W46779485","doi":"","title":"Set branching in constraint optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Branch and bound; Bounding overwatch; Cluster analysis; Branching (polymer chemistry); Mathematics; Constraint (computer-aided design); Mathematical optimization; Algorithm; Domain (mathematical analysis); Computer science; Set (abstract data type); Upper and lower bounds; Artificial intelligence; Statistics","score_opus":0.01205112372200819,"score_gpt":0.24444915623099545,"score_spread":0.23239803250898725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46779485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014870119,0.000005820338,0.9722762,0.0023674646,0.000091855676,0.000081154765,2.9452028e-7,0.00015953831,0.02353064],"genre_scores_gemma":[0.78276384,0.0000073038823,0.21621221,0.0009458425,0.000008779392,9.554839e-7,0.000002562962,0.0000012742925,0.00005722521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944437,0.000027165297,0.00015276663,0.00016602372,0.00009282701,0.000116858486],"domain_scores_gemma":[0.9997421,0.000021149435,0.00003116021,0.00014274905,0.000024558678,0.000038293536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012729003,0.00006023373,0.000065017906,0.00012688263,0.000037841543,0.00009481454,0.00013582355,0.000032930246,0.00015925869],"category_scores_gemma":[0.000022662969,0.00005925212,0.000019018104,0.0003029748,0.000012447031,0.00047623008,0.00001499709,0.00006468658,0.000012732059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016564933,0.00001782264,0.0009997895,0.0000011180894,0.0000013562887,0.0000058668747,0.0005790245,0.631882,0.000103068305,0.16092007,0.00013679909,0.20535141],"study_design_scores_gemma":[0.00028339733,0.000019530917,0.006983428,0.000007383739,4.74866e-7,0.00001608862,0.000044600027,0.9907725,0.00012630294,0.0015574283,0.00009575544,0.0000931044],"about_ca_topic_score_codex":0.000008011985,"about_ca_topic_score_gemma":0.000015470507,"teacher_disagreement_score":0.7812768,"about_ca_system_score_codex":0.000029416591,"about_ca_system_score_gemma":0.00003413001,"threshold_uncertainty_score":0.24162313},"labels":[],"label_agreement":null},{"id":"W49964765","doi":"","title":"Exploiting decomposition on constraint problems with high tree-width","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decomposition; Tree decomposition; Tree (set theory); Search tree; Decomposition method (queueing theory); Heuristic; Constraint (computer-aided design); Computer science; Treewidth; Mathematical optimization; Algorithm; Branch and bound; Mathematics; Theoretical computer science; Search algorithm; Discrete mathematics; Combinatorics; Graph; Pathwidth","score_opus":0.011430077838768706,"score_gpt":0.22819869225012285,"score_spread":0.21676861441135414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49964765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015793404,0.000002215558,0.94350374,0.0035783215,0.00007040126,0.00017454688,5.774114e-7,0.00037445233,0.036502372],"genre_scores_gemma":[0.843763,0.0000031022125,0.15490402,0.0011972539,0.000021788132,0.0000052761293,0.000005313049,0.0000032556366,0.000097009615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991879,0.000028201212,0.00015751192,0.0002670613,0.0001904249,0.00016891229],"domain_scores_gemma":[0.99955887,0.000037963197,0.00006773713,0.00020292574,0.000058274003,0.00007424249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000906705,0.00011098616,0.00009349566,0.00009961188,0.00011641441,0.00015285403,0.00014382607,0.000033324093,0.00009016191],"category_scores_gemma":[0.0000061834808,0.00008714779,0.000025241456,0.00021687623,0.000028514716,0.0003895102,0.000012369903,0.00008317782,0.000036923346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010341137,0.0000798687,0.00032285263,0.0000027063527,0.000007760118,0.0000100471,0.00021439917,0.010122909,0.0011784302,0.38484055,0.000148115,0.60306203],"study_design_scores_gemma":[0.007806856,0.006199052,0.18162765,0.0006714396,0.000043770462,0.0007434397,0.00052889175,0.69418406,0.049794875,0.054320995,0.0015828771,0.0024961128],"about_ca_topic_score_codex":0.0000102890845,"about_ca_topic_score_gemma":0.000023787228,"teacher_disagreement_score":0.82796955,"about_ca_system_score_codex":0.000042454616,"about_ca_system_score_gemma":0.00003644635,"threshold_uncertainty_score":0.3553784},"labels":[],"label_agreement":null},{"id":"W60262200","doi":"","title":"An Explanation Oriented Dialogue Approach for Solving Wicked Planning Problems.","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Plan (archaeology); Computer science; Parsing; Principal (computer security); Ideal (ethics); Measure (data warehouse); Similarity (geometry); Order (exchange); Subject (documents); Management science; Artificial intelligence; Data mining; Engineering","score_opus":0.025827468978713516,"score_gpt":0.26365552928738845,"score_spread":0.23782806030867493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60262200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002310822,0.000008527177,0.9922804,0.00032356224,0.00010189739,0.00030613877,0.0000015126928,0.00032006152,0.004347066],"genre_scores_gemma":[0.5304093,0.0000010182641,0.46916553,0.00018313352,0.00005887555,0.000034623863,0.00006145527,0.0000040750265,0.00008202812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927783,0.000017948843,0.00016700279,0.0002596609,0.00011979726,0.00015778378],"domain_scores_gemma":[0.9995796,0.00003394255,0.00006203396,0.00018145135,0.00008016871,0.00006278235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019831157,0.00007957197,0.000073133226,0.00010701329,0.00015045893,0.000107448606,0.0001719207,0.000044110413,0.000016171954],"category_scores_gemma":[0.000023536233,0.00007520303,0.000025564188,0.00017363107,0.000018416737,0.0010311101,0.000021005379,0.000045892233,0.0000041443523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015922562,0.00020811368,0.0028860492,0.000030739702,0.000023479175,6.1974686e-7,0.008559817,0.50069207,0.0034766113,0.24527657,0.0014881006,0.23734193],"study_design_scores_gemma":[0.0003619565,0.000036505266,0.0009082937,0.0000043751597,0.000002319442,0.0000045952256,0.00016184534,0.99633485,0.000534495,0.00017919378,0.0013593722,0.00011220534],"about_ca_topic_score_codex":0.000009077986,"about_ca_topic_score_gemma":0.00001654495,"teacher_disagreement_score":0.5280984,"about_ca_system_score_codex":0.00003821351,"about_ca_system_score_gemma":0.000034100205,"threshold_uncertainty_score":0.30666906},"labels":[],"label_agreement":null},{"id":"W615032608","doi":"10.1007/978-3-319-07467-2_46","title":"Configuring the Webpage Content through Conditional Constraints and Preferences","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Web page; Personalization; Constraint (computer-aided design); Set (abstract data type); Content (measure theory); Preference; Web content; Information retrieval; Expressive power; World Wide Web; Theoretical computer science; Programming language; Mathematics","score_opus":0.03434033797897846,"score_gpt":0.24128639823508158,"score_spread":0.20694606025610313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W615032608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009558035,0.0001677653,0.9872011,0.0018820768,0.00088204857,0.0003423398,0.000010248894,0.00009477789,0.009324053],"genre_scores_gemma":[0.86922336,0.00011090992,0.12673125,0.0033200202,0.00025822766,0.00001255028,0.00001206852,0.000015864189,0.0003157599],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997693,0.000050402563,0.0003933162,0.0009009083,0.0006129303,0.00034942373],"domain_scores_gemma":[0.9981992,0.0006761019,0.00025665923,0.00057274033,0.00019972726,0.000095541574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005632861,0.00033804475,0.0003223043,0.00021040293,0.00039203826,0.00059437857,0.0011536557,0.00018095749,0.00012274768],"category_scores_gemma":[0.000084602616,0.00024851327,0.000065976565,0.00017491341,0.00242507,0.00040712734,0.0004602514,0.00053469144,0.000022271743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025294835,0.000006602513,0.00013564824,0.000018806266,0.000015412372,0.00001263799,0.0007091976,0.006136021,0.000056654593,0.40639567,0.000023203462,0.5864876],"study_design_scores_gemma":[0.0009117528,0.00021527066,0.003852223,0.0005530713,0.000023732504,0.0005139347,0.0000034495079,0.46408257,0.0009595857,0.52267,0.0050727767,0.0011416726],"about_ca_topic_score_codex":0.000014105513,"about_ca_topic_score_gemma":0.000067293746,"teacher_disagreement_score":0.86912775,"about_ca_system_score_codex":0.00008425235,"about_ca_system_score_gemma":0.00031431534,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W6182124","doi":"10.1007/978-3-642-30353-1_19","title":"Predicting Good Propagation Methods for Constraint Satisfaction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Constraint satisfaction problem; Oracle; Local consistency; Solver; Computer science; Constraint satisfaction; Limit (mathematics); A priori and a posteriori; Constraint (computer-aided design); Simple (philosophy); Mathematical optimization; Problem solver; Variety (cybernetics); Artificial intelligence; Machine learning; Mathematics","score_opus":0.024232005713215918,"score_gpt":0.2973156277035197,"score_spread":0.2730836219903038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6182124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021406344,0.00021000559,0.993464,0.0005831832,0.0026960555,0.001007992,0.0000075953167,0.00027118807,0.0017386092],"genre_scores_gemma":[0.067061484,0.000032691773,0.9319574,0.0003504269,0.0004336483,0.000036162943,0.000011407358,0.000027366319,0.000089409696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723476,0.00007088997,0.0005918693,0.001053587,0.00049470353,0.0005541904],"domain_scores_gemma":[0.99753463,0.0007702652,0.00046500747,0.00069613307,0.00036008828,0.00017385113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017855042,0.00041163396,0.0003918336,0.00067840057,0.000360874,0.00043361305,0.0007789684,0.00034167964,0.00004471516],"category_scores_gemma":[0.00023430167,0.00040406082,0.0001361361,0.0003895238,0.00042463344,0.0010573416,0.00032170227,0.0005211367,0.000012684219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003078636,0.000007854308,0.00052217697,0.00003127532,0.000009277118,0.0000010394323,0.000340549,0.010032423,0.0003082177,0.04415686,0.0000021413668,0.9445851],"study_design_scores_gemma":[0.00035384513,0.0001218697,0.0012883402,0.00019385335,0.000019857085,0.00009504576,4.6655583e-7,0.9314034,0.0020196903,0.06298244,0.00096540793,0.00055580895],"about_ca_topic_score_codex":0.000016523161,"about_ca_topic_score_gemma":0.000072471834,"teacher_disagreement_score":0.9440293,"about_ca_system_score_codex":0.0004310679,"about_ca_system_score_gemma":0.00053225417,"threshold_uncertainty_score":0.99984115},"labels":[],"label_agreement":null},{"id":"W64307931","doi":"10.5591/978-1-57735-516-8/ijcai11-092","title":"Depth-driven circuit-level stochastic local search for SAT","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Boolean satisfiability problem; Completeness (order theory); Computer science; Local search (optimization); Boolean circuit; Satisfiability; Heuristic; Key (lock); Algorithm; Theoretical computer science; Search algorithm; Stochastic computing; Logic gate; Mathematics; Artificial intelligence","score_opus":0.12231916808260415,"score_gpt":0.27386644913658953,"score_spread":0.15154728105398538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64307931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005820892,0.0000032993316,0.9907486,0.0001239558,0.00020696197,0.00021422979,0.0000030848037,0.00014560409,0.007972172],"genre_scores_gemma":[0.8652405,6.359634e-7,0.13412695,0.00016415713,0.000018432813,0.000014951597,0.0000032558912,0.0000051127768,0.0004259924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930936,0.00001830905,0.00012331092,0.00022441131,0.00013274289,0.00019184678],"domain_scores_gemma":[0.99951243,0.000059527105,0.000022404238,0.0002168165,0.00009959145,0.00008924837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103366656,0.00007352831,0.00007485761,0.00008276334,0.000087238244,0.000044127377,0.0002667665,0.000042867327,0.00024588782],"category_scores_gemma":[0.000013087364,0.000067892455,0.000044794306,0.00014368916,0.000050848234,0.00024401277,0.000064877306,0.000055405068,0.0001200593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010410088,0.00005773624,0.0018492464,0.000011855947,0.00002155459,0.0000027445878,0.0018311233,0.0085278945,0.00016095703,0.41992378,0.00044760006,0.5671551],"study_design_scores_gemma":[0.0005299305,0.00009691245,0.030481072,0.0000075662897,0.0000055275614,0.000022810029,0.0001355646,0.96469414,0.0010027197,0.00272022,0.00010990862,0.00019364085],"about_ca_topic_score_codex":0.00004303685,"about_ca_topic_score_gemma":0.00011406459,"teacher_disagreement_score":0.9561662,"about_ca_system_score_codex":0.00003376045,"about_ca_system_score_gemma":0.00008194948,"threshold_uncertainty_score":0.27685738},"labels":[],"label_agreement":null},{"id":"W646208794","doi":"","title":"Proceedings, Seventh International Workshop on Temporal Representation and Reasoning, Cape Breton, Nova Scotia, Canada, 7-9 July, 2000","year":2000,"lang":"en","type":"book","venue":"IEEE Computer Society eBooks","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nova scotia; Representation (politics); Constraint (computer-aided design); Computer science; Nova (rocket); Temporal database; Artificial intelligence; Cognitive science; Geography; Psychology; Mathematics; Data mining; Political science; Archaeology; Engineering","score_opus":0.014145450115863756,"score_gpt":0.23530726677330605,"score_spread":0.22116181665744228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W646208794","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076206186,0.00016699824,0.47932994,0.0022065642,0.011193759,0.0015501673,0.0001172927,0.00078035094,0.50389284],"genre_scores_gemma":[0.014726022,0.00013443336,0.108848736,0.0078992285,0.0036398133,0.000035918514,0.00037127116,0.00016885829,0.86417574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99705845,0.00003268582,0.00055457465,0.0011035186,0.0008631445,0.00038764987],"domain_scores_gemma":[0.9985426,0.00009404371,0.00043483323,0.0004287533,0.00027929075,0.00022046333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018808802,0.0005067511,0.0004132103,0.00013368702,0.00022036779,0.0006084088,0.00078364677,0.00038346287,0.000093277085],"category_scores_gemma":[0.00000682446,0.00056530145,0.00023008628,0.00011106983,0.00013984823,0.0003103174,0.00019784435,0.0007219836,0.00003300997],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000163007,0.000024556304,0.0002366164,0.000043405813,0.0002272749,0.00002910664,0.0020898075,0.0011047433,0.0000031386912,0.0018483093,0.88458043,0.10979633],"study_design_scores_gemma":[0.0023446262,0.00018271038,0.002815799,0.0018804985,0.00011491796,0.0004852202,0.000084715946,0.37765548,0.00017223126,0.0016264681,0.6101221,0.0025152555],"about_ca_topic_score_codex":0.009004724,"about_ca_topic_score_gemma":0.0151844295,"teacher_disagreement_score":0.37655073,"about_ca_system_score_codex":0.0008918752,"about_ca_system_score_gemma":0.0019990643,"threshold_uncertainty_score":0.99967986},"labels":[],"label_agreement":null},{"id":"W6467814","doi":"10.1007/978-3-540-72792-7_13","title":"On Integer Programming and the Branch-Width of the Constraint Matrix","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Matroid; Combinatorics; Integer programming; Mathematics; Constant (computer programming); Constraint (computer-aided design); Matrix (chemical analysis); Integer matrix; Discrete mathematics; Algorithm; Computer science; Physics; Geometry; Symmetric matrix; Eigenvalues and eigenvectors; Chemistry","score_opus":0.012509983866953976,"score_gpt":0.2492199954398392,"score_spread":0.2367100115728852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6467814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007911442,0.00014702059,0.9932809,0.0017215043,0.0009742614,0.000530172,0.0000018568711,0.00004723543,0.0032179244],"genre_scores_gemma":[0.7902941,0.00003776165,0.20709369,0.0021726242,0.00013591713,0.0000065756217,9.0795885e-7,0.000018424462,0.00024000963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979969,0.000047931706,0.0004066384,0.0006055924,0.0006521122,0.0002908025],"domain_scores_gemma":[0.9978104,0.00088268775,0.00031059468,0.0007735471,0.00016043856,0.00006233442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011748285,0.00026816374,0.00029969713,0.00030475797,0.00022875515,0.0002628626,0.0013317803,0.00015784605,0.00001837193],"category_scores_gemma":[0.00013500983,0.00015145016,0.00011413266,0.00043789245,0.0026414054,0.00016681103,0.0005682366,0.0006198758,0.000003603414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008016075,0.0000062934896,0.000045616012,0.000011987953,0.000005743418,0.0000026415576,0.0005930096,0.007776786,0.0000071674453,0.24888396,0.0000031121772,0.7426557],"study_design_scores_gemma":[0.0016011605,0.00018179229,0.000982209,0.0009709633,0.000024105555,0.00025760385,0.0000017100422,0.59747756,0.0009017409,0.39541918,0.0014718168,0.0007101277],"about_ca_topic_score_codex":0.000015641966,"about_ca_topic_score_gemma":0.0000736396,"teacher_disagreement_score":0.79021496,"about_ca_system_score_codex":0.00008604673,"about_ca_system_score_gemma":0.00025522982,"threshold_uncertainty_score":0.97323686},"labels":[],"label_agreement":null},{"id":"W65207345","doi":"10.1007/978-1-4613-0089-2_5","title":"Proving Theorems by Constructing Closed Semantic Trees","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Section (typography); Set (abstract data type); Base (topology); Interpretation (philosophy); Computer science; Semantic interpretation; Abstract interpretation; Algorithm; Mathematics; Programming language; Theoretical computer science; Natural language processing","score_opus":0.010914878843219072,"score_gpt":0.2079987132964952,"score_spread":0.19708383445327612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65207345","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067134088,0.000049214195,0.38508397,0.0002157223,0.00025072246,0.00015377458,0.0000028886418,0.0002754664,0.6139615],"genre_scores_gemma":[0.015732596,0.00014579378,0.043589603,0.0004793371,0.00014831082,0.0000056015992,0.000033669996,0.00004923164,0.9398159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870056,0.000017172131,0.00033262032,0.0004777195,0.00026318716,0.00020874754],"domain_scores_gemma":[0.9991019,0.00009945435,0.000232659,0.00040336847,0.000080250844,0.0000823731],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013070847,0.00026870816,0.00025372402,0.00014288488,0.000121252,0.0002450493,0.0003664034,0.0002010191,0.0014905786],"category_scores_gemma":[0.000017614557,0.00024912722,0.000105390805,0.00004619144,0.00011027646,0.00021718224,0.00012100968,0.00024672705,0.00011904151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.627263e-7,0.0000031227485,0.000050893537,0.000007864779,0.000019367431,0.000009093799,0.000050061517,0.000017262251,0.00006041422,0.72988206,0.0019261272,0.26797274],"study_design_scores_gemma":[0.00200602,0.0002089131,0.000087571134,0.0008013394,0.00014172676,0.001069599,0.00022291296,0.10709524,0.0009856187,0.2076234,0.6761672,0.0035904765],"about_ca_topic_score_codex":0.000014834295,"about_ca_topic_score_gemma":0.00008465041,"teacher_disagreement_score":0.67424107,"about_ca_system_score_codex":0.000055244498,"about_ca_system_score_gemma":0.000090799076,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W66743352","doi":"10.1007/978-3-540-73580-9_41","title":"Using Infeasibility to Improve Abstraction-Based Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Abstraction; Heuristic; Computer science; State (computer science); Mathematical optimization; Value (mathematics); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.04143490981174151,"score_gpt":0.3026837768493827,"score_spread":0.26124886703764116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66743352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113682814,0.000022568183,0.99390703,0.0003262665,0.0026168665,0.00046133346,0.000008039086,0.0001712014,0.0023729873],"genre_scores_gemma":[0.14859441,0.0000021596948,0.8490719,0.001953444,0.00027885378,0.000002515632,0.0000036228757,0.000021586098,0.00007151128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967804,0.000020902069,0.0005664821,0.0012909153,0.0008368619,0.00050442596],"domain_scores_gemma":[0.99746186,0.0004342079,0.00027436545,0.0011264647,0.00043806998,0.00026501846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093290134,0.00039746903,0.00034053304,0.0010012831,0.0002517177,0.00046112222,0.0011908287,0.00029650147,0.00005024378],"category_scores_gemma":[0.00022292028,0.000410694,0.00010529618,0.0006889464,0.00034336487,0.0004122306,0.00039332884,0.00064375374,0.000039985352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057086695,0.000019855592,0.00021685162,0.00002008205,0.0000035299047,0.000025400046,0.000098136145,0.4465044,0.00021212976,0.003470712,0.0000032200505,0.54941994],"study_design_scores_gemma":[0.00019373567,0.00008484773,0.0009902847,0.00012817788,0.0000062929175,0.000023005172,8.94824e-8,0.98171175,0.0014542176,0.014421016,0.00046577482,0.00052080414],"about_ca_topic_score_codex":0.000051355975,"about_ca_topic_score_gemma":0.00020188994,"teacher_disagreement_score":0.5488992,"about_ca_system_score_codex":0.00069429557,"about_ca_system_score_gemma":0.0010207883,"threshold_uncertainty_score":0.9998345},"labels":[],"label_agreement":null},{"id":"W67075882","doi":"10.1007/978-3-540-78913-0_9","title":"The Lattice of Contact Relations on a Boolean Algebra","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Boolean algebra; Two-element Boolean algebra; Free Boolean algebra; Boolean algebras canonically defined; Complete Boolean algebra; Algebra over a field; Set (abstract data type); Stone's representation theorem for Boolean algebras; Relation algebra; Computer science; Lattice (music); Mathematics; Theoretical computer science; Pure mathematics; Algorithm; Algebra representation; Programming language; Physics","score_opus":0.01419696534302546,"score_gpt":0.23048882174081906,"score_spread":0.2162918563977936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67075882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059944512,0.00017045422,0.984048,0.0016616774,0.00092739356,0.0002663207,0.0000032884252,0.00008072127,0.012782178],"genre_scores_gemma":[0.653199,0.00055047974,0.34125727,0.002659172,0.00036194848,0.000013236575,0.000008239468,0.000050380728,0.0019002601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786586,0.000037705013,0.00044280608,0.000651562,0.00070279505,0.0002993017],"domain_scores_gemma":[0.99728626,0.0011192695,0.00032511132,0.00096073217,0.00022193248,0.00008671753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044319776,0.00026355544,0.0002598206,0.0004010848,0.00046393723,0.00019698628,0.0014288706,0.00016793744,0.000024185018],"category_scores_gemma":[0.00014657677,0.00020109043,0.00010813298,0.0004353639,0.0005820907,0.0003215967,0.00030473806,0.00054934993,0.000043663043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007653193,0.000019072824,0.00008759441,0.000006887157,0.000013984386,0.00001965901,0.0007983001,0.04162138,0.00002843947,0.20371702,0.00013109983,0.7535489],"study_design_scores_gemma":[0.00054793153,0.0004054699,0.0041473634,0.0004521046,0.000014077616,0.00014086184,6.090149e-7,0.9023625,0.00067553186,0.07929761,0.011209171,0.00074674794],"about_ca_topic_score_codex":0.000011363099,"about_ca_topic_score_gemma":0.000070816604,"teacher_disagreement_score":0.86074114,"about_ca_system_score_codex":0.00016175906,"about_ca_system_score_gemma":0.00048003218,"threshold_uncertainty_score":0.82002294},"labels":[],"label_agreement":null},{"id":"W69236537","doi":"10.1007/978-3-642-25566-3_47","title":"HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; State (computer science); Range (aeronautics); Algorithm; Software engineering; Engineering","score_opus":0.02214497837932569,"score_gpt":0.24690902476520954,"score_spread":0.22476404638588385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69236537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030492125,0.0001562898,0.998338,0.00026926535,0.0005428805,0.00045184983,0.000005088644,0.00015513925,0.000051032268],"genre_scores_gemma":[0.19279274,0.000121309924,0.8067566,0.00022893997,0.000049204365,0.000012151791,0.0000017354016,0.000010010865,0.000027256636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982765,0.000025910127,0.0003631758,0.0006896863,0.00037574698,0.00026899893],"domain_scores_gemma":[0.9975353,0.0011103452,0.00030792592,0.00073470606,0.00024828204,0.00006342816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000719889,0.00025743933,0.00038198192,0.0006688675,0.00021383718,0.00018048982,0.00113674,0.0002087096,0.000016452366],"category_scores_gemma":[0.000082908,0.00018913257,0.000081634396,0.00095027126,0.0005722625,0.000295343,0.00030535593,0.0002784356,0.0000017278298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057855104,0.0000071090403,0.000091077134,0.000016970062,0.000068867084,0.0000014235786,0.00046806555,0.25800782,0.000006485395,0.022072311,0.0000025303193,0.7192516],"study_design_scores_gemma":[0.000109807734,0.00008796467,0.0020792626,0.000086925604,0.000065634296,0.000009430629,8.956456e-8,0.9436567,0.0005118164,0.053166207,0.000019086918,0.00020706268],"about_ca_topic_score_codex":0.00003675072,"about_ca_topic_score_gemma":0.0000215439,"teacher_disagreement_score":0.7190445,"about_ca_system_score_codex":0.000053066888,"about_ca_system_score_gemma":0.00019676735,"threshold_uncertainty_score":0.77126026},"labels":[],"label_agreement":null},{"id":"W6926400286","doi":"10.25316/ir-12724","title":"Nanaimo Free Press [Tuesday, June 27, 1893]","year":2019,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.008242950877012096,"score_gpt":0.19188261351326452,"score_spread":0.18363966263625242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926400286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6088155e-8,0.00012070904,0.21871026,0.00033849137,0.0044670054,0.0003043572,0.00008192975,0.00045220694,0.775525],"genre_scores_gemma":[0.000046357258,0.00050443545,0.00629176,0.000093676535,0.0001470224,5.974023e-7,0.0000012664334,0.00011192093,0.992803],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835,0.00009126375,0.00012518548,0.0007034123,0.000372553,0.0003575575],"domain_scores_gemma":[0.99819136,0.000050241633,0.00028057734,0.0012556843,0.00007934272,0.00014278821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000060441464,0.00036806485,0.0003765614,0.00070371333,0.00009944372,0.00011420608,0.0013098919,0.000377666,0.0005864939],"category_scores_gemma":[0.000019743497,0.00039499524,0.00015260266,0.00058524,0.00008119592,0.00040193117,0.0005330581,0.0003014947,0.00030625795],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007956498,0.000027595333,0.0000028030674,0.000040941235,0.00007207734,0.000060488226,0.00011377593,0.00022168636,0.0000027026856,0.009349019,0.98859894,0.0015020072],"study_design_scores_gemma":[0.0011329883,0.000032986296,0.0000034495224,0.00011351657,0.000043286458,0.0000041771655,0.000075754804,0.0019492838,0.000013205126,0.000051561554,0.9960971,0.0004827045],"about_ca_topic_score_codex":0.0005087493,"about_ca_topic_score_gemma":0.004858751,"teacher_disagreement_score":0.21727799,"about_ca_system_score_codex":0.00014099771,"about_ca_system_score_gemma":0.00019765575,"threshold_uncertainty_score":0.9998502},"labels":[],"label_agreement":null},{"id":"W6929000334","doi":"10.4230/lipics.cp.2023.23","title":"Large Neighborhood Beam Search for Domain-Independent Dynamic Programming","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Solver; Scheduling (production processes); State space; Beam search; Constraint programming; Dynamic programming; State (computer science); Search algorithm","score_opus":0.013371875105233005,"score_gpt":0.27542852147713176,"score_spread":0.26205664637189874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929000334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028562238,0.0000114282075,0.9650773,0.00091859925,0.001075721,0.0022750082,0.0003868906,0.00078258093,0.0009102509],"genre_scores_gemma":[0.8982915,0.000038098016,0.09822069,0.00072320306,0.000119196215,0.00059962086,0.0013681375,0.000067363086,0.0005721296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694574,0.000030819858,0.00089329097,0.00038346415,0.0006237067,0.001122971],"domain_scores_gemma":[0.9982499,0.00018519133,0.0002673493,0.0006854924,0.00036102248,0.00025102953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010640013,0.00034144003,0.00034687106,0.0005091673,0.00065431214,0.0007218373,0.00092816626,0.00021329412,0.000030104153],"category_scores_gemma":[0.00006231408,0.000331841,0.0002964964,0.00081528974,0.00006478376,0.0015711116,0.0004583039,0.00031712864,0.00021577085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003318348,0.0012861494,0.02588399,0.0027661747,0.0008586472,0.000034297478,0.06647747,0.0086395955,0.00034911867,0.33996913,0.008375998,0.5450276],"study_design_scores_gemma":[0.0057791695,0.000371401,0.0032063967,0.00011136414,0.000029775,0.00006261163,0.0045609027,0.90956414,0.000423361,0.0021734438,0.072938085,0.0007793785],"about_ca_topic_score_codex":0.0000036632628,"about_ca_topic_score_gemma":0.000033465953,"teacher_disagreement_score":0.9009245,"about_ca_system_score_codex":0.00019785111,"about_ca_system_score_gemma":0.00016125686,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W6930755238","doi":"10.5281/zenodo.14596699","title":"FIGURES 62–64. Camptopteroides. 62a in Illustrated key to the genera and catalogue of Mymaridae (Hymenoptera) in the Neotropical region","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Resources Canada","funders":"","keywords":"Key (lock); Head (geology); Taxonomy (biology); New guinea","score_opus":0.026734724723454062,"score_gpt":0.23476994398560094,"score_spread":0.20803521926214688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930755238","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004407189,0.0016857348,0.11108284,0.021245556,0.00078121235,0.0035009708,0.00039055882,0.0013325545,0.8555734],"genre_scores_gemma":[0.88763714,0.0017744459,0.00350542,0.0025989714,0.0006450999,0.0000017653167,0.0020986449,0.0047303643,0.097008176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984552,0.00036483823,0.0002620299,0.00041920037,0.00028161347,0.00021706836],"domain_scores_gemma":[0.9992181,0.000025812322,0.00009277565,0.0005147088,0.00008673741,0.00006186963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039718338,0.00015536396,0.00015699105,0.00044962476,0.0001971622,0.0006088417,0.001074957,0.00010288394,0.00081998226],"category_scores_gemma":[0.00014149382,0.000113283335,0.000027150843,0.00084089534,0.00012645393,0.00010480823,0.0006470133,0.0003444245,0.0006084928],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015752606,0.000048791386,0.0000138780315,0.00009507011,0.000023929126,0.000040787963,0.0051637073,0.00040224617,0.0001161357,0.010157868,0.90625155,0.07767029],"study_design_scores_gemma":[0.00023048522,0.00008468368,0.001212154,0.00014394552,0.000006424786,0.00010475181,0.00015795771,0.0023216044,0.000019969582,0.000094909345,0.9954751,0.0001480012],"about_ca_topic_score_codex":0.0003651059,"about_ca_topic_score_gemma":0.00012467396,"teacher_disagreement_score":0.8832299,"about_ca_system_score_codex":0.000069766764,"about_ca_system_score_gemma":0.000008419559,"threshold_uncertainty_score":0.8978231},"labels":[],"label_agreement":null},{"id":"W6931019501","doi":"10.5281/zenodo.15319161","title":"wirl-ice/iceberg-beacon-track-database-tools: Iceberg Beacon Track Database (IBTD) Tools","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Iceberg; Track (disk drive); Code (set theory); Global Positioning System; Tracking (education); Radar tracker","score_opus":0.041403467074618415,"score_gpt":0.26216306257305994,"score_spread":0.2207595954984415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931019501","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025016838,0.000299833,0.28203723,0.0010743579,0.0007498786,0.001135481,0.0028738123,0.0034552144,0.70834917],"genre_scores_gemma":[0.005782715,0.004648464,0.055027634,0.003337434,0.0020745934,0.0000024068854,0.05777712,0.014754174,0.85659546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953238,0.0006773814,0.0006998017,0.0015676011,0.0009391787,0.00079225097],"domain_scores_gemma":[0.9961338,0.00014599162,0.00050744653,0.0021188355,0.00066739204,0.0004265492],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009896348,0.00059798977,0.0005249489,0.0010918939,0.0014963138,0.0032553072,0.0031996784,0.00031583916,0.046018124],"category_scores_gemma":[0.0011472735,0.0006755803,0.00018275263,0.0015152962,0.00027865285,0.0016285162,0.0025961797,0.00093157025,0.013746046],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022533679,0.00013659341,0.0000011280102,0.00017798768,0.00010829887,0.000045334335,0.00020244558,0.00006237477,0.00040314533,0.012609034,0.6873286,0.2989025],"study_design_scores_gemma":[0.0008587882,0.000099264355,0.00012244299,0.00037289018,0.00006043589,0.0000994329,0.000098392884,0.0026469429,0.00029358186,0.000053539865,0.9946229,0.00067143055],"about_ca_topic_score_codex":0.00012715936,"about_ca_topic_score_gemma":0.000020028538,"teacher_disagreement_score":0.30729425,"about_ca_system_score_codex":0.00030102461,"about_ca_system_score_gemma":0.000075429016,"threshold_uncertainty_score":0.9998036},"labels":[],"label_agreement":null},{"id":"W6931173563","doi":"10.5281/zenodo.4162504","title":"Les agressions sexuelles d'enfants non résolues par la police : Une analyse du processus de passage à l'acte","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Simon Fraser University","funders":"","keywords":"Sample (material); Bivariate analysis; Perspective (graphical); Diversity (politics); Sexual assault; Human factors and ergonomics; Poison control; Criminal behaviour","score_opus":0.034817407766594276,"score_gpt":0.26105655524065613,"score_spread":0.22623914747406185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931173563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060689148,0.00003903891,0.8036475,0.015732309,0.00009002264,0.00051424943,0.00009825163,0.0025768073,0.11661267],"genre_scores_gemma":[0.9954909,0.00009866259,0.0033975765,0.00035662978,0.00011010056,6.544832e-8,0.00013708635,0.00028416488,0.00012478633],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984088,0.0003387632,0.0002255604,0.0004151885,0.00029922102,0.00031245349],"domain_scores_gemma":[0.9989133,0.00004382571,0.00012511153,0.00031805632,0.00030763505,0.00029208694],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003437955,0.0001439306,0.00014795216,0.00016193565,0.0016027536,0.0009769208,0.0010609432,0.00007012063,0.0014313273],"category_scores_gemma":[0.0003546068,0.00014519274,0.00005005868,0.001030566,0.00011879318,0.0004840151,0.0008425439,0.00024485422,0.0007665868],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010800827,0.00030990425,0.0011811866,0.0001959345,0.00015738085,0.00008736064,0.043251183,0.0043229866,0.019821567,0.009967108,0.13232334,0.78827405],"study_design_scores_gemma":[0.0013260598,0.0002981901,0.02734103,0.00009010731,0.00004407259,0.00020605169,0.002411603,0.15826619,0.0032659764,0.0003129295,0.8058342,0.0006036189],"about_ca_topic_score_codex":0.00013241981,"about_ca_topic_score_gemma":0.000004657596,"teacher_disagreement_score":0.93480176,"about_ca_system_score_codex":0.00006672158,"about_ca_system_score_gemma":0.000015538024,"threshold_uncertainty_score":0.999697},"labels":[],"label_agreement":null},{"id":"W6946413516","doi":"10.34726/hss.2022.95250","title":"SAT-based Optimization of Octolinear Metro Map Layouts","year":2022,"lang":"de","type":"article","venue":"reposiTUm (TU Wien)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Integer programming; Graph; Modulo","score_opus":0.01146602942001659,"score_gpt":0.2275420969976221,"score_spread":0.2160760675776055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946413516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027733562,0.0010239015,0.98890156,0.0018827919,0.0036819885,0.000495936,0.00008897375,0.00019805935,0.0009534285],"genre_scores_gemma":[0.909748,0.000028550417,0.088281445,0.0005898876,0.00015861525,0.000039310675,0.00020799658,0.000038027363,0.00090816064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966393,0.0004434202,0.00085314276,0.00070615293,0.0009535858,0.00040435727],"domain_scores_gemma":[0.9977771,0.00013958308,0.00072105427,0.00087999407,0.00030892677,0.00017336148],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005962554,0.00029147085,0.00040615664,0.00045563705,0.0005904472,0.00018141867,0.0006094484,0.00010624742,0.0010095994],"category_scores_gemma":[0.000089257366,0.0003414322,0.000242065,0.0013055402,0.000121689605,0.00072630856,0.00039219987,0.00036471992,0.00007516842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058850866,0.00026970805,0.002689855,0.00007423968,0.000076695,0.00005036219,0.00046610064,0.98860264,0.00042128272,0.00313443,0.0006089942,0.0035468398],"study_design_scores_gemma":[0.0009190161,0.0003101395,0.00094576017,0.000044900236,0.00011196215,0.000026887144,0.00009478338,0.9876414,0.0016835713,0.00005720111,0.0078075444,0.0003568642],"about_ca_topic_score_codex":0.00009143808,"about_ca_topic_score_gemma":0.000023109678,"teacher_disagreement_score":0.9069747,"about_ca_system_score_codex":0.00030105896,"about_ca_system_score_gemma":0.000561266,"threshold_uncertainty_score":0.9999038},"labels":[],"label_agreement":null},{"id":"W6958512806","doi":"10.6084/m9.figshare.26657590","title":"Additional file 2 of Supporting self-management in women with pre-existing diabetes in pregnancy: a mixed-methods sequential comparative case study","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; McMaster University","funders":"","keywords":"Comparative case; Table (database); Diabetes mellitus; Type 2 diabetes; Type 1 diabetes","score_opus":0.03400080136705371,"score_gpt":0.3350712562732143,"score_spread":0.30107045490616063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958512806","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005710452,0.000030560444,0.0011667969,0.000011869586,0.000052588497,0.0009974757,0.98879,0.00022313185,0.00301716],"genre_scores_gemma":[0.66675717,3.4201398e-7,0.19577123,0.000028695827,0.00003180614,0.0052380846,0.13197467,0.000019194067,0.00017877783],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989399,0.00014365255,0.00027154785,0.00030002106,0.000150572,0.00019430784],"domain_scores_gemma":[0.9989048,0.00077087193,0.00010577996,0.00013187148,0.00004980507,0.000036845864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009506975,0.00010366251,0.00014383989,0.00021635203,0.00004024237,0.00010037968,0.00013113722,0.000023996372,0.5269525],"category_scores_gemma":[0.00012724304,0.00009920884,0.000018117185,0.00065654115,0.0000061119426,0.00034583683,0.00014583745,0.00011843945,0.00003215226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013847814,0.0005119136,0.00028547627,0.00095969735,0.0002175084,0.004152337,0.044110365,0.0073387884,0.0000031928928,0.00009451427,0.5385301,0.40378225],"study_design_scores_gemma":[0.00093199516,0.0004203261,0.028498152,0.014220093,0.000012013705,0.00017742721,0.01060958,0.9240372,0.000059809914,0.00010207682,0.02039881,0.00053251337],"about_ca_topic_score_codex":0.000007367598,"about_ca_topic_score_gemma":0.00016153307,"teacher_disagreement_score":0.9166984,"about_ca_system_score_codex":0.00010767201,"about_ca_system_score_gemma":0.000115697054,"threshold_uncertainty_score":0.47347996},"labels":[],"label_agreement":null},{"id":"W6966475010","doi":"10.4230/lipics.cp.2025.5","title":"Transition Dominance in Domain-Independent Dynamic Programming","year":2025,"lang":"en","type":"article","venue":"Monash University Research Portal (Monash University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong","keywords":"Computation; Dynamic programming; Dominance (genetics); Transition (genetics); Heuristic; State (computer science)","score_opus":0.012832301001443407,"score_gpt":0.2579455366113462,"score_spread":0.2451132356099028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966475010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28805235,0.00006079471,0.60378826,0.0040827235,0.00030100037,0.0012037029,0.000022220003,0.00039091217,0.102098025],"genre_scores_gemma":[0.9796476,0.0001683747,0.008603203,0.000039224822,0.000007347017,6.7831104e-7,0.00002238118,0.0000074541354,0.011503752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975281,0.00037187416,0.00018118338,0.00071792735,0.00059025065,0.000610675],"domain_scores_gemma":[0.9988759,0.00012811828,0.00007011815,0.00045401545,0.00029616855,0.00017568338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061385357,0.00018399468,0.00022132136,0.002229658,0.0005707408,0.000115548806,0.0010391476,0.00017479822,0.0000656585],"category_scores_gemma":[0.00002519605,0.00024897084,0.00012550477,0.004034952,0.00029471854,0.0012466136,0.0004631119,0.00060298713,0.000027692975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005767496,0.0009307363,0.02061471,0.0001595591,0.00016377568,0.010062492,0.0037218628,0.0051416834,0.0015201959,0.768183,0.0013456075,0.18757966],"study_design_scores_gemma":[0.0180907,0.00074371585,0.29377496,0.0010080886,0.00009811989,0.00014315844,0.0530139,0.15061131,0.000888037,0.010704676,0.46815336,0.0027699685],"about_ca_topic_score_codex":0.00039077445,"about_ca_topic_score_gemma":0.0032049122,"teacher_disagreement_score":0.7574783,"about_ca_system_score_codex":0.0007219065,"about_ca_system_score_gemma":0.0005312116,"threshold_uncertainty_score":0.99999624},"labels":[],"label_agreement":null},{"id":"W6968179877","doi":"10.5281/zenodo.16703271","title":"OptimizationProblems.jl","year":2019,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Syntax; Selection (genetic algorithm); Identification (biology); Class (philosophy)","score_opus":0.022200812657762952,"score_gpt":0.2250015510761652,"score_spread":0.20280073841840227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968179877","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.7225033e-7,0.000062100815,0.41439968,0.00042408542,0.00024937134,0.0003729721,0.00005850199,0.0019521908,0.5824807],"genre_scores_gemma":[0.0010880111,0.0007005776,0.043264214,0.0006238876,0.00044359436,1.4114737e-7,0.004005439,0.012197472,0.93767667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981245,0.00022131983,0.0002568364,0.00065012486,0.0004166511,0.0003305621],"domain_scores_gemma":[0.99837095,0.000015354499,0.00024013023,0.00092709647,0.0002951122,0.0001513889],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003013476,0.00023107356,0.00021296943,0.00058213726,0.000768564,0.0012787478,0.0017448933,0.00019111874,0.033907235],"category_scores_gemma":[0.00015273213,0.0002567037,0.00007200008,0.00069484045,0.00009087357,0.00028064646,0.0011869492,0.0002823158,0.025466803],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002657737,0.00003540799,3.72838e-7,0.000050976134,0.000034326866,0.00000371301,0.00018422073,0.0007018338,0.000030238638,0.023529015,0.8822792,0.093148],"study_design_scores_gemma":[0.0003498125,0.00005944795,0.000013250111,0.00006649825,0.000008739266,0.00006370302,0.000027629963,0.008662637,0.0000126045015,0.000088010245,0.9903683,0.00027937477],"about_ca_topic_score_codex":0.000016892116,"about_ca_topic_score_gemma":4.782229e-7,"teacher_disagreement_score":0.37113547,"about_ca_system_score_codex":0.000122043304,"about_ca_system_score_gemma":0.000010140567,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W6986608131","doi":"","title":"Prioritized Unit Propagation and Extended Resolution Techniques for SAT Solvers","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Heuristics; Boolean satisfiability problem; Maximum satisfiability problem; Heuristic; Resolution (logic); Satisfiability; Class (philosophy); Constraint (computer-aided design); True quantified Boolean formula","score_opus":0.014257721180009526,"score_gpt":0.2274240442898645,"score_spread":0.21316632310985498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986608131","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56806535,0.00011772122,0.41825765,0.004346704,0.0016327568,0.004242748,0.0001155947,0.0022395074,0.000981995],"genre_scores_gemma":[0.07897591,0.0010737899,0.37153545,0.00005031538,0.00010733606,0.000016866248,0.0030461336,0.00008768074,0.54510653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990886,0.00004571511,0.00012575497,0.00037090303,0.0001979755,0.0001710648],"domain_scores_gemma":[0.99914634,0.000049548835,0.00024243252,0.0002228755,0.00027919502,0.000059622933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019462465,0.0001569149,0.00022549678,0.00039629868,0.00025827019,0.000054040924,0.00024213457,0.00023290786,0.00001257406],"category_scores_gemma":[0.00002860128,0.00019473772,0.000086045926,0.00027845806,0.000060165494,0.0004485421,0.000055104214,0.00011720483,0.000007657577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010551319,0.00019224771,0.0006666807,0.0023684073,0.0003505618,0.00004140956,0.21694405,0.00020168643,0.03449237,0.03471234,0.006440897,0.7025342],"study_design_scores_gemma":[0.012079258,0.0023924801,0.15764825,0.0034071158,0.00114685,0.000046098576,0.36695886,0.38312775,0.038662557,0.019762293,0.009850517,0.0049179704],"about_ca_topic_score_codex":0.0019122472,"about_ca_topic_score_gemma":0.011653362,"teacher_disagreement_score":0.6976162,"about_ca_system_score_codex":0.00006404413,"about_ca_system_score_gemma":0.00011614973,"threshold_uncertainty_score":0.79411733},"labels":[],"label_agreement":null},{"id":"W6996047811","doi":"","title":"Random constraint satisfaction: A more accurate picture","year":2001,"lang":"en","type":"article","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint (computer-aided design); Random variable; Bayesian probability; Set (abstract data type); Stochastic process","score_opus":0.018859290372520803,"score_gpt":0.29942262521220353,"score_spread":0.2805633348396827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996047811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024755785,0.000047375226,0.9516514,0.008965434,0.00046153355,0.00019292462,0.000001014831,0.00038106967,0.013543446],"genre_scores_gemma":[0.9696729,0.00007544917,0.02741764,0.001006739,0.00008437173,0.000012581724,0.0000032155353,0.0000078021885,0.0017192723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991143,0.000049122675,0.00015791405,0.00027240472,0.0001989312,0.0002073614],"domain_scores_gemma":[0.99932194,0.000068289286,0.0000826603,0.00033865476,0.00007886997,0.00010957125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011922437,0.00013350899,0.000136422,0.00008324155,0.00014479696,0.00015932413,0.00018844786,0.00007105004,0.00080268696],"category_scores_gemma":[0.000046742472,0.00012195634,0.00006194368,0.00035381143,0.00006851653,0.0003417782,0.00005342388,0.00014634478,0.00011238688],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017576638,0.00009524533,0.037375174,0.000031376698,0.00014587084,0.0003085473,0.019596538,0.029001702,0.003044789,0.07897097,0.013510945,0.81774306],"study_design_scores_gemma":[0.013353399,0.00023827355,0.30843773,0.00012924083,0.000070816444,0.003067228,0.006972315,0.50659955,0.0022265643,0.0036158967,0.15320349,0.002085483],"about_ca_topic_score_codex":0.000046256308,"about_ca_topic_score_gemma":0.000057257297,"teacher_disagreement_score":0.94491714,"about_ca_system_score_codex":0.000045273202,"about_ca_system_score_gemma":0.00007682225,"threshold_uncertainty_score":0.8788859},"labels":[],"label_agreement":null},{"id":"W6999413970","doi":"","title":"The constraint satisfaction problem: complexity and approximability","year":2017,"lang":"en","type":"book","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Dresden; Grantová Agentura České Republiky","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Hybrid algorithm (constraint satisfaction); Computational complexity theory; Approximation algorithm","score_opus":0.04102692681197964,"score_gpt":0.25888046554094,"score_spread":0.21785353872896038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999413970","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085297466,0.000078416015,0.32956052,0.0036888723,0.00022527519,0.0017426515,0.00046885244,0.00019474137,0.6631877],"genre_scores_gemma":[0.060312696,0.018819027,0.22611871,0.000064799606,0.00020375538,0.0000022489876,0.0005556609,0.00010415168,0.6938189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99639744,0.00066869427,0.0002429724,0.0009837674,0.00100902,0.00069809746],"domain_scores_gemma":[0.9960258,0.00082148676,0.00055996596,0.0014523928,0.0007379547,0.00040238508],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0015759458,0.00036036418,0.0005342004,0.00063622044,0.0044289287,0.00029395762,0.0024912464,0.00030964703,0.00010893543],"category_scores_gemma":[0.00013309988,0.0003976574,0.00026765701,0.00028559167,0.0065882923,0.0010912685,0.0026137333,0.0014660443,0.000009626162],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003681451,0.00008108321,0.0035144177,0.00028714593,0.00029332875,0.00012359241,0.001766907,0.000033983997,0.00003196269,0.68906313,0.017633015,0.28680328],"study_design_scores_gemma":[0.0016447328,0.00039414607,0.032863725,0.00023127989,0.00006989912,0.00005218637,0.0022525855,0.014157989,0.0000035088262,0.123244055,0.8244562,0.0006297028],"about_ca_topic_score_codex":0.00080905575,"about_ca_topic_score_gemma":0.008273847,"teacher_disagreement_score":0.8068232,"about_ca_system_score_codex":0.00064234895,"about_ca_system_score_gemma":0.0017598827,"threshold_uncertainty_score":0.99984753},"labels":[],"label_agreement":null},{"id":"W7001608982","doi":"","title":"Learning SAT Encodings for Constraint Satisfaction Problems","year":2023,"lang":"en","type":"dissertation","venue":"White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Constraint (computer-aided design); Frame (networking); Feature (linguistics); Nucleofection; Set (abstract data type); Selection (genetic algorithm)","score_opus":0.020165100180329593,"score_gpt":0.21376992579041793,"score_spread":0.19360482561008832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001608982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5443313,0.00021713902,0.43925476,0.004482448,0.0012242616,0.0023165073,0.00070924556,0.00069468573,0.0067696148],"genre_scores_gemma":[0.93160516,0.002326744,0.03726689,0.000023514918,0.00004763323,5.688826e-8,0.00089252455,0.000041163126,0.027796334],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9980165,0.00022157324,0.00027401958,0.0006190502,0.0005216902,0.00034717692],"domain_scores_gemma":[0.9967826,0.00063298986,0.0011815177,0.00053254765,0.0007313933,0.00013892661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005091929,0.00034804695,0.00071894896,0.00069405866,0.0009216072,0.000025559519,0.001469743,0.0005908067,0.00033650867],"category_scores_gemma":[0.00009289265,0.00046061722,0.0005855121,0.0008102669,0.00065868883,0.0005654719,0.0003214561,0.0007203649,0.000016462125],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033425635,0.0009996498,0.01623482,0.0043763868,0.002961179,0.00013429373,0.3870579,0.0873937,0.007221487,0.0150487395,0.008810437,0.46641883],"study_design_scores_gemma":[0.0067794705,0.0016093944,0.08681367,0.0025849824,0.0016301553,0.000025476744,0.7916238,0.08018161,0.00028210034,0.00107863,0.025488652,0.0019020936],"about_ca_topic_score_codex":0.0047024703,"about_ca_topic_score_gemma":0.020768132,"teacher_disagreement_score":0.46451673,"about_ca_system_score_codex":0.00017104138,"about_ca_system_score_gemma":0.00044342337,"threshold_uncertainty_score":0.9997845},"labels":[],"label_agreement":null},{"id":"W7014853004","doi":"","title":"Relational methods in computer science 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005 ; selected revised papers","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Action (physics); Relational database; Relational algebra; Relational model; Computer Applications","score_opus":0.024263112217480048,"score_gpt":0.32448752130471703,"score_spread":0.30022440908723697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014853004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006322324,0.00001616267,0.9854794,0.0029641658,0.0011847682,0.00075309887,0.00003425788,0.00009501193,0.0031507928],"genre_scores_gemma":[0.22505257,0.000027376182,0.77350026,0.0006045142,0.00020033144,0.00008472881,0.00017903934,0.000022172595,0.00032902716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489814,0.00033914845,0.0012974656,0.0011850384,0.0017798276,0.0005003948],"domain_scores_gemma":[0.99597865,0.0015102054,0.00069233245,0.0006279289,0.0010133721,0.00017751098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027666024,0.00036377585,0.00041770434,0.0023448511,0.00027245833,0.00015001671,0.0012940208,0.00017144441,0.00037602693],"category_scores_gemma":[0.00034051915,0.00037267854,0.00009698803,0.004451336,0.00056765816,0.0010561174,0.00030727423,0.00059476285,0.0000067739284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011459,0.00054199854,0.012822822,0.000011896195,0.00003639837,0.000004402355,0.00013019443,0.55900145,0.0029684862,0.114624165,0.0018886965,0.30785492],"study_design_scores_gemma":[0.0009808172,0.000052757103,0.34778863,0.00017752858,0.000007429369,0.00001572201,0.000020711464,0.6452552,0.0025763449,0.00082381186,0.0019642236,0.00033683912],"about_ca_topic_score_codex":0.0064590117,"about_ca_topic_score_gemma":0.0145126125,"teacher_disagreement_score":0.33496583,"about_ca_system_score_codex":0.0017817909,"about_ca_system_score_gemma":0.0022438965,"threshold_uncertainty_score":0.9998725},"labels":[],"label_agreement":null},{"id":"W7019527964","doi":"","title":"Generating Hard and Realistic Boolean (Un)Satisfiability Problems.","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Boolean function; Product term; Set (abstract data type); And-inverter graph; Class (philosophy); Feature (linguistics)","score_opus":0.015792052508206245,"score_gpt":0.22963760130857533,"score_spread":0.21384554880036907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019527964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83063465,0.0009779253,0.0033959188,0.0004702015,0.0066467226,0.004027832,0.0016562185,0.0027000546,0.14949048],"genre_scores_gemma":[0.91252834,0.00047559143,0.076304,0.0007080391,0.00006294732,0.00024702895,0.0011164288,0.000105256484,0.008452398],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957976,0.0004447316,0.0009797201,0.0015889097,0.0006330829,0.00055599393],"domain_scores_gemma":[0.9973074,0.00028787673,0.00056555297,0.0010532025,0.00048660988,0.0002993218],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010111906,0.0006599463,0.000636325,0.00043831996,0.001469202,0.0004482925,0.0007432869,0.00059129536,0.00013791806],"category_scores_gemma":[0.0009825075,0.0007411299,0.00019597427,0.00075711886,0.000057877707,0.0011083246,0.00025941443,0.0010899593,0.000035342302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017856315,0.000064280815,0.000109648136,0.0004866342,0.000101001104,0.000017027685,0.000027421615,0.0012423574,0.00377298,0.20305088,0.000010379051,0.79109955],"study_design_scores_gemma":[0.009705367,0.0011590084,0.08507219,0.0067420024,0.0017464736,0.0004577384,0.0010600762,0.24936889,0.064407825,0.47889286,0.08677282,0.01461473],"about_ca_topic_score_codex":0.00032029246,"about_ca_topic_score_gemma":0.0020701739,"teacher_disagreement_score":0.7764848,"about_ca_system_score_codex":0.00040479325,"about_ca_system_score_gemma":0.00014729516,"threshold_uncertainty_score":0.9998307},"labels":[],"label_agreement":null},{"id":"W7020810813","doi":"","title":"McKinnon Doings, Vol. 5 No. 6, July 4th, 1941","year":2023,"lang":"en","type":"other","venue":"Brock University Digital Repository (Brock University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"League; Victory","score_opus":0.007411041563720943,"score_gpt":0.17507235423329953,"score_spread":0.1676613126695786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020810813","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028059607,0.000028613698,0.067366704,0.0000054898424,0.0030047328,0.0003521868,0.000108961394,0.003815259,0.92529],"genre_scores_gemma":[0.00019190986,0.00014456062,0.0012045564,0.000033297976,0.0003056171,1.5798771e-7,0.000038169946,0.00022764257,0.9978541],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975859,0.000084901934,0.00022531349,0.0010666178,0.00053072744,0.0005065359],"domain_scores_gemma":[0.99780625,0.00009813492,0.00043200457,0.0008221254,0.00048084857,0.0003606077],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000030394754,0.0005203367,0.0004344227,0.0015208777,0.00041006124,0.00038357938,0.0015310429,0.00054061576,0.000045579687],"category_scores_gemma":[0.00007756045,0.000694392,0.00034059517,0.0014071006,0.00015509318,0.0018531949,0.00095080864,0.00043175824,0.0014969958],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003353476,0.00006808305,0.0014507902,0.000050686518,0.00014995184,0.0003548733,0.000011632396,0.00010917298,0.00010931367,0.00037226963,0.99466664,0.0026230551],"study_design_scores_gemma":[0.00067802775,0.000081692364,0.00047438775,0.00019978455,0.00006209425,0.000037504124,0.00037150978,0.00007377001,0.000019767624,0.000014501576,0.997257,0.00072994345],"about_ca_topic_score_codex":0.00021902316,"about_ca_topic_score_gemma":0.00078585383,"teacher_disagreement_score":0.072564095,"about_ca_system_score_codex":0.00063352374,"about_ca_system_score_gemma":0.00032577233,"threshold_uncertainty_score":0.9995507},"labels":[],"label_agreement":null},{"id":"W7024670479","doi":"","title":"Swept up from the Streets or Nowhere Else to Go?: The Journeys of Dutch Female Beggars and Vagrants to the Oegstgeest State Labor Institution in the Late Nineteenth Century","year":2012,"lang":"en","type":"article","venue":"Project Muse (Johns Hopkins University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Institution; State (computer science); Quarter (Canadian coin); Poor relief","score_opus":0.020320085789779608,"score_gpt":0.2323308970817586,"score_spread":0.212010811291979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024670479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9647733,0.000016833505,0.019272296,0.0069858907,0.0005643395,0.0013753435,0.00011251154,0.00005646958,0.0068430337],"genre_scores_gemma":[0.9895364,0.008501522,0.00087100477,0.0009718005,0.000051116895,0.0000046089417,0.0000053782273,0.000007333501,0.00005082481],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986464,0.00036718894,0.0001786941,0.00022806584,0.0002857049,0.0002939766],"domain_scores_gemma":[0.9989134,0.0002797551,0.00012300821,0.0005139775,0.00009396153,0.0000758693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044790257,0.00016211417,0.00013490696,0.0007757592,0.00035568388,0.00013263326,0.0008928076,0.00004781054,0.000023687942],"category_scores_gemma":[0.000082900304,0.00008070932,0.000046485697,0.00426011,0.00009930956,0.0005956812,0.0003230059,0.00022376594,0.000017135957],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000538104,0.00040700755,0.12175263,0.000035254587,0.00019303887,0.00006221254,0.36555776,0.008317218,0.00007844319,0.008949693,0.002052892,0.49205574],"study_design_scores_gemma":[0.0009063613,0.00011114894,0.18169096,0.000073280215,0.000048947146,0.000011913445,0.005813244,0.0022223352,0.00017522823,0.000002687868,0.8087178,0.00022610907],"about_ca_topic_score_codex":0.010970946,"about_ca_topic_score_gemma":0.053558484,"teacher_disagreement_score":0.8066649,"about_ca_system_score_codex":0.00008150309,"about_ca_system_score_gemma":0.00019762105,"threshold_uncertainty_score":0.99561507},"labels":[],"label_agreement":null},{"id":"W7024672697","doi":"","title":"Strategies for addressing the lack of artificial intelligence regulations to protect consumers in digital communication","year":2025,"lang":"en","type":"article","venue":"The International Islamic University Malaysia Repository (The International Islamic University Malaysia)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Normative; Statutory law; Data Protection Act 1998; Consumer protection; Information and Communications Technology; Digital transformation; Digital rights","score_opus":0.03783120397409768,"score_gpt":0.2717889701952552,"score_spread":0.23395776622115755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024672697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2762376,0.000013674937,0.6678555,0.031538405,0.0008688027,0.0010705389,0.00006724565,0.0000992895,0.022248944],"genre_scores_gemma":[0.9926075,0.00001874497,0.0028726277,0.00020978658,0.000038304177,0.0000046289324,0.000033085584,0.000008127255,0.004207194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983323,0.00016024726,0.00041012611,0.00041124312,0.00047118147,0.00021488906],"domain_scores_gemma":[0.9975709,0.0007159656,0.00036808001,0.0006801439,0.0006417604,0.000023153401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046906163,0.00020125457,0.00019154283,0.0005408791,0.0005861683,0.00041336642,0.003644473,0.00009444426,0.000028423265],"category_scores_gemma":[0.0001136933,0.0001716566,0.00018965725,0.0008340518,0.00046835077,0.0011493625,0.0008006895,0.00032445366,0.000010908991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021976465,0.00009298661,0.00082756643,0.000010335537,0.0002239668,0.000008726698,0.0021776943,0.13556091,0.0027460463,0.85203004,0.0004793844,0.0056225806],"study_design_scores_gemma":[0.0005820338,0.00005032914,0.0050043417,0.00023142363,0.000082607374,0.000037234244,0.015074641,0.9248877,0.0019379373,0.046374697,0.00540485,0.00033216292],"about_ca_topic_score_codex":0.0005779588,"about_ca_topic_score_gemma":0.00039897326,"teacher_disagreement_score":0.80565536,"about_ca_system_score_codex":0.0006561698,"about_ca_system_score_gemma":0.0004106548,"threshold_uncertainty_score":0.6999953},"labels":[],"label_agreement":null},{"id":"W7030801696","doi":"","title":"Screaming Beavers","year":2022,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"White (mutation); Government (linguistics); Screaming; Headline; Boycott; Photojournalism; Quality (philosophy); Freedom of information; Trophy","score_opus":0.01050804465338686,"score_gpt":0.22454935412719396,"score_spread":0.2140413094738071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030801696","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008841964,0.00007766042,0.41160974,0.00014321964,0.0010387154,0.00034259853,0.00015594576,0.00064480165,0.58597845],"genre_scores_gemma":[0.0017903137,0.00011519986,0.04413175,0.0006959548,0.00029274594,0.00009088461,0.0005694379,0.00035787545,0.95195585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99655914,0.0003775929,0.0005463322,0.0012697282,0.000622765,0.0006244264],"domain_scores_gemma":[0.9979083,0.0002544317,0.0004899072,0.0010367275,0.000022863554,0.00028779067],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019600634,0.00063616765,0.0005475503,0.0011817258,0.00006937555,0.0003083812,0.002364481,0.00012829472,0.0567911],"category_scores_gemma":[0.000063400395,0.00067523174,0.00038914662,0.0002549533,0.0002624788,0.00020651991,0.002129234,0.00091662095,0.0017358437],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021915117,0.00006135401,0.00041144647,0.000039143128,0.00020536638,0.00011938974,0.0014937443,0.00006819583,0.000023935176,0.03249587,0.96010673,0.0049529206],"study_design_scores_gemma":[0.00052047585,0.00016149289,0.0002841189,0.00022304687,0.000029451803,0.000120809615,0.000063091975,0.02753934,0.00003915029,0.0011227125,0.96920717,0.0006891225],"about_ca_topic_score_codex":0.0059373225,"about_ca_topic_score_gemma":0.0071234684,"teacher_disagreement_score":0.367478,"about_ca_system_score_codex":0.00012469337,"about_ca_system_score_gemma":0.00014278432,"threshold_uncertainty_score":0.9995699},"labels":[],"label_agreement":null},{"id":"W7042188343","doi":"","title":"Operations Research Techniques in Constraint Programming","year":2005,"lang":"en","type":"dissertation","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Constraint programming; Constraint satisfaction; Joint (building); Context (archaeology)","score_opus":0.08915013655303941,"score_gpt":0.4059745813348766,"score_spread":0.31682444478183724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042188343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037937526,0.0002960679,0.8892957,0.019062437,0.0022041851,0.013632709,0.00009162093,0.00028754992,0.037192184],"genre_scores_gemma":[0.6304463,0.0006450178,0.3649784,0.0006694397,0.0007198411,0.0019171779,0.0002161843,0.000040410006,0.00036719016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328685,0.00024790538,0.0010294528,0.0005317657,0.0038819183,0.001022136],"domain_scores_gemma":[0.9954141,0.0014744237,0.00016800649,0.0005924675,0.0022038722,0.00014713217],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.023335673,0.0003018099,0.00033032525,0.0017058952,0.0017987846,0.0027590154,0.0031144458,0.00022709343,0.000011028267],"category_scores_gemma":[0.0015889772,0.00019767204,0.00009081542,0.0029947665,0.0015068499,0.0018303894,0.00041230812,0.0014493533,0.000011974237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020917809,0.00026578756,0.000025871675,0.0002507737,0.00001779526,0.0000032256537,0.027239554,0.0051144673,0.000021737751,0.72592795,0.0008422538,0.24026968],"study_design_scores_gemma":[0.00048884924,0.00017160586,0.0004597734,0.00052672956,0.0000051495645,0.00006572536,0.0035450163,0.9433793,0.00009724256,0.03752606,0.013434047,0.00030052787],"about_ca_topic_score_codex":0.000059041075,"about_ca_topic_score_gemma":0.0020136693,"teacher_disagreement_score":0.9382648,"about_ca_system_score_codex":0.00064459664,"about_ca_system_score_gemma":0.002443906,"threshold_uncertainty_score":0.99950075},"labels":[],"label_agreement":null},{"id":"W7045424919","doi":"","title":"Areas of Same Cardinal Direction","year":2023,"lang":"en","type":"article","venue":"DigitalCommons (California Polytechnic State University)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cardinal direction; Object (grammar); Relation (database); Spatial relation; Spatial intelligence; Field (mathematics); Frame of reference; Reference frame; Set (abstract data type)","score_opus":0.014878722974995234,"score_gpt":0.21198588718855385,"score_spread":0.19710716421355862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045424919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053198006,0.000022471306,0.8134892,0.001320842,0.00041403895,0.0003738223,0.0004192221,0.0026536025,0.12810881],"genre_scores_gemma":[0.9962924,0.00007977268,0.00188889,0.000027734091,0.000009527623,9.923975e-7,0.000045682795,0.000009413864,0.0016455903],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906796,0.000038440536,0.00018000438,0.00026354342,0.00021040853,0.00023964736],"domain_scores_gemma":[0.99923486,0.00008179758,0.00011586516,0.00037799342,0.00008732616,0.000102175676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106153726,0.00012563373,0.00016806669,0.0008602048,0.00011204939,0.00005435818,0.00040188266,0.000055415287,0.000018588093],"category_scores_gemma":[0.000032573094,0.00014270868,0.00013021626,0.0023442719,0.0000962686,0.0004973918,0.0002416583,0.000099352874,0.00012670238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105638115,0.00023853302,0.05871613,0.000073210824,0.0002605757,0.000290531,0.00049422047,0.012772197,0.001969108,0.24057847,0.009873317,0.6746281],"study_design_scores_gemma":[0.0031342232,0.00044670637,0.1653505,0.00022440232,0.00010834054,0.00017821701,0.0010901532,0.17171451,0.008600244,0.00966426,0.63757414,0.0019143386],"about_ca_topic_score_codex":0.000055585995,"about_ca_topic_score_gemma":0.00004146032,"teacher_disagreement_score":0.9430944,"about_ca_system_score_codex":0.00010383915,"about_ca_system_score_gemma":0.00007713262,"threshold_uncertainty_score":0.5819492},"labels":[],"label_agreement":null},{"id":"W7095120501","doi":"","title":"Changes’05 International Workshop on Constraint Solving under Change and Uncertainty","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Position (finance); Position paper; Time constraint; Constraint satisfaction","score_opus":0.05002762432455753,"score_gpt":0.27606668077883584,"score_spread":0.2260390564542783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095120501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032776713,0.000031666255,0.88716096,0.08325412,0.00073686097,0.00020782652,0.0000032216278,0.00027312365,0.025054548],"genre_scores_gemma":[0.9595884,0.00010530453,0.029432463,0.009827448,0.0002535769,0.000017556893,0.000005624791,0.000005606197,0.0007640165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992578,0.000021424534,0.000113248796,0.00026905318,0.00018004682,0.00015842104],"domain_scores_gemma":[0.99956983,0.000084122956,0.00004721706,0.00016278168,0.000053420197,0.000082639104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013085386,0.00010340743,0.00007729663,0.00013273385,0.0000872182,0.00016645995,0.00018704178,0.000052140906,0.0004827413],"category_scores_gemma":[0.000023768758,0.00009343603,0.000022152679,0.00012044116,0.00005593241,0.00035063716,0.000100450176,0.00009776271,0.000037895916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003525517,0.000021717897,0.0001906175,0.0000013780805,0.0000118945645,0.0000019988606,0.00044808513,0.0018250626,0.00006412672,0.18191458,0.00057440554,0.8149426],"study_design_scores_gemma":[0.00090203393,0.000056668425,0.011452132,0.00006433042,0.000005327041,0.00007942185,0.0004846455,0.9521332,0.0002628812,0.0011227727,0.033050716,0.00038592255],"about_ca_topic_score_codex":0.000016353557,"about_ca_topic_score_gemma":0.0004442841,"teacher_disagreement_score":0.95631075,"about_ca_system_score_codex":0.00007406268,"about_ca_system_score_gemma":0.000020897965,"threshold_uncertainty_score":0.52856785},"labels":[],"label_agreement":null},{"id":"W7096725793","doi":"","title":"Fifty-Five Solvers in Vancouver: The SAT 2004 Competition","year":2008,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competition (biology); Software; Set (abstract data type); Process (computing); Snapshot (computer storage)","score_opus":0.01029536189614184,"score_gpt":0.20135780292323452,"score_spread":0.1910624410270927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096725793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00831123,0.000016467315,0.9553999,0.0017820894,0.0005685746,0.00013949156,8.329149e-7,0.00012730974,0.03365411],"genre_scores_gemma":[0.9798206,0.00004402975,0.01698002,0.001084375,0.000021197666,0.000005640575,0.0000023826133,0.0000026547455,0.0020390875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994724,0.00003419344,0.000112070265,0.00014057911,0.00013125276,0.00010950977],"domain_scores_gemma":[0.99967235,0.000054435823,0.0000307984,0.00018327104,0.000031852134,0.000027285398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083174804,0.00005649342,0.000055167377,0.00006024121,0.00012514157,0.000026161195,0.0001833539,0.000026069545,0.0002979131],"category_scores_gemma":[0.000012538696,0.00004133331,0.000027369948,0.00025504403,0.000053067106,0.00031547926,0.000041323936,0.00007651773,0.00008269798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031321142,0.0002856664,0.063797735,0.00001614171,0.00003994643,0.00012766605,0.01512803,0.15446676,0.00032338977,0.45668274,0.1965738,0.112526804],"study_design_scores_gemma":[0.0020601735,0.000093174785,0.20329577,0.00003320581,0.0000051799734,0.0001186737,0.0011678364,0.74885935,0.00064402167,0.0036877904,0.039495777,0.000539033],"about_ca_topic_score_codex":0.00015173628,"about_ca_topic_score_gemma":0.0023360166,"teacher_disagreement_score":0.9715094,"about_ca_system_score_codex":0.00005012211,"about_ca_system_score_gemma":0.000054895445,"threshold_uncertainty_score":0.32619393},"labels":[],"label_agreement":null},{"id":"W7097109693","doi":"","title":"UNIVERSITY OF ALBERTA A Theoretical Evaluation of Selected Backtracking Algorithms BY","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Backtracking; Correctness; Consistency (knowledge bases); Tree (set theory); Look-ahead; Domain (mathematical analysis); Search tree","score_opus":0.010011064454413292,"score_gpt":0.23979477222546136,"score_spread":0.22978370777104806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097109693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032752547,0.000005537925,0.9510676,0.00013621827,0.000036776473,0.000075388656,5.6120246e-7,0.0000186491,0.015906675],"genre_scores_gemma":[0.95136905,0.0000026693199,0.04853053,0.000012735691,0.0000026643959,4.342692e-8,0.0000033706497,0.0000012544605,0.00007769496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940044,0.000054025524,0.000110473025,0.000106389016,0.00025475107,0.00007395377],"domain_scores_gemma":[0.9992782,0.000121217156,0.000064412605,0.000113580245,0.000392128,0.000030444895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322193,0.000036341742,0.00006119637,0.00005297845,0.000025353733,0.0000058253463,0.00012372539,0.000035505513,0.0006992998],"category_scores_gemma":[0.00007527296,0.00003721745,0.000020065607,0.00035918577,0.00007348778,0.00013680593,0.000026092572,0.000032726606,0.00000344675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018780247,0.000109303546,0.0044717933,0.000007995479,0.000032326774,6.173597e-7,0.0015559342,0.000965516,0.0077331592,0.4775253,0.0005747421,0.50700456],"study_design_scores_gemma":[0.0005498014,0.00003786756,0.01964221,0.000008095998,0.000017949238,0.0000036282224,0.00015495205,0.9623061,0.015838042,0.0012704307,0.00009554344,0.000075413824],"about_ca_topic_score_codex":0.00013958519,"about_ca_topic_score_gemma":0.00015731553,"teacher_disagreement_score":0.96134055,"about_ca_system_score_codex":0.000026176256,"about_ca_system_score_gemma":0.00007072097,"threshold_uncertainty_score":0.76568425},"labels":[],"label_agreement":null},{"id":"W7097355445","doi":"","title":"Toronto, CanadaORGANISATION Organizers and Workshop Chairs","year":2004,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constraint satisfaction; Constraint satisfaction problem; Constraint (computer-aided design); Simplicity; Constraint programming; Field (mathematics)","score_opus":0.005667588356920029,"score_gpt":0.20198033087731254,"score_spread":0.19631274252039252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097355445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00897151,0.00002919235,0.9785928,0.004791793,0.00018257601,0.000066912675,2.228594e-7,0.00016705514,0.007197953],"genre_scores_gemma":[0.94704217,0.000028788625,0.052195694,0.00044140112,0.00001545991,0.0000011714152,0.000001099668,0.0000032839596,0.00027094965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995916,0.000006802784,0.00007532436,0.00014582391,0.00009228526,0.00008819801],"domain_scores_gemma":[0.99974823,0.000012112863,0.000021051374,0.00012118028,0.00003064101,0.000066758934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004342549,0.000052782343,0.000043231423,0.000019164323,0.00007924651,0.00007970321,0.0000843696,0.000028181516,0.00023475294],"category_scores_gemma":[0.000013367312,0.000050339615,0.0000074560617,0.000105954554,0.000016812215,0.00046543792,0.000034236407,0.000026601967,0.000009558147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023198436,0.000023943685,0.0016229787,0.0000052789906,0.000015993137,0.0000062771283,0.0038470172,0.001905501,0.0010742217,0.76631933,0.0008650221,0.22431213],"study_design_scores_gemma":[0.01857484,0.0006667933,0.47920874,0.00021471168,0.00010330242,0.001943272,0.027754063,0.26323524,0.06844346,0.111045636,0.022581613,0.0062283343],"about_ca_topic_score_codex":0.0026557143,"about_ca_topic_score_gemma":0.024713457,"teacher_disagreement_score":0.93807065,"about_ca_system_score_codex":0.00014917315,"about_ca_system_score_gemma":0.00009484187,"threshold_uncertainty_score":0.993083},"labels":[],"label_agreement":null},{"id":"W7097461270","doi":"","title":"Ecole Polytechnique de Montreal","year":2015,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Automaton; Software; Sequence (biology); Range (aeronautics); Natural language; Decomposition; State (computer science); Büchi automaton","score_opus":0.015895551968881174,"score_gpt":0.24015953185417477,"score_spread":0.2242639798852936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097461270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009970913,0.0000030305794,0.90471995,0.0009705688,0.000058675676,0.00003679357,1.4510833e-7,0.00026844474,0.09294531],"genre_scores_gemma":[0.68309647,0.0000019020438,0.31487685,0.00058718876,0.0000147470155,0.0000043450455,4.47422e-7,0.000001662892,0.0014163733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971586,0.000014575227,0.00005018164,0.00007949069,0.00006136936,0.000078546174],"domain_scores_gemma":[0.9997341,0.000008319692,0.000012789844,0.00012948441,0.000031000367,0.000084305255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009931405,0.000030213085,0.000029007502,0.000034553817,0.000018684166,0.000045259854,0.00012226882,0.000022897293,0.000045703557],"category_scores_gemma":[0.00001452227,0.000027507742,0.000012038354,0.00009447686,0.0000076356255,0.00017859986,0.00003536562,0.000027300533,0.000044004308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046923133,0.00005453544,0.017122617,0.0000018673252,0.0000074455556,0.000015423662,0.0009624524,0.0058089215,0.00030702047,0.40106165,0.03593218,0.5387212],"study_design_scores_gemma":[0.00037054298,0.00005271158,0.035951354,0.000002579561,0.0000015320859,0.00006348647,0.000059459057,0.93985265,0.0032292542,0.014747243,0.005515611,0.00015356943],"about_ca_topic_score_codex":0.00019533005,"about_ca_topic_score_gemma":0.00017486479,"teacher_disagreement_score":0.93404377,"about_ca_system_score_codex":0.000035476533,"about_ca_system_score_gemma":0.000088286375,"threshold_uncertainty_score":0.11217332},"labels":[],"label_agreement":null},{"id":"W7097876432","doi":"","title":"Constraint Reasoning DCR’2004- In conjunction with the Tenth International Conference on Principles and Practice of Constraint Programming (CP’2004), Toronto, Canada Dynamic Distributed BackJumping","year":2010,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Constraint programming; Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Constraint satisfaction problem; Set (abstract data type); Conjunction (astronomy); Distributed algorithm","score_opus":0.012426214211145805,"score_gpt":0.24835180172292992,"score_spread":0.2359255875117841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097876432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05298374,0.000037867158,0.91586787,0.011005333,0.00075139984,0.00084492937,0.00004294948,0.00012590924,0.018340029],"genre_scores_gemma":[0.9574694,0.000019876701,0.042199124,0.0002121288,0.0000131175775,0.00001875909,0.00002566857,0.000006078425,0.000035852125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862534,0.00009337964,0.00032912492,0.00035487628,0.00037361172,0.00022367407],"domain_scores_gemma":[0.9986832,0.0003439273,0.0002988413,0.0002549123,0.00033146312,0.0000876121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528263,0.00016912905,0.0001622092,0.000052109055,0.00012473468,0.00018921128,0.00026886875,0.00006264701,0.00012420365],"category_scores_gemma":[0.00037045157,0.00012305361,0.000020994747,0.00016632205,0.00030503763,0.0005652695,0.000076396296,0.00029640354,4.9384647e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019213503,0.0001953461,0.013117546,0.00003532567,0.00014916879,0.00004659512,0.0012594626,0.0060951062,0.0030891201,0.6848289,0.00009423478,0.2908971],"study_design_scores_gemma":[0.0028150931,0.00032852107,0.06526178,0.00036730754,0.00004617257,0.0009645349,0.015631422,0.90436614,0.00070868136,0.0001119646,0.008647028,0.0007513479],"about_ca_topic_score_codex":0.05327479,"about_ca_topic_score_gemma":0.7064824,"teacher_disagreement_score":0.90448564,"about_ca_system_score_codex":0.00025336462,"about_ca_system_score_gemma":0.000736516,"threshold_uncertainty_score":0.9530295},"labels":[],"label_agreement":null},{"id":"W7099194177","doi":"","title":"A Conceptual Comparative Analysis Between the British and the Canadian Mad Cow Crisis: The Cost","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Key (lock)","score_opus":0.02420937720867007,"score_gpt":0.25748989400505623,"score_spread":0.23328051679638617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099194177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016883068,0.00046058148,0.7325235,0.20580229,0.0001358901,0.0010763779,0.000044555058,0.00012459744,0.04294915],"genre_scores_gemma":[0.9930857,0.000023637089,0.0012883382,0.0051455772,0.000052029285,0.000018962155,0.000004844328,0.0000015615577,0.00037937757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999127,0.0001999051,0.00015605766,0.0001788393,0.00017145442,0.0001667678],"domain_scores_gemma":[0.999182,0.00030582194,0.00005528638,0.00027850838,0.00008581878,0.00009259793],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00039419104,0.000075719974,0.00014210527,0.000043796776,0.0012961364,0.001313881,0.00043485817,0.000030538773,0.00018289823],"category_scores_gemma":[0.000017190316,0.000039449114,0.00006374033,0.00059298455,0.00049917103,0.00020613728,0.00006244615,0.00013691549,0.000022022272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012378901,0.000022112179,0.074114166,0.0000014103862,0.0016444735,0.000006038762,0.043704238,0.01993377,7.056174e-7,0.5259316,0.09443246,0.24019666],"study_design_scores_gemma":[0.0013366068,0.000018752175,0.4449987,0.0000050605727,0.0003008808,0.00003615748,0.010123001,0.44688934,0.000018895513,0.0006651345,0.0953211,0.00028638478],"about_ca_topic_score_codex":0.15295912,"about_ca_topic_score_gemma":0.91205645,"teacher_disagreement_score":0.9762026,"about_ca_system_score_codex":0.000049225924,"about_ca_system_score_gemma":0.000115647,"threshold_uncertainty_score":0.99972284},"labels":[],"label_agreement":null},{"id":"W7100761624","doi":"","title":"Author manuscript, published in &amp;quot;CP&amp;apos;12: International Conference on Principles and Practice of Constraint Programming, Québec City: Canada (2012)&amp;quot; Revisiting Neighborhood Inverse Consistency on Binary CSPs","year":2012,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Local consistency; Constraint satisfaction problem; Consistency (knowledge bases); Pairwise comparison; Binary number; Weak consistency; Consistency model; Causal consistency; Constraint (computer-aided design)","score_opus":0.1493037634918881,"score_gpt":0.32662805670698225,"score_spread":0.17732429321509416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100761624","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17714189,0.00046243882,0.28387457,0.15434933,0.0060057743,0.0036932745,0.00017089299,0.00088148843,0.37342036],"genre_scores_gemma":[0.89366454,0.000050477433,0.100293234,0.0021820138,0.00011024975,0.000039980932,0.00006874526,0.00002034004,0.0035704074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968975,0.00034453726,0.0008589856,0.0006341785,0.0007349249,0.00052987045],"domain_scores_gemma":[0.99719524,0.00072200014,0.00063930865,0.00061454054,0.00047597542,0.00035296046],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013668637,0.0003413855,0.00038716313,0.00040112497,0.00017407759,0.00037391382,0.0004945756,0.00014162705,0.0010268041],"category_scores_gemma":[0.0027298671,0.00032429976,0.000068662186,0.00039226506,0.00024524407,0.0019766917,0.00029306576,0.00045848454,0.000018516792],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002732494,0.00096746976,0.10589941,0.00020524976,0.0002442632,0.000042484106,0.0067050955,0.00052213145,0.0008070032,0.65511733,0.015747728,0.21346858],"study_design_scores_gemma":[0.003174868,0.00032784417,0.050359555,0.0007658826,0.000098616,0.000679966,0.0044370997,0.01811347,0.00021659707,0.00051700603,0.919598,0.0017111211],"about_ca_topic_score_codex":0.11527917,"about_ca_topic_score_gemma":0.581471,"teacher_disagreement_score":0.90385026,"about_ca_system_score_codex":0.00044330524,"about_ca_system_score_gemma":0.0015824088,"threshold_uncertainty_score":0.9999209},"labels":[],"label_agreement":null},{"id":"W7104456890","doi":"10.5281/zenodo.17556483","title":"Spectral-Multiplicative Optimization Framework","year":2025,"lang":"en","type":"dissertation","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristic; Optimization problem; Multiplicative function; Convergence (economics); Constrained optimization; Global optimization; Constraint (computer-aided design)","score_opus":0.02243130766186581,"score_gpt":0.2619489755576584,"score_spread":0.2395176678957926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104456890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000823942,0.00007888873,0.79829246,0.00080787746,0.00056647067,0.00065284513,0.00009379578,0.0016450871,0.19778016],"genre_scores_gemma":[0.16722953,0.004260458,0.62729424,0.0021179803,0.0016211268,0.0000030756757,0.102706954,0.008416367,0.08635025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974886,0.00030901624,0.00044288198,0.0008760046,0.00049116864,0.00039229268],"domain_scores_gemma":[0.997427,0.00007149121,0.00032796495,0.0009140654,0.001090154,0.00016931871],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038895753,0.00030804737,0.00027403783,0.0006407131,0.0022793012,0.0017557656,0.0020097073,0.00031736767,0.0064572436],"category_scores_gemma":[0.00089176145,0.00032140338,0.00012120055,0.001381053,0.000060338665,0.0005519022,0.00054832804,0.0006641383,0.0016978029],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092354516,0.00022719365,0.0000016796458,0.0002566151,0.00017426425,0.000013279652,0.0043484583,0.025349226,0.00030730173,0.15219103,0.06730116,0.74973744],"study_design_scores_gemma":[0.0007834978,0.0002117837,0.0006997793,0.0004850886,0.000070145674,0.00005840749,0.0008106232,0.13294563,0.0009777134,0.0043193083,0.8576467,0.0009913088],"about_ca_topic_score_codex":0.00000897847,"about_ca_topic_score_gemma":0.0000011426561,"teacher_disagreement_score":0.79034555,"about_ca_system_score_codex":0.00029261684,"about_ca_system_score_gemma":0.000025860934,"threshold_uncertainty_score":0.9999238},"labels":[],"label_agreement":null},{"id":"W7110393708","doi":"10.4230/lipics.stacs.2025.60","title":"Modular Counting CSP: Reductions and Algorithms","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Constraint satisfaction problem; Automorphism; Prime (order theory); Counting problem; Modular design; Focus (optics); Binary number; Binary tree","score_opus":0.0078069332054348396,"score_gpt":0.24956541262937426,"score_spread":0.2417584794239394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110393708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014699944,0.000048370406,0.9754194,0.0014449243,0.0012435365,0.0005517374,0.00006213091,0.0002646458,0.006265307],"genre_scores_gemma":[0.643428,0.00017161497,0.35172153,0.0023721585,0.00015085611,0.00014175681,0.00019833106,0.000028468083,0.0017872326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.000022166152,0.0006246466,0.00023896022,0.00022807893,0.00036225747],"domain_scores_gemma":[0.9989211,0.000081516606,0.00019973758,0.00045048338,0.00024722985,0.00009996063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003707036,0.00021001558,0.00023385047,0.00032380785,0.00049679837,0.00053912605,0.00039271617,0.00012934685,0.000017306129],"category_scores_gemma":[0.00009032928,0.0002097514,0.000096276686,0.0004491753,0.00010553158,0.0016130357,0.0002489596,0.00022535527,0.000021280932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046731053,0.00034289778,0.012541278,0.0008982992,0.00046308478,0.0000056207905,0.0119964825,0.005604677,0.0003883432,0.3595513,0.011907733,0.5962535],"study_design_scores_gemma":[0.0016679792,0.000056257504,0.0042291298,0.00013062,0.000033038905,0.00006534016,0.00091574213,0.9050597,0.00043159374,0.0026788511,0.084351905,0.00037984585],"about_ca_topic_score_codex":0.000013673217,"about_ca_topic_score_gemma":0.00000896498,"teacher_disagreement_score":0.899455,"about_ca_system_score_codex":0.00008291999,"about_ca_system_score_gemma":0.00009337843,"threshold_uncertainty_score":0.8553414},"labels":[],"label_agreement":null},{"id":"W7115887828","doi":"10.5287/ora-pzpyzzjrv","title":"Promise constraint satisfaction problems","year":2022,"lang":"en","type":"dissertation","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Constraint satisfaction problem; Constraint (computer-aided design); Constraint satisfaction; Algebraic number; Cover (algebra); Boolean satisfiability problem; Benchmark (surveying)","score_opus":0.023748714854991634,"score_gpt":0.25784704247778706,"score_spread":0.23409832762279542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115887828","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.130953,0.00021225924,0.4081315,0.002554229,0.0017545508,0.0056949784,0.0013962961,0.0010340204,0.44826916],"genre_scores_gemma":[0.735576,0.012040118,0.12670302,0.00007607195,0.00015984003,0.000008582823,0.0063682958,0.00018395642,0.11888415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955002,0.00082024426,0.000291483,0.0011021115,0.0015049782,0.00078097667],"domain_scores_gemma":[0.99712306,0.0003495409,0.00051872147,0.0009012324,0.00069877383,0.00040868585],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090447237,0.00039304906,0.0005600168,0.0021574616,0.001939059,0.00011670328,0.0021776548,0.00029291617,0.002326299],"category_scores_gemma":[0.00008979949,0.0005644082,0.00038224363,0.0018116985,0.00059713155,0.0012548048,0.0009947236,0.0017140806,0.000019969486],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026485384,0.0009505981,0.014131876,0.001784736,0.0012357752,0.0011967376,0.039857894,0.0043865675,0.003704873,0.29746842,0.019017894,0.6136161],"study_design_scores_gemma":[0.005799591,0.00178498,0.09922307,0.0005895843,0.00023361263,0.000092471164,0.089921124,0.04227493,0.00015011519,0.010882608,0.746896,0.0021518874],"about_ca_topic_score_codex":0.0015958638,"about_ca_topic_score_gemma":0.009300106,"teacher_disagreement_score":0.72787815,"about_ca_system_score_codex":0.0007670517,"about_ca_system_score_gemma":0.0016736911,"threshold_uncertainty_score":0.99968076},"labels":[],"label_agreement":null},{"id":"W7117377964","doi":"10.2139/ssrn.5975002","title":"A General Framework for Predicting and Explaining the Hardness of Graph-Based Combinatorial Optimization Problems using Machine Learning and Association Rule Mining","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Association rule learning; Benchmark (surveying); Computation; Graph; Clique; Regression; Optimization problem","score_opus":0.012726237416075111,"score_gpt":0.2596199946167792,"score_spread":0.24689375720070408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117377964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050592568,0.0020451336,0.9435698,0.00058755535,0.0022873213,0.00082708005,0.000018390989,0.000047688598,0.000024475587],"genre_scores_gemma":[0.72441536,0.005409491,0.26928407,0.00006357649,0.0005638266,0.000055396176,0.00004315205,0.000046932695,0.000118201286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535674,0.0007727684,0.0011079328,0.00066624675,0.0006012354,0.0014950581],"domain_scores_gemma":[0.99531066,0.0010970271,0.002560299,0.00021016717,0.00071554515,0.000106308544],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006712236,0.00044131282,0.0006110914,0.000457134,0.0018351881,0.00075179926,0.00033724896,0.00057500415,0.0000071251193],"category_scores_gemma":[0.0014790897,0.0004215523,0.00021482343,0.0005751049,0.000117164534,0.00046388985,0.00032303628,0.003917097,3.888392e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010701862,0.00004507832,0.049007162,0.00017593855,0.00041424966,3.8942713e-7,0.0020899964,0.87813514,0.00005200852,0.053258657,6.949532e-7,0.016713647],"study_design_scores_gemma":[0.0019130416,0.00027299378,0.00026351705,0.0009534404,0.00030602535,0.00006620868,0.00093357835,0.94371945,0.000053509742,0.051166013,0.000022369377,0.00032985775],"about_ca_topic_score_codex":0.00012945595,"about_ca_topic_score_gemma":0.00008150653,"teacher_disagreement_score":0.6742857,"about_ca_system_score_codex":0.0011778179,"about_ca_system_score_gemma":0.0037852817,"threshold_uncertainty_score":0.99982363},"labels":[],"label_agreement":null},{"id":"W7117896362","doi":"10.1613/jair.1.19533","title":"Combining Constraint Programming and Machine Learning: From Current Progress to Future Opportunities","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Key (lock); Resource (disambiguation); Constraint (computer-aided design); Resource constraints; Open research","score_opus":0.21473514558467585,"score_gpt":0.41256032378544666,"score_spread":0.1978251782007708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117896362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01966806,0.0017339521,0.96556836,0.011661245,0.00085237355,0.0002487429,0.0000015446291,0.000035088597,0.00023062665],"genre_scores_gemma":[0.96514213,0.00063449907,0.033928096,0.000047345853,0.00019430267,0.000008226514,0.0000017252411,0.000005665416,0.000038032194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980698,0.0003063596,0.0005382764,0.00021424016,0.0005741988,0.00029709542],"domain_scores_gemma":[0.99826324,0.00032732822,0.00014903974,0.00014899539,0.0008957188,0.00021568972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018647469,0.00010544595,0.00019480301,0.0006714295,0.00031905196,0.00074174395,0.00043935957,0.000055483204,0.000039470033],"category_scores_gemma":[0.00027455584,0.00009237569,0.000054325374,0.00071371696,0.00026319554,0.00041480592,0.00023837529,0.0008203943,0.0000059572967],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032261894,0.00006028916,0.0010140778,0.000013420561,0.000018703424,0.000023661552,0.0018327886,0.00038523367,0.00016104976,0.08518232,0.000057634876,0.9112186],"study_design_scores_gemma":[0.00051163876,0.002743919,0.0040295646,0.0023934206,0.00006314746,0.00023999187,0.090367466,0.5655444,0.024450153,0.111990884,0.1965873,0.0010780906],"about_ca_topic_score_codex":0.000026185882,"about_ca_topic_score_gemma":0.0000366164,"teacher_disagreement_score":0.945474,"about_ca_system_score_codex":0.00007322568,"about_ca_system_score_gemma":0.00049321895,"threshold_uncertainty_score":0.7152654},"labels":[],"label_agreement":null},{"id":"W7117995562","doi":"10.1145/3712285.3787189","title":"10.1145/3712285.3787189","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Parallelism (grammar); Scheme (mathematics); Key (lock); Component (thermodynamics)","score_opus":0.004420487585784678,"score_gpt":0.16756780355997902,"score_spread":0.16314731597419435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117995562","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008956834,0.0000082119695,0.00675319,0.001020514,0.000006461078,0.000102325015,0.000001759002,0.0002792211,0.99173874],"genre_scores_gemma":[0.0005371608,3.196397e-7,0.007903641,0.00020322342,0.00003566701,0.0000063509733,0.0000031198176,0.000005645304,0.9913049],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936175,0.000024634443,0.00011558485,0.00020537282,0.00013757842,0.0001550854],"domain_scores_gemma":[0.9995298,0.000023962464,0.000018057588,0.00028777955,0.00003449818,0.0001059255],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000078811485,0.000078604484,0.00007569381,0.00006936883,0.000073579555,0.00009846522,0.00027291008,0.000032369535,0.98120594],"category_scores_gemma":[0.000012918913,0.00008063761,0.000032127973,0.0002867999,0.000015045834,0.0002398177,0.00004012711,0.000048692593,0.95674086],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004047162,0.000011529318,4.7676224e-7,7.0736775e-7,0.0000030237995,0.0000019651463,0.000019828203,0.0010735423,0.000013017173,0.00005959356,0.035120204,0.96369207],"study_design_scores_gemma":[0.000117617725,0.000038259983,0.00015189275,0.0000041059316,0.0000019039089,0.000010157022,2.3482423e-7,0.026186273,0.00004025517,0.000027027789,0.97331434,0.00010794346],"about_ca_topic_score_codex":0.0000069622824,"about_ca_topic_score_gemma":1.650099e-7,"teacher_disagreement_score":0.9635841,"about_ca_system_score_codex":0.000022857097,"about_ca_system_score_gemma":0.000029596571,"threshold_uncertainty_score":0.32883063},"labels":[],"label_agreement":null},{"id":"W7123733475","doi":"10.1109/icet66147.2025.11321459","title":"From Exact Search to Evolutionary Algorithms: Benchmarking N-Queens Solvers","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Initialization; Benchmarking; Harmony search; Robustness (evolution); Simulated annealing; Solver; Ranging; Benchmark (surveying); Rate of convergence; Premature convergence","score_opus":0.015622616632197764,"score_gpt":0.27909064998331407,"score_spread":0.2634680333511163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123733475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016594918,0.00015849876,0.9513006,0.010089427,0.00359091,0.0005096781,0.000037494992,0.00020608162,0.03244777],"genre_scores_gemma":[0.5360357,0.00023249695,0.45007426,0.003722006,0.0005443678,0.000023646593,0.00004918586,0.000017919056,0.00930044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968391,0.0002117103,0.0005832636,0.0011207248,0.0006141776,0.000631001],"domain_scores_gemma":[0.99810624,0.00034973893,0.00007385453,0.000775009,0.0003575927,0.00033755883],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039267202,0.00032526677,0.0003027814,0.00050817063,0.0005843084,0.0005398283,0.00074392033,0.00020347399,0.005639301],"category_scores_gemma":[0.000075677315,0.00036718877,0.00017245702,0.0018872927,0.0001287139,0.00076713786,0.0007662553,0.0003710126,0.00043910326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027480039,0.00011246047,0.0039657657,0.000018015953,0.00014616188,0.000021392441,0.0021557931,0.035170965,0.00019489811,0.018051898,0.026544724,0.91359043],"study_design_scores_gemma":[0.00049107615,0.00007876512,0.044058386,0.00018107341,0.000028436938,0.0000037720167,0.00063040556,0.94282156,0.00034507905,0.0007213804,0.010245276,0.0003948113],"about_ca_topic_score_codex":0.0018860576,"about_ca_topic_score_gemma":0.00012889112,"teacher_disagreement_score":0.9131956,"about_ca_system_score_codex":0.0005150858,"about_ca_system_score_gemma":0.0010101865,"threshold_uncertainty_score":0.999878},"labels":[],"label_agreement":null},{"id":"W7124241997","doi":"10.65109/igsn9951","title":"Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search","year":2024,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Lockheed Martin (Canada)","funders":"","keywords":"Disjoint sets; Clique; State (computer science); Solver; Heuristic; Exponential function; Minification","score_opus":0.01452661755021012,"score_gpt":0.27590278970141113,"score_spread":0.261376172151201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124241997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015823161,0.00050487183,0.9715509,0.0056859013,0.00021969325,0.00025580826,0.000009507391,0.00019079099,0.00575936],"genre_scores_gemma":[0.9774079,0.00012222884,0.01905842,0.0005130707,0.000032960426,0.000006422081,0.00001311973,0.000012503938,0.0028333857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976931,0.00028056462,0.000522057,0.00079832686,0.0003213902,0.0003845405],"domain_scores_gemma":[0.998923,0.00040054545,0.000046055644,0.00033110112,0.00011493162,0.00018434497],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009001196,0.00022563705,0.00039105263,0.0015071823,0.0001285464,0.0017800716,0.00019835834,0.0001621755,0.0023227073],"category_scores_gemma":[0.000037743175,0.00022774101,0.00012882416,0.0034371694,0.00019927858,0.0005686503,0.00011678825,0.00034336216,0.00012894915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032292988,0.000105871615,0.03801633,0.00015886246,0.00058367546,0.00020368148,0.0027231039,0.04798391,0.0017871648,0.019633582,0.00028351927,0.888488],"study_design_scores_gemma":[0.00036883884,0.00005867766,0.0213468,0.000096136995,0.00013051924,0.000008315311,0.00005411313,0.9758831,0.0007203624,0.00003567635,0.001041084,0.00025636383],"about_ca_topic_score_codex":0.0005070788,"about_ca_topic_score_gemma":0.00037992405,"teacher_disagreement_score":0.96158475,"about_ca_system_score_codex":0.00011546923,"about_ca_system_score_gemma":0.00047137972,"threshold_uncertainty_score":0.9992562},"labels":[],"label_agreement":null},{"id":"W7124244561","doi":"10.65109/wjjy5186","title":"interActors: A Model for Separating Complex Communication Concerns in Multiagent Computations","year":2017,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Initialization; Computation; Models of communication; Key (lock); Complex system","score_opus":0.18181330747406232,"score_gpt":0.40796660870538676,"score_spread":0.22615330123132443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124244561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062075523,0.00002518527,0.98202604,0.0042678,0.00037146176,0.001199892,0.0000537163,0.000084926505,0.005763414],"genre_scores_gemma":[0.7067164,0.00004870404,0.29231372,0.00031197202,0.000031784573,0.000068091176,0.000051845895,0.000012907523,0.00044454966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786615,0.00014062253,0.00084417517,0.00055232114,0.00022192176,0.00037478885],"domain_scores_gemma":[0.9968808,0.0003816801,0.0007669052,0.0014229747,0.00040706393,0.00014053754],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004990877,0.0002719846,0.00034127038,0.0001919992,0.0016224977,0.0016893897,0.0013494034,0.00012533029,0.00026039747],"category_scores_gemma":[0.00031290302,0.00030851114,0.00014835456,0.00012083147,0.0002608066,0.0018362778,0.0005681583,0.00025265096,0.000027217404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027875509,0.00022137127,0.004971589,0.00004535916,0.000038382677,0.0000010969146,0.012672147,0.80875176,0.0001686703,0.04960696,0.0006949447,0.12279983],"study_design_scores_gemma":[0.0017405167,0.000041348554,0.017306702,0.0001268973,0.000014397592,0.0000032529215,0.0003504397,0.9784747,0.000041863623,0.0012884357,0.0002844295,0.00032701265],"about_ca_topic_score_codex":0.00048398037,"about_ca_topic_score_gemma":0.0044370075,"teacher_disagreement_score":0.70050883,"about_ca_system_score_codex":0.0002221761,"about_ca_system_score_gemma":0.0002665195,"threshold_uncertainty_score":0.9999367},"labels":[],"label_agreement":null},{"id":"W7124293546","doi":"10.65109/wpsb9400","title":"Approximation Ratio for Preference Aggregation Using Tree CP-Nets","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Preference; Class (philosophy); Simple (philosophy); Tree (set theory); Set (abstract data type); Preference theory; Aggregation problem; Exponential function","score_opus":0.05460642767539643,"score_gpt":0.2869001496834418,"score_spread":0.23229372200804538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124293546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018424995,0.00009895196,0.9814495,0.002041033,0.0016220062,0.0015502309,0.000007774297,0.00016526923,0.011222739],"genre_scores_gemma":[0.6606497,0.000056020115,0.33409628,0.00059487595,0.000069257025,0.00007046397,0.000035514277,0.000010614271,0.0044172425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979203,0.00011823532,0.0006789072,0.00067879085,0.000274118,0.00032970123],"domain_scores_gemma":[0.99838406,0.00018466613,0.00031344546,0.00048544627,0.00055067625,0.00008173691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040911481,0.00026447946,0.00024753806,0.00039435344,0.0005232753,0.00071103376,0.00035347536,0.00019907915,0.00018320179],"category_scores_gemma":[0.00022109554,0.00028597444,0.00012270402,0.0009882543,0.00008326363,0.0015192365,0.00011424084,0.00012641017,0.000015524292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028333847,0.00006532777,0.0004332073,0.00010503076,0.000036115856,2.0279373e-7,0.00046013042,0.022816932,0.0016306406,0.22172074,0.0005398662,0.75216347],"study_design_scores_gemma":[0.0009565743,0.000056847213,0.0020050022,0.00017660185,0.00005120061,0.0000034537854,0.00007766391,0.97942936,0.009775942,0.0063046534,0.00089457806,0.0002681387],"about_ca_topic_score_codex":0.000041422725,"about_ca_topic_score_gemma":0.00013731886,"teacher_disagreement_score":0.9566124,"about_ca_system_score_codex":0.0002401193,"about_ca_system_score_gemma":0.00064985617,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W7125595225","doi":"10.1109/cascon66301.2025.00064","title":"Efficient Compilation of Algorithms into Compact Linear Programs","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Solver; Linear programming; Rounding; Integer programming; Abstraction; Compiler; Extension (predicate logic); Tree (set theory); Reduction (mathematics)","score_opus":0.017533580552783742,"score_gpt":0.287138950852305,"score_spread":0.26960537029952125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125595225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073702727,0.00012732708,0.974182,0.0019100506,0.0013327365,0.0006681496,0.0000043572804,0.00014789117,0.014257179],"genre_scores_gemma":[0.88347304,0.000020226229,0.115261815,0.00015548678,0.000032140728,0.0000036093832,0.000019468709,0.000006321679,0.0010278963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978833,0.00013225642,0.0007977531,0.00049325405,0.00041478913,0.0002786179],"domain_scores_gemma":[0.9984794,0.00010016078,0.00028219578,0.000524209,0.0005016777,0.00011233123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004137246,0.00023633518,0.0003505695,0.00039449733,0.00021768667,0.00015581939,0.00040399368,0.00013607094,0.00027918196],"category_scores_gemma":[0.00004562616,0.00023176745,0.00016027472,0.0017365313,0.00025335298,0.00014452814,0.00015868775,0.00018424196,0.00004325898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020172085,0.00047383332,0.007942366,0.00011382289,0.000069245616,0.0000012239376,0.0012720088,0.22759376,0.00019247002,0.051881216,0.00017545478,0.71026444],"study_design_scores_gemma":[0.0006950783,0.00013164498,0.021849098,0.0001811268,0.00002919304,0.0000025009087,0.00016906437,0.9742109,0.0013768924,0.00025893882,0.0009051879,0.00019035312],"about_ca_topic_score_codex":0.00019302158,"about_ca_topic_score_gemma":0.00004628673,"teacher_disagreement_score":0.87610275,"about_ca_system_score_codex":0.0001238483,"about_ca_system_score_gemma":0.00040812657,"threshold_uncertainty_score":0.9451203},"labels":[],"label_agreement":null},{"id":"W7125631293","doi":"10.1109/cascon66301.2025.00095","title":"Deploying AI Models in Resource-Constrained Environments","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Key (lock); Feature (linguistics); Set (abstract data type); Identification (biology); Perspective (graphical)","score_opus":0.013598909710013768,"score_gpt":0.23991623060558687,"score_spread":0.2263173208955731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125631293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011799693,0.0001275693,0.9003398,0.0061667254,0.00037879756,0.0003788193,0.0000022606293,0.000090294154,0.09133577],"genre_scores_gemma":[0.96661067,0.0001208495,0.02024946,0.005342603,0.000017616601,0.000017024322,0.0000034546713,0.000011137649,0.0076272064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975923,0.00018095704,0.0006905791,0.0007530915,0.00030362883,0.00047944757],"domain_scores_gemma":[0.9990715,0.00011451425,0.00010051313,0.00057192444,0.000021098436,0.000120478195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041981274,0.00027294795,0.00027675406,0.0006069105,0.00019844809,0.00031768545,0.0004983027,0.00019171875,0.00055906974],"category_scores_gemma":[0.000042936575,0.00030988146,0.000100591955,0.000996207,0.00017147142,0.0009767116,0.0003438161,0.0003696546,0.00006329536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021898511,0.00015598878,0.0042637917,0.00002442948,0.000039196486,0.00001979066,0.0008727689,0.2917877,0.00021644407,0.17509057,0.0008101606,0.5266973],"study_design_scores_gemma":[0.0011158057,0.000020137888,0.004169442,0.00013159466,0.00001226202,0.000005916232,0.00019653665,0.9835118,0.00030676663,0.0062759942,0.0039821425,0.00027157678],"about_ca_topic_score_codex":0.000059903556,"about_ca_topic_score_gemma":0.00009568691,"teacher_disagreement_score":0.9654307,"about_ca_system_score_codex":0.00024171984,"about_ca_system_score_gemma":0.0002711739,"threshold_uncertainty_score":0.9999353},"labels":[],"label_agreement":null},{"id":"W7125978140","doi":"10.1109/ica67499.2025.00018","title":"MBNP: A Multi-bid Protocol for Integrating Matching and Negotiation in Constraint-based Environments","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"Strategic International Collaborative Research Program","keywords":"Scalability; Protocol (science); Negotiation; Matching (statistics); Selection (genetic algorithm); Scheme (mathematics); Quality (philosophy)","score_opus":0.023035492460287462,"score_gpt":0.3141067717523268,"score_spread":0.29107127929203935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125978140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004325767,0.0000035019586,0.9053536,0.0012124201,0.00015888314,0.09189087,0.000005663814,0.0000486385,0.000893828],"genre_scores_gemma":[0.3355993,0.0000022940467,0.5523846,0.0012726957,0.000020614056,0.109906465,0.000009647011,0.000015695896,0.00078870205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980038,0.00014148606,0.00071227236,0.0006442737,0.00016851725,0.00032965152],"domain_scores_gemma":[0.99909014,0.00030284497,0.00023096254,0.00024934122,0.000044670327,0.000082043945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000550565,0.0002694429,0.00025526324,0.00038095095,0.0002516531,0.00041681682,0.00019698046,0.00015745588,0.00012774384],"category_scores_gemma":[0.00016930864,0.0002760522,0.00007090525,0.00038014312,0.00014231676,0.00055840786,0.000108773704,0.00022286335,0.000004300465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011706976,0.00043127037,0.023605697,0.00044142848,0.000035923713,0.0000032524601,0.0018776926,0.019768054,0.0026276407,0.06336622,0.000056626177,0.88766915],"study_design_scores_gemma":[0.0055954447,0.00007964067,0.011824901,0.00048041047,0.000009375507,0.0000019945135,0.0005079166,0.97838277,0.0012793841,0.0009117901,0.00067443517,0.0002519697],"about_ca_topic_score_codex":0.00010613683,"about_ca_topic_score_gemma":0.00046837842,"teacher_disagreement_score":0.9586147,"about_ca_system_score_codex":0.00020141099,"about_ca_system_score_gemma":0.00033670317,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W7126377987","doi":"10.21428/594757db.4f758025","title":"SAT for Upward Book Embedding: An Empirical Study","year":2025,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Embedding; Scalability; Benchmark (surveying); Speedup; Empirical research; Grid; Constraint (computer-aided design)","score_opus":0.026634184655244995,"score_gpt":0.36853846648830774,"score_spread":0.34190428183306276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126377987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065460857,0.000012408811,0.98448545,0.0020533581,0.00029231372,0.00036228925,4.93172e-7,0.00022715125,0.006020438],"genre_scores_gemma":[0.8334672,0.0000021208336,0.15286966,0.0043937564,0.00003204638,0.000053688887,0.000003823252,0.00000457029,0.009173126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940884,0.000032155716,0.00012810936,0.00024007025,0.00008345724,0.00010738066],"domain_scores_gemma":[0.99956197,0.00006221126,0.000018951187,0.00024882573,0.00006260614,0.000045462508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013753696,0.00006210357,0.00007728227,0.00009339764,0.000107588436,0.000119028875,0.00021264932,0.000027346472,0.000088984394],"category_scores_gemma":[0.000027771568,0.000054675394,0.000031992575,0.00015924957,0.000015997673,0.00035919313,0.00006362709,0.000037658032,0.000013718226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005312805,0.001276418,0.16482782,0.00002738728,0.0001208438,0.0000074707086,0.007856545,0.007206811,0.00011451863,0.18286715,0.12039095,0.5152509],"study_design_scores_gemma":[0.0010090803,0.00027970757,0.044923175,0.000004951051,0.000012216417,0.0000020165778,0.00059557933,0.9062149,0.00017062419,0.0027349503,0.043879796,0.00017299328],"about_ca_topic_score_codex":0.0000043559953,"about_ca_topic_score_gemma":0.000028359407,"teacher_disagreement_score":0.8990081,"about_ca_system_score_codex":0.000026791033,"about_ca_system_score_gemma":0.00006907977,"threshold_uncertainty_score":0.22295979},"labels":[],"label_agreement":null},{"id":"W7126384763","doi":"10.21428/594757db.2c273559","title":"USING AI PLANNING AND MULTI-AGENT PATHFINDINGFOR DROPLET ROUTING","year":2024,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Routing (electronic design automation); Automation; Work (physics); Process (computing); Field (mathematics)","score_opus":0.06643784889817951,"score_gpt":0.3323247586165187,"score_spread":0.2658869097183392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126384763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01251323,0.00009729397,0.985819,0.0003487238,0.00036838098,0.000057153564,6.591362e-7,0.00026463086,0.00053097133],"genre_scores_gemma":[0.77496,0.0000028648453,0.22461303,0.0002310753,0.000022480886,9.936546e-7,7.467889e-7,0.0000041294124,0.00016467343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.000014123496,0.00010815029,0.0002057186,0.00007932718,0.00011943608],"domain_scores_gemma":[0.9998104,0.000032239728,0.0000158826,0.00008168409,0.00001505233,0.00004475589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012826089,0.0000637938,0.000052750103,0.00009254885,0.000115321345,0.00041206126,0.0000653173,0.000026814616,0.000034281213],"category_scores_gemma":[0.000013407883,0.000056818095,0.00001923047,0.0001666094,0.0000133820295,0.00039369203,0.00007986368,0.00007370071,0.000009963461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029462783,0.000037075974,0.050965182,0.00010637462,0.00006645031,0.0002166341,0.010874608,0.03938868,0.008313025,0.25038117,0.0006633332,0.6389845],"study_design_scores_gemma":[0.00007622064,0.000005929097,0.001831477,0.000044933924,0.0000029050855,0.00004998589,0.00007511616,0.99709004,0.0002293194,0.00008039205,0.00043390226,0.000079806065],"about_ca_topic_score_codex":0.000018471876,"about_ca_topic_score_gemma":0.0000035770902,"teacher_disagreement_score":0.9577013,"about_ca_system_score_codex":0.000030369369,"about_ca_system_score_gemma":0.000033905457,"threshold_uncertainty_score":0.39735162},"labels":[],"label_agreement":null},{"id":"W7128617324","doi":"10.1109/focs63196.2025.00116","title":"RE-completeness of entangled constraint satisfaction problems","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Undecidable problem; Constraint satisfaction problem; Class (philosophy); Commutative property; Formalism (music); Constraint satisfaction; Variety (cybernetics); Decision problem; Computational complexity theory","score_opus":0.019173558094014338,"score_gpt":0.25669372740634755,"score_spread":0.23752016931233322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128617324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005721379,0.00017194412,0.93027264,0.0028121108,0.002193039,0.0008031243,0.000016301736,0.00015833938,0.05785113],"genre_scores_gemma":[0.97566915,0.00018261424,0.022147188,0.00046479184,0.000026792528,0.000020592428,0.0000073465603,0.000009181925,0.0014723167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971502,0.00021357638,0.0011612964,0.0006810367,0.00041147447,0.00038244252],"domain_scores_gemma":[0.99802446,0.00021831792,0.0004434698,0.00070413813,0.00049253885,0.00011705209],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004880204,0.00031813336,0.00049707806,0.0005173786,0.00022895848,0.00021823854,0.00040591814,0.00020804921,0.0027061354],"category_scores_gemma":[0.00010023679,0.00033097152,0.00019954889,0.001416628,0.00039255805,0.0005627282,0.00022105152,0.00023814436,0.000040089162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029282555,0.00013933031,0.041802842,0.0003089938,0.00017489691,0.0000032926587,0.0008660807,0.0077708936,0.0029543904,0.25493842,0.0008663226,0.69014525],"study_design_scores_gemma":[0.0034409573,0.00028825877,0.21894252,0.00097070425,0.00016595432,0.000026039117,0.0017027397,0.7507701,0.010852901,0.009033082,0.0029245936,0.00088217296],"about_ca_topic_score_codex":0.000521167,"about_ca_topic_score_gemma":0.0011264448,"teacher_disagreement_score":0.9699478,"about_ca_system_score_codex":0.00017419201,"about_ca_system_score_gemma":0.0006078066,"threshold_uncertainty_score":0.9999142},"labels":[],"label_agreement":null},{"id":"W7131130865","doi":"10.1109/iccvw69036.2025.00556","title":"SmolRGPT: Efficient Spatial Reasoning for Warehouse Environments with 600M Parameters","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Spatial intelligence; Matching (statistics); Software deployment; Spatial analysis; Visual reasoning; Architecture; RGB color model; Core (optical fiber)","score_opus":0.008559305596849804,"score_gpt":0.2236254246751714,"score_spread":0.2150661190783216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131130865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009719881,0.000046995166,0.9842991,0.0013633464,0.001035709,0.0011265608,0.000011432811,0.00011541671,0.0022815058],"genre_scores_gemma":[0.78939044,0.000027590644,0.20658566,0.0007658185,0.000022035872,0.0000662876,0.000008809707,0.000016760785,0.003116608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977227,0.00008457187,0.00045345194,0.0008571544,0.0003733808,0.0005087789],"domain_scores_gemma":[0.99875975,0.00021548076,0.000191097,0.0006180262,0.000059075872,0.00015655805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002903586,0.0003265659,0.0002859367,0.00024132707,0.0004583559,0.00040283042,0.0004017549,0.00012938515,0.00016103334],"category_scores_gemma":[0.00008353528,0.00029593715,0.00012871863,0.0004549596,0.00019282673,0.00022445597,0.00018452418,0.00016526582,0.00003086713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018914299,0.0002358932,0.0038182132,0.000045442954,0.00015486612,0.0000066810862,0.00079515,0.5502773,0.00006986687,0.014894613,0.00035927503,0.42915356],"study_design_scores_gemma":[0.0019355279,0.00027329277,0.0075703193,0.00017031997,0.00008073193,0.0000073290275,0.00012127613,0.98434234,0.0022047537,0.00007380289,0.0028512548,0.000369048],"about_ca_topic_score_codex":0.00017602992,"about_ca_topic_score_gemma":0.00009858053,"teacher_disagreement_score":0.77967054,"about_ca_system_score_codex":0.00025217264,"about_ca_system_score_gemma":0.0002626293,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W7132962046","doi":"","title":"Contributions to Data-Driven Combinatorial Solvers","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Solver; Generality; Range (aeronautics); Heuristic; Tree (set theory); Monte Carlo tree search","score_opus":0.03808674698533174,"score_gpt":0.37836922596877676,"score_spread":0.340282478983445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132962046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008272542,0.00008485083,0.89981157,0.013761181,0.06159149,0.0030704655,0.0011679088,0.0016060702,0.010633948],"genre_scores_gemma":[0.86258674,0.0008351466,0.030717922,0.0013502744,0.0033663784,0.00033670836,0.03024052,0.0003411606,0.07022517],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960044,0.0002055493,0.00067357963,0.0015080627,0.0008819647,0.0007264156],"domain_scores_gemma":[0.9956016,0.00034801004,0.00043102665,0.0021062659,0.00095859263,0.00055449764],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005665166,0.0005291,0.0005864886,0.0005445972,0.00078268565,0.00074021774,0.0021644821,0.0004856021,0.00079345703],"category_scores_gemma":[0.0010971243,0.00064891693,0.00016042388,0.0019927477,0.00008053752,0.00066309853,0.0007589757,0.0006222662,0.0036487384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054917356,0.0007064107,0.00055178127,0.00038383514,0.0011898434,0.0002201157,0.09609547,0.05566998,0.002805336,0.250166,0.4711626,0.120499454],"study_design_scores_gemma":[0.0034969584,0.00042455056,0.00831803,0.0005864188,0.00039820152,0.000018414326,0.011568429,0.8980299,0.00067533733,0.0013663094,0.07282943,0.0022879683],"about_ca_topic_score_codex":0.00074874837,"about_ca_topic_score_gemma":0.0010165335,"teacher_disagreement_score":0.8690936,"about_ca_system_score_codex":0.00038643056,"about_ca_system_score_gemma":0.0014366022,"threshold_uncertainty_score":0.99959624},"labels":[],"label_agreement":null},{"id":"W7133003879","doi":"","title":"Reasoning with Constraints: Decision Procedures, Witnesses and Applications","year":2025,"lang":"","type":"dissertation","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Correctness; Automated reasoning; Constraint satisfaction; Constraint satisfaction problem; Non-monotonic logic; Reasoning system; Key (lock); Constraint (computer-aided design)","score_opus":0.009078679378113868,"score_gpt":0.29806805980202905,"score_spread":0.2889893804239152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133003879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043886863,0.0012820677,0.9696477,0.00050454796,0.00032345927,0.0015613625,0.000011964053,0.00022490653,0.022055319],"genre_scores_gemma":[0.7040375,0.0046597444,0.26824564,0.00046241627,0.00023058521,0.0009300707,0.000525813,0.00009073701,0.02081749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972172,0.000075305754,0.00051936164,0.0012480967,0.0005275978,0.00041248646],"domain_scores_gemma":[0.99742544,0.00040333878,0.00052820786,0.000674037,0.00073305314,0.00023595417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002416298,0.0005655454,0.0004963519,0.00047357738,0.00079849176,0.0007301476,0.00046204022,0.00036478502,0.00026031287],"category_scores_gemma":[0.00027067753,0.00054663105,0.000069063055,0.0013539362,0.00033350097,0.00050057634,0.00011244942,0.00047893391,0.000022102837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019737075,0.00012387094,0.0016475072,0.000881346,0.00014780245,0.000014486701,0.0062053744,0.002401671,0.000117019634,0.09520677,0.00032826472,0.8927285],"study_design_scores_gemma":[0.021807605,0.0025207032,0.17712131,0.0663731,0.0040030587,0.0032260278,0.16138047,0.3957562,0.0072286245,0.016415853,0.12728105,0.016885988],"about_ca_topic_score_codex":0.000089366775,"about_ca_topic_score_gemma":0.0010270536,"teacher_disagreement_score":0.8758425,"about_ca_system_score_codex":0.00010271361,"about_ca_system_score_gemma":0.0020786112,"threshold_uncertainty_score":0.9996985},"labels":[],"label_agreement":null},{"id":"W7133100449","doi":"","title":"Two-dimensional Parallel Tempering for Solving Constraint-satisfaction Problems","year":2021,"lang":"","type":"dissertation","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Knapsack problem; Simulated annealing; Boltzmann machine; Parallel tempering; Combinatorial optimization; Benchmark (surveying); Artificial neural network; Range (aeronautics); Optimization problem","score_opus":0.027088636168065686,"score_gpt":0.31388780778765685,"score_spread":0.2867991716195912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133100449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06779453,0.0011696481,0.9137042,0.0015404745,0.007992717,0.0031288452,0.000040253428,0.0004839295,0.004145412],"genre_scores_gemma":[0.69380033,0.0002914656,0.28900716,0.0003999142,0.000631039,0.0005956394,0.0014038773,0.0001682722,0.013702321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511445,0.0001589262,0.0011727096,0.001749513,0.0008673809,0.00093700766],"domain_scores_gemma":[0.996065,0.0005324434,0.0010260899,0.00077299087,0.0012371532,0.00036627986],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066821463,0.0008810931,0.0008653539,0.0004388202,0.0011774362,0.0010380079,0.00043401332,0.00057501433,0.0014743704],"category_scores_gemma":[0.00033528486,0.0010617521,0.000525754,0.0007117625,0.00016692912,0.0008962182,0.0001518971,0.00076003163,0.000071419025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022836436,0.000256493,0.0023156148,0.0016872664,0.00068855955,0.000053099302,0.02884893,0.6118041,0.06039793,0.02953226,0.0010841156,0.26310325],"study_design_scores_gemma":[0.004254747,0.0002873262,0.0076810163,0.0020701042,0.0002809541,0.0002669408,0.011480098,0.96479195,0.0045385705,0.00084363454,0.0011880193,0.0023166344],"about_ca_topic_score_codex":0.00061278866,"about_ca_topic_score_gemma":0.0018104214,"teacher_disagreement_score":0.62600577,"about_ca_system_score_codex":0.00036649092,"about_ca_system_score_gemma":0.0016081968,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W7133116061","doi":"","title":"Empirical Models of Heuristic Search in AI Planning and Neural Sequence Decoding","year":2021,"lang":"","type":"dissertation","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Beam search; Heuristic; Incremental heuristic search; Decoding methods; Search algorithm; Satisficing; Empirical research; Sequence (biology)","score_opus":0.12207430465948568,"score_gpt":0.4282263411095157,"score_spread":0.30615203645003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133116061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54622084,0.0009211741,0.4504953,0.0007833368,0.00042972504,0.00025592087,0.0000038914154,0.000031227388,0.00085856527],"genre_scores_gemma":[0.98822165,0.00021373031,0.010791168,0.0001417123,0.000027484955,0.000008233374,0.00005945408,0.00001895204,0.00051763514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745035,0.0002842312,0.0005983802,0.00077140366,0.0004985498,0.00039707398],"domain_scores_gemma":[0.998607,0.0003376154,0.00023603947,0.0003324942,0.00032446985,0.00016242442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039432108,0.000307445,0.00049521064,0.00044456546,0.00015443681,0.00025289474,0.0002928065,0.000261598,0.00008935163],"category_scores_gemma":[0.00016272826,0.00036733123,0.00007759526,0.0009257705,0.00011676423,0.0005445729,0.00015198985,0.0007176399,0.0000017702314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009162324,0.0000854327,0.042298228,0.0006516351,0.000036373684,0.00025270617,0.111656584,0.78838414,0.0024038327,0.0026368776,0.000036806792,0.051465765],"study_design_scores_gemma":[0.00035523684,0.00005806717,0.016695544,0.00065011054,0.000016881464,0.000047844456,0.0061121495,0.9749202,0.0005956651,0.0002430341,0.0000037730126,0.00030145462],"about_ca_topic_score_codex":0.00033272084,"about_ca_topic_score_gemma":0.00019544744,"teacher_disagreement_score":0.44200078,"about_ca_system_score_codex":0.000106126965,"about_ca_system_score_gemma":0.0006133189,"threshold_uncertainty_score":0.99987787},"labels":[],"label_agreement":null},{"id":"W7133490960","doi":"10.1109/reacs67479.2025.11413563","title":"Optimizing Operational Costs in Resource-Limited Environments via Linear Programming","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Government of Canada","funders":"","keywords":"Linear programming; Key (lock); Minification; Context (archaeology)","score_opus":0.011544596098900758,"score_gpt":0.24803496280915754,"score_spread":0.23649036671025678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133490960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012142215,0.00016186458,0.9811979,0.005910552,0.0004777245,0.0007534163,0.0000023203716,0.0000904233,0.010191563],"genre_scores_gemma":[0.5424275,0.00013675647,0.44421187,0.005041361,0.00007878737,0.00007111003,0.000059294493,0.00002163334,0.007951694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972503,0.00022718398,0.0007945651,0.0008110735,0.00042285305,0.0004940002],"domain_scores_gemma":[0.99904865,0.00013931972,0.00013132486,0.00047156433,0.00007157928,0.00013755013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005133154,0.0003044907,0.00027379752,0.00059611595,0.00034503182,0.00044218238,0.00046376942,0.00021195911,0.00055361126],"category_scores_gemma":[0.00011198761,0.00034138447,0.00009430827,0.0013345943,0.00014107047,0.0007384956,0.00039438356,0.00039059774,0.00008829595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003614203,0.00031594944,0.005911986,0.000020483065,0.000051009432,0.000018915978,0.00081667025,0.1535102,0.000494417,0.0091826655,0.00034988383,0.8292917],"study_design_scores_gemma":[0.0011844668,0.000050634837,0.0058721765,0.00015623897,0.000013671176,0.000007708941,0.00019899009,0.95799625,0.0007126399,0.000030349584,0.033464946,0.0003119473],"about_ca_topic_score_codex":0.000081556325,"about_ca_topic_score_gemma":0.00011786416,"teacher_disagreement_score":0.82897973,"about_ca_system_score_codex":0.00051717996,"about_ca_system_score_gemma":0.00023172236,"threshold_uncertainty_score":0.9999038},"labels":[],"label_agreement":null},{"id":"W74688519","doi":"","title":"Extending Temporal Causal Graph For Diagnosis Problems","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Inference; Graph; Causal inference; Extension (predicate logic); Temporal logic; Artificial intelligence; Temporal database; Theoretical computer science; Machine learning; Data mining; Mathematics; Statistics","score_opus":0.01946268200881902,"score_gpt":0.24120471480000757,"score_spread":0.22174203279118856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74688519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026602647,0.0005499087,0.9718979,0.016786397,0.00046377897,0.0009447073,0.00004529879,0.0005471228,0.0061046267],"genre_scores_gemma":[0.44102338,0.0008904497,0.5544051,0.00023935227,0.00004312642,0.00047793303,0.0004742933,0.00004189779,0.0024044972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574625,0.0018365746,0.00059923757,0.0010033438,0.0004034469,0.00041112048],"domain_scores_gemma":[0.99492687,0.00089388655,0.0005861625,0.0018047183,0.0015836003,0.00020474076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037197392,0.00036215544,0.00036875595,0.00035978775,0.0004626792,0.00093083846,0.0015648389,0.0002956631,0.000052036456],"category_scores_gemma":[0.0007702407,0.0004025501,0.00029431135,0.00049695955,0.000108485445,0.00036888616,0.0008772044,0.0004707536,0.000013994096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008069164,0.00066394295,0.009363997,0.00028806162,0.00011233476,0.0000059506538,0.0071765054,0.0030970303,0.00026690998,0.38899872,0.0054766713,0.5845418],"study_design_scores_gemma":[0.0027092695,0.0000048507795,0.02224757,0.0055946186,0.00012890552,0.000057634377,0.00017036818,0.68682504,0.023066098,0.19954583,0.056807436,0.0028423916],"about_ca_topic_score_codex":0.0003853349,"about_ca_topic_score_gemma":0.0010582482,"teacher_disagreement_score":0.683728,"about_ca_system_score_codex":0.00013399209,"about_ca_system_score_gemma":0.000306475,"threshold_uncertainty_score":0.99984264},"labels":[],"label_agreement":null},{"id":"W77186466","doi":"10.1007/3-540-26886-3_2","title":"Combined Extraction of Directional and Topological Relationship Information from 2D Concave Objects","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Histogram; Partition (number theory); Spatial analysis; Computer science; Fuzzy logic; Mathematics; Regular polygon; Representation (politics); Robustness (evolution); Bounding overwatch; Topology (electrical circuits); Artificial intelligence; Algorithm; Pattern recognition (psychology); Combinatorics; Image (mathematics); Geometry","score_opus":0.018669760430010496,"score_gpt":0.2321037788966134,"score_spread":0.2134340184666029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77186466","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018271637,0.000047953945,0.4571255,0.00048469237,0.00039057122,0.00019738749,0.000022264838,0.0001556819,0.5413932],"genre_scores_gemma":[0.7590577,0.00038307783,0.14045756,0.0007293126,0.000253838,0.000016173151,0.0005279463,0.00001994736,0.09855444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901897,0.000021997253,0.00042186255,0.00020324445,0.00025209415,0.000081823804],"domain_scores_gemma":[0.99891335,0.00034064543,0.0003367648,0.00018874687,0.00015794535,0.00006255892],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001057253,0.00016040156,0.00019630814,0.00019893679,0.0000961982,0.0000793237,0.00010481582,0.00030547802,0.0010969162],"category_scores_gemma":[0.000063441235,0.00015533109,0.00006112399,0.0000435902,0.000091255155,0.0009999459,0.00006168729,0.00023532851,0.000058741774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015520387,0.000009533582,0.0006477368,0.000006874368,0.000026074027,7.037768e-7,0.00019312557,0.00015093027,0.000016653143,0.9421496,0.00040513108,0.056378108],"study_design_scores_gemma":[0.004389725,0.0006648559,0.28288448,0.00031726062,0.00021502202,0.00016219454,0.00024693314,0.1370344,0.0008283631,0.4680044,0.103071444,0.0021809144],"about_ca_topic_score_codex":0.00003558373,"about_ca_topic_score_gemma":0.000047076795,"teacher_disagreement_score":0.758875,"about_ca_system_score_codex":0.000071769435,"about_ca_system_score_gemma":0.00007780474,"threshold_uncertainty_score":0.99981624},"labels":[],"label_agreement":null},{"id":"W78606972","doi":"10.1007/978-3-642-40627-0_23","title":"Solving Weighted CSPs by Successive Relaxations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tuple; Solver; Relaxation (psychology); Mathematical optimization; Mathematics; Set (abstract data type); Algorithm; Integer programming; Maximum satisfiability problem; Discrete mathematics; Computer science; Combinatorics","score_opus":0.008754078167863891,"score_gpt":0.22103550097618344,"score_spread":0.21228142280831955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78606972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023373063,0.00023193791,0.9853264,0.0017911558,0.0014912538,0.00037737013,0.000007286927,0.00024380593,0.010507402],"genre_scores_gemma":[0.12600385,0.0001409267,0.86723775,0.0025742955,0.0003753696,0.000029913057,0.00004058079,0.000054901368,0.0035424135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701786,0.000033930355,0.000497107,0.0012048272,0.0007505314,0.0004957385],"domain_scores_gemma":[0.9976428,0.0004747404,0.00040339486,0.0009314401,0.00036077708,0.00018682533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032522844,0.00041699343,0.00035037365,0.00070017023,0.00040551124,0.00086509215,0.0018317736,0.00031214443,0.00033916967],"category_scores_gemma":[0.00011116958,0.0003953278,0.0000980548,0.00063827715,0.00049773284,0.0012631869,0.0006338972,0.00067967304,0.00019778307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012618198,0.000020081452,0.0000668907,0.000015263171,0.000012867953,0.000018456953,0.00058530364,0.011722707,0.00022465707,0.053918734,0.00064625667,0.9327675],"study_design_scores_gemma":[0.00022381093,0.000056339268,0.00011525905,0.00019326601,0.000006868186,0.000035333418,2.107968e-7,0.93343943,0.00065056497,0.06182815,0.0028201046,0.00063063536],"about_ca_topic_score_codex":0.00004103532,"about_ca_topic_score_gemma":0.00006268092,"teacher_disagreement_score":0.9321369,"about_ca_system_score_codex":0.00030631962,"about_ca_system_score_gemma":0.00046395467,"threshold_uncertainty_score":0.99984986},"labels":[],"label_agreement":null},{"id":"W81094332","doi":"10.1007/978-3-642-33398-9_6","title":"Representation by Graphs","year":2012,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Similarity (geometry); Representation (politics); Basis (linear algebra); Space (punctuation); Measure (data warehouse); Mathematics; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence; Geometry; Image (mathematics); Data mining; Political science","score_opus":0.018117043065384905,"score_gpt":0.24669855287933018,"score_spread":0.22858150981394526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81094332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005996537,0.0003206844,0.91540426,0.00033710722,0.0019705156,0.00027287233,0.0000036232213,0.00023298834,0.08139797],"genre_scores_gemma":[0.15837625,0.002083115,0.78467816,0.003060679,0.0010036957,0.000060019913,0.00005165378,0.00015875378,0.050527677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970788,0.000024483981,0.0004830961,0.0010509602,0.0008542153,0.00050843885],"domain_scores_gemma":[0.9981825,0.00008346163,0.00028319506,0.0010636888,0.00016492156,0.00022223873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007412768,0.0003212843,0.0003107456,0.0007176921,0.00020282721,0.00045360782,0.0016002761,0.00017350499,0.00015589247],"category_scores_gemma":[0.00002223136,0.0003553132,0.00010510082,0.0005987739,0.0004778209,0.0015791805,0.00078754954,0.0003994326,0.00013945131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014043023,0.00001804743,0.00038394387,0.0000097823995,0.000006288044,0.000009425676,0.00022280561,0.00048667545,0.00011351626,0.45927328,0.0007111792,0.53876364],"study_design_scores_gemma":[0.002120884,0.00031456407,0.018852212,0.0008370576,0.00005039953,0.00032485998,0.00000764969,0.6055806,0.004121522,0.18023296,0.18242322,0.0051340354],"about_ca_topic_score_codex":0.000025390198,"about_ca_topic_score_gemma":0.000014869231,"teacher_disagreement_score":0.60509396,"about_ca_system_score_codex":0.00023520507,"about_ca_system_score_gemma":0.0002271759,"threshold_uncertainty_score":0.9998899},"labels":[],"label_agreement":null},{"id":"W828144655","doi":"10.5194/isprsarchives-xl-4-w7-11-2015","title":"INVESTIGATING GEOSPARQL REQUIREMENTS FOR PARTICIPATORY URBAN PLANNING","year":2015,"lang":"en","type":"article","venue":"˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Spatial intelligence; Spatial planning; Predicate (mathematical logic); Urban planning; Participatory GIS; Spatial relation; Spatial database; Spatial analysis; Citizen journalism; Artificial intelligence; Geography; World Wide Web; Engineering; Programming language","score_opus":0.057922610282376705,"score_gpt":0.2987092178282929,"score_spread":0.2407866075459162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W828144655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005762108,0.000030641713,0.9809223,0.004650287,0.00231132,0.00072932016,0.00005411988,0.000073496514,0.0054664025],"genre_scores_gemma":[0.9791704,0.00003599369,0.01893757,0.0016017507,0.00014323293,8.7547807e-7,0.00003008641,0.000009846977,0.00007028519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552107,0.0002958571,0.0014289769,0.00043195768,0.0017882283,0.00053392135],"domain_scores_gemma":[0.99609065,0.0009719246,0.0017474104,0.0005050241,0.00044450202,0.0002405106],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002010783,0.00037734938,0.00037667164,0.0007782645,0.0013507493,0.0010433131,0.0018842208,0.000087489076,0.0000031979034],"category_scores_gemma":[0.001349299,0.00025331383,0.00029293555,0.00092150527,0.0022806646,0.0009135379,0.0010232064,0.0003415322,0.000002374787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058914335,0.000013793255,0.00096699025,0.000029335411,0.00006628172,1.7268526e-7,0.006404153,0.0102535235,0.0007250657,0.000044958193,0.00013394596,0.98130286],"study_design_scores_gemma":[0.0009252126,0.00014594686,0.0029446625,0.00030128742,0.000032036067,0.00007216494,0.0019085966,0.9761947,0.0037098785,0.009053251,0.0044200183,0.0002922472],"about_ca_topic_score_codex":0.43843812,"about_ca_topic_score_gemma":0.05320284,"teacher_disagreement_score":0.9810106,"about_ca_system_score_codex":0.000065219465,"about_ca_system_score_gemma":0.0004216176,"threshold_uncertainty_score":0.9999937},"labels":[],"label_agreement":null},{"id":"W856071238","doi":"","title":"Nogood processing in csps","year":2008,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Computer science; Speedup; Solver; Domain (mathematical analysis); Satisfiability; Boolean satisfiability problem; Constraint (computer-aided design); Theoretical computer science; Constraint satisfaction; Mathematical optimization; Artificial intelligence; Parallel computing; Mathematics; Programming language","score_opus":0.01694446723756259,"score_gpt":0.31036205888149043,"score_spread":0.29341759164392783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W856071238","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121423885,0.0023060152,0.38253033,0.0020945065,0.0035195109,0.0011271731,0.000002616218,0.0012633855,0.48573256],"genre_scores_gemma":[0.85695916,0.00036839777,0.0637181,0.00032060852,0.00015081953,0.000059031507,0.00020792527,0.000052424417,0.078163505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917334,0.000023732899,0.00016389985,0.00028927368,0.00019574106,0.0001540292],"domain_scores_gemma":[0.99955875,0.000011686104,0.00012612436,0.00019761865,0.00006519107,0.000040615763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057231417,0.00013530291,0.00014348811,0.000216792,0.000072555995,0.00008464308,0.00024292457,0.00014325495,0.000066172026],"category_scores_gemma":[0.000026127473,0.0001475918,0.000035450295,0.0003888059,0.000010483339,0.00022887073,0.00001694318,0.00021228594,0.00004660269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028443763,0.00012153131,0.001646606,0.00026219265,0.000011169548,0.000109358094,0.06399311,0.0017048147,0.0011472449,0.003982153,0.0026748672,0.9243185],"study_design_scores_gemma":[0.005556239,0.0003213801,0.41636553,0.0030672553,0.00007490111,0.00043470488,0.020243555,0.48433772,0.017357284,0.0030227744,0.04324576,0.005972914],"about_ca_topic_score_codex":0.000060489492,"about_ca_topic_score_gemma":0.00074753445,"teacher_disagreement_score":0.9183456,"about_ca_system_score_codex":0.000059328948,"about_ca_system_score_gemma":0.0002518384,"threshold_uncertainty_score":0.6018619},"labels":[],"label_agreement":null},{"id":"W96994324","doi":"10.1007/978-3-642-33558-7_70","title":"Constraint Programming for Path Planning with Uncertainty","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Probabilistic logic; Path (computing); Mathematical optimization; Heuristic; Computer science; Constraint programming; Constraint (computer-aided design); Motion planning; Graph; Search algorithm; Object (grammar); Incremental heuristic search; Algorithm; Theoretical computer science; Mathematics; Beam search; Artificial intelligence; Stochastic programming","score_opus":0.020669773812666062,"score_gpt":0.25280064258980256,"score_spread":0.2321308687771365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96994324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002248371,0.000214543,0.99645627,0.00039982327,0.0007853929,0.00077804504,0.0000068144636,0.00020642563,0.0011302],"genre_scores_gemma":[0.13051543,0.000009535139,0.8684775,0.0005628795,0.00028394142,0.000032563057,0.000013517219,0.000026933862,0.00007770177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737614,0.000017745093,0.0003729783,0.0009853067,0.00058088306,0.00066693744],"domain_scores_gemma":[0.99820256,0.00039216407,0.00029202108,0.0006461402,0.00027369635,0.00019341268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006704812,0.0004188237,0.00037637397,0.00046835138,0.00030210905,0.00048840063,0.0010477327,0.00021757185,0.00001942509],"category_scores_gemma":[0.00005179333,0.00034916177,0.00009098147,0.00034425856,0.00066189613,0.00056163524,0.00028191676,0.00045542125,0.0000062539857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076163465,0.000011914888,0.00016753277,0.000028257908,0.000009926653,0.0000139812255,0.0006334159,0.09389564,0.0000112434755,0.023829756,0.0000058761893,0.88138485],"study_design_scores_gemma":[0.0008199395,0.00041139786,0.00022785827,0.0008333652,0.000023806153,0.00026322142,0.0000019042824,0.962719,0.00020025829,0.023454031,0.009888512,0.0011566877],"about_ca_topic_score_codex":0.000007778253,"about_ca_topic_score_gemma":0.00002606192,"teacher_disagreement_score":0.88022816,"about_ca_system_score_codex":0.0002507435,"about_ca_system_score_gemma":0.00061334274,"threshold_uncertainty_score":0.99989605},"labels":[],"label_agreement":null},{"id":"W99499226","doi":"","title":"Propagating logical combinations of constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Constraint logic programming; Negation; Computer science; Consistency (knowledge bases); Simple (philosophy); Theoretical computer science; Binary constraint; Constraint programming; Algorithm; Conjunctive normal form; Logical consequence; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Mathematical optimization; Programming language; Artificial intelligence","score_opus":0.015914112174625548,"score_gpt":0.24659398242600872,"score_spread":0.23067987025138317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99499226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004397408,0.0000030345232,0.93134856,0.0018144585,0.000043478412,0.000069259775,5.188372e-7,0.000097092154,0.06222621],"genre_scores_gemma":[0.78587896,0.0000015940259,0.21381296,0.00014235945,0.0000070159253,0.0000017834423,7.174922e-7,9.355821e-7,0.00015365012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999553,0.00001935011,0.00015187952,0.000099546436,0.00010524608,0.00007093951],"domain_scores_gemma":[0.99968624,0.000043431974,0.00005021755,0.00011149324,0.000076784585,0.000031824886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009639068,0.00003850974,0.000055603912,0.000047597732,0.000043148866,0.000024722387,0.00013001455,0.000022036478,0.0003836947],"category_scores_gemma":[0.00004385967,0.00003305383,0.000022738488,0.00015420742,0.00007706288,0.00023192063,0.00003689642,0.000039648796,0.00003065053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1598538e-7,0.000060321334,0.0006642717,0.000001302014,0.000002314995,2.769536e-7,0.00006679754,0.00052238064,0.00037074037,0.67173874,0.00009649368,0.32647616],"study_design_scores_gemma":[0.0015620786,0.00009576754,0.02370561,0.000022090075,0.0000052752334,0.000063377265,0.00014212265,0.95058924,0.015465189,0.005666507,0.00241327,0.00026948669],"about_ca_topic_score_codex":0.0000015937239,"about_ca_topic_score_gemma":0.0000053826184,"teacher_disagreement_score":0.95006686,"about_ca_system_score_codex":0.0000123806385,"about_ca_system_score_gemma":0.00003440925,"threshold_uncertainty_score":0.4201188},"labels":[],"label_agreement":null}]}