{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06878266,0.0010222183,0.8719894,0.0022638754,0.0005695321,0.00021187047,0.0017101378,0.0060240263,0.047426276],"genre_scores_gemma":[0.47200263,0.0005879302,0.5021251,0.0004508415,0.00021272474,0.00031596978,0.0019708069,0.0005177446,0.021816215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.00008655197,0.000018847217,0.00009103125,0.00011491439,0.000051536754],"domain_scores_gemma":[0.9995223,0.0002533103,0.000022327295,0.00010461545,0.000052600837,0.00004498759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000284633,0.00036211422,0.000646641,0.00044472129,0.00067021,0.0011185437,0.0010197952,0.0009919141,0.010693152],"category_scores_gemma":[0.0014949028,0.00027795252,0.00068084884,0.000951945,0.0006931951,0.0014954894,0.0010063618,0.00078121014,0.0016234113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033415726,0.0001635069,0.00064121705,0.000565605,0.00006770402,0.0003478286,0.00026629743,0.12051192,0.018957825,0.35161662,0.038798187,0.46772915],"study_design_scores_gemma":[0.00006445158,0.00014001831,0.00059110863,0.00006965277,0.000046543406,0.00038496504,0.00005159929,0.60567814,0.00831731,0.34863046,0.035988957,0.000036836635],"about_ca_topic_score_codex":0.00082700985,"about_ca_topic_score_gemma":0.001274407,"teacher_disagreement_score":0.010693152,"about_ca_system_score_codex":0.000784186,"about_ca_system_score_gemma":0.0007297603,"threshold_uncertainty_score":0.035772204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012965496,0.00021299394,0.9783246,0.00032020317,0.00006844606,0.00027741207,0.00026645756,0.0030350287,0.0045293905],"genre_scores_gemma":[0.20316842,0.00014602754,0.78881437,0.00036783284,0.000062186824,0.00050064473,0.0013465703,0.00089545496,0.00469845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589646,0.0015114772,0.00016387108,0.0006033418,0.0015342738,0.00029072101],"domain_scores_gemma":[0.98897773,0.00697328,0.00040739498,0.0016763442,0.0017920635,0.00017319544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00257751,0.0012396135,0.0011387321,0.002543193,0.0005903513,0.0012937974,0.0035961955,0.0017509051,0.009865741],"category_scores_gemma":[0.014717449,0.0009300542,0.0015854231,0.0023499462,0.0012401928,0.0017526586,0.0024089795,0.0021222692,0.0016056295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051544263,0.00044830938,0.0024622628,0.0004924852,0.00015715482,0.0005773587,0.00015849211,0.25932217,0.022858191,0.053240657,0.017556848,0.64221066],"study_design_scores_gemma":[0.00012540429,0.00016095967,0.0005056401,0.000065983986,0.00007413297,0.00033870724,0.000041212097,0.9206057,0.017397359,0.05568619,0.0049727876,0.000026020318],"about_ca_topic_score_codex":0.0021865717,"about_ca_topic_score_gemma":0.0027508002,"teacher_disagreement_score":0.009865741,"about_ca_system_score_codex":0.0011961295,"about_ca_system_score_gemma":0.002146939,"threshold_uncertainty_score":0.033004165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065828944,0.00045255024,0.9738515,0.0014856555,0.00021113893,0.0004264434,0.00068004,0.0026940708,0.013615647],"genre_scores_gemma":[0.06647897,0.00033569243,0.9206738,0.00050766015,0.00015391804,0.00056751736,0.0025563417,0.0006765558,0.008049588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956507,0.00093716604,0.0003259445,0.0011979451,0.0012915721,0.0005966507],"domain_scores_gemma":[0.99498296,0.0029510295,0.00024949538,0.0009278926,0.00066266494,0.00022598186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021921508,0.002415905,0.002110724,0.0022641507,0.0020720942,0.0037844994,0.0046565374,0.0037681854,0.027113652],"category_scores_gemma":[0.011375375,0.0011637649,0.0027255944,0.003963354,0.0015620139,0.008259591,0.005619581,0.004718647,0.0082092155],"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.000766568,0.0006640968,0.0011986231,0.0010592258,0.00016791301,0.0002759633,0.0005058119,0.0869085,0.007994423,0.19530362,0.06996761,0.63518775],"study_design_scores_gemma":[0.00048376265,0.00020878186,0.00040494886,0.000109648885,0.00008159626,0.00050199026,0.00032258118,0.4851712,0.004854044,0.469837,0.037945695,0.000078691504],"about_ca_topic_score_codex":0.0036623944,"about_ca_topic_score_gemma":0.00500811,"teacher_disagreement_score":0.027113652,"about_ca_system_score_codex":0.0028556325,"about_ca_system_score_gemma":0.0039140224,"threshold_uncertainty_score":0.0907042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07287687,0.0032333394,0.76377594,0.0029713833,0.0007279331,0.00015268502,0.0018837916,0.001509208,0.15286882],"genre_scores_gemma":[0.7412323,0.005533891,0.21298295,0.0021647234,0.001825075,0.00028455196,0.0031739725,0.0006100277,0.032192476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984394,0.00025675868,0.00009050856,0.0006218357,0.00039530106,0.0001962558],"domain_scores_gemma":[0.99666756,0.0014251523,0.00041605666,0.00076076144,0.00043766882,0.00029270336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886567,0.00058648246,0.0005235668,0.0021670857,0.0014459587,0.0027343677,0.0015562553,0.00092863565,0.01298982],"category_scores_gemma":[0.005829884,0.00046371482,0.0016160919,0.0028908013,0.002018089,0.005678902,0.0024094365,0.0037918575,0.0014022567],"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.000027157468,0.000019057183,0.00032218063,0.00006371828,0.000010587081,0.000118222095,0.00023301845,0.005115391,0.0007528921,0.96965337,0.004655654,0.019028645],"study_design_scores_gemma":[0.000008306502,0.000014194124,0.0002624107,0.00002678379,0.000011193408,0.00016286506,0.00009964291,0.01225814,0.00031077844,0.9610297,0.025802499,0.000013529308],"about_ca_topic_score_codex":0.0025591466,"about_ca_topic_score_gemma":0.0017525444,"teacher_disagreement_score":0.01298982,"about_ca_system_score_codex":0.001531544,"about_ca_system_score_gemma":0.0005398839,"threshold_uncertainty_score":0.043455303},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055137137,0.0001242759,0.9944323,0.00031474404,0.00006205195,0.00006452319,0.00015145993,0.00017890852,0.0041203247],"genre_scores_gemma":[0.06604338,0.00060854625,0.92513156,0.00047396435,0.00017586474,0.0005704278,0.0005054836,0.0001525537,0.0063382746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974043,0.0008869069,0.0002429555,0.00045294175,0.00082085346,0.00019200126],"domain_scores_gemma":[0.99644816,0.0015136515,0.00035496848,0.00079537113,0.00055516325,0.00033263114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004869977,0.0011719464,0.000654198,0.0016308522,0.0015735795,0.0033828784,0.0024529428,0.0013247228,0.008250787],"category_scores_gemma":[0.0069387206,0.00080616155,0.0020577789,0.0027705163,0.0031684765,0.0070908233,0.003967398,0.0052419733,0.0016277543],"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.000011655852,0.000027741915,0.000090560534,0.000083860534,0.000019108991,0.000108880835,0.00015040852,0.008341109,0.0007108761,0.97005725,0.0019544729,0.018443925],"study_design_scores_gemma":[0.00002184859,0.000027642844,0.00007997218,0.00008321979,0.000027907245,0.00024015269,0.00009685092,0.057387177,0.0015179666,0.8838619,0.05662003,0.00003540594],"about_ca_topic_score_codex":0.0039002355,"about_ca_topic_score_gemma":0.0052628987,"teacher_disagreement_score":0.008250787,"about_ca_system_score_codex":0.001811497,"about_ca_system_score_gemma":0.0033347053,"threshold_uncertainty_score":0.0276016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004293417,0.0011308983,0.9919458,0.0005923571,0.00012546268,0.00025259273,0.00046630338,0.00045271686,0.004604471],"genre_scores_gemma":[0.028232144,0.004476362,0.9550575,0.0010432304,0.00039077457,0.0025320237,0.002516194,0.00036145083,0.0053902753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927475,0.002708823,0.0011462879,0.00076714373,0.002249459,0.0003807931],"domain_scores_gemma":[0.98735213,0.008049115,0.0011558069,0.0017441008,0.0014546216,0.00024418044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007865298,0.0025668496,0.001398212,0.0031534755,0.0018076178,0.0037432292,0.0037168565,0.0020069268,0.011681196],"category_scores_gemma":[0.015712822,0.0015639457,0.005494973,0.0040785875,0.0044917525,0.0071032927,0.003750646,0.007326131,0.0045119165],"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.0000150860205,0.000030177061,0.000092294445,0.0004065307,0.000040314495,0.00016605997,0.0003040593,0.010109935,0.0007132183,0.96238405,0.005895378,0.019843029],"study_design_scores_gemma":[0.000059395043,0.000039106762,0.0000746403,0.0003066517,0.00004945699,0.00036121774,0.00016433626,0.04726037,0.0019112829,0.8336105,0.116115846,0.00004721686],"about_ca_topic_score_codex":0.0061222967,"about_ca_topic_score_gemma":0.0054186624,"teacher_disagreement_score":0.011681196,"about_ca_system_score_codex":0.0034467687,"about_ca_system_score_gemma":0.0049572587,"threshold_uncertainty_score":0.041596174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08745124,0.0014415063,0.54571545,0.0008603614,0.00044335658,0.00075719313,0.0028778277,0.33968267,0.020770453],"genre_scores_gemma":[0.435146,0.00064013776,0.52563334,0.0012148183,0.0001242787,0.0014584308,0.007016465,0.020382384,0.008384137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971789,0.0008534029,0.00025488294,0.000657174,0.0007907815,0.00026489582],"domain_scores_gemma":[0.99426985,0.0032554243,0.0004347561,0.0011465455,0.0006417581,0.00025173443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040007457,0.0022832886,0.000916618,0.0015468813,0.00057600363,0.0019953563,0.0037845767,0.001503434,0.010754858],"category_scores_gemma":[0.012599071,0.0010223916,0.0011162694,0.0010519244,0.0011381172,0.002835284,0.0020215067,0.0019203657,0.0055161496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034406297,0.0009244869,0.016084293,0.0023252384,0.00035751067,0.0007785499,0.0006699829,0.14984035,0.045962863,0.016930036,0.11985157,0.6428345],"study_design_scores_gemma":[0.000945139,0.0008008033,0.00207014,0.00018442195,0.000100809055,0.0006055683,0.00020998533,0.8306456,0.079653285,0.014175753,0.070448436,0.00016011446],"about_ca_topic_score_codex":0.0013484327,"about_ca_topic_score_gemma":0.001945941,"teacher_disagreement_score":0.010754858,"about_ca_system_score_codex":0.0012685534,"about_ca_system_score_gemma":0.0020464251,"threshold_uncertainty_score":0.035978556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018713182,0.00093967724,0.9649193,0.0020356306,0.00014008289,0.000093315226,0.0007252865,0.00030421582,0.012129327],"genre_scores_gemma":[0.82178575,0.002885563,0.13376382,0.0006989749,0.00048286235,0.0009101431,0.0014182562,0.0002098849,0.037844747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983284,0.00058879884,0.000085849206,0.00028802332,0.00038688057,0.0003221423],"domain_scores_gemma":[0.99695766,0.0021081762,0.00032749138,0.00014253489,0.0002394436,0.00022462627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018801669,0.0011222872,0.0016043037,0.0008367016,0.00088602095,0.0024588117,0.0028172573,0.0023585598,0.005968547],"category_scores_gemma":[0.0048184134,0.00090352556,0.0009790759,0.0016735673,0.0020571973,0.002945391,0.001684366,0.0027770638,0.0009328373],"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.00006386403,0.00004591687,0.00033496643,0.00007359128,0.000035145906,0.00015825365,0.000109124296,0.6189962,0.0005959655,0.3718616,0.0025336347,0.0051917993],"study_design_scores_gemma":[0.000026051792,0.000015909049,0.000088830675,0.000010225619,0.000009086359,0.000026333706,0.000012822694,0.879187,0.00006649647,0.11873212,0.0018114512,0.000013631214],"about_ca_topic_score_codex":0.020587916,"about_ca_topic_score_gemma":0.021347152,"teacher_disagreement_score":0.020587916,"about_ca_system_score_codex":0.0026766136,"about_ca_system_score_gemma":0.0031217365,"threshold_uncertainty_score":0.040936172},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020957595,0.0005349163,0.97581905,0.00030733203,0.00003678095,0.000057501926,0.00007706042,0.00030670577,0.0019031056],"genre_scores_gemma":[0.23413238,0.0011032876,0.7617024,0.00015084843,0.00006897333,0.00017168597,0.00036938538,0.00020801026,0.002093125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769056,0.0009570564,0.0001151908,0.00047839337,0.00054919935,0.00020953562],"domain_scores_gemma":[0.9947537,0.0038544657,0.00041014943,0.00054834876,0.00033428238,0.00009895305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021228227,0.0008450405,0.0007092313,0.0006195006,0.0007536914,0.0014331404,0.0016808457,0.0011425273,0.0033727055],"category_scores_gemma":[0.007178173,0.0005172451,0.0009935346,0.0018015826,0.0011710492,0.0032961282,0.0011866236,0.0015176609,0.0004044491],"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.00018342191,0.00015090882,0.0008761592,0.00044643867,0.00013448528,0.00020815388,0.00027628412,0.8067699,0.0052261087,0.05925821,0.0018798853,0.12458997],"study_design_scores_gemma":[0.000056800916,0.00011390303,0.000248802,0.000029768174,0.00003303063,0.00018203717,0.00019786066,0.9443777,0.0063435654,0.041291058,0.0071034096,0.000021988102],"about_ca_topic_score_codex":0.0045643067,"about_ca_topic_score_gemma":0.0059676412,"teacher_disagreement_score":0.0045643067,"about_ca_system_score_codex":0.00084093784,"about_ca_system_score_gemma":0.0018736066,"threshold_uncertainty_score":0.011282802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03944299,0.0007653118,0.89218795,0.0015545948,0.0008695398,0.001517475,0.0014403714,0.004453307,0.057768527],"genre_scores_gemma":[0.059983846,0.0004044994,0.9194731,0.0005174899,0.00025550465,0.0005228644,0.0022585029,0.0006937313,0.015890447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873096,0.00030784262,0.000098745484,0.0003448889,0.00037471106,0.00014293639],"domain_scores_gemma":[0.99767286,0.001311358,0.00011823636,0.0005181599,0.00030007132,0.00007928284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002456,0.0016364884,0.0019594317,0.0010392056,0.0010253633,0.0020414304,0.0030859374,0.0014426406,0.03946724],"category_scores_gemma":[0.0048179855,0.0014368698,0.0030256493,0.0019291696,0.0007601271,0.003864408,0.002047134,0.0049162544,0.008091441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010910318,0.0014684092,0.0013106649,0.002536638,0.0003619074,0.00078647287,0.00043256048,0.20617414,0.036492143,0.123170435,0.059854545,0.566321],"study_design_scores_gemma":[0.0005020213,0.00063895824,0.001277537,0.00016836773,0.00033218975,0.0008299965,0.00033386168,0.6274474,0.01816413,0.27961072,0.070567384,0.0001274263],"about_ca_topic_score_codex":0.0027360495,"about_ca_topic_score_gemma":0.006646894,"teacher_disagreement_score":0.03946724,"about_ca_system_score_codex":0.0011331053,"about_ca_system_score_gemma":0.002028082,"threshold_uncertainty_score":0.13203108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04930802,0.003401232,0.9308017,0.0010544623,0.00026116826,0.00025085258,0.0020356989,0.0018953044,0.010991664],"genre_scores_gemma":[0.35153258,0.0017953571,0.630353,0.00032310066,0.00031042594,0.00041393636,0.0064179525,0.0005474222,0.008306237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780387,0.0006983139,0.00009722293,0.0005383525,0.000696297,0.00016601624],"domain_scores_gemma":[0.99117106,0.0066700364,0.00032974183,0.00066714484,0.000952238,0.00020976603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021710817,0.0011670013,0.0013204563,0.0025012325,0.0005609775,0.0015798287,0.0020278476,0.0015708451,0.009154524],"category_scores_gemma":[0.016929684,0.0008698442,0.0011777041,0.002991799,0.000773696,0.0021213708,0.0009966756,0.002188362,0.0018095124],"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.00018646113,0.0002516677,0.0049167755,0.00027597303,0.00010241176,0.00007395404,0.00004868919,0.6003112,0.0016799532,0.020955944,0.026784364,0.3444125],"study_design_scores_gemma":[0.00000671112,0.000016191092,0.00031637846,0.000015218509,0.000005637581,0.000012767268,0.000009314092,0.98848397,0.00047910007,0.009825926,0.0008236073,0.0000051557126],"about_ca_topic_score_codex":0.0069870353,"about_ca_topic_score_gemma":0.011410155,"teacher_disagreement_score":0.009154524,"about_ca_system_score_codex":0.0011725299,"about_ca_system_score_gemma":0.0015576138,"threshold_uncertainty_score":0.030624926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021224193,0.0006016603,0.9617321,0.0006216278,0.00011154541,0.00036318201,0.0009906649,0.006237077,0.008117935],"genre_scores_gemma":[0.21856526,0.0007606241,0.76887465,0.0003650935,0.00017161333,0.000378249,0.002834214,0.0019811916,0.0060690087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99319446,0.00168846,0.0006874255,0.00076207984,0.002880888,0.0007866849],"domain_scores_gemma":[0.9874751,0.0079103345,0.00054875546,0.0025534825,0.0011893054,0.00032303325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033891038,0.001491849,0.0032002828,0.0016273445,0.0018589151,0.0063736397,0.005559795,0.0014460145,0.0089300675],"category_scores_gemma":[0.013770243,0.0014918318,0.0029408925,0.0057553905,0.0018106393,0.009414021,0.006088942,0.003909331,0.0022153312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012761947,0.0006066797,0.0016586215,0.0018620616,0.00031154844,0.0012839473,0.0009298014,0.14750785,0.021762878,0.3561747,0.048260577,0.41836524],"study_design_scores_gemma":[0.0002206482,0.00012737469,0.00027922753,0.00009134844,0.000114342576,0.00058305566,0.00043852287,0.7051918,0.015231697,0.25883415,0.01880911,0.000078839104],"about_ca_topic_score_codex":0.0039308565,"about_ca_topic_score_gemma":0.0064722374,"teacher_disagreement_score":0.0089300675,"about_ca_system_score_codex":0.0013914845,"about_ca_system_score_gemma":0.002641805,"threshold_uncertainty_score":0.029874027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038607155,0.0014018869,0.9495897,0.0018554535,0.00037007566,0.000072465766,0.00032729455,0.0015878576,0.040934578],"genre_scores_gemma":[0.23880744,0.0037021295,0.7022977,0.00092224596,0.00059632247,0.00032198403,0.0014313548,0.0014225364,0.05049837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980469,0.0008964791,0.00014014736,0.00031726086,0.00047280744,0.00012642243],"domain_scores_gemma":[0.9973726,0.0017975618,0.00007587602,0.00053403137,0.00017962379,0.000040282812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019144051,0.0010503078,0.0011670775,0.0012167437,0.001027568,0.0035457436,0.0016799202,0.0010851527,0.026136452],"category_scores_gemma":[0.008060745,0.0010892003,0.0017113758,0.0031956893,0.0019778034,0.010655074,0.002433348,0.0029471759,0.00532005],"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.0000755017,0.000044197866,0.00014372756,0.00032455818,0.00004317123,0.000062556705,0.00018718562,0.015099001,0.0011283442,0.8219648,0.010611278,0.15031566],"study_design_scores_gemma":[0.000015875225,0.000011509405,0.00004110332,0.00006254736,0.00002233528,0.000044526736,0.000023963126,0.03176087,0.00089911703,0.94554836,0.021558203,0.00001152409],"about_ca_topic_score_codex":0.00259729,"about_ca_topic_score_gemma":0.0033075367,"teacher_disagreement_score":0.026136452,"about_ca_system_score_codex":0.002017028,"about_ca_system_score_gemma":0.001026796,"threshold_uncertainty_score":0.087435186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028652677,0.00043090258,0.96761525,0.0008318988,0.00021611,0.00023430772,0.0019004737,0.006778736,0.019127082],"genre_scores_gemma":[0.031444423,0.00086433085,0.9504527,0.00036223192,0.000118311225,0.000433502,0.0012093873,0.0017722979,0.013342759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.00015443312,0.000034923414,0.000069929105,0.00019159817,0.000046039062],"domain_scores_gemma":[0.9989574,0.0007231379,0.00005142024,0.00005695742,0.00013958766,0.00007150195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012343086,0.0011964001,0.00086822547,0.0007061528,0.0009249503,0.0017839185,0.0021154578,0.0011354734,0.03189925],"category_scores_gemma":[0.003446813,0.0009221384,0.0009637517,0.0019219512,0.0006073554,0.0014451157,0.0017374147,0.0017550071,0.0034686446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031264973,0.00021377686,0.0010322491,0.0014393433,0.00012954275,0.00087649707,0.00092031836,0.27453554,0.0050680595,0.17797084,0.17143692,0.3660643],"study_design_scores_gemma":[0.00020458431,0.00005230951,0.0004897764,0.00020989378,0.000072750525,0.0003478046,0.00024811664,0.7232875,0.0050274157,0.08396538,0.18602198,0.00007236351],"about_ca_topic_score_codex":0.020113468,"about_ca_topic_score_gemma":0.036953103,"teacher_disagreement_score":0.03189925,"about_ca_system_score_codex":0.0007515663,"about_ca_system_score_gemma":0.0015712715,"threshold_uncertainty_score":0.10671359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007444486,0.0000614684,0.96060157,0.00015848683,0.00005144328,0.00011057782,0.0010013749,0.028110253,0.009160242],"genre_scores_gemma":[0.017980767,0.00028722303,0.95540786,0.00042166424,0.000036896472,0.00040927195,0.0038090793,0.0087267235,0.012920552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985631,0.00023777047,0.00017134966,0.00017254277,0.00074045965,0.00011487975],"domain_scores_gemma":[0.99717677,0.0016349717,0.00013839184,0.00046710946,0.0005020772,0.00008061946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016242772,0.0015285566,0.00090748916,0.0016721213,0.0008151652,0.0027566627,0.0029405958,0.0010871673,0.030069185],"category_scores_gemma":[0.005376606,0.001484468,0.0015103754,0.0022731717,0.0010688504,0.0033752888,0.002267154,0.0029496807,0.010013679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019772591,0.00020941695,0.00045395727,0.0013500918,0.00006758949,0.000455525,0.0006250622,0.028134577,0.018822651,0.21480232,0.13163416,0.60324687],"study_design_scores_gemma":[0.00027521403,0.00008097337,0.00023522438,0.00035333564,0.00009542351,0.00079486833,0.00014544616,0.3351402,0.057683717,0.14381087,0.4612563,0.00012848317],"about_ca_topic_score_codex":0.0056879157,"about_ca_topic_score_gemma":0.0077387895,"teacher_disagreement_score":0.030069185,"about_ca_system_score_codex":0.0011552782,"about_ca_system_score_gemma":0.0030414592,"threshold_uncertainty_score":0.10059142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06599801,0.0013483639,0.9068941,0.0007433661,0.00014535322,0.00022069608,0.00063676503,0.000587446,0.023425886],"genre_scores_gemma":[0.6454902,0.0015916732,0.3411114,0.0005189687,0.0005019042,0.00042815448,0.0015545916,0.00054713245,0.0082557835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953902,0.0009238459,0.0005076423,0.0012177033,0.0015212976,0.00043933617],"domain_scores_gemma":[0.977415,0.010724514,0.0035749825,0.004116886,0.0034376844,0.0007308051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030754823,0.0006875611,0.00082368974,0.0021133227,0.0016198485,0.0029881147,0.00216254,0.0010255665,0.0061711874],"category_scores_gemma":[0.02477749,0.0006303405,0.0013208677,0.003002293,0.003504331,0.010053266,0.0034717363,0.0019957323,0.0007200488],"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.00021866466,0.00005253195,0.0057691014,0.00043438585,0.00008345012,0.00066856784,0.0024466042,0.020064551,0.010871759,0.89305174,0.0027895197,0.063549146],"study_design_scores_gemma":[0.000034795732,0.00013873885,0.0025773095,0.00014035712,0.00009935342,0.0015209811,0.0007625534,0.08835312,0.0075895055,0.86285037,0.03581753,0.0001153559],"about_ca_topic_score_codex":0.0023525578,"about_ca_topic_score_gemma":0.0020636104,"teacher_disagreement_score":0.0061711874,"about_ca_system_score_codex":0.0013830608,"about_ca_system_score_gemma":0.0012118274,"threshold_uncertainty_score":0.020644724},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003714827,0.0032924446,0.52292204,0.0017956219,0.0018754408,0.00009364201,0.00075636036,0.0017432643,0.46380642],"genre_scores_gemma":[0.17851846,0.007464668,0.55715585,0.0014507425,0.0011613363,0.00032080236,0.002847143,0.0035594704,0.24752158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793965,0.00047585877,0.00010341994,0.0003233478,0.00091047795,0.00024733486],"domain_scores_gemma":[0.9972542,0.0009590978,0.00007526699,0.0011521281,0.0004361854,0.00012314819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014595169,0.0015929533,0.001346833,0.0014566199,0.0013554359,0.0036848176,0.0037042177,0.0014696976,0.072315045],"category_scores_gemma":[0.011057066,0.00076000293,0.0023030995,0.001992979,0.0020455897,0.005288117,0.0042980835,0.004920558,0.021062743],"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.000055385543,0.000036902533,0.0001342503,0.00027592963,0.000028553895,0.00014267175,0.00013340807,0.012878574,0.00051394635,0.85693204,0.04824255,0.08062577],"study_design_scores_gemma":[0.000017337534,0.000015314334,0.00010710962,0.0001633046,0.00002921361,0.0001857859,0.00007322732,0.037911434,0.00096770696,0.8172871,0.14321782,0.000024663423],"about_ca_topic_score_codex":0.002520959,"about_ca_topic_score_gemma":0.0046473327,"teacher_disagreement_score":0.072315045,"about_ca_system_score_codex":0.0018447558,"about_ca_system_score_gemma":0.0012796859,"threshold_uncertainty_score":0.24191791},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17516871,0.0013240863,0.65063214,0.0021938519,0.00084112206,0.00016005385,0.00093157456,0.0015363039,0.16721213],"genre_scores_gemma":[0.7851416,0.00082650135,0.18089777,0.00052823295,0.00035258543,0.00028062027,0.0008946869,0.00093583146,0.030142164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991792,0.00016496818,0.000034632212,0.0001523845,0.00028591993,0.00018296886],"domain_scores_gemma":[0.997672,0.0013556139,0.00011400617,0.00042166057,0.0002109559,0.00022564892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014927684,0.0010024781,0.0021121658,0.0011606052,0.0014458225,0.0019594093,0.0024928688,0.0015927182,0.017600507],"category_scores_gemma":[0.00890986,0.0007675165,0.00082829344,0.0014560339,0.0018113737,0.0050243526,0.0042207856,0.004138061,0.0017575676],"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.00024953124,0.000083168314,0.00014388599,0.0001381134,0.000011231309,0.000039529834,0.00014858146,0.017176056,0.0012184021,0.9213167,0.009040035,0.050434817],"study_design_scores_gemma":[0.000045903078,0.000042000367,0.000105794024,0.000035118366,0.000011031478,0.000047578942,0.00007540682,0.058689356,0.0013110804,0.93392396,0.0057004094,0.000012342092],"about_ca_topic_score_codex":0.00072477054,"about_ca_topic_score_gemma":0.0011400388,"teacher_disagreement_score":0.017600507,"about_ca_system_score_codex":0.0012808632,"about_ca_system_score_gemma":0.0012672034,"threshold_uncertainty_score":0.058879554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050395,0.0005375164,0.98718333,0.00036286545,0.000036344638,0.00003809779,0.000018267234,0.00030658703,0.006477527],"genre_scores_gemma":[0.27801087,0.0007804114,0.71698946,0.0004984492,0.00013108844,0.0003219848,0.00010401911,0.0003023393,0.0028614171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98619604,0.0067565246,0.0006463281,0.001546027,0.003928724,0.00092628936],"domain_scores_gemma":[0.95820284,0.031507544,0.0018719948,0.0059425216,0.0019290916,0.00054608274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109941885,0.0017806913,0.0014734511,0.0027696958,0.0011682966,0.004804524,0.0029839368,0.0023224808,0.0039753104],"category_scores_gemma":[0.052302316,0.0010557878,0.0015943949,0.0027833285,0.005928267,0.005976907,0.005113819,0.0040856376,0.0009451142],"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.000094105264,0.00007043851,0.0005408894,0.00018315177,0.00006832052,0.00006850346,0.00029675785,0.3373528,0.00133873,0.5999086,0.0017007994,0.05837694],"study_design_scores_gemma":[0.000025616782,0.000054732427,0.00008004806,0.000081230275,0.000027587177,0.000045400357,0.00003564691,0.7569099,0.0015967863,0.23774233,0.003379568,0.000021172367],"about_ca_topic_score_codex":0.002209857,"about_ca_topic_score_gemma":0.002984209,"teacher_disagreement_score":0.0109941885,"about_ca_system_score_codex":0.0034618406,"about_ca_system_score_gemma":0.0033840612,"threshold_uncertainty_score":0.058143497},"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":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003956692,0.009343931,0.23961388,0.0045002825,0.0019914545,0.00095990126,0.28450012,0.27226985,0.18286398],"genre_scores_gemma":[0.027519718,0.0059337425,0.22813196,0.0018570696,0.001027058,0.0020041047,0.6575871,0.04004294,0.035896257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967349,0.0008452993,0.0004017197,0.00046665233,0.0012845135,0.00026682246],"domain_scores_gemma":[0.98406434,0.008126702,0.00083811616,0.002701316,0.002991057,0.0012785512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031652253,0.0024662227,0.0023910233,0.007459019,0.0012287169,0.0048511038,0.00654334,0.0017899581,0.19830033],"category_scores_gemma":[0.018972896,0.0017134055,0.0020970549,0.015776392,0.0007782569,0.0053741103,0.004524517,0.0044768215,0.14331391],"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.0001533149,0.00009875643,0.0002747798,0.0010550346,0.000052677227,0.0000749666,0.000034492972,0.002944487,0.0008559467,0.013601004,0.88645345,0.094401196],"study_design_scores_gemma":[0.00037344525,0.00008198494,0.0010725714,0.00034347383,0.00007770489,0.00030535474,0.000053791147,0.017453864,0.0045940187,0.04808237,0.92748165,0.00007966923],"about_ca_topic_score_codex":0.0030621793,"about_ca_topic_score_gemma":0.004451016,"teacher_disagreement_score":0.19830033,"about_ca_system_score_codex":0.0022661434,"about_ca_system_score_gemma":0.004251255,"threshold_uncertainty_score":0.6633807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101908624,0.00033541396,0.88358533,0.0002813437,0.00012891558,0.00028534012,0.00024572207,0.0018884932,0.01134085],"genre_scores_gemma":[0.6523142,0.00013171954,0.34014314,0.00008284014,0.000032047006,0.00020696362,0.000290353,0.00023604902,0.006562601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993291,0.00023073082,0.000036138867,0.000091504386,0.00017955458,0.00013308974],"domain_scores_gemma":[0.9988489,0.0006921483,0.000051062052,0.00017757835,0.00012709253,0.00010323046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015019,0.00036191422,0.0011067879,0.00063565245,0.0008006937,0.0010655614,0.0022155643,0.0008181655,0.005625875],"category_scores_gemma":[0.0025487721,0.0004264749,0.00043019073,0.0015113436,0.00063521485,0.0013816087,0.0012133059,0.00075726554,0.000637749],"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.0007795632,0.00032037194,0.0008275182,0.00016344382,0.000048456488,0.00008921425,0.00019288975,0.75198627,0.0065799723,0.04588576,0.006407002,0.18671955],"study_design_scores_gemma":[0.000054904074,0.000063472944,0.00011612668,0.0000042983365,0.000009248387,0.000020646226,0.000037198348,0.9824249,0.0009326117,0.01553917,0.00079082645,0.000006625023],"about_ca_topic_score_codex":0.006572386,"about_ca_topic_score_gemma":0.009435135,"teacher_disagreement_score":0.006572386,"about_ca_system_score_codex":0.0009103466,"about_ca_system_score_gemma":0.0018268913,"threshold_uncertainty_score":0.018820405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032907967,0.00058110466,0.9365918,0.0002741457,0.00010249822,0.00032999198,0.00034271087,0.024123557,0.004746257],"genre_scores_gemma":[0.2028433,0.00022557401,0.79275525,0.00022349418,0.000061699924,0.00053603726,0.00084866,0.001147115,0.001358882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973537,0.0011890322,0.00019741441,0.00043921507,0.00063135,0.00018941557],"domain_scores_gemma":[0.9941983,0.0035090067,0.0003399906,0.0012479426,0.0005175533,0.00018718137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004367223,0.0016234561,0.001432405,0.0015476067,0.0006126007,0.0018470815,0.0033188201,0.0015046434,0.004961977],"category_scores_gemma":[0.0118811615,0.0010080746,0.0012316399,0.0013855459,0.0011193708,0.0023087887,0.0022216728,0.0018678077,0.0023453583],"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.0005201997,0.00034651815,0.0047930432,0.00042336292,0.00027119086,0.00019168056,0.00019034931,0.5167754,0.009987707,0.018109197,0.018828467,0.4295628],"study_design_scores_gemma":[0.000114251714,0.00007261443,0.00024646125,0.000014743725,0.000024482082,0.000049374725,0.00002253357,0.9845547,0.0047554746,0.0061744787,0.003954714,0.00001614529],"about_ca_topic_score_codex":0.0019879746,"about_ca_topic_score_gemma":0.0028011573,"teacher_disagreement_score":0.004961977,"about_ca_system_score_codex":0.0010082177,"about_ca_system_score_gemma":0.0026825212,"threshold_uncertainty_score":0.023096323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011590988,0.00006798406,0.97739035,0.0004267876,0.00006525891,0.00016476236,0.00025126926,0.0022193633,0.007823101],"genre_scores_gemma":[0.222871,0.00021447631,0.7649155,0.00017386653,0.00006620378,0.000396126,0.00056804204,0.0003661565,0.010428561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899906,0.0001999127,0.0001240356,0.00012184181,0.00043132616,0.0001237144],"domain_scores_gemma":[0.9982326,0.0009698073,0.00013325036,0.00036817143,0.0002001634,0.00009590501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019676378,0.00043525096,0.00048543685,0.00057907746,0.0009924249,0.0027957084,0.0025378983,0.0011113193,0.00805811],"category_scores_gemma":[0.0045770546,0.0010213285,0.0011841006,0.0006743897,0.002246359,0.003108596,0.001860188,0.0017279801,0.0018103919],"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.00016350433,0.00006469791,0.0002953287,0.0002323586,0.000016790413,0.00017845191,0.00037160428,0.014098001,0.017490173,0.94085735,0.0023483124,0.02388341],"study_design_scores_gemma":[0.00017582806,0.00019817184,0.0003521392,0.000102511585,0.00011381028,0.0003699729,0.00015215692,0.39084578,0.044488132,0.49688992,0.06624034,0.00007116918],"about_ca_topic_score_codex":0.001831422,"about_ca_topic_score_gemma":0.00337344,"teacher_disagreement_score":0.00805811,"about_ca_system_score_codex":0.0010552604,"about_ca_system_score_gemma":0.0023318422,"threshold_uncertainty_score":0.026957035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009114226,0.0002840175,0.99079645,0.00020523687,0.00008581858,0.000040347455,0.00027791833,0.0029017841,0.0044969865],"genre_scores_gemma":[0.04975379,0.00052932283,0.9412734,0.00032099034,0.000171228,0.00014965926,0.0010104587,0.0012088821,0.0055822683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978174,0.0006527904,0.00012764418,0.00045595499,0.0008126076,0.00013352421],"domain_scores_gemma":[0.99747354,0.0015791422,0.0001179011,0.00053889176,0.0002400116,0.000050476654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021572176,0.0013612892,0.0015762931,0.001381558,0.00080354547,0.0023600524,0.0050677317,0.0015645437,0.016447019],"category_scores_gemma":[0.0072844415,0.0014328334,0.0016985517,0.003093329,0.0011869175,0.0049978034,0.003455091,0.004136737,0.0045714052],"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.00018800749,0.00019820484,0.00034318518,0.00071497774,0.00017160234,0.0001338004,0.00012594978,0.17028753,0.004882865,0.19225657,0.03883615,0.5918611],"study_design_scores_gemma":[0.0000694637,0.00003520192,0.00010500896,0.000068635374,0.00006250341,0.00012528042,0.000023415165,0.7253989,0.003996236,0.24844542,0.021638906,0.0000310186],"about_ca_topic_score_codex":0.0031015952,"about_ca_topic_score_gemma":0.0083459895,"teacher_disagreement_score":0.016447019,"about_ca_system_score_codex":0.0011422841,"about_ca_system_score_gemma":0.001628748,"threshold_uncertainty_score":0.05502075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013574601,0.00053851627,0.9799595,0.00022476848,0.00006608225,0.000067193476,0.000070217706,0.0013140363,0.004185123],"genre_scores_gemma":[0.31711993,0.000517822,0.67322886,0.00026810862,0.00015653425,0.000402837,0.00041768033,0.00091710326,0.0069711576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998505,0.00067385996,0.00007888434,0.0003005405,0.00032648293,0.00011523295],"domain_scores_gemma":[0.9957041,0.0030370383,0.00018687743,0.00073361595,0.00021957974,0.00011884284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029618219,0.00095811376,0.002400575,0.00155739,0.0010142854,0.0013176756,0.0034658834,0.0014849522,0.0068838233],"category_scores_gemma":[0.012383749,0.0011661007,0.0014511807,0.0032774657,0.0016241217,0.0042644567,0.0034610874,0.0028406964,0.0010122808],"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.0002617897,0.00015800116,0.00045907267,0.0002838151,0.000097671335,0.000051901607,0.00023157522,0.61589515,0.0020871847,0.14009114,0.008605467,0.23177719],"study_design_scores_gemma":[0.000024238729,0.00002105835,0.000044506403,0.00000884402,0.00001250612,0.000011438323,0.000011059085,0.92600846,0.00038017714,0.07251589,0.0009547225,0.000007101865],"about_ca_topic_score_codex":0.002977087,"about_ca_topic_score_gemma":0.004927748,"teacher_disagreement_score":0.0068838233,"about_ca_system_score_codex":0.0013063506,"about_ca_system_score_gemma":0.0010894233,"threshold_uncertainty_score":0.023028731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016226984,0.00036063627,0.9882784,0.00035164406,0.0000890888,0.00021434916,0.0002823013,0.0016189633,0.0071819345],"genre_scores_gemma":[0.023566177,0.00039157018,0.9704021,0.00021821138,0.000022112421,0.00029864497,0.0006104291,0.000240533,0.004250268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927753,0.0001726649,0.00004884126,0.00019237598,0.00025379588,0.000054780845],"domain_scores_gemma":[0.9993837,0.00032451685,0.000060007485,0.00007993093,0.00012461012,0.0000271873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952331,0.0010781048,0.00058159226,0.0010836616,0.0009296533,0.0010196699,0.0013547712,0.0010967451,0.0128682405],"category_scores_gemma":[0.0024004153,0.00058455265,0.0013039402,0.0016047682,0.0007821077,0.0014487167,0.0013290821,0.0015946309,0.0033564141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012211832,0.00016501553,0.0005906459,0.0009279128,0.000113463386,0.00025868404,0.00017452067,0.18036929,0.011980617,0.1210306,0.04052641,0.64374065],"study_design_scores_gemma":[0.00014730614,0.00012288408,0.00021337025,0.00012517232,0.00006831934,0.00044881192,0.00011107403,0.77756786,0.009244353,0.12244575,0.08946889,0.000036218098],"about_ca_topic_score_codex":0.003940124,"about_ca_topic_score_gemma":0.0062304176,"teacher_disagreement_score":0.0128682405,"about_ca_system_score_codex":0.0008909565,"about_ca_system_score_gemma":0.002513171,"threshold_uncertainty_score":0.04304862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003039585,0.0009472443,0.98908293,0.00038303182,0.00014193813,0.000023847533,0.00006663503,0.00022458786,0.0060902624],"genre_scores_gemma":[0.19148065,0.0017967579,0.7871507,0.000585097,0.0006686397,0.00024881188,0.00058183965,0.0007731273,0.016714327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99313337,0.0022501852,0.00032999853,0.0008792553,0.0028980817,0.0005091421],"domain_scores_gemma":[0.98643756,0.0092774965,0.000453544,0.0022112622,0.0011879595,0.00043218286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057044546,0.0024338944,0.002727171,0.0021428752,0.0010831542,0.0032180776,0.006342617,0.002098105,0.0070344745],"category_scores_gemma":[0.019599786,0.0013399574,0.0025719285,0.0030473252,0.0032061555,0.007856573,0.010414932,0.010220808,0.0012823029],"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.0002121761,0.00008446006,0.00036128392,0.0003642568,0.00007932057,0.00009714908,0.00018984855,0.13145618,0.0034011693,0.73285705,0.009292238,0.1216049],"study_design_scores_gemma":[0.000022144735,0.000044784694,0.00016310491,0.000058887963,0.000035078698,0.00010698578,0.00002069529,0.65310854,0.0020773583,0.3375594,0.006769391,0.00003367067],"about_ca_topic_score_codex":0.001953704,"about_ca_topic_score_gemma":0.002077474,"teacher_disagreement_score":0.0070344745,"about_ca_system_score_codex":0.0025383907,"about_ca_system_score_gemma":0.0015966265,"threshold_uncertainty_score":0.030168355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014767158,0.00012408633,0.996064,0.00035786402,0.000037155853,0.000033675635,0.000061866645,0.00011932743,0.0017253998],"genre_scores_gemma":[0.107209906,0.0009772737,0.8887777,0.00036842,0.000174578,0.00028160808,0.00031524236,0.00012152876,0.0017738354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348587,0.0030709507,0.00050699594,0.00063746737,0.0020056744,0.00029312607],"domain_scores_gemma":[0.98856926,0.0070590414,0.0009723359,0.0016173121,0.0014027003,0.00037929293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009773718,0.0015146342,0.0010985924,0.0029744399,0.0014709766,0.0050360537,0.0027806633,0.0016706184,0.0038624648],"category_scores_gemma":[0.026891816,0.0014657457,0.0036266567,0.0030704688,0.005691115,0.010550241,0.0061797947,0.0055437335,0.00090179686],"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.000029312336,0.00001605932,0.00021342683,0.00013059755,0.0000408245,0.00013264807,0.0003200746,0.04400565,0.00077185116,0.93688625,0.0010672442,0.016385954],"study_design_scores_gemma":[0.000013590204,0.000009545358,0.00004254128,0.000034520173,0.000018858722,0.000038006066,0.00005416975,0.10217696,0.0005446367,0.8920554,0.004995937,0.00001585733],"about_ca_topic_score_codex":0.0058984454,"about_ca_topic_score_gemma":0.005556305,"teacher_disagreement_score":0.009773718,"about_ca_system_score_codex":0.0028223067,"about_ca_system_score_gemma":0.0026346883,"threshold_uncertainty_score":0.05168897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5721114,0.00065370416,0.40166005,0.0013542558,0.000067702655,0.00012488649,0.0008601141,0.0010014056,0.022166394],"genre_scores_gemma":[0.9441526,0.0003852364,0.04253831,0.0001499685,0.00012611476,0.00015380759,0.00090670574,0.000257359,0.011329904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976503,0.0005092484,0.00012979364,0.0005749287,0.0007070032,0.00042872343],"domain_scores_gemma":[0.98456925,0.011300145,0.001085266,0.0015558576,0.0008882794,0.0006011027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244052,0.0005336102,0.001302042,0.0009341656,0.0015082159,0.004268054,0.0014832591,0.0011717248,0.005766714],"category_scores_gemma":[0.012707013,0.00093205454,0.00136652,0.0019076357,0.0021454245,0.0058682254,0.0024570744,0.002287393,0.0006703994],"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.00017525787,0.000048198854,0.0011683545,0.00009820439,0.00002826259,0.0005326543,0.0013109276,0.010787484,0.004458669,0.96631384,0.0018520316,0.013226168],"study_design_scores_gemma":[0.0000652257,0.000032011674,0.00046896358,0.000018609544,0.00003507526,0.00032816612,0.00022839269,0.033149064,0.002374864,0.958276,0.005004697,0.000018942446],"about_ca_topic_score_codex":0.0030707973,"about_ca_topic_score_gemma":0.0028249342,"teacher_disagreement_score":0.005766714,"about_ca_system_score_codex":0.0026758066,"about_ca_system_score_gemma":0.0013431053,"threshold_uncertainty_score":0.019414365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96465653,0.0013443135,0.026610617,0.00068917376,0.000052783646,0.00014877859,0.00081491604,0.00018230714,0.005500652],"genre_scores_gemma":[0.98762244,0.00015732148,0.01050654,0.000047222824,0.00002670689,0.000059125552,0.00085029786,0.00008136364,0.0006489527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98321116,0.012586096,0.0006478285,0.001227378,0.001969309,0.00035828253],"domain_scores_gemma":[0.29507065,0.6605351,0.011817633,0.02483137,0.006313523,0.0014318486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024127332,0.00054939254,0.000719293,0.001945015,0.0010864208,0.0018778902,0.0034043978,0.0015982105,0.006206472],"category_scores_gemma":[0.269405,0.0005488273,0.00066868926,0.004240214,0.0027405797,0.004537148,0.0010136077,0.0030666776,0.00045409272],"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.011647036,0.0053448523,0.33321077,0.0013187535,0.0013132915,0.00042588828,0.0028187197,0.34093836,0.0027001374,0.0839737,0.016158277,0.20015027],"study_design_scores_gemma":[0.0006559195,0.0026831625,0.07992106,0.0001755222,0.0006315248,0.0009184299,0.002467841,0.8449524,0.0028995848,0.059368305,0.005202476,0.0001238177],"about_ca_topic_score_codex":0.0041876966,"about_ca_topic_score_gemma":0.0041396297,"teacher_disagreement_score":0.024127332,"about_ca_system_score_codex":0.0019133231,"about_ca_system_score_gemma":0.0013796109,"threshold_uncertainty_score":0.12759906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002631395,0.0011792374,0.96597975,0.0004349728,0.0002440508,0.00009159275,0.0001767545,0.000708175,0.028554004],"genre_scores_gemma":[0.043170653,0.002277496,0.9444184,0.00021029144,0.00016417609,0.00015621095,0.00024933033,0.0004029404,0.008950462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940896,0.0001447813,0.000027155464,0.00007617384,0.0002946117,0.000048249134],"domain_scores_gemma":[0.9991165,0.0005816276,0.000031252737,0.00011094651,0.00013124396,0.000028492846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062837993,0.00089101295,0.0009225299,0.0008808736,0.0008244566,0.001542169,0.0018776988,0.0009722947,0.011767913],"category_scores_gemma":[0.0027477867,0.0007068571,0.0010288493,0.0034214924,0.0008760702,0.0013217026,0.0010992708,0.002490387,0.0015996028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001029,0.000105256455,0.0002257368,0.0003415178,0.00006107639,0.00024605266,0.00014355521,0.20371681,0.005460633,0.3272994,0.023798382,0.4384986],"study_design_scores_gemma":[0.000026969501,0.000030513907,0.00015915716,0.00007312496,0.000026921394,0.00012621577,0.00002994998,0.72298,0.0029599983,0.22613838,0.04741928,0.000029451085],"about_ca_topic_score_codex":0.012479488,"about_ca_topic_score_gemma":0.018088551,"teacher_disagreement_score":0.012479488,"about_ca_system_score_codex":0.0009546067,"about_ca_system_score_gemma":0.0015384898,"threshold_uncertainty_score":0.039367616},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033966176,0.0009923026,0.17737933,0.0017120772,0.0006590374,0.000117304,0.00094486505,0.00085929554,0.7833697],"genre_scores_gemma":[0.43624297,0.0014749761,0.03282021,0.0009131786,0.0006898068,0.00031888968,0.0020699308,0.0009419563,0.524528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994723,0.0000756299,0.00002910311,0.0001396972,0.00019707359,0.00008619554],"domain_scores_gemma":[0.9993206,0.00015491572,0.0000587441,0.00020292292,0.00016391565,0.000098944845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036991833,0.0006777986,0.0006823686,0.0018876035,0.0024483849,0.0027373196,0.0010764381,0.0011592921,0.066651665],"category_scores_gemma":[0.0020292627,0.00045947428,0.00057600834,0.0015312786,0.0018384098,0.005400191,0.0027215688,0.0024510277,0.014393351],"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.000012612405,0.000012032912,0.000032231794,0.000024760768,0.0000024370204,0.000023638022,0.00010317351,0.00016655592,0.00055706577,0.9825837,0.005728927,0.010752758],"study_design_scores_gemma":[0.0000061618184,0.000015071275,0.000081838916,0.000016066839,0.000005348102,0.00010174213,0.00007968607,0.0013392775,0.0008890569,0.9595601,0.03789908,0.000006521921],"about_ca_topic_score_codex":0.00040147416,"about_ca_topic_score_gemma":0.00044602956,"teacher_disagreement_score":0.066651665,"about_ca_system_score_codex":0.00076503085,"about_ca_system_score_gemma":0.00047127475,"threshold_uncertainty_score":0.22297204},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002127345,0.01102439,0.32205245,0.003613928,0.00070066,0.000114657334,0.0018276301,0.001035741,0.6575032],"genre_scores_gemma":[0.10811524,0.030826652,0.18319808,0.0017638233,0.0010282693,0.0006686771,0.007866171,0.001362955,0.66517013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923575,0.00017459848,0.000041482126,0.00013727833,0.00035227943,0.000058645583],"domain_scores_gemma":[0.9994522,0.00027724297,0.000030727253,0.000111760724,0.00009981574,0.000028233186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006575026,0.0018608909,0.0009224698,0.0013990107,0.000883715,0.0036204106,0.0017302205,0.0012067718,0.0680559],"category_scores_gemma":[0.0020826398,0.0008906285,0.0012193118,0.00416945,0.0014259836,0.004311481,0.0017299593,0.0029013765,0.017639117],"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.000011138354,0.000037667633,0.00008217519,0.00022436766,0.000020031915,0.00006569835,0.00011823706,0.009060512,0.00032327656,0.79143274,0.07982223,0.11880202],"study_design_scores_gemma":[0.0000086476975,0.000007867716,0.00007089336,0.00014771149,0.00001219344,0.00008171792,0.00004945502,0.016511012,0.00040695744,0.70282,0.27986896,0.000014625012],"about_ca_topic_score_codex":0.004537665,"about_ca_topic_score_gemma":0.00591395,"teacher_disagreement_score":0.0680559,"about_ca_system_score_codex":0.002092965,"about_ca_system_score_gemma":0.0017986755,"threshold_uncertainty_score":0.22766966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04048386,0.00047118874,0.9499849,0.00057269423,0.000056526584,0.00008286688,0.00014592355,0.00029067893,0.007911283],"genre_scores_gemma":[0.41976684,0.00055926497,0.5727535,0.0002629936,0.0000654136,0.00013178773,0.0003848021,0.00023485249,0.005840463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760854,0.00086417684,0.00012218292,0.00037993482,0.0007955194,0.00022968056],"domain_scores_gemma":[0.9929715,0.0042121387,0.0005552284,0.0013695472,0.0006682806,0.0002232009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024399338,0.0006520809,0.000947922,0.0009571754,0.0006465865,0.0032992112,0.0016765194,0.00090787746,0.00334046],"category_scores_gemma":[0.010511301,0.00061136443,0.00080444996,0.0021933143,0.0021860038,0.0045311046,0.0032857428,0.003538606,0.00041496218],"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.00034601337,0.0001437152,0.0012860788,0.00043194133,0.00005137995,0.00024868964,0.000466819,0.09653506,0.0064503346,0.69407916,0.0027299533,0.19723083],"study_design_scores_gemma":[0.000038291455,0.0000722778,0.0002275948,0.00008274702,0.00003135019,0.00018400252,0.00011691456,0.4807552,0.008338424,0.50234586,0.007785063,0.000022209655],"about_ca_topic_score_codex":0.0018798152,"about_ca_topic_score_gemma":0.0021996265,"teacher_disagreement_score":0.00334046,"about_ca_system_score_codex":0.0014933122,"about_ca_system_score_gemma":0.0017162919,"threshold_uncertainty_score":0.01290375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01945478,0.00052089116,0.97153443,0.00023320236,0.000055943216,0.00009483157,0.00013688303,0.0026394674,0.005329573],"genre_scores_gemma":[0.38572678,0.00038763558,0.6051192,0.00024319111,0.00011120411,0.00043302102,0.0005350569,0.0009033846,0.0065405555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990324,0.00038172587,0.000049264843,0.00018242454,0.00025885212,0.0000952419],"domain_scores_gemma":[0.99766797,0.0015137963,0.00009993437,0.00049015414,0.000151625,0.000076455624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015858208,0.0008728473,0.0021263196,0.0014657142,0.00081842946,0.0010282119,0.0026225257,0.0011017937,0.00859828],"category_scores_gemma":[0.0069093127,0.00095119793,0.00110868,0.002902683,0.0011711987,0.0027970262,0.0032403015,0.001822725,0.0015054761],"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.00040595236,0.00016495444,0.0005679187,0.0002471046,0.00007536861,0.00005236986,0.00018654593,0.52502596,0.003841525,0.076166034,0.011757239,0.38150895],"study_design_scores_gemma":[0.000032852877,0.000027377528,0.000063250314,0.0000058217115,0.000011639455,0.000011953434,0.0000114295335,0.96338594,0.00053637906,0.0349057,0.0010016705,0.00000598933],"about_ca_topic_score_codex":0.0034930513,"about_ca_topic_score_gemma":0.006597093,"teacher_disagreement_score":0.00859828,"about_ca_system_score_codex":0.0010205747,"about_ca_system_score_gemma":0.0010714869,"threshold_uncertainty_score":0.02876407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010617669,0.00016892218,0.99176764,0.00054888014,0.00012273071,0.000075053686,0.00013854208,0.00039354208,0.0057228645],"genre_scores_gemma":[0.07926943,0.0005160982,0.91141343,0.0006426941,0.00028285218,0.00048292818,0.00042143784,0.00052888156,0.0064422274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966653,0.0013574262,0.00046978233,0.0005980843,0.0007043867,0.00020498938],"domain_scores_gemma":[0.99585235,0.0024588543,0.0002568056,0.0006388646,0.0005990989,0.00019395244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049867416,0.0015420244,0.0012088703,0.0021000567,0.0020247502,0.0050064987,0.005061895,0.0033970547,0.013677032],"category_scores_gemma":[0.007420154,0.0021573603,0.0034835052,0.0027292182,0.0077187126,0.011988442,0.00489843,0.007074663,0.003497534],"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.00001424872,0.000011572003,0.00003413308,0.00010532456,0.000008202407,0.00014135377,0.00044704767,0.0011385364,0.0020174775,0.9893121,0.0012352685,0.0055346587],"study_design_scores_gemma":[0.00005125948,0.0000643503,0.00008238122,0.00013430121,0.00007576831,0.00037768466,0.00036262188,0.039154325,0.0053953375,0.8775795,0.07664787,0.00007461199],"about_ca_topic_score_codex":0.0021477002,"about_ca_topic_score_gemma":0.0031536825,"teacher_disagreement_score":0.013677032,"about_ca_system_score_codex":0.0018293496,"about_ca_system_score_gemma":0.0015442763,"threshold_uncertainty_score":0.045754254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045193125,0.00077182037,0.93028367,0.0005434134,0.00019937559,0.00025102327,0.00033660053,0.0010025984,0.021418385],"genre_scores_gemma":[0.30297548,0.00034175412,0.6855092,0.00045884267,0.00009964553,0.00037025698,0.0007924348,0.00037235627,0.00908007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988532,0.0003970112,0.00006322823,0.00023501259,0.00031707415,0.00013443985],"domain_scores_gemma":[0.9975661,0.0012409965,0.00015038955,0.00061421195,0.00033685096,0.00009139611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013963918,0.00087662507,0.0008493205,0.0008212083,0.0004705837,0.00085697585,0.0021597482,0.0010319218,0.0056806984],"category_scores_gemma":[0.0051233717,0.00037918572,0.0009931679,0.0011314497,0.0009301587,0.0015561522,0.0020161709,0.0020930145,0.00084841903],"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.00044655896,0.0003314798,0.0013042993,0.00027080416,0.00010964981,0.00025094268,0.0001592372,0.534596,0.008938627,0.12208616,0.010721017,0.3207851],"study_design_scores_gemma":[0.00009130698,0.00016515199,0.00035870573,0.000027944077,0.000032009182,0.00020808353,0.000036942296,0.91882557,0.003791645,0.065945655,0.010498941,0.000018064467],"about_ca_topic_score_codex":0.0016040769,"about_ca_topic_score_gemma":0.0031354304,"teacher_disagreement_score":0.0056806984,"about_ca_system_score_codex":0.00075974874,"about_ca_system_score_gemma":0.001355585,"threshold_uncertainty_score":0.019003868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9589682,0.0021732897,0.02880305,0.00070700864,0.00005203397,0.00027335004,0.0011758349,0.0009039489,0.0069433404],"genre_scores_gemma":[0.9439572,0.00048412132,0.052311614,0.000082524726,0.000017195982,0.00019166581,0.0015505827,0.00020340065,0.001201697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874956,0.006170431,0.0010710399,0.0014573075,0.0034279912,0.00037776362],"domain_scores_gemma":[0.67476755,0.28639328,0.0072025317,0.017545069,0.013111967,0.0009795778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01728773,0.00075473636,0.0006412636,0.0028696463,0.000887604,0.0017319665,0.0018258664,0.0013540643,0.0019637865],"category_scores_gemma":[0.17421232,0.00042960144,0.00055663165,0.004042318,0.0016228487,0.0028879603,0.00083694997,0.0021387362,0.00048027092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028055548,0.0027979128,0.20244801,0.0013217708,0.00045435812,0.00042052005,0.0012082685,0.21447556,0.0057541323,0.022054179,0.0114427,0.534817],"study_design_scores_gemma":[0.0002560298,0.0023198572,0.045685153,0.00021860725,0.00021298592,0.0011268804,0.0008867891,0.92018014,0.008316646,0.011303979,0.009409398,0.000083645464],"about_ca_topic_score_codex":0.005223487,"about_ca_topic_score_gemma":0.006098831,"teacher_disagreement_score":0.01728773,"about_ca_system_score_codex":0.0018169355,"about_ca_system_score_gemma":0.0015354083,"threshold_uncertainty_score":0.091427326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077078175,0.00007938729,0.99091244,0.000105923384,0.0000092827795,0.000036812482,0.000026177802,0.00021014415,0.00091199664],"genre_scores_gemma":[0.37598845,0.000173179,0.62167287,0.00014841986,0.000063728374,0.00024622644,0.00026730367,0.0002145489,0.001225264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527884,0.0022216036,0.00019731623,0.0006167497,0.0014422843,0.00024321773],"domain_scores_gemma":[0.9793483,0.015590672,0.00095902884,0.0022993535,0.0015355564,0.00026705253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006577431,0.00051201944,0.0010512433,0.0015560499,0.0010821414,0.002149615,0.002550136,0.001078396,0.0035471625],"category_scores_gemma":[0.029933913,0.00053465896,0.0008928257,0.0023440898,0.002183723,0.005363917,0.0026992783,0.0032189724,0.00047851296],"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.00021533125,0.00013578557,0.0013081688,0.00024676387,0.000078334124,0.00010884436,0.00041456026,0.24231228,0.0038103985,0.60764444,0.0025493726,0.14117569],"study_design_scores_gemma":[0.000015375434,0.000030709645,0.00013434443,0.000016119126,0.000018597748,0.00004113706,0.00004640522,0.76686215,0.0024657277,0.22897406,0.0013841791,0.000011237498],"about_ca_topic_score_codex":0.0020215057,"about_ca_topic_score_gemma":0.0022322852,"teacher_disagreement_score":0.006577431,"about_ca_system_score_codex":0.0015484927,"about_ca_system_score_gemma":0.0014934551,"threshold_uncertainty_score":0.03478521},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23652066,0.002465353,0.5558434,0.044219885,0.0022604018,0.0004529491,0.0023992402,0.007648045,0.14818998],"genre_scores_gemma":[0.8563842,0.0012503798,0.10693371,0.004563117,0.0010109924,0.00041376913,0.002513711,0.0018600727,0.02506997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9831594,0.0036998515,0.001326335,0.004154013,0.0061227134,0.0015376374],"domain_scores_gemma":[0.8830427,0.08854313,0.0031821425,0.017134001,0.0062137092,0.0018843962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057257004,0.0019639435,0.001943838,0.0016609613,0.0016784613,0.0061342823,0.0042245085,0.0038078371,0.0123374425],"category_scores_gemma":[0.06310822,0.0019867264,0.0034599018,0.0017332276,0.008665185,0.026884524,0.009078643,0.012038848,0.0034203269],"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.0006015797,0.0005423372,0.0061883866,0.0011847983,0.00031957324,0.0010812266,0.0011728201,0.016103467,0.011091072,0.7424536,0.03160336,0.18765776],"study_design_scores_gemma":[0.000047248173,0.000073733456,0.00043729082,0.00014643048,0.00005778746,0.00033215337,0.0003583504,0.01423762,0.0072692684,0.96759564,0.009410771,0.00003372661],"about_ca_topic_score_codex":0.000756342,"about_ca_topic_score_gemma":0.0009078852,"teacher_disagreement_score":0.0123374425,"about_ca_system_score_codex":0.0015955816,"about_ca_system_score_gemma":0.0017016124,"threshold_uncertainty_score":0.04127288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029133756,0.00043409332,0.95876294,0.00038775068,0.00009883485,0.00024014957,0.0002658198,0.0016503341,0.00902631],"genre_scores_gemma":[0.23315467,0.00031183168,0.7614689,0.00029164422,0.000042044034,0.00029085347,0.00050481944,0.00039121485,0.0035440575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970356,0.0010143366,0.00028373007,0.00052479305,0.00077239994,0.00036905534],"domain_scores_gemma":[0.9927337,0.004102334,0.0004517295,0.0019812377,0.00054791936,0.00018305927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002162788,0.0013000619,0.001177104,0.0011148523,0.0009947958,0.0029462061,0.002815677,0.0013824637,0.008952793],"category_scores_gemma":[0.013873183,0.0008602476,0.0016046109,0.002088796,0.0017396021,0.005503446,0.004374602,0.00265172,0.0012772937],"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.0004591391,0.0002978989,0.002054117,0.0007288816,0.00014095708,0.00024773044,0.00073781505,0.35082048,0.004112073,0.33187902,0.0093599325,0.299162],"study_design_scores_gemma":[0.00014792742,0.00018109535,0.0002933841,0.00008957187,0.00008507972,0.00014743741,0.0002509025,0.5994116,0.0049203117,0.38344836,0.010965399,0.00005897573],"about_ca_topic_score_codex":0.0036399497,"about_ca_topic_score_gemma":0.0052891206,"teacher_disagreement_score":0.008952793,"about_ca_system_score_codex":0.0016892424,"about_ca_system_score_gemma":0.0024072255,"threshold_uncertainty_score":0.029950082},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045379796,0.35872236,0.5897648,0.0055528707,0.0009115765,0.0001799735,0.00048551525,0.00019602639,0.03964885],"genre_scores_gemma":[0.109223686,0.32460737,0.5510667,0.002044034,0.003547396,0.0004427459,0.0006573138,0.00010981196,0.008300983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560505,0.001537982,0.00044216856,0.0004757649,0.0017979408,0.00014094626],"domain_scores_gemma":[0.9881285,0.00902312,0.0005253285,0.0008687112,0.0012706763,0.00018364021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007630852,0.0010669729,0.0024552308,0.0055960296,0.001434049,0.006350071,0.0037034487,0.0022778183,0.0048684934],"category_scores_gemma":[0.014453299,0.0013992384,0.0025107649,0.014501406,0.008700569,0.00973337,0.002821777,0.0059763123,0.0012005194],"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.000015206088,0.00003150399,0.00020831477,0.0006910985,0.00008538979,0.000042210908,0.00014122907,0.008516769,0.00018447483,0.925532,0.0031298741,0.061421804],"study_design_scores_gemma":[0.000009955276,0.000014536874,0.00025370115,0.00021677579,0.00003200241,0.00010925514,0.00006847387,0.017905116,0.0002461018,0.9426273,0.038480915,0.00003601619],"about_ca_topic_score_codex":0.0120063545,"about_ca_topic_score_gemma":0.009986214,"teacher_disagreement_score":0.0120063545,"about_ca_system_score_codex":0.004328254,"about_ca_system_score_gemma":0.0035472263,"threshold_uncertainty_score":0.04035628},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002272554,0.117940314,0.3412636,0.032364145,0.38869426,0.00042537693,0.00190233,0.0024596974,0.112677835],"genre_scores_gemma":[0.020691354,0.097944275,0.16609193,0.017697288,0.4517141,0.0005837728,0.004899152,0.0037360068,0.23664209],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987508,0.00024082116,0.0001298018,0.00031649007,0.00047702738,0.00008505437],"domain_scores_gemma":[0.9954379,0.0021966083,0.00016142608,0.00059175456,0.0012517258,0.00036063112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015830307,0.0018573843,0.0025336323,0.0026205385,0.00094682444,0.0038792917,0.0018456357,0.0020942837,0.056124125],"category_scores_gemma":[0.005393089,0.0009456195,0.0017030953,0.0044218865,0.00093048846,0.004585167,0.0016106756,0.005216264,0.025898263],"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.00010016755,0.00014878732,0.00019465004,0.0008161042,0.00010294645,0.00016308615,0.000037312195,0.0033995747,0.0012130837,0.02156873,0.73932505,0.23293048],"study_design_scores_gemma":[0.000034619516,0.0001100272,0.00041741252,0.00025027856,0.0000714125,0.00049812807,0.000027775732,0.0070786383,0.0008311878,0.043974068,0.94666225,0.000044219953],"about_ca_topic_score_codex":0.0007224838,"about_ca_topic_score_gemma":0.0015156571,"teacher_disagreement_score":0.056124125,"about_ca_system_score_codex":0.0010044269,"about_ca_system_score_gemma":0.0010453032,"threshold_uncertainty_score":0.18775392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017348736,0.0002784316,0.9861413,0.0002414414,0.00006697173,0.00015902106,0.00043812927,0.0012760123,0.00966382],"genre_scores_gemma":[0.040806726,0.000376829,0.9483873,0.00024696934,0.00003669538,0.0005556766,0.0010370357,0.0004729933,0.008079828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837923,0.00059239584,0.0002087212,0.00027979893,0.00044787957,0.00009192325],"domain_scores_gemma":[0.99878126,0.00036581658,0.00004580618,0.0005202268,0.00023853222,0.000048361224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016098537,0.0004924421,0.00080944074,0.001405804,0.00084765133,0.0024055818,0.0023696157,0.0013637572,0.016635753],"category_scores_gemma":[0.003906311,0.00057831797,0.0012082475,0.0027826314,0.0015302867,0.0039301584,0.003097346,0.001488172,0.004546045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009443511,0.000052530686,0.00033753415,0.0003321022,0.000045824072,0.00011109765,0.00046461142,0.015045179,0.003192576,0.7647576,0.014418188,0.2011484],"study_design_scores_gemma":[0.000107673084,0.0001315961,0.00019422304,0.00019109285,0.00010715086,0.0006102492,0.0002761207,0.19720258,0.005709736,0.64117706,0.15422733,0.00006511908],"about_ca_topic_score_codex":0.00210501,"about_ca_topic_score_gemma":0.0029717218,"teacher_disagreement_score":0.016635753,"about_ca_system_score_codex":0.000754374,"about_ca_system_score_gemma":0.0015007771,"threshold_uncertainty_score":0.05565214},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001052808,0.000058189973,0.9960323,0.000121172416,0.000030429048,0.000117340445,0.000050866034,0.0015075092,0.0010294805],"genre_scores_gemma":[0.023239125,0.00008133803,0.97384465,0.00011804405,0.000035434667,0.00023696478,0.00024264347,0.0005584662,0.0016433564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964265,0.0009027517,0.00024753282,0.00082403055,0.0013379909,0.00026115845],"domain_scores_gemma":[0.9896327,0.0065079574,0.0006882658,0.0015765096,0.0013945592,0.00020003293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044658775,0.0020480764,0.0016002998,0.0024842576,0.0016928021,0.0024723678,0.003499936,0.002393642,0.0139441015],"category_scores_gemma":[0.015533844,0.0012842801,0.0015647039,0.0029986298,0.0022842535,0.0048488597,0.0048002214,0.004640057,0.0040254975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030107336,0.0002854401,0.0007662361,0.0004491704,0.00011207841,0.00017429361,0.0003741006,0.08063663,0.010666133,0.10880589,0.01991966,0.77750933],"study_design_scores_gemma":[0.00028951027,0.00015070892,0.00026278786,0.000099036595,0.00008483571,0.0003298123,0.00014086049,0.8073325,0.019158928,0.14850529,0.023524217,0.000121498604],"about_ca_topic_score_codex":0.003718434,"about_ca_topic_score_gemma":0.005126897,"teacher_disagreement_score":0.0139441015,"about_ca_system_score_codex":0.0013911712,"about_ca_system_score_gemma":0.0042332495,"threshold_uncertainty_score":0.04664761},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07472681,0.0030009632,0.9013509,0.00046805205,0.00033077778,0.000088043314,0.00020751193,0.0029368661,0.01689004],"genre_scores_gemma":[0.50922745,0.0017544945,0.47719464,0.00011828175,0.00016525468,0.00015843207,0.00046342495,0.0006620755,0.010255963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964356,0.000060771876,0.000022813503,0.000041329622,0.00013258868,0.00009891455],"domain_scores_gemma":[0.9993586,0.00034497777,0.000039740207,0.00012867762,0.00009662789,0.000031400476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004723731,0.00074778276,0.00068046415,0.0005873529,0.0007003249,0.00078806275,0.0012000061,0.00047829704,0.0044976366],"category_scores_gemma":[0.0017241242,0.00066277036,0.00039916896,0.0014366672,0.0004506918,0.0015418732,0.0006462569,0.0011071659,0.00058644137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080075645,0.00016005448,0.00044521905,0.00035901737,0.000056314602,0.00010985444,0.00015214531,0.3748952,0.031957444,0.091222055,0.022066817,0.47777504],"study_design_scores_gemma":[0.00010386371,0.00011547299,0.00030373418,0.000020368027,0.000027963899,0.000053866006,0.0000353484,0.88688594,0.012652485,0.09209133,0.0076911435,0.00001858542],"about_ca_topic_score_codex":0.0025464708,"about_ca_topic_score_gemma":0.005988669,"teacher_disagreement_score":0.0044976366,"about_ca_system_score_codex":0.0007619921,"about_ca_system_score_gemma":0.001587655,"threshold_uncertainty_score":0.01504612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0133255,0.0069347806,0.9582981,0.000714791,0.0004351131,0.00035817633,0.00041540113,0.0023990108,0.017119167],"genre_scores_gemma":[0.08381645,0.0053699156,0.902855,0.00033900043,0.0002136834,0.00032630574,0.0011609874,0.001374385,0.004544279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909366,0.0035301687,0.0005964581,0.00078867894,0.0036767612,0.00047141666],"domain_scores_gemma":[0.95595986,0.032745916,0.00089393137,0.004794645,0.0051373662,0.00046823404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010351491,0.0020431108,0.0026798858,0.0041777063,0.0013898112,0.004856666,0.0053075156,0.0028446945,0.010268423],"category_scores_gemma":[0.03885174,0.0012286796,0.0020303687,0.011134932,0.0014849593,0.009712942,0.0031507725,0.0039739097,0.0018491396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010733432,0.0005578687,0.0011051818,0.0008618877,0.00031283064,0.00003694635,0.00021339199,0.117136665,0.0011283098,0.07465128,0.012272398,0.79064995],"study_design_scores_gemma":[0.00028840528,0.00028606484,0.001478132,0.00025121853,0.00025511457,0.0001636465,0.00026591422,0.8916582,0.004403667,0.086843096,0.014029545,0.00007703083],"about_ca_topic_score_codex":0.008891818,"about_ca_topic_score_gemma":0.011016625,"teacher_disagreement_score":0.010351491,"about_ca_system_score_codex":0.0023501138,"about_ca_system_score_gemma":0.004623767,"threshold_uncertainty_score":0.0547446},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022350822,0.02163623,0.5900629,0.033782374,0.0019965423,0.00012510705,0.00089799514,0.0012915669,0.32785636],"genre_scores_gemma":[0.25062174,0.025545944,0.5977114,0.0049547325,0.0021360684,0.000330173,0.0023389428,0.0027319195,0.11362906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851245,0.0005105995,0.00012056814,0.00034093307,0.00042866505,0.00008681639],"domain_scores_gemma":[0.9927174,0.0050126044,0.00020133154,0.00081482256,0.0010711872,0.00018267326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001996825,0.0012214012,0.0007154608,0.0010912655,0.0016832544,0.004573341,0.002946943,0.0019706197,0.027534598],"category_scores_gemma":[0.021053346,0.00082717463,0.0008013597,0.0025822253,0.0034066672,0.011859138,0.0027693138,0.0047579133,0.005432802],"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.00005674371,0.000071151924,0.0004563346,0.00045027162,0.00003105008,0.00027234512,0.001901203,0.009845723,0.00060711784,0.6032221,0.09327617,0.28980988],"study_design_scores_gemma":[0.00001709467,0.000015292424,0.00019489328,0.00036455158,0.000012626127,0.00025734646,0.00066987285,0.013096413,0.00075189664,0.77187175,0.21271926,0.000028964154],"about_ca_topic_score_codex":0.0058366256,"about_ca_topic_score_gemma":0.0066940654,"teacher_disagreement_score":0.027534598,"about_ca_system_score_codex":0.0017859463,"about_ca_system_score_gemma":0.0016593839,"threshold_uncertainty_score":0.09211242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014195428,0.0014400221,0.9891487,0.0005553636,0.000065032844,0.000096936,0.00003052345,0.0005759677,0.0066678664],"genre_scores_gemma":[0.07825123,0.001962036,0.9152148,0.0004093364,0.00011421181,0.0004970476,0.00015754874,0.00036729002,0.0030264927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351984,0.003308921,0.00031793717,0.0008045656,0.00184575,0.00020310792],"domain_scores_gemma":[0.99002737,0.0069133234,0.00045655965,0.0015313417,0.00096740737,0.00010397762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007545406,0.0014674957,0.0014327528,0.00160475,0.0007836445,0.004029675,0.0022483296,0.0022287916,0.006780009],"category_scores_gemma":[0.019729288,0.0011261936,0.0011338211,0.0019453955,0.0033783412,0.0037021667,0.002443032,0.0027559444,0.002213039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013477031,0.00008442796,0.00088158034,0.0009591251,0.00011786115,0.00009621785,0.0002924145,0.22792684,0.003921322,0.32921323,0.0071761236,0.42919612],"study_design_scores_gemma":[0.00009527652,0.00015680303,0.00026260893,0.00043288164,0.000054958593,0.0001814792,0.00009207783,0.60389584,0.0051322323,0.32681075,0.06282744,0.00005767658],"about_ca_topic_score_codex":0.0015348968,"about_ca_topic_score_gemma":0.0011806632,"teacher_disagreement_score":0.007545406,"about_ca_system_score_codex":0.0015319276,"about_ca_system_score_gemma":0.0025302542,"threshold_uncertainty_score":0.039904416},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05258165,0.00045267117,0.93763334,0.0012034414,0.000053314736,0.0001252547,0.0006935989,0.00033169493,0.00692505],"genre_scores_gemma":[0.3348526,0.0006321941,0.65761876,0.00017751181,0.00011487265,0.00019163499,0.0013459985,0.00014530214,0.004921087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992399,0.00022520275,0.000045546883,0.00030910768,0.00010396376,0.00007625675],"domain_scores_gemma":[0.99677867,0.0025981662,0.00020787687,0.00015681228,0.00015949391,0.000099058554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014417233,0.00071000564,0.0012587149,0.0010466409,0.00089582853,0.0019118803,0.0025637944,0.0017699088,0.007564433],"category_scores_gemma":[0.007634005,0.00064145244,0.0016633375,0.0012870394,0.0013045782,0.0038422807,0.0010505294,0.0015174024,0.00069067936],"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.00020855866,0.000108298955,0.002258115,0.00056287483,0.00024381651,0.00020023255,0.00037085402,0.76797664,0.0019463123,0.11119421,0.004106991,0.11082308],"study_design_scores_gemma":[0.000027204635,0.00005879766,0.00026738498,0.000038812326,0.00005924972,0.00012426887,0.00021175285,0.7975737,0.001181964,0.19855969,0.0018752026,0.00002197236],"about_ca_topic_score_codex":0.0028979313,"about_ca_topic_score_gemma":0.0036668202,"teacher_disagreement_score":0.007564433,"about_ca_system_score_codex":0.0010552774,"about_ca_system_score_gemma":0.0016287636,"threshold_uncertainty_score":0.02530551},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070868924,0.036514428,0.03433817,0.036141135,0.015331917,0.00081787107,0.037834227,0.019496948,0.74865645],"genre_scores_gemma":[0.15325542,0.015463269,0.04662611,0.0051254462,0.0017207243,0.00036818543,0.120411985,0.0077601746,0.6492687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786973,0.00046374914,0.00009934598,0.00030981927,0.0008205398,0.00043681773],"domain_scores_gemma":[0.99601847,0.000641796,0.00005485579,0.00029769432,0.0013457794,0.0016414496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00337921,0.0024355764,0.0019429409,0.0024645596,0.0037715866,0.007731009,0.0039872224,0.0025354768,0.10035459],"category_scores_gemma":[0.006014963,0.0012350908,0.0013151561,0.0071344716,0.0011101903,0.002063353,0.003431645,0.0032812892,0.04380924],"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.00023096486,0.00012514743,0.0005049109,0.00019480563,0.00004416714,0.000043653825,0.00006475497,0.002765623,0.00032253488,0.0028074973,0.9259867,0.06690921],"study_design_scores_gemma":[0.00053344667,0.00020105139,0.0039778044,0.00026487204,0.00006699729,0.00013080193,0.00052186375,0.01703787,0.0017344222,0.015626175,0.9598448,0.00005979418],"about_ca_topic_score_codex":0.089308105,"about_ca_topic_score_gemma":0.33792704,"teacher_disagreement_score":0.10035459,"about_ca_system_score_codex":0.006209523,"about_ca_system_score_gemma":0.009981299,"threshold_uncertainty_score":0.33571953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034612273,0.00012764893,0.99253404,0.00011787047,0.000048810984,0.00010181178,0.00009445505,0.0008549134,0.0026593024],"genre_scores_gemma":[0.038326964,0.00014108908,0.95573246,0.000108691,0.000047482496,0.00014495113,0.00042468277,0.00054060784,0.004532936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985261,0.00028251618,0.00010218836,0.0004245494,0.0005248523,0.00013985486],"domain_scores_gemma":[0.9969958,0.0013978224,0.00014528933,0.0007354691,0.000637954,0.00008767162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018105308,0.0010896984,0.0014952694,0.0017725283,0.0013587362,0.0021266746,0.0032925757,0.0017214115,0.01283909],"category_scores_gemma":[0.0067735612,0.0010049758,0.0017083489,0.0026573718,0.0013340489,0.0051819496,0.003926753,0.003833749,0.0023722698],"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.0003387447,0.00026343664,0.0007022837,0.0003996633,0.00007877143,0.00014083955,0.0002684798,0.08433839,0.011021832,0.13624926,0.017575575,0.7486228],"study_design_scores_gemma":[0.00022058527,0.00013299816,0.00039303067,0.00009871064,0.000086439206,0.00025834522,0.00019464818,0.7734394,0.014793275,0.18788362,0.022443341,0.000055585082],"about_ca_topic_score_codex":0.0033107703,"about_ca_topic_score_gemma":0.003584093,"teacher_disagreement_score":0.01283909,"about_ca_system_score_codex":0.0010070278,"about_ca_system_score_gemma":0.0021033648,"threshold_uncertainty_score":0.042950988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061550615,0.0004148575,0.9816064,0.00049570797,0.00006463121,0.00006499967,0.00010996509,0.0004227216,0.010665676],"genre_scores_gemma":[0.24992527,0.0010608117,0.73411816,0.00038546557,0.00015673823,0.0003488745,0.0004948442,0.0006048061,0.012905059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989893,0.00057366595,0.00003438728,0.00012875808,0.00019212397,0.00008176708],"domain_scores_gemma":[0.997715,0.0016011731,0.00011034263,0.0003361339,0.00015745733,0.000079834615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161252,0.0007243628,0.0015486386,0.0009004321,0.0007167766,0.002433752,0.0021047636,0.0015611189,0.012203878],"category_scores_gemma":[0.0074149896,0.00067265664,0.001003435,0.0022886044,0.0011446271,0.005630011,0.0022878947,0.0033161622,0.0012135879],"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.00014627581,0.00012317518,0.0001532111,0.0003047054,0.000030614472,0.00007528937,0.00016348761,0.2655383,0.0013555216,0.53532606,0.013182982,0.18360029],"study_design_scores_gemma":[0.000033931887,0.0000322702,0.000033195363,0.000041558793,0.000012311192,0.00004638567,0.000040796313,0.7284434,0.00075472245,0.2669455,0.003603754,0.000012183229],"about_ca_topic_score_codex":0.0023298974,"about_ca_topic_score_gemma":0.0036896667,"teacher_disagreement_score":0.012203878,"about_ca_system_score_codex":0.0011125855,"about_ca_system_score_gemma":0.0013747619,"threshold_uncertainty_score":0.040826023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00989334,0.0006157381,0.9835683,0.00018993717,0.00004498948,0.000059492566,0.000027719592,0.00017210445,0.0054284367],"genre_scores_gemma":[0.335658,0.00087983557,0.65476286,0.0001781244,0.00013776102,0.00041483392,0.00017858144,0.00036194504,0.0074280677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789387,0.0009856154,0.00007115015,0.00020464887,0.00071000116,0.00013481942],"domain_scores_gemma":[0.9947524,0.004026271,0.00031905255,0.0002907379,0.00048929366,0.0001221436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028190813,0.0015840793,0.0023644506,0.001737552,0.00094056915,0.0015771938,0.0025502283,0.0020792205,0.0030876864],"category_scores_gemma":[0.011289655,0.0012848887,0.0015770001,0.0034894648,0.0026512898,0.0019395606,0.002720658,0.0027549672,0.00040129127],"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.000084191335,0.000055807413,0.00022395956,0.0001446575,0.00004456196,0.0000520216,0.0000871094,0.84099466,0.0011749462,0.10699686,0.0015724287,0.048568875],"study_design_scores_gemma":[0.000012946495,0.00002608772,0.000056632045,0.000015986374,0.0000076110914,0.00001882208,0.000006799492,0.9682853,0.0003277455,0.030691648,0.00054312736,0.0000073123424],"about_ca_topic_score_codex":0.0045023873,"about_ca_topic_score_gemma":0.004064478,"teacher_disagreement_score":0.0045023873,"about_ca_system_score_codex":0.0020599116,"about_ca_system_score_gemma":0.0020356935,"threshold_uncertainty_score":0.0149457455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049107052,0.00075603207,0.93839985,0.0022251704,0.00010566157,0.00011165313,0.00052358356,0.00049944065,0.008271545],"genre_scores_gemma":[0.7610474,0.000637847,0.22098835,0.001038406,0.00040761978,0.00053352845,0.0011651954,0.0005149496,0.013666646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904779,0.0042661307,0.00047737337,0.001960224,0.0019632326,0.00085512415],"domain_scores_gemma":[0.9567352,0.0306911,0.0026920482,0.006731767,0.0021001473,0.0010497847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063067214,0.001236654,0.0028206056,0.0017297708,0.0017511486,0.0041812295,0.0043723076,0.0029242618,0.006994152],"category_scores_gemma":[0.03810216,0.0024162948,0.0027503553,0.0035917368,0.004036626,0.009205003,0.0036728282,0.006173352,0.0007063524],"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.00028737105,0.0001544756,0.0011292675,0.000253443,0.00015966869,0.00023016511,0.00025223714,0.14821821,0.0020217758,0.8228202,0.004294078,0.020179017],"study_design_scores_gemma":[0.000045751276,0.000036324396,0.00024589195,0.000016212804,0.00002968655,0.00010524033,0.000034310462,0.2652778,0.00065545645,0.73244756,0.0010797802,0.000025979542],"about_ca_topic_score_codex":0.0027284927,"about_ca_topic_score_gemma":0.0029524276,"teacher_disagreement_score":0.006994152,"about_ca_system_score_codex":0.0020481125,"about_ca_system_score_gemma":0.0019686401,"threshold_uncertainty_score":0.033353508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064266897,0.0004792922,0.9766598,0.00034718917,0.000074263364,0.0002410145,0.0046279593,0.0085696755,0.002574212],"genre_scores_gemma":[0.052708052,0.0005012704,0.93821245,0.0001537614,0.0000340988,0.00028527417,0.0058862413,0.00031790568,0.0019009983],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988452,0.00029264964,0.00020609806,0.0002572646,0.0003347137,0.00006398554],"domain_scores_gemma":[0.9975751,0.0011017234,0.00033396907,0.00054432097,0.0003337812,0.0001111667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011222471,0.0010261661,0.0009653507,0.0028286253,0.00077326,0.0021717222,0.0015474402,0.0015896668,0.0059997695],"category_scores_gemma":[0.0062096757,0.00039238896,0.0013399835,0.0032332698,0.0010497781,0.0050468673,0.0015200849,0.0013090444,0.0034754272],"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.00056405936,0.00014782907,0.0023495257,0.0012246995,0.00011918728,0.0007701377,0.0014481123,0.030962149,0.01572982,0.1032608,0.033859767,0.809564],"study_design_scores_gemma":[0.000075083604,0.0001628321,0.0019739692,0.00049351255,0.00011776575,0.00089854695,0.0007701866,0.49828416,0.026615111,0.33297214,0.13746324,0.0001734521],"about_ca_topic_score_codex":0.0060787005,"about_ca_topic_score_gemma":0.011029018,"teacher_disagreement_score":0.0060787005,"about_ca_system_score_codex":0.0008329755,"about_ca_system_score_gemma":0.0012957958,"threshold_uncertainty_score":0.020071268},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046608006,0.00009167374,0.99034053,0.000254719,0.000022235434,0.00010495722,0.00031202484,0.0009748275,0.0032383113],"genre_scores_gemma":[0.049813177,0.00027472767,0.947096,0.000100695885,0.000020215839,0.0002644488,0.000572846,0.0003606478,0.0014971768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608815,0.0015665008,0.00040414304,0.0005718064,0.0011415713,0.0002278127],"domain_scores_gemma":[0.9914518,0.0064384006,0.00065348187,0.00073436234,0.00057947263,0.00014247822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003952239,0.0012688865,0.00096854696,0.0015740276,0.0012073582,0.0041854563,0.0022779494,0.0015657762,0.0063058916],"category_scores_gemma":[0.013280423,0.0008713366,0.0021451805,0.0020483395,0.001954864,0.004859981,0.0026479128,0.002070152,0.00084086135],"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.00011034821,0.00013740969,0.0014363764,0.0012466696,0.00013596835,0.0011794128,0.0010025218,0.32768407,0.009456337,0.51176625,0.007822309,0.13802242],"study_design_scores_gemma":[0.00006657341,0.00005157343,0.000256128,0.00022924923,0.000052979958,0.00054203277,0.0005840055,0.66308063,0.010795209,0.27272496,0.051539067,0.00007762754],"about_ca_topic_score_codex":0.0049088933,"about_ca_topic_score_gemma":0.008913098,"teacher_disagreement_score":0.0063058916,"about_ca_system_score_codex":0.0011172646,"about_ca_system_score_gemma":0.003356912,"threshold_uncertainty_score":0.021095335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036381178,0.000629939,0.9457648,0.0005391294,0.00026726746,0.00022548756,0.0002511277,0.0017845005,0.014156689],"genre_scores_gemma":[0.36046222,0.0003367338,0.6285427,0.00023071106,0.00015155296,0.00017731369,0.0004992268,0.00068980566,0.008909718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983063,0.00062525243,0.000059878916,0.00023936428,0.00056698034,0.00020223844],"domain_scores_gemma":[0.99444264,0.0034623116,0.00021779527,0.0010466215,0.0006129782,0.00021766903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019681577,0.0006534082,0.001507974,0.0022445545,0.001071719,0.0017353154,0.0030323134,0.001205817,0.011894606],"category_scores_gemma":[0.008732526,0.0007903644,0.0008267053,0.0038876976,0.0012975656,0.0033641544,0.0015581317,0.0021470524,0.00080229953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006126468,0.00044691243,0.0018193468,0.00028285402,0.00009341431,0.00012759033,0.00019932112,0.20822911,0.0043511367,0.19184108,0.016808076,0.5751886],"study_design_scores_gemma":[0.00011210946,0.0001349419,0.0006079983,0.000049119153,0.000068515066,0.00011006477,0.00011031171,0.8051298,0.005356136,0.18052948,0.007748626,0.000042972115],"about_ca_topic_score_codex":0.0045833546,"about_ca_topic_score_gemma":0.0057370183,"teacher_disagreement_score":0.011894606,"about_ca_system_score_codex":0.0016511078,"about_ca_system_score_gemma":0.0022017895,"threshold_uncertainty_score":0.039791465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031497218,0.009927652,0.9561964,0.00087132887,0.00033534016,0.000083781175,0.0005060729,0.00046451113,0.028465232],"genre_scores_gemma":[0.21206631,0.011602263,0.7231316,0.0007971746,0.001178962,0.0012247743,0.0023204172,0.0019390325,0.045739375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976255,0.0009118817,0.00014646407,0.00030820622,0.000894649,0.0001131969],"domain_scores_gemma":[0.9960601,0.0021294341,0.00028577642,0.0006114457,0.0007206264,0.00019255227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002405195,0.0017478974,0.0020183136,0.003473068,0.00085693377,0.0025491065,0.0022388168,0.0015397569,0.013828554],"category_scores_gemma":[0.013937592,0.00069333875,0.0008938454,0.00653349,0.0020620753,0.0063461126,0.0025578728,0.0037637437,0.002009621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027911028,0.000030985808,0.00019544586,0.00030479598,0.000038097136,0.000030723804,0.00010355124,0.03318279,0.000665312,0.7902099,0.022792088,0.15241839],"study_design_scores_gemma":[0.000009731926,0.00003201379,0.00021577296,0.000109793466,0.000019426476,0.000052059586,0.00003354677,0.12708008,0.0004207431,0.84807855,0.02392726,0.000020993555],"about_ca_topic_score_codex":0.0032741015,"about_ca_topic_score_gemma":0.0032628342,"teacher_disagreement_score":0.013828554,"about_ca_system_score_codex":0.0030001937,"about_ca_system_score_gemma":0.0010956727,"threshold_uncertainty_score":0.046261072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000549322,0.00011451256,0.9945629,0.0001191309,0.000030058538,0.000060504997,0.00021410029,0.0027283041,0.0016211391],"genre_scores_gemma":[0.009140021,0.00012371408,0.98816234,0.000131554,0.000024957526,0.00011548964,0.0004426237,0.00034256422,0.0015167954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823135,0.00040251357,0.00020839536,0.00030531865,0.00075893244,0.0000934967],"domain_scores_gemma":[0.99864036,0.000748753,0.00006196619,0.0003360692,0.00016417503,0.000048628077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022833343,0.0012066207,0.0013243165,0.0013410802,0.00071458454,0.0026714965,0.003884589,0.0014102559,0.010503528],"category_scores_gemma":[0.0037237036,0.0014729601,0.0036697865,0.001435433,0.0012785541,0.003241428,0.0024625068,0.004731806,0.003859171],"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.00025174196,0.0002754454,0.0005116683,0.0008819774,0.0002902387,0.00026054808,0.00030574985,0.11418663,0.008301423,0.3211941,0.027993187,0.52554727],"study_design_scores_gemma":[0.00012738044,0.00005850044,0.00016886998,0.00016255626,0.00015445275,0.00019683964,0.000042086973,0.57728213,0.008327509,0.35514426,0.058284532,0.0000508601],"about_ca_topic_score_codex":0.0023655929,"about_ca_topic_score_gemma":0.004870966,"teacher_disagreement_score":0.010503528,"about_ca_system_score_codex":0.00085462205,"about_ca_system_score_gemma":0.0016017077,"threshold_uncertainty_score":0.035137832},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055269366,0.00042002648,0.98449785,0.00013609162,0.00004993875,0.00010964383,0.00019788,0.0015901031,0.0074714147],"genre_scores_gemma":[0.071678184,0.00031166393,0.9236391,0.00011457267,0.000046341807,0.0001952405,0.00051222334,0.00047797657,0.0030246926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.0004314007,0.00007480794,0.00017893847,0.00032280362,0.00022439226],"domain_scores_gemma":[0.9985636,0.0007532633,0.000068578374,0.0004107414,0.00015332938,0.000050492887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015378109,0.0011982642,0.002128346,0.0012368666,0.0008387135,0.0019414314,0.0034171802,0.0021291878,0.011184853],"category_scores_gemma":[0.005299356,0.00091792893,0.0017240668,0.003174481,0.0010097486,0.0029625387,0.0031344348,0.0024437238,0.002438233],"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.00020267119,0.00015200519,0.00034717174,0.0004966285,0.000074240554,0.00016434498,0.00011492726,0.46935156,0.0024647915,0.18828788,0.014773453,0.3235703],"study_design_scores_gemma":[0.00006658238,0.000038611226,0.00011252814,0.00003919518,0.000034479297,0.000075628624,0.000032119733,0.88189185,0.0011500983,0.108885825,0.007655741,0.000017331758],"about_ca_topic_score_codex":0.0031555595,"about_ca_topic_score_gemma":0.0059676194,"teacher_disagreement_score":0.011184853,"about_ca_system_score_codex":0.0013084025,"about_ca_system_score_gemma":0.0017545987,"threshold_uncertainty_score":0.037416995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012792704,0.0023523874,0.92226046,0.00086752395,0.0007762068,0.00024598226,0.00077752187,0.0009037664,0.059023462],"genre_scores_gemma":[0.074845865,0.0022062613,0.88720834,0.00032098262,0.00039048961,0.0005367996,0.002551243,0.0009081404,0.031031907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964605,0.000932518,0.0002759256,0.0006583692,0.0013483516,0.00032435328],"domain_scores_gemma":[0.99290353,0.0043235384,0.0004476956,0.0009060568,0.001189323,0.00022993433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022858123,0.002071906,0.0018969047,0.0035658488,0.0013899601,0.0036382987,0.0046162936,0.0019973277,0.02453661],"category_scores_gemma":[0.021337729,0.0012920875,0.0013744531,0.008242874,0.0013042067,0.0061873114,0.0026593616,0.0036330738,0.004694173],"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.0001481115,0.00012346264,0.0006590994,0.001131762,0.000081577135,0.000096878844,0.00018635583,0.05563673,0.0027540084,0.3722903,0.03880331,0.52808833],"study_design_scores_gemma":[0.000044790188,0.000078802055,0.0004248904,0.00039461162,0.00007772631,0.00025587552,0.00012455539,0.23365271,0.0041521136,0.7218235,0.03891649,0.00005387298],"about_ca_topic_score_codex":0.001615575,"about_ca_topic_score_gemma":0.002782388,"teacher_disagreement_score":0.02453661,"about_ca_system_score_codex":0.0016106425,"about_ca_system_score_gemma":0.0015113637,"threshold_uncertainty_score":0.082083166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045189913,0.0064689065,0.96877444,0.0053626816,0.0004808129,0.000037875347,0.00021380714,0.00013727378,0.014005244],"genre_scores_gemma":[0.2963353,0.028158167,0.60505825,0.001780441,0.0019519589,0.0003948495,0.000905261,0.0005120992,0.064903624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998713,0.00041576102,0.000081958584,0.00024870373,0.0003803801,0.00016019832],"domain_scores_gemma":[0.99833786,0.0007635335,0.0001370322,0.0002562612,0.00038940686,0.000115887524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020167716,0.0012087321,0.0022159913,0.0028426542,0.0013269142,0.0037427277,0.002404956,0.002966454,0.015272089],"category_scores_gemma":[0.0065884767,0.0008395987,0.0015335141,0.005630097,0.0026804681,0.010753835,0.004363946,0.0026809194,0.0032596893],"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.000068085166,0.00003420691,0.0004618028,0.00028375475,0.000057785222,0.00015791191,0.00016971263,0.036999628,0.0006886399,0.88043755,0.020854441,0.059786454],"study_design_scores_gemma":[0.000021459779,0.000034230285,0.00029553287,0.00010555089,0.00008164878,0.00017342457,0.00015563508,0.16100907,0.0010528283,0.8068994,0.030103398,0.00006769432],"about_ca_topic_score_codex":0.0038432046,"about_ca_topic_score_gemma":0.003644082,"teacher_disagreement_score":0.015272089,"about_ca_system_score_codex":0.0017002886,"about_ca_system_score_gemma":0.0016314845,"threshold_uncertainty_score":0.05109018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030319286,0.0003131248,0.9865398,0.00029153615,0.000162658,0.00008957259,0.00019433055,0.001306666,0.008070452],"genre_scores_gemma":[0.10328606,0.00053192157,0.8851456,0.00023970395,0.00034802692,0.00030720577,0.00051907566,0.0011910332,0.008431402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676204,0.0012787542,0.00017900081,0.00057390594,0.0010316917,0.0001746421],"domain_scores_gemma":[0.9941151,0.0032001047,0.0002523714,0.0013639217,0.00095105806,0.00011744072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037859431,0.0011389425,0.0021867508,0.0018297953,0.0014740721,0.0026550286,0.0042480165,0.0013564128,0.011817168],"category_scores_gemma":[0.013969386,0.0012732181,0.0021644745,0.0063114725,0.0020690872,0.0045605125,0.0040079285,0.004714781,0.0016584188],"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.000207073,0.00011114917,0.0003686578,0.00054872234,0.000089344096,0.00021683727,0.00030136158,0.13606194,0.0020350122,0.56740284,0.017720236,0.2749369],"study_design_scores_gemma":[0.000050988885,0.000030715928,0.00012617128,0.000048470352,0.00005809823,0.000118912336,0.000050300834,0.32328644,0.002710511,0.6584938,0.014997363,0.000028209699],"about_ca_topic_score_codex":0.0050319196,"about_ca_topic_score_gemma":0.005800929,"teacher_disagreement_score":0.011817168,"about_ca_system_score_codex":0.001765409,"about_ca_system_score_gemma":0.0024044286,"threshold_uncertainty_score":0.039532304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082835175,0.007856597,0.88847655,0.0021359487,0.00038522645,0.00029884986,0.00023894517,0.0039195525,0.01385315],"genre_scores_gemma":[0.4612482,0.0028410892,0.5271543,0.0011136503,0.00016591417,0.00018919211,0.00041461518,0.00062504417,0.0062479894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963959,0.0011105128,0.00019414604,0.0005969481,0.0013343431,0.00036812312],"domain_scores_gemma":[0.990699,0.0047565475,0.00058250263,0.0024264788,0.0012728488,0.00026267068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029964508,0.0010848591,0.0014526519,0.0011443644,0.0013928083,0.0017544366,0.0040422776,0.0015753829,0.0041456213],"category_scores_gemma":[0.011240119,0.0009769218,0.0015287203,0.0032416913,0.0025691336,0.0030698297,0.0021958922,0.0039893254,0.00075697043],"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.00057436636,0.0005006729,0.0065696775,0.0015924142,0.0003276474,0.0008201448,0.0013147927,0.22403783,0.015139672,0.15391637,0.014547879,0.5806585],"study_design_scores_gemma":[0.00023059873,0.00029690473,0.0020423105,0.0001629315,0.00030927578,0.0014666087,0.00033691427,0.78485715,0.03418275,0.13385019,0.04212702,0.000137292],"about_ca_topic_score_codex":0.007300815,"about_ca_topic_score_gemma":0.006748482,"teacher_disagreement_score":0.007300815,"about_ca_system_score_codex":0.0014769026,"about_ca_system_score_gemma":0.0020728281,"threshold_uncertainty_score":0.015846908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12585524,0.00048628822,0.7981142,0.00066665624,0.00014627578,0.00021130369,0.00039122475,0.00090476085,0.07322398],"genre_scores_gemma":[0.83702093,0.00037766827,0.14614771,0.00026711606,0.00008337806,0.00028324986,0.00048408896,0.00013671607,0.015199094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990402,0.00021814756,0.00006454354,0.00014406837,0.00037504983,0.000157961],"domain_scores_gemma":[0.99927706,0.00016998759,0.00009089552,0.000113452,0.00015405388,0.00019461202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087319757,0.00037771065,0.0005271751,0.0014186408,0.0014592579,0.002281383,0.0010576054,0.00070937193,0.007173081],"category_scores_gemma":[0.0020493465,0.00037891557,0.00083349436,0.0010820518,0.0020082663,0.004544226,0.0025336866,0.0015226911,0.00095540326],"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.000007830966,0.0000099890585,0.000078666446,0.000015890992,0.0000037510733,0.00006567177,0.00013530329,0.0006682275,0.0010395376,0.99565387,0.00021977584,0.0021015184],"study_design_scores_gemma":[0.000018692846,0.000022729055,0.00014848751,0.000018424535,0.000012149106,0.0001616882,0.0002220458,0.018273987,0.0035148351,0.96545225,0.012137369,0.000017373572],"about_ca_topic_score_codex":0.00097210205,"about_ca_topic_score_gemma":0.0010436553,"teacher_disagreement_score":0.007173081,"about_ca_system_score_codex":0.0014932404,"about_ca_system_score_gemma":0.0006969709,"threshold_uncertainty_score":0.023996353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005304051,0.006258497,0.9740073,0.0007225117,0.00018107418,0.00005278381,0.00010712975,0.00017129933,0.013195224],"genre_scores_gemma":[0.40714163,0.018222086,0.5617447,0.0002855695,0.0005906952,0.00031816988,0.00042807433,0.00013314214,0.011136007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988556,0.0003839495,0.000066080655,0.00010376077,0.0005174026,0.00007328608],"domain_scores_gemma":[0.99896955,0.0006449557,0.00008461794,0.000097545606,0.00015685776,0.000046393874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017785837,0.00079547364,0.0011050623,0.00061798794,0.0005691563,0.0022413947,0.0012937671,0.0009630906,0.0029447833],"category_scores_gemma":[0.0030697347,0.00051420566,0.0008542552,0.0023295605,0.0015859476,0.0038924965,0.0015104925,0.0020654534,0.00027613025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111429246,0.000048601254,0.00014947729,0.00040833166,0.000080559315,0.00010644301,0.000439117,0.33316773,0.002708369,0.47701976,0.008457521,0.17730269],"study_design_scores_gemma":[0.00003149136,0.00006681405,0.00022925096,0.00014154479,0.000034481367,0.00009693271,0.00013683633,0.4976724,0.0015727222,0.47728342,0.02268882,0.00004530295],"about_ca_topic_score_codex":0.0049018506,"about_ca_topic_score_gemma":0.003156949,"teacher_disagreement_score":0.0049018506,"about_ca_system_score_codex":0.0013814482,"about_ca_system_score_gemma":0.0018962241,"threshold_uncertainty_score":0.010023117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015370357,0.00069205073,0.94013864,0.000421336,0.0005098074,0.00007345767,0.00019857723,0.00866925,0.033926543],"genre_scores_gemma":[0.38506755,0.0018424094,0.54356194,0.0003254129,0.00038814894,0.00033313732,0.0009193011,0.0026071032,0.064954974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991418,0.00023738496,0.000043498214,0.00010025051,0.00037166255,0.000105403444],"domain_scores_gemma":[0.99724567,0.001489089,0.00009441919,0.00068703707,0.00038141877,0.00010244523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007032295,0.001662499,0.00097145484,0.0010411781,0.0008354835,0.0014272655,0.001711248,0.0014412723,0.045787703],"category_scores_gemma":[0.0042726463,0.0005224016,0.0005919512,0.0012645898,0.0005490156,0.00282715,0.0025301834,0.0015695705,0.0061253523],"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.00054619263,0.0002982991,0.00047916485,0.00047972405,0.000068923284,0.0002777056,0.00056688045,0.098957345,0.060356624,0.054259833,0.033864,0.7498453],"study_design_scores_gemma":[0.00012736702,0.00028035327,0.00056540314,0.00016351644,0.0001163311,0.00050629483,0.00023261194,0.78335696,0.07139438,0.059591398,0.08358444,0.00008087206],"about_ca_topic_score_codex":0.001315728,"about_ca_topic_score_gemma":0.0013634844,"teacher_disagreement_score":0.045787703,"about_ca_system_score_codex":0.000414203,"about_ca_system_score_gemma":0.0004283932,"threshold_uncertainty_score":0.15317512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060819853,0.0009683748,0.9044856,0.001401864,0.00039255345,0.00030599424,0.00090822997,0.0008091742,0.029908445],"genre_scores_gemma":[0.36790508,0.0010901781,0.6063788,0.00026573704,0.00058888824,0.0002959816,0.0012238416,0.000504389,0.02174707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878365,0.0003093805,0.00009132232,0.00028962397,0.0003490974,0.00017693489],"domain_scores_gemma":[0.99785006,0.0012108982,0.0002283918,0.00020650272,0.00019416331,0.00031000527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013207487,0.0013987634,0.0018925655,0.00093229575,0.0012635238,0.002668633,0.00238444,0.0019893309,0.008128752],"category_scores_gemma":[0.0047200443,0.00075039227,0.0017417431,0.0026837282,0.0009247749,0.0035145478,0.0017825791,0.002512173,0.0012461417],"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.0010759899,0.0004160218,0.000672715,0.0011293427,0.0002037981,0.00052393624,0.00048679198,0.4682398,0.029814085,0.26613784,0.018895984,0.21240373],"study_design_scores_gemma":[0.00027634244,0.0006213855,0.00055598293,0.000071046794,0.0001261802,0.0006655393,0.00033858878,0.7382255,0.006179921,0.22724101,0.025633596,0.00006480808],"about_ca_topic_score_codex":0.001832942,"about_ca_topic_score_gemma":0.00148141,"teacher_disagreement_score":0.008128752,"about_ca_system_score_codex":0.00130647,"about_ca_system_score_gemma":0.0015372927,"threshold_uncertainty_score":0.027193427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79303855,0.0015874038,0.050741363,0.009998359,0.000438113,0.00016197511,0.0012299997,0.0012453332,0.14155892],"genre_scores_gemma":[0.9851462,0.00023205453,0.008172149,0.00037872454,0.000027743468,0.000035579316,0.0012434792,0.00021638114,0.004547662],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99523216,0.0026168022,0.00014392234,0.00042509803,0.00093843427,0.00064358907],"domain_scores_gemma":[0.9934457,0.0042651794,0.00042632173,0.00075803173,0.00051973056,0.0005849911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046818736,0.0007251757,0.0010203497,0.0006042626,0.0014194815,0.0050265295,0.0011880661,0.0022698692,0.017788976],"category_scores_gemma":[0.019851536,0.000390578,0.00079229556,0.0013382547,0.0018949917,0.0084071,0.002142349,0.002439559,0.0016770646],"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.0055292677,0.0012122502,0.02033387,0.00086471764,0.00044233486,0.00037444147,0.002569157,0.28996587,0.0072859675,0.23485807,0.044408765,0.3921553],"study_design_scores_gemma":[0.0015344582,0.0036513114,0.026437782,0.00034846755,0.0004925075,0.00058155047,0.008354783,0.49571913,0.009645272,0.3782092,0.074576825,0.00044871718],"about_ca_topic_score_codex":0.010693445,"about_ca_topic_score_gemma":0.016146949,"teacher_disagreement_score":0.017788976,"about_ca_system_score_codex":0.0017069806,"about_ca_system_score_gemma":0.0023560545,"threshold_uncertainty_score":0.059510052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005499438,0.0002846175,0.9930184,0.00047741484,0.000055022818,0.00006057615,0.00012006998,0.00018931662,0.0052447165],"genre_scores_gemma":[0.06786254,0.0015125332,0.92071056,0.00043810633,0.0003493738,0.0008561279,0.0004285786,0.0002793266,0.0075628716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974597,0.00086224894,0.00022355982,0.00043351328,0.000760993,0.00025997282],"domain_scores_gemma":[0.9984316,0.0006507344,0.00017303695,0.00033489813,0.000274911,0.00013470002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034912475,0.0014496938,0.0010003047,0.0019081542,0.0015338201,0.004160497,0.004119766,0.0023416993,0.009343317],"category_scores_gemma":[0.0046033496,0.00085358636,0.0028311266,0.0033565164,0.003567026,0.0046469225,0.0025393157,0.003683591,0.0027507464],"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.0000075651647,0.000010108201,0.00006307826,0.000059412254,0.000011451439,0.000041458843,0.00010693003,0.0356819,0.000354039,0.9563344,0.0012274664,0.0061020753],"study_design_scores_gemma":[0.000022517253,0.00004113361,0.00010954704,0.00006412373,0.000014982026,0.00011677604,0.00007323585,0.16466296,0.0002890699,0.78321046,0.051369276,0.000025861396],"about_ca_topic_score_codex":0.010421771,"about_ca_topic_score_gemma":0.009238135,"teacher_disagreement_score":0.010421771,"about_ca_system_score_codex":0.0030805024,"about_ca_system_score_gemma":0.0045717913,"threshold_uncertainty_score":0.031256557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016221211,0.0013345877,0.9875546,0.00026442445,0.00014651475,0.00008253357,0.00036581093,0.00061171176,0.008017674],"genre_scores_gemma":[0.06989194,0.0024891258,0.9161802,0.00021479095,0.00031834934,0.00037014054,0.0014173012,0.000295268,0.008822841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998626,0.000333583,0.00018494058,0.00022378472,0.0005490253,0.0000825768],"domain_scores_gemma":[0.9982493,0.0010065727,0.00011046101,0.00028787227,0.00026496325,0.00008089018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706551,0.0010161109,0.0011263201,0.0012745077,0.00089120405,0.002907921,0.0028671068,0.00093887653,0.013906471],"category_scores_gemma":[0.0046720114,0.0010962683,0.0020610578,0.0035843584,0.0016835788,0.0060394984,0.0019068433,0.003977195,0.002670056],"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.00007143123,0.000044089207,0.00008153782,0.00030462575,0.000036977788,0.00012399878,0.00021287164,0.019552434,0.0014898718,0.87669337,0.0080650505,0.0933238],"study_design_scores_gemma":[0.0000365435,0.000019553294,0.000068117006,0.000092040216,0.00003291885,0.00011857801,0.00005148488,0.112523936,0.0010071368,0.85348386,0.03254127,0.0000245755],"about_ca_topic_score_codex":0.0032738894,"about_ca_topic_score_gemma":0.0034727147,"teacher_disagreement_score":0.013906471,"about_ca_system_score_codex":0.0015525824,"about_ca_system_score_gemma":0.0010327853,"threshold_uncertainty_score":0.046521783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016375644,0.0013146894,0.9423921,0.0003880829,0.00015537594,0.00012733889,0.00041691342,0.0022544512,0.036575437],"genre_scores_gemma":[0.38121322,0.001981093,0.5818794,0.00022416453,0.00022756749,0.00029790145,0.0012100408,0.0016537473,0.031312954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765956,0.00089947216,0.00015940423,0.00025157977,0.0007989561,0.00023099496],"domain_scores_gemma":[0.9950192,0.0030554668,0.00011427331,0.0013685459,0.00031446884,0.00012808823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022027357,0.0006525441,0.0015035936,0.0010218857,0.0012781054,0.0024852643,0.0025397167,0.000923167,0.010333213],"category_scores_gemma":[0.008359746,0.0008863701,0.00082684006,0.0034618701,0.0020110789,0.0058007035,0.0023243995,0.0032721036,0.0020809171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007587545,0.00016194643,0.0003506441,0.0005942829,0.000043017284,0.0001568431,0.00035095072,0.050676,0.003949533,0.59309256,0.014800071,0.3350654],"study_design_scores_gemma":[0.000093633156,0.00009044633,0.000139689,0.00008633907,0.000046404628,0.00024095089,0.00009132452,0.18347387,0.006040193,0.7928589,0.01679105,0.000047250884],"about_ca_topic_score_codex":0.003506578,"about_ca_topic_score_gemma":0.0053753513,"teacher_disagreement_score":0.010333213,"about_ca_system_score_codex":0.0011871962,"about_ca_system_score_gemma":0.002044712,"threshold_uncertainty_score":0.03456801},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054085705,0.01054842,0.8147202,0.058245067,0.0017090999,0.00011184861,0.00074700016,0.0009565446,0.058876082],"genre_scores_gemma":[0.6832803,0.006119988,0.29009223,0.0036615652,0.001756989,0.00016783453,0.0007910557,0.00074475067,0.013385283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745387,0.0009386215,0.00021039428,0.00049540686,0.0006259034,0.00027584133],"domain_scores_gemma":[0.986286,0.008362919,0.00074911653,0.0031090225,0.0008927306,0.0006002158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003932808,0.00048071748,0.0011514111,0.001005185,0.001563324,0.0040028626,0.0022496681,0.0023767496,0.011284291],"category_scores_gemma":[0.025969971,0.0007785507,0.0012187556,0.001863927,0.0038631728,0.01798595,0.0039253864,0.005457491,0.0015212252],"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.00028706467,0.00006510175,0.0007516935,0.000293309,0.000045058423,0.00017419923,0.00058040244,0.009965823,0.0012705787,0.8720789,0.015425545,0.0990623],"study_design_scores_gemma":[0.000042034186,0.000014459261,0.00023879371,0.00004904406,0.00001808073,0.0000998779,0.00023321336,0.015405764,0.0003597357,0.9683409,0.015185198,0.000013093349],"about_ca_topic_score_codex":0.0031752384,"about_ca_topic_score_gemma":0.0033564782,"teacher_disagreement_score":0.011284291,"about_ca_system_score_codex":0.001259408,"about_ca_system_score_gemma":0.0021064929,"threshold_uncertainty_score":0.037749708},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009585167,0.0001736333,0.98207873,0.00018894202,0.00003530203,0.000054177734,0.000044673,0.00012091932,0.0077184155],"genre_scores_gemma":[0.31497097,0.00043747207,0.67210424,0.00016751267,0.00008720066,0.00032384947,0.00026473586,0.000114247676,0.011529801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.0004311962,0.00005362192,0.00018292207,0.0003297163,0.00007500523],"domain_scores_gemma":[0.99751854,0.0016836735,0.00019297402,0.00022612193,0.0002812574,0.00009747844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013221514,0.0008213863,0.0006972628,0.00054760795,0.0007180921,0.0015177485,0.0015941452,0.0010206437,0.004936952],"category_scores_gemma":[0.0054690256,0.0008937045,0.0007576863,0.0011144249,0.00096115016,0.0023057822,0.0021466366,0.002383222,0.00047186587],"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.00009804707,0.0000663802,0.00032936552,0.00014492546,0.0000890726,0.00020733103,0.0001906325,0.7350479,0.0034248726,0.1778105,0.003367466,0.07922357],"study_design_scores_gemma":[0.00001518918,0.000019222487,0.000049958053,0.000013961309,0.000012300948,0.00004440066,0.00002538777,0.91745526,0.0012847534,0.07823364,0.0028376963,0.000008242823],"about_ca_topic_score_codex":0.0021955308,"about_ca_topic_score_gemma":0.0034668518,"teacher_disagreement_score":0.004936952,"about_ca_system_score_codex":0.0009018677,"about_ca_system_score_gemma":0.00090947445,"threshold_uncertainty_score":0.016515791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011093461,0.0002731471,0.9761838,0.00016525156,0.000030882613,0.00005717628,0.000022776798,0.00013802547,0.012035455],"genre_scores_gemma":[0.48353598,0.0006441215,0.4961666,0.00008936314,0.000049789138,0.0003930032,0.000121388584,0.000104793806,0.01889492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916506,0.00042692243,0.00003509018,0.00016192839,0.00014156522,0.000069367125],"domain_scores_gemma":[0.99878997,0.0008556367,0.00008013272,0.0001376865,0.00007296362,0.00006360159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013119471,0.0007220711,0.0008411334,0.00059953274,0.0009740772,0.0014771369,0.001628431,0.0014061012,0.0047719446],"category_scores_gemma":[0.0030830076,0.0008101341,0.00081964966,0.0009953092,0.0014214937,0.002064522,0.0021704321,0.0012484851,0.00043523975],"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.000066264736,0.000046914454,0.0002213088,0.0000800042,0.000025761261,0.00011083052,0.00015072101,0.8770085,0.00066954637,0.08484648,0.000883663,0.03588998],"study_design_scores_gemma":[0.000014864615,0.00002954141,0.000057357982,0.000016010674,0.000010770834,0.00003262274,0.000044269415,0.93352646,0.00057658146,0.062808804,0.0028754799,0.00000723735],"about_ca_topic_score_codex":0.004234721,"about_ca_topic_score_gemma":0.004429221,"teacher_disagreement_score":0.0047719446,"about_ca_system_score_codex":0.0010896584,"about_ca_system_score_gemma":0.00095822883,"threshold_uncertainty_score":0.015963733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024232745,0.010036871,0.80349976,0.0037515778,0.00075362873,0.00020081371,0.00080992316,0.000875694,0.15583907],"genre_scores_gemma":[0.54153675,0.010654296,0.35667568,0.00153143,0.0019316047,0.0006946488,0.0035586513,0.0013680889,0.08204888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964084,0.0010346369,0.00029563258,0.0007348017,0.0012719006,0.00025456966],"domain_scores_gemma":[0.99473757,0.0029260737,0.00020613303,0.0012902129,0.0006862607,0.00015376614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003386151,0.00085245824,0.0017418467,0.0019847949,0.0021244131,0.0039947517,0.0024657806,0.0014691058,0.008522872],"category_scores_gemma":[0.009412581,0.001877831,0.001926367,0.0054944726,0.0046150256,0.013367042,0.003397936,0.006575615,0.0016298246],"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.00002663283,0.000017198448,0.000106459214,0.00015125987,0.00001659104,0.00004491272,0.00019825117,0.0035997864,0.00039265226,0.9698439,0.005039212,0.020563139],"study_design_scores_gemma":[0.000007529687,0.0000049521714,0.00005641086,0.00001969493,0.000008628769,0.000051959498,0.000027753385,0.0050385185,0.00028679153,0.98470914,0.009782001,0.000006634363],"about_ca_topic_score_codex":0.0019718702,"about_ca_topic_score_gemma":0.001641672,"teacher_disagreement_score":0.008522872,"about_ca_system_score_codex":0.0023983114,"about_ca_system_score_gemma":0.001638105,"threshold_uncertainty_score":0.028511822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03840782,0.00014063301,0.95344466,0.00008497127,0.00003152359,0.0000892719,0.00016787177,0.0011776399,0.006455701],"genre_scores_gemma":[0.24469693,0.00013022305,0.7509599,0.000036109803,0.000011562771,0.00013762561,0.0007709888,0.0002938339,0.002962827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995097,0.00006824661,0.00004263943,0.00017060996,0.00013847889,0.00007033501],"domain_scores_gemma":[0.9993,0.00014582399,0.000058571157,0.00020926546,0.00019944916,0.00008686705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041803106,0.00044073188,0.000850419,0.0018624264,0.0011900017,0.0022696143,0.0017484266,0.0010753784,0.005225014],"category_scores_gemma":[0.001786761,0.0007418091,0.0010784818,0.0012863354,0.0011635171,0.0028284367,0.0024744514,0.0012099526,0.001564035],"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.00026539477,0.00020915057,0.004990312,0.00045922797,0.00007529816,0.0005282114,0.0018713777,0.08760484,0.07551597,0.23471893,0.008486042,0.5852752],"study_design_scores_gemma":[0.00001516576,0.000058108417,0.0014178857,0.000077776196,0.00005021532,0.0002963867,0.0006563246,0.8680304,0.023971982,0.094640836,0.010744258,0.000040646064],"about_ca_topic_score_codex":0.0025168543,"about_ca_topic_score_gemma":0.003576032,"teacher_disagreement_score":0.005225014,"about_ca_system_score_codex":0.00070841017,"about_ca_system_score_gemma":0.0009633932,"threshold_uncertainty_score":0.01747936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011270545,0.000452995,0.9514696,0.00069924805,0.000097019656,0.00008748102,0.00020719231,0.00026234207,0.035453476],"genre_scores_gemma":[0.42577282,0.0016575058,0.5287348,0.00044112667,0.00018374424,0.00043615146,0.0007868899,0.00029725605,0.041689683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982095,0.000629536,0.00009916859,0.0002001498,0.00071513344,0.00014659578],"domain_scores_gemma":[0.9976793,0.001309619,0.00013665948,0.00042159893,0.00031459946,0.0001383052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023055892,0.0006816598,0.00044789957,0.0006660469,0.0006225244,0.002251917,0.0015111731,0.0005324175,0.009979753],"category_scores_gemma":[0.007218999,0.00048093332,0.0008997567,0.0016454285,0.001146617,0.0046194894,0.0026029465,0.0019565774,0.0014075522],"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.000071860144,0.000071383656,0.0002571858,0.00024418137,0.000041501346,0.00014342298,0.0005287671,0.024874689,0.0048567723,0.8167431,0.005733826,0.14643331],"study_design_scores_gemma":[0.000021900878,0.00003620513,0.000126909,0.000060215443,0.00002692182,0.00015802836,0.00029639193,0.07402328,0.0062343194,0.8837797,0.03520484,0.00003121283],"about_ca_topic_score_codex":0.0007742108,"about_ca_topic_score_gemma":0.0010215592,"teacher_disagreement_score":0.009979753,"about_ca_system_score_codex":0.0010029309,"about_ca_system_score_gemma":0.00080068456,"threshold_uncertainty_score":0.033385634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063321586,0.0010380283,0.9628072,0.00092232187,0.00036115406,0.00013244456,0.0006123307,0.003907974,0.023886386],"genre_scores_gemma":[0.11074769,0.0009536268,0.85448873,0.0007113818,0.00034438894,0.00023450294,0.0026715915,0.0025927012,0.027255427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961002,0.0010031081,0.00027743453,0.0008097251,0.0012913347,0.00051826506],"domain_scores_gemma":[0.99553394,0.0015580804,0.000111637484,0.002060574,0.00065126613,0.00008436384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015579329,0.001429883,0.0016859439,0.0019902939,0.002035425,0.0041736676,0.004031321,0.0015205026,0.02573397],"category_scores_gemma":[0.0068422384,0.0014296066,0.002437391,0.0038193893,0.0018027725,0.008513758,0.005658505,0.0056232885,0.010281229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042374694,0.00028011246,0.00046181813,0.0010137294,0.00015708405,0.00039326146,0.0004602037,0.016321914,0.021084458,0.3425202,0.04672917,0.57015437],"study_design_scores_gemma":[0.000083524064,0.00004974828,0.0004123886,0.00014767732,0.0001454237,0.0004162323,0.0002803582,0.073765606,0.05392029,0.7980861,0.072611794,0.00008077554],"about_ca_topic_score_codex":0.0013738007,"about_ca_topic_score_gemma":0.0030298147,"teacher_disagreement_score":0.02573397,"about_ca_system_score_codex":0.0010695542,"about_ca_system_score_gemma":0.0019346745,"threshold_uncertainty_score":0.08608872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011062071,0.000051515035,0.9982053,0.000086451895,0.00000599487,0.00001561153,0.000011854776,0.00007476282,0.00044224298],"genre_scores_gemma":[0.09592257,0.00027884118,0.90235335,0.00013850148,0.000052601677,0.00020866083,0.0001321889,0.000103939776,0.0008092835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978497,0.0011481339,0.00009132067,0.00027120608,0.00052385614,0.00011570908],"domain_scores_gemma":[0.9955415,0.0034774872,0.0002872404,0.0002917799,0.00031202557,0.00009005854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033409328,0.0012277571,0.0010373628,0.0010378279,0.00065905694,0.001231353,0.0018234227,0.0012273998,0.0027174049],"category_scores_gemma":[0.011027686,0.0007256382,0.0008617933,0.0016297464,0.0015718739,0.0024412028,0.0018794951,0.0024286173,0.00068070646],"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.0000848925,0.000113656366,0.0007866214,0.00024985225,0.000089828674,0.00012905413,0.00015176476,0.72116226,0.0022116122,0.13372931,0.0031711394,0.13812003],"study_design_scores_gemma":[0.000011630101,0.000020334504,0.000042875738,0.000012141176,0.000006725006,0.00002224886,0.000009258964,0.9448866,0.00077925745,0.05339215,0.00080932915,0.000007476645],"about_ca_topic_score_codex":0.0019573774,"about_ca_topic_score_gemma":0.0030556256,"teacher_disagreement_score":0.0033409328,"about_ca_system_score_codex":0.0008248664,"about_ca_system_score_gemma":0.0016505065,"threshold_uncertainty_score":0.017668724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049680984,0.0008277965,0.8561333,0.00051499985,0.00030458902,0.00023504526,0.0008376038,0.0029536944,0.13322487],"genre_scores_gemma":[0.14180031,0.0017877837,0.72309756,0.0006760103,0.00011237885,0.0004062043,0.0033218483,0.002036023,0.12676188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.00021507434,0.00005651286,0.00022632648,0.00049777277,0.00013482467],"domain_scores_gemma":[0.99862456,0.00056931906,0.000058693335,0.00035131117,0.00034470073,0.00005138576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075668696,0.0011123155,0.00075393997,0.0013951343,0.0012831943,0.002005385,0.0026451943,0.0012859949,0.029273711],"category_scores_gemma":[0.0030553902,0.00087278656,0.000929071,0.0024654404,0.0013377997,0.0021250157,0.0027018494,0.0020664071,0.006394935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023651459,0.00019864437,0.0003423106,0.00075588556,0.000068616966,0.0003887916,0.00038192823,0.049393333,0.010689298,0.34859866,0.06932122,0.5196248],"study_design_scores_gemma":[0.000092334674,0.000055133238,0.0002442649,0.00028538608,0.000097140466,0.00045492864,0.00014936927,0.24973716,0.026961228,0.5051072,0.2167543,0.00006148932],"about_ca_topic_score_codex":0.005718007,"about_ca_topic_score_gemma":0.010132162,"teacher_disagreement_score":0.029273711,"about_ca_system_score_codex":0.0013560066,"about_ca_system_score_gemma":0.0017520081,"threshold_uncertainty_score":0.09793037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013162617,0.0005737188,0.9801625,0.00043853236,0.00009903692,0.000109296525,0.000046474684,0.00043816952,0.004969581],"genre_scores_gemma":[0.53407115,0.0012623512,0.43697226,0.00047078662,0.0003124708,0.0007626052,0.0003552725,0.00048354993,0.025309563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687696,0.0012719127,0.00018194348,0.00045764234,0.0008634464,0.00034805434],"domain_scores_gemma":[0.99358577,0.0046222988,0.00027558435,0.0005564256,0.00064012007,0.00031987467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047170324,0.000755321,0.0019868163,0.0007646297,0.0018122316,0.0030694737,0.0032167214,0.0017213541,0.0071191364],"category_scores_gemma":[0.011146079,0.0011140413,0.0006672375,0.0030707081,0.0020104914,0.0034340986,0.0033838558,0.0032321403,0.00082765275],"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.00030390063,0.00020290245,0.00049944286,0.0002591576,0.00006904501,0.00010222308,0.0004884207,0.581738,0.0019176417,0.3060938,0.00807472,0.100250766],"study_design_scores_gemma":[0.00005595646,0.000040572533,0.000055721142,0.000014324888,0.000014916452,0.000015548421,0.00005721093,0.907948,0.0005842495,0.088783346,0.002417309,0.000012789612],"about_ca_topic_score_codex":0.006431146,"about_ca_topic_score_gemma":0.011479711,"teacher_disagreement_score":0.0071191364,"about_ca_system_score_codex":0.003008186,"about_ca_system_score_gemma":0.002707747,"threshold_uncertainty_score":0.024946392},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026047563,0.00041852385,0.9711601,0.00016279276,0.000052231804,0.00006511434,0.000040221552,0.0005587168,0.0014947333],"genre_scores_gemma":[0.4543568,0.0004592098,0.5374663,0.00029375093,0.00017494035,0.0004306301,0.00035019833,0.00049832306,0.0059698364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978643,0.0010221141,0.00010413517,0.0003061935,0.0004949193,0.00020836442],"domain_scores_gemma":[0.99332434,0.0052710916,0.0002452487,0.00040132354,0.0005722458,0.0001857215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034118043,0.0007582765,0.0019380235,0.0010986757,0.0007949148,0.001051936,0.0023723543,0.00143945,0.004544338],"category_scores_gemma":[0.009398488,0.0007052251,0.0011772667,0.0016843941,0.0011978801,0.0020529435,0.0023253418,0.002054635,0.00063809945],"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.0004958023,0.00025836044,0.0013966761,0.00025682716,0.00011628931,0.0001336594,0.00021045671,0.76657736,0.0050152666,0.048132386,0.0045935893,0.17281327],"study_design_scores_gemma":[0.000016983086,0.00003002572,0.000065464475,0.00000568167,0.000011016399,0.000010125397,0.0000062162694,0.99311525,0.00043668505,0.0061083185,0.0001907691,0.0000034862928],"about_ca_topic_score_codex":0.002817209,"about_ca_topic_score_gemma":0.0035258855,"teacher_disagreement_score":0.004544338,"about_ca_system_score_codex":0.0010119843,"about_ca_system_score_gemma":0.0014423892,"threshold_uncertainty_score":0.018043518},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01743654,0.0013243993,0.9673701,0.00028587316,0.0008291001,0.00021180949,0.00018322859,0.0013554553,0.011003539],"genre_scores_gemma":[0.10099298,0.00086468615,0.87769026,0.0003670832,0.00037761888,0.0004350696,0.00044139472,0.00061921193,0.018211704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922955,0.0001661197,0.000047842972,0.00015388739,0.0003271838,0.000075376665],"domain_scores_gemma":[0.9991899,0.000423978,0.000037409594,0.00014568324,0.00015302778,0.000049954313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595167,0.0009478005,0.0012075704,0.0013425612,0.0007637056,0.0010074668,0.002093968,0.0013172695,0.010689561],"category_scores_gemma":[0.002272375,0.00042340014,0.0011970224,0.0023113417,0.0007474309,0.0013850762,0.0012961945,0.0020031368,0.0009698462],"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.00036354264,0.00027228892,0.0005140852,0.00054191286,0.00016665096,0.00038192215,0.00029883476,0.07054472,0.029016625,0.07448814,0.014763411,0.80864775],"study_design_scores_gemma":[0.00083134463,0.00085211114,0.0017143508,0.00023187014,0.00040945064,0.0011445988,0.00014031309,0.78591067,0.019760003,0.11537172,0.07348316,0.0001503552],"about_ca_topic_score_codex":0.001033657,"about_ca_topic_score_gemma":0.0014957757,"teacher_disagreement_score":0.010689561,"about_ca_system_score_codex":0.00063968933,"about_ca_system_score_gemma":0.0005375781,"threshold_uncertainty_score":0.035760105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127701145,0.00050465734,0.9799815,0.00028316918,0.00012808637,0.00010123262,0.00009349495,0.0019791361,0.004158665],"genre_scores_gemma":[0.13542499,0.00031058886,0.855445,0.0003979738,0.00016540017,0.00034217187,0.0004669072,0.0006609007,0.0067859357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860126,0.00035697545,0.00007858048,0.00030666697,0.00043045927,0.00022610156],"domain_scores_gemma":[0.9892153,0.008901578,0.00030028517,0.00076459645,0.0006345157,0.00018371212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030065218,0.0018254529,0.0027090078,0.0021103062,0.0013715246,0.0021523251,0.0026762825,0.0027791471,0.012398267],"category_scores_gemma":[0.013841448,0.0014164378,0.0019399797,0.0026356783,0.0013293143,0.0048743696,0.0018956646,0.00355282,0.002022749],"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.0005631709,0.00045586616,0.000938007,0.0005593785,0.00019112151,0.0002481513,0.00027826533,0.47570875,0.0062766033,0.050039455,0.023187602,0.4415536],"study_design_scores_gemma":[0.00007121594,0.000050598584,0.000090008216,0.000023483495,0.00003266077,0.000046298774,0.000023595425,0.975935,0.0013738004,0.020965753,0.0013763037,0.000011296532],"about_ca_topic_score_codex":0.007994773,"about_ca_topic_score_gemma":0.011965172,"teacher_disagreement_score":0.012398267,"about_ca_system_score_codex":0.0015346294,"about_ca_system_score_gemma":0.0017485198,"threshold_uncertainty_score":0.04147637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029199743,0.00028055886,0.97694993,0.0010213287,0.00007786189,0.00012514279,0.000249092,0.00021008441,0.01816598],"genre_scores_gemma":[0.29718214,0.00091188296,0.6907879,0.0004806074,0.00012777344,0.0008377658,0.000804511,0.0001368877,0.008730457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960748,0.0017888021,0.000341476,0.00056564744,0.0010030989,0.00022617375],"domain_scores_gemma":[0.9958947,0.0019484699,0.00042339423,0.0006812743,0.00086154573,0.00019064627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457543,0.0009967672,0.00061509747,0.0028919752,0.0016387088,0.0057973876,0.0022112844,0.0016268169,0.008237999],"category_scores_gemma":[0.008255154,0.00050811126,0.0024430763,0.0026109882,0.00430672,0.008057753,0.0030940175,0.0019172408,0.0014124103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024199071,0.000018753313,0.0003158492,0.00012568852,0.000025762383,0.00014528392,0.0011293836,0.023482304,0.00061730796,0.9596622,0.0010476721,0.013405496],"study_design_scores_gemma":[0.000026405805,0.00006128133,0.000313207,0.00012753916,0.000047263355,0.0002582684,0.00096597034,0.13291909,0.0012748031,0.82095045,0.04299902,0.0000567137],"about_ca_topic_score_codex":0.009063333,"about_ca_topic_score_gemma":0.0038857295,"teacher_disagreement_score":0.009063333,"about_ca_system_score_codex":0.004302075,"about_ca_system_score_gemma":0.0028258103,"threshold_uncertainty_score":0.03121382},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026836911,0.00033403104,0.9652075,0.0011129335,0.0001955821,0.00027835654,0.00026857198,0.0007591799,0.0050068973],"genre_scores_gemma":[0.25570124,0.00039949382,0.73635834,0.00069947715,0.00025625995,0.00023837127,0.0007489031,0.00043854272,0.005159358],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918167,0.0023805844,0.00047724767,0.0017710465,0.0027887113,0.00076585053],"domain_scores_gemma":[0.9602875,0.029291714,0.0028650805,0.003616746,0.0031274771,0.00081147475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006722483,0.0014949178,0.0014739381,0.002528183,0.002368465,0.0024392677,0.0030816833,0.0019111828,0.008887435],"category_scores_gemma":[0.04117874,0.0013451484,0.0021462047,0.0039156512,0.0026244286,0.009113693,0.0052113943,0.0048068436,0.0012474266],"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.00075984997,0.0005532786,0.005891946,0.0016260326,0.00047012934,0.0015174616,0.0010739673,0.14061369,0.018569803,0.3983358,0.017528664,0.4130593],"study_design_scores_gemma":[0.00012974141,0.00015969595,0.0006667113,0.00012306042,0.00016425317,0.0005990544,0.00039546378,0.55195934,0.0183109,0.41288543,0.014508791,0.00009764374],"about_ca_topic_score_codex":0.0035685333,"about_ca_topic_score_gemma":0.0055530784,"teacher_disagreement_score":0.008887435,"about_ca_system_score_codex":0.0015520806,"about_ca_system_score_gemma":0.0029116191,"threshold_uncertainty_score":0.035552323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011179832,0.00011058548,0.97468776,0.00018308782,0.0000747413,0.000108084365,0.00027195222,0.0010520695,0.012331921],"genre_scores_gemma":[0.08542106,0.000254943,0.9000501,0.00011832332,0.000021167076,0.0002592486,0.00089781627,0.0008395951,0.012137789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00021467842,0.00003527205,0.00022522728,0.00033408302,0.00012218553],"domain_scores_gemma":[0.9982174,0.0009703296,0.00011572225,0.0003305233,0.00028935075,0.000076605626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985844,0.0017106174,0.0012900009,0.0011998655,0.0011567974,0.001325153,0.0023568065,0.0011520957,0.016664548],"category_scores_gemma":[0.0047832467,0.001259558,0.0016548494,0.0014812858,0.0014916849,0.003356443,0.0030026766,0.003136438,0.0026072618],"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.00018884387,0.00022829624,0.0004139361,0.0006343822,0.00007673049,0.00024434205,0.00023771336,0.41697288,0.006965329,0.30271277,0.016271817,0.25505295],"study_design_scores_gemma":[0.00005267859,0.00009485656,0.00011590822,0.00009796091,0.000045391524,0.00011525973,0.0000934165,0.5675419,0.004894579,0.40649784,0.020418065,0.000032199474],"about_ca_topic_score_codex":0.0034694194,"about_ca_topic_score_gemma":0.006756471,"teacher_disagreement_score":0.016664548,"about_ca_system_score_codex":0.0009864424,"about_ca_system_score_gemma":0.0017525202,"threshold_uncertainty_score":0.055748403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02071963,0.0011082697,0.9269484,0.0007671882,0.00021266169,0.00012998248,0.0011257111,0.0004207105,0.048567455],"genre_scores_gemma":[0.43781474,0.0031272413,0.5167991,0.0006866054,0.0009673473,0.00049449527,0.0029902433,0.000991097,0.036129147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970688,0.0006927909,0.00025291418,0.0006219923,0.0009674004,0.00039607298],"domain_scores_gemma":[0.9929415,0.0029673832,0.0005130805,0.0026706078,0.0005877428,0.0003197389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860511,0.0010419755,0.0013029191,0.0014697425,0.0012508539,0.0027458235,0.0030466137,0.0012044344,0.010963604],"category_scores_gemma":[0.010093393,0.0008541218,0.002042552,0.003783376,0.0019079471,0.010460524,0.0036663432,0.004237841,0.0009923455],"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.000066270324,0.000035963196,0.00052843377,0.00033010385,0.00006104852,0.00025985428,0.00024764935,0.042241685,0.0024407199,0.90414244,0.008399514,0.04124636],"study_design_scores_gemma":[0.00002116571,0.00003490431,0.00056885305,0.0000930779,0.00006790244,0.0004162374,0.000160647,0.100413665,0.0026323148,0.86426765,0.031281766,0.000041797706],"about_ca_topic_score_codex":0.003348792,"about_ca_topic_score_gemma":0.0049600373,"teacher_disagreement_score":0.010963604,"about_ca_system_score_codex":0.001327119,"about_ca_system_score_gemma":0.0012912374,"threshold_uncertainty_score":0.036676884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23237136,0.0007497664,0.7428677,0.0013947889,0.000129648,0.00010166722,0.00029882797,0.00060447457,0.02148177],"genre_scores_gemma":[0.85289365,0.00044657875,0.13851082,0.00060439506,0.00025905936,0.00028838354,0.00029383812,0.00019704044,0.0065062055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497616,0.0012511524,0.0003383297,0.0013733262,0.0014969006,0.00056420855],"domain_scores_gemma":[0.99158716,0.005503492,0.00072965375,0.001297656,0.00048775604,0.00039428408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033019246,0.00093386753,0.0011030849,0.002350208,0.0016163551,0.005183225,0.0014434205,0.001168576,0.004744477],"category_scores_gemma":[0.010518034,0.0005830114,0.002511111,0.0023555302,0.0054843104,0.009188006,0.0040993295,0.0039832876,0.00043561973],"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.00004226838,0.000021122332,0.0004786158,0.00004587013,0.000014224911,0.00007994034,0.0003641671,0.0019847357,0.0017229044,0.98818666,0.00026236963,0.0067970715],"study_design_scores_gemma":[0.000021530539,0.00004936306,0.00047992662,0.000020962001,0.000029697978,0.00023199049,0.00013365819,0.02170529,0.0039939224,0.9683235,0.004983199,0.000026857178],"about_ca_topic_score_codex":0.00090289087,"about_ca_topic_score_gemma":0.00046421215,"teacher_disagreement_score":0.005183225,"about_ca_system_score_codex":0.0030908994,"about_ca_system_score_gemma":0.00090339215,"threshold_uncertainty_score":0.022426188},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017240867,0.005784296,0.9344922,0.0009922512,0.00032324743,0.0000378512,0.0003514441,0.00034689493,0.055947844],"genre_scores_gemma":[0.11490255,0.014063238,0.766167,0.00043627922,0.0006195293,0.00021916041,0.0011165553,0.0003619958,0.10211374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974996,0.00004071307,0.000013333161,0.000033112217,0.0001514539,0.000011331841],"domain_scores_gemma":[0.99973625,0.00012028016,0.000015613541,0.000042265492,0.000071905626,0.000013756135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048798363,0.0010768146,0.001024607,0.00089979824,0.00046859108,0.0014121776,0.0015552626,0.00074461946,0.00919226],"category_scores_gemma":[0.0010370817,0.0006186945,0.0010381398,0.0022418853,0.00078175263,0.0019919067,0.00063604355,0.0015284133,0.0017311621],"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.00001648884,0.00002948539,0.00012942258,0.00024951613,0.00004313652,0.00006393814,0.00013506434,0.16218513,0.0011503999,0.6439687,0.040735014,0.15129371],"study_design_scores_gemma":[0.000009179073,0.000016561376,0.0001540476,0.00009418698,0.00002790169,0.00010277001,0.00004564656,0.34579712,0.00054723525,0.5489972,0.10418687,0.00002134109],"about_ca_topic_score_codex":0.010251693,"about_ca_topic_score_gemma":0.014925863,"teacher_disagreement_score":0.010251693,"about_ca_system_score_codex":0.0011952234,"about_ca_system_score_gemma":0.0010008072,"threshold_uncertainty_score":0.030751169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023607556,0.00091268605,0.9752734,0.0003281026,0.0001737313,0.000100506164,0.00030778974,0.0003676019,0.020175476],"genre_scores_gemma":[0.0679858,0.002501541,0.9023125,0.00023727576,0.00020484805,0.0003257844,0.0013297853,0.0004595506,0.024642942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986518,0.0003759004,0.000106618216,0.00024950854,0.00048762452,0.00012855338],"domain_scores_gemma":[0.9982311,0.0011309653,0.000093915354,0.00022445571,0.00026030687,0.000059381386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017238994,0.0013629235,0.0008525045,0.001387612,0.0010607783,0.0027739187,0.0026120252,0.0010689894,0.010851759],"category_scores_gemma":[0.0057370095,0.0012166672,0.0015092281,0.003930263,0.0018793815,0.0047813174,0.0024210026,0.0045478535,0.0019756593],"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.00009047612,0.00006817093,0.00019476473,0.00051431626,0.000052038973,0.0001479461,0.00015975017,0.0956003,0.0017665768,0.6742429,0.010864213,0.21629852],"study_design_scores_gemma":[0.000023012843,0.000017494796,0.00009341808,0.00014565149,0.000037843613,0.00009621579,0.00004580344,0.1891241,0.002374421,0.7731342,0.034877416,0.000030450567],"about_ca_topic_score_codex":0.0076670754,"about_ca_topic_score_gemma":0.011969621,"teacher_disagreement_score":0.010851759,"about_ca_system_score_codex":0.0017973619,"about_ca_system_score_gemma":0.0023252754,"threshold_uncertainty_score":0.036302805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002876596,0.0002045712,0.9912553,0.0000667017,0.00016593434,0.000074583055,0.000051808416,0.00056641374,0.0047382135],"genre_scores_gemma":[0.03564023,0.00020917488,0.95568365,0.00013306494,0.000058978883,0.00030410045,0.00016998794,0.00026292715,0.007537948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.00011210401,0.00002446363,0.000098239856,0.0001918923,0.000054514596],"domain_scores_gemma":[0.99951196,0.00025489618,0.000024445877,0.000052177566,0.00012749141,0.00002907752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088699,0.0011480444,0.0011895944,0.001173769,0.0006933573,0.0009730138,0.002181919,0.0015105596,0.0074605374],"category_scores_gemma":[0.0015734116,0.0006574838,0.0013985616,0.0013311489,0.0006425572,0.0008031348,0.0013092059,0.0017263949,0.0012224719],"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.000115419774,0.00020963301,0.0005219505,0.0002753761,0.00016624173,0.00025072263,0.00012875075,0.50719154,0.017344696,0.033917602,0.008772351,0.4311058],"study_design_scores_gemma":[0.000030324487,0.00003401974,0.000110529225,0.000019288602,0.000029918792,0.000070600414,0.000012036645,0.98809516,0.0012802755,0.004918134,0.0053848205,0.00001480414],"about_ca_topic_score_codex":0.00683068,"about_ca_topic_score_gemma":0.010029276,"teacher_disagreement_score":0.0074605374,"about_ca_system_score_codex":0.00066820387,"about_ca_system_score_gemma":0.0013385135,"threshold_uncertainty_score":0.024957955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00677273,0.011739341,0.45326707,0.002265658,0.00075067906,0.00010202047,0.0021731108,0.0021944807,0.52073485],"genre_scores_gemma":[0.2061993,0.01791597,0.4038031,0.0022704024,0.0009962167,0.0004034641,0.0056292713,0.0038437385,0.3589385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993268,0.0001765964,0.000043804648,0.00013267377,0.00022881338,0.00009123284],"domain_scores_gemma":[0.9992768,0.00036464402,0.000025243271,0.0001432486,0.00015332334,0.00003670416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746588,0.0006582403,0.00086210907,0.0014255648,0.0015582355,0.0026701335,0.0011701393,0.0006344969,0.040146016],"category_scores_gemma":[0.0026605572,0.00055980723,0.0013652556,0.0030850659,0.0018048486,0.005330221,0.0016669609,0.0025675334,0.017581636],"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.000017130595,0.000011682074,0.00013050162,0.00017789702,0.000010464255,0.00005491994,0.0003278064,0.0013482529,0.0005395169,0.8803662,0.040207557,0.07680812],"study_design_scores_gemma":[0.0000083151845,0.000007979594,0.00014949053,0.00009678998,0.0000103664515,0.00010364835,0.000050895993,0.0031331184,0.000521339,0.8315794,0.16432689,0.000011771377],"about_ca_topic_score_codex":0.004608323,"about_ca_topic_score_gemma":0.0074838605,"teacher_disagreement_score":0.040146016,"about_ca_system_score_codex":0.0022778648,"about_ca_system_score_gemma":0.001264708,"threshold_uncertainty_score":0.13430184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014208733,0.0020669377,0.95792145,0.0003217525,0.00015128595,0.00016396299,0.00019627882,0.0020858056,0.0228838],"genre_scores_gemma":[0.39317203,0.00210178,0.57532483,0.0005899288,0.00020046698,0.0006457449,0.0008563289,0.0024051876,0.024703672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974661,0.00080058066,0.00020148154,0.00039820612,0.0006798997,0.00045379196],"domain_scores_gemma":[0.9944617,0.0035708176,0.0001947009,0.0011963239,0.00044634176,0.00013011305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027611954,0.0017964373,0.0023502088,0.0020743436,0.0015465106,0.0029913296,0.0046624863,0.0020286457,0.011765723],"category_scores_gemma":[0.012224722,0.0010476969,0.001697669,0.0033860996,0.0025424783,0.00586043,0.004795422,0.003037513,0.0021709516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006443256,0.00018819075,0.0006036266,0.00056980044,0.00013273099,0.00018191987,0.0006938899,0.13927394,0.004399198,0.4681666,0.015183665,0.3699622],"study_design_scores_gemma":[0.00008807928,0.00009050806,0.000247379,0.00016870427,0.00011250019,0.00011292585,0.000119482946,0.5140291,0.0028718247,0.47427747,0.007833874,0.00004814674],"about_ca_topic_score_codex":0.0049143145,"about_ca_topic_score_gemma":0.0062359497,"teacher_disagreement_score":0.011765723,"about_ca_system_score_codex":0.0018978267,"about_ca_system_score_gemma":0.0014742932,"threshold_uncertainty_score":0.039360225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039468568,0.002487466,0.8300396,0.0012694082,0.00071354926,0.0008370632,0.009652562,0.034331404,0.08120041],"genre_scores_gemma":[0.36010063,0.0016252004,0.5356037,0.0008639358,0.0002789601,0.0009980904,0.024825433,0.004700308,0.07100376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855,0.00023346957,0.00015320655,0.00025256144,0.00046374634,0.00034693338],"domain_scores_gemma":[0.99640536,0.00049933325,0.00010185722,0.0021904074,0.0006465711,0.00015646215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009974331,0.0014483533,0.0019168678,0.0018413013,0.0018367252,0.0042176303,0.004385925,0.0015452744,0.056572407],"category_scores_gemma":[0.0055978475,0.0006064178,0.0012734472,0.005051785,0.0009020108,0.006325726,0.0048199245,0.0013284986,0.018483113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021254038,0.00045129808,0.0020267388,0.0009503055,0.00025324267,0.0005602602,0.0002909179,0.039814945,0.010771706,0.26792398,0.19228138,0.48254985],"study_design_scores_gemma":[0.00041958856,0.00019156131,0.0006841999,0.00015805551,0.00017800817,0.00074075634,0.00024056867,0.3778116,0.022890585,0.45577767,0.1407909,0.00011651425],"about_ca_topic_score_codex":0.0073115253,"about_ca_topic_score_gemma":0.011810222,"teacher_disagreement_score":0.056572407,"about_ca_system_score_codex":0.0018910286,"about_ca_system_score_gemma":0.003278983,"threshold_uncertainty_score":0.18925357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010745792,0.00009574399,0.98536646,0.00015550762,0.000056332403,0.00007646258,0.00003155213,0.0003124057,0.0031597994],"genre_scores_gemma":[0.29936576,0.00010949578,0.69363075,0.00017019373,0.00007039009,0.00047968538,0.00015139164,0.00021536596,0.005806989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999047,0.0003254611,0.000056374756,0.00018485663,0.00027265016,0.00011370563],"domain_scores_gemma":[0.9983908,0.0010362193,0.00008171147,0.00022610695,0.00017514732,0.00008996255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015368287,0.0009522022,0.0018091825,0.0006072234,0.00072696054,0.0012379274,0.002898062,0.0018373794,0.0067377994],"category_scores_gemma":[0.004311428,0.00085258903,0.00077425805,0.0013021978,0.00093905994,0.0018062278,0.0027998816,0.0023542126,0.0008555211],"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.00037611712,0.00028506634,0.0002791951,0.00017070257,0.0001061876,0.00009063818,0.000109984845,0.8058292,0.0033893022,0.043763958,0.004230025,0.14136957],"study_design_scores_gemma":[0.000056282683,0.000028597984,0.000025538242,0.0000037184104,0.000007851699,0.000009452739,0.000009327165,0.99151343,0.00027585853,0.0076913643,0.00037387837,0.000004653832],"about_ca_topic_score_codex":0.0023227525,"about_ca_topic_score_gemma":0.003555824,"teacher_disagreement_score":0.0067377994,"about_ca_system_score_codex":0.00068211276,"about_ca_system_score_gemma":0.001545403,"threshold_uncertainty_score":0.022540152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039786953,0.0006059936,0.949498,0.00035480343,0.00012900688,0.0002507706,0.00059287075,0.005509033,0.0032725434],"genre_scores_gemma":[0.375599,0.00036131882,0.61776805,0.00017807273,0.000103931925,0.00035076123,0.0018414978,0.0013376283,0.0024597237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973788,0.00068633637,0.0002453454,0.0007087335,0.00072874536,0.00025200096],"domain_scores_gemma":[0.99371284,0.003840507,0.0003374929,0.0011703711,0.00081736094,0.00012139615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032042633,0.0018927535,0.0023523162,0.0019813275,0.00072213926,0.0037078904,0.0030292948,0.002621527,0.0073176506],"category_scores_gemma":[0.0192435,0.0009656423,0.0016962715,0.001536948,0.0006195852,0.004807902,0.0014878155,0.0029385039,0.0034195387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014176638,0.0004028564,0.010729461,0.0006131057,0.00026855685,0.00034679016,0.0001308939,0.08401558,0.032115035,0.012121383,0.015158552,0.84268016],"study_design_scores_gemma":[0.00009885679,0.00016298325,0.0020594902,0.00008064971,0.0002476652,0.00028455025,0.00008502448,0.9430797,0.027562952,0.022540906,0.003754697,0.000042581523],"about_ca_topic_score_codex":0.0010169714,"about_ca_topic_score_gemma":0.0014221558,"teacher_disagreement_score":0.0073176506,"about_ca_system_score_codex":0.00089878764,"about_ca_system_score_gemma":0.0015756314,"threshold_uncertainty_score":0.024480045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08038018,0.0006094618,0.8890024,0.002982451,0.00005996194,0.00026162167,0.0013058062,0.0007808643,0.024617234],"genre_scores_gemma":[0.7858376,0.0011397554,0.19681336,0.000636924,0.00019270094,0.00089473993,0.002306965,0.00097639736,0.0112016015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941766,0.0016746565,0.00037965176,0.0013449751,0.0016289991,0.0007950897],"domain_scores_gemma":[0.9726121,0.019627336,0.0016588417,0.0046627237,0.00106535,0.0003737304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003085161,0.0012409964,0.0011999484,0.0010860767,0.0013448879,0.0055195587,0.002462726,0.0016256201,0.012424991],"category_scores_gemma":[0.027184166,0.0009909231,0.0028263303,0.002308234,0.0033759838,0.013232855,0.0035347422,0.006266205,0.0007574152],"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.00013088179,0.00010030003,0.001790509,0.00040810186,0.00014820359,0.00030693843,0.0004769495,0.22762498,0.0036068745,0.7268626,0.0036331774,0.03491045],"study_design_scores_gemma":[0.00002787504,0.000027922666,0.0003907525,0.00004129832,0.00006316309,0.00011729116,0.000079198646,0.19321188,0.001999189,0.7991092,0.004905081,0.00002722838],"about_ca_topic_score_codex":0.0046332176,"about_ca_topic_score_gemma":0.003857186,"teacher_disagreement_score":0.012424991,"about_ca_system_score_codex":0.0039410484,"about_ca_system_score_gemma":0.0027663116,"threshold_uncertainty_score":0.041565657},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008732667,0.0007138833,0.9327464,0.00049334555,0.0004486675,0.00021580786,0.00060019625,0.002094717,0.05395432],"genre_scores_gemma":[0.118496895,0.00059535337,0.84753805,0.0006207805,0.00020389745,0.00043403148,0.0013552901,0.0009373748,0.029818403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979424,0.00063193415,0.00011320726,0.00040273665,0.0006717993,0.00023784349],"domain_scores_gemma":[0.9971541,0.0015929323,0.00010257122,0.00056885765,0.00048643,0.0000950894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013529886,0.0011862597,0.0013676358,0.0020974344,0.001355259,0.0017494097,0.0023635982,0.0010362017,0.018665824],"category_scores_gemma":[0.007187895,0.0009533173,0.0018690269,0.0036567857,0.001674428,0.0026760802,0.003128164,0.0035112414,0.0039030972],"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.00017764859,0.00009346009,0.0002780677,0.00035867016,0.00010466444,0.00032083265,0.00018277286,0.06506308,0.0044917976,0.5828128,0.03535059,0.31076556],"study_design_scores_gemma":[0.000067359055,0.000060714883,0.00020959813,0.00010341846,0.000072227616,0.0002472757,0.000061808256,0.34938493,0.003271328,0.6063701,0.040111523,0.000039722214],"about_ca_topic_score_codex":0.006486683,"about_ca_topic_score_gemma":0.012109766,"teacher_disagreement_score":0.018665824,"about_ca_system_score_codex":0.0015396329,"about_ca_system_score_gemma":0.0015192233,"threshold_uncertainty_score":0.062443376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022429248,0.00026959874,0.88546664,0.00035504997,0.00061148714,0.0003146572,0.0006088392,0.07886848,0.011076007],"genre_scores_gemma":[0.32158664,0.0002774782,0.64590853,0.00035929668,0.00026753207,0.00055478443,0.0010606544,0.006254761,0.023730299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.00014770846,0.00007162926,0.00018643559,0.000298697,0.00010813788],"domain_scores_gemma":[0.99835926,0.00061562576,0.000088238485,0.0003764133,0.0002968805,0.00026352392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021950796,0.00060634554,0.0011841429,0.00065085373,0.0013044687,0.0028080922,0.002982303,0.001116557,0.023016647],"category_scores_gemma":[0.004541056,0.0009656772,0.0006794857,0.00062518753,0.00076819997,0.0017800175,0.0017184952,0.001872552,0.0048808777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004599906,0.0012412753,0.007431809,0.0011884755,0.000629944,0.00081014796,0.0013994285,0.23234718,0.05296811,0.17784756,0.0784426,0.4410935],"study_design_scores_gemma":[0.0005687778,0.00014269886,0.0005639308,0.000032460423,0.0001288948,0.00013723345,0.00005803442,0.90587187,0.0153303845,0.030161813,0.046931706,0.00007226634],"about_ca_topic_score_codex":0.0047889883,"about_ca_topic_score_gemma":0.006027512,"teacher_disagreement_score":0.023016647,"about_ca_system_score_codex":0.00087148603,"about_ca_system_score_gemma":0.0027474929,"threshold_uncertainty_score":0.07699841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031409075,0.00014071845,0.99589074,0.0000579215,0.0000047782505,0.00006453746,0.000012785115,0.00011349221,0.0005740149],"genre_scores_gemma":[0.06471937,0.0005375315,0.9336829,0.00005311609,0.000012464486,0.0002683134,0.00007371999,0.00007601341,0.00057663163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974044,0.0011689714,0.00014801392,0.00021361581,0.00095551444,0.000109458],"domain_scores_gemma":[0.99279845,0.0053765634,0.00070123235,0.0007599185,0.00029803993,0.0000658423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026510365,0.0009688349,0.00075415836,0.001097698,0.0005711698,0.0010986039,0.0015444527,0.0010971925,0.002835602],"category_scores_gemma":[0.010208086,0.0007831193,0.001174552,0.0016839635,0.0016309959,0.0017825052,0.0014334216,0.0014339697,0.00040515972],"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.000094394796,0.00015360235,0.0013752508,0.0010614641,0.0002109798,0.000202546,0.00066895183,0.54558736,0.013945382,0.12538671,0.0014037132,0.30990967],"study_design_scores_gemma":[0.000046777488,0.00013366523,0.00038844324,0.00010408628,0.000064554966,0.00026388018,0.00017639805,0.93850654,0.006542505,0.048675843,0.0050699967,0.000027378539],"about_ca_topic_score_codex":0.0022274368,"about_ca_topic_score_gemma":0.0059758388,"teacher_disagreement_score":0.002835602,"about_ca_system_score_codex":0.00076070864,"about_ca_system_score_gemma":0.0021825025,"threshold_uncertainty_score":0.014020205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005587607,0.00027846612,0.9866802,0.00032688983,0.000071896975,0.00010694999,0.00030065895,0.00025219942,0.0063952114],"genre_scores_gemma":[0.13984059,0.00073786394,0.84806716,0.00023379867,0.0001119897,0.00031591323,0.0010913849,0.00025805488,0.009343272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769634,0.00086404075,0.00017812116,0.0003975385,0.0006143724,0.0002494753],"domain_scores_gemma":[0.9937908,0.004529609,0.00033760807,0.0005304224,0.0006520014,0.00015943097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033513138,0.0011003488,0.0010897648,0.0018522941,0.0012350561,0.0031041647,0.002665017,0.0012803113,0.007082284],"category_scores_gemma":[0.013505301,0.0011243252,0.0018130721,0.0037476954,0.0021526273,0.004923106,0.002731693,0.0038777753,0.0007997383],"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.00016801822,0.000114639835,0.00068865035,0.00043790482,0.00010062794,0.00019150668,0.00016418971,0.39780784,0.0012839488,0.4643227,0.0051528956,0.12956704],"study_design_scores_gemma":[0.000027974278,0.000022565338,0.00012000504,0.00006286642,0.00004518203,0.000045523804,0.00003909642,0.57741773,0.0012995453,0.41480768,0.0060901176,0.00002165126],"about_ca_topic_score_codex":0.016544525,"about_ca_topic_score_gemma":0.026771897,"teacher_disagreement_score":0.016544525,"about_ca_system_score_codex":0.0019204079,"about_ca_system_score_gemma":0.0038422227,"threshold_uncertainty_score":0.03289646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044151332,0.0007072809,0.91368103,0.0009110014,0.00014080555,0.00012688202,0.00026926713,0.0004354054,0.039577056],"genre_scores_gemma":[0.51182485,0.0012283348,0.45263624,0.0003598152,0.00020335669,0.00042756548,0.0006029565,0.0006399253,0.03207691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987356,0.0004501046,0.00003406332,0.00026270497,0.00027794897,0.00023950671],"domain_scores_gemma":[0.99712676,0.0022605911,0.00012604524,0.00014930293,0.00013294189,0.00020443929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076265,0.002241655,0.0020222766,0.00116751,0.001171948,0.0024674314,0.003381369,0.0032101062,0.008428697],"category_scores_gemma":[0.0067947377,0.0014324207,0.0016678498,0.0016015078,0.0024747893,0.0038363757,0.0034258298,0.0034714276,0.0009872284],"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.00011480636,0.00006200318,0.00022188867,0.00018444385,0.000044428463,0.00009863467,0.00011617915,0.7943818,0.0011876108,0.17980793,0.0049348017,0.018845424],"study_design_scores_gemma":[0.000014824973,0.000027516668,0.0000778873,0.000024881225,0.000011767391,0.00002975369,0.000025425517,0.85033643,0.00021122533,0.14771502,0.0015134991,0.000011680026],"about_ca_topic_score_codex":0.008860713,"about_ca_topic_score_gemma":0.006590921,"teacher_disagreement_score":0.008860713,"about_ca_system_score_codex":0.0027878867,"about_ca_system_score_gemma":0.0016964105,"threshold_uncertainty_score":0.028196812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003363762,0.00034793225,0.99030906,0.00015449614,0.000094407114,0.000063403095,0.00013284975,0.00080736325,0.004726755],"genre_scores_gemma":[0.02537856,0.00027429292,0.9675913,0.00010698537,0.00012567379,0.00016448452,0.00046639002,0.00059053954,0.0053019244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699247,0.0007751928,0.00017298243,0.00066048955,0.001053453,0.00034540426],"domain_scores_gemma":[0.9929938,0.0037004007,0.00029463042,0.0020801092,0.00077122636,0.00015982047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033434646,0.0023743086,0.0029503116,0.0023214922,0.00142362,0.0028779635,0.005293598,0.0022543224,0.021411443],"category_scores_gemma":[0.01155632,0.001335696,0.0026289031,0.0047396314,0.0017847779,0.007665715,0.0050683473,0.0057256757,0.0035454014],"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.0004282583,0.00022948562,0.0005712742,0.00043768686,0.00013693573,0.00008779881,0.00023763465,0.22462188,0.0039872467,0.19039772,0.024359183,0.55450493],"study_design_scores_gemma":[0.00014936869,0.00006842869,0.00035198202,0.00006800674,0.00009542625,0.000121090336,0.00006141483,0.7947929,0.0033661202,0.18732628,0.013562729,0.000036231606],"about_ca_topic_score_codex":0.0034900017,"about_ca_topic_score_gemma":0.0066830376,"teacher_disagreement_score":0.021411443,"about_ca_system_score_codex":0.002198213,"about_ca_system_score_gemma":0.0021776191,"threshold_uncertainty_score":0.07162845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013138749,0.001486689,0.93672127,0.00072243134,0.00029898618,0.000106348874,0.00048249937,0.0031606546,0.043882348],"genre_scores_gemma":[0.24809358,0.0008210413,0.71962726,0.00046445717,0.00021520967,0.0002923681,0.0015657002,0.0016504499,0.027269978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903935,0.00020065269,0.000044912966,0.00020773904,0.0003752209,0.00013211813],"domain_scores_gemma":[0.99877983,0.0005682631,0.000054286134,0.00035777313,0.00017589916,0.00006398917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297449,0.001352139,0.0017389688,0.00084694166,0.0007330652,0.0015372033,0.00246214,0.00135202,0.02121641],"category_scores_gemma":[0.0039045138,0.00073875795,0.00093074207,0.0020685124,0.00087279617,0.0028037305,0.002868896,0.0025641543,0.004387485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088678737,0.00025545066,0.0003963009,0.0005150672,0.00008683491,0.00009747947,0.000113679336,0.3035362,0.005871612,0.17240134,0.04537639,0.47046292],"study_design_scores_gemma":[0.00014835461,0.000058664224,0.00012267739,0.00004089775,0.000024197125,0.00008695017,0.00003291019,0.8303993,0.0028317,0.15232264,0.013915788,0.000015902555],"about_ca_topic_score_codex":0.002675084,"about_ca_topic_score_gemma":0.0041136,"teacher_disagreement_score":0.02121641,"about_ca_system_score_codex":0.0012922642,"about_ca_system_score_gemma":0.0017578572,"threshold_uncertainty_score":0.07097602},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13227953,0.0023327067,0.8481649,0.0005741373,0.00018485647,0.0006023921,0.0002663495,0.0040062405,0.011588932],"genre_scores_gemma":[0.37292314,0.0012552601,0.6180446,0.00017228801,0.00014664262,0.00018820957,0.0010552703,0.0006848434,0.0055297245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956945,0.00095210044,0.0002213363,0.00037789176,0.0024521868,0.0003019757],"domain_scores_gemma":[0.9910178,0.00426308,0.0002503312,0.0016216133,0.002525812,0.000321397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033417076,0.00072523515,0.0021827724,0.0021369073,0.0016461164,0.0024729595,0.0029087395,0.00131845,0.0062477393],"category_scores_gemma":[0.009633188,0.0005366034,0.0012315618,0.0027470668,0.0008458606,0.004670783,0.0016523713,0.001063361,0.0015685786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00447008,0.0009196595,0.005948908,0.0007672191,0.00036111625,0.00020328622,0.0007606745,0.05637496,0.037440177,0.014770613,0.0058958535,0.8720874],"study_design_scores_gemma":[0.0002098719,0.00094097626,0.0052669668,0.000051755917,0.0005112386,0.00051852036,0.0014150213,0.92048013,0.04760245,0.011705158,0.011198395,0.000099568526],"about_ca_topic_score_codex":0.017295808,"about_ca_topic_score_gemma":0.02282889,"teacher_disagreement_score":0.017295808,"about_ca_system_score_codex":0.0010492041,"about_ca_system_score_gemma":0.002827325,"threshold_uncertainty_score":0.03439027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008244141,0.0021443244,0.9151462,0.0014792057,0.0003084276,0.00004687375,0.00022276776,0.00018963369,0.07221842],"genre_scores_gemma":[0.4635688,0.004449425,0.49262208,0.00088234956,0.0009236852,0.00043003247,0.0006947249,0.00038825267,0.036040667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927765,0.00025548413,0.000049661194,0.00016532166,0.00018111202,0.00007076747],"domain_scores_gemma":[0.99958915,0.00015965922,0.000034837627,0.000095488474,0.00007401535,0.000046908714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918918,0.0005818368,0.00077714084,0.001322443,0.0014018313,0.003132372,0.0017449396,0.0015392811,0.0045779217],"category_scores_gemma":[0.0014025818,0.00056986604,0.001508843,0.0015461065,0.0064764274,0.0069759637,0.0021434298,0.0033403104,0.0007817735],"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.000001081391,9.874116e-7,0.000007689687,0.000005677205,0.0000012488922,0.0000067432047,0.00003705832,0.0004397336,0.00007202403,0.9984225,0.00015083073,0.0008543792],"study_design_scores_gemma":[0.0000030660804,0.000003458206,0.00002777495,0.000007105109,0.0000031179065,0.000019096506,0.000023253782,0.0035153243,0.00007593034,0.9879462,0.008372072,0.0000036311812],"about_ca_topic_score_codex":0.0036396284,"about_ca_topic_score_gemma":0.0021620935,"teacher_disagreement_score":0.0045779217,"about_ca_system_score_codex":0.0017034092,"about_ca_system_score_gemma":0.0010818853,"threshold_uncertainty_score":0.015314698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033725924,0.00014302683,0.9933407,0.00008583816,0.00006364871,0.00005802055,0.0000744777,0.0006752653,0.002186425],"genre_scores_gemma":[0.037384354,0.00024165181,0.9524437,0.00012000741,0.000099174176,0.00013809105,0.00047706816,0.00047196046,0.008624031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.00010556136,0.00006534076,0.0002742823,0.00035390927,0.000119290075],"domain_scores_gemma":[0.9978668,0.0011264548,0.00010433515,0.0003828082,0.00042257187,0.0000970649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219752,0.0014388977,0.0018029381,0.001966257,0.0014932283,0.0021761989,0.0022480215,0.0022439768,0.017422898],"category_scores_gemma":[0.0048323674,0.00094962196,0.00155215,0.0026953865,0.00094230846,0.0040273755,0.0018869415,0.0024633352,0.0033249536],"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.00031717677,0.00018533976,0.0004666107,0.0002246822,0.000063679625,0.000101970174,0.00016524455,0.057427492,0.012465073,0.074817225,0.01628598,0.8374795],"study_design_scores_gemma":[0.00014357474,0.00016462087,0.00040273138,0.0000652441,0.00006230078,0.00022877107,0.00007963544,0.86239433,0.010899137,0.10675069,0.01874712,0.00006182538],"about_ca_topic_score_codex":0.0061751544,"about_ca_topic_score_gemma":0.0058090826,"teacher_disagreement_score":0.017422898,"about_ca_system_score_codex":0.0011637743,"about_ca_system_score_gemma":0.0015783656,"threshold_uncertainty_score":0.058285356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009321463,0.0014711912,0.98231125,0.0006430475,0.00012714183,0.00014016339,0.0005660492,0.0006183827,0.004801196],"genre_scores_gemma":[0.32453385,0.0014392709,0.66815937,0.0003839729,0.00025664188,0.00034436217,0.0018413481,0.0002455381,0.0027955917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99184287,0.0027246233,0.0006591633,0.0012752624,0.0031117124,0.0003863827],"domain_scores_gemma":[0.97612566,0.017293725,0.0012921027,0.0027302473,0.002251873,0.0003063916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076602576,0.00065112486,0.0011900777,0.0023099368,0.0010854148,0.0035827039,0.0034306129,0.0013623203,0.0050513227],"category_scores_gemma":[0.0444269,0.0010282565,0.0017235415,0.0037647465,0.0023728996,0.008190319,0.0028295803,0.0037994373,0.00071554777],"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.0006105449,0.00020326565,0.0018006647,0.00081360125,0.00037070754,0.00036593297,0.0007960191,0.11676097,0.0028009159,0.6327156,0.011033312,0.23172852],"study_design_scores_gemma":[0.00008883126,0.00006502524,0.00040831097,0.00013743885,0.00013100244,0.00020278408,0.00018036009,0.2912311,0.0026788327,0.69606274,0.008770927,0.000042548887],"about_ca_topic_score_codex":0.009119008,"about_ca_topic_score_gemma":0.0077148573,"teacher_disagreement_score":0.009119008,"about_ca_system_score_codex":0.0022446464,"about_ca_system_score_gemma":0.002974256,"threshold_uncertainty_score":0.040511787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032860872,0.0005051455,0.9900411,0.000068431,0.000032199478,0.00007365474,0.00004976221,0.0005014157,0.005442209],"genre_scores_gemma":[0.11451275,0.0009620336,0.86916107,0.00020499135,0.00006250595,0.000651313,0.00031689997,0.0005064221,0.013622023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999405,0.00018111973,0.000029699355,0.000118153956,0.0001972222,0.00006881417],"domain_scores_gemma":[0.9992855,0.00035122366,0.000066216235,0.00014182217,0.00012750081,0.000027728252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091337756,0.0008888663,0.0011138142,0.0010366549,0.00052946684,0.0011536006,0.0015598476,0.0011447862,0.009768832],"category_scores_gemma":[0.0038458745,0.00061660504,0.00061559124,0.0014343734,0.00060218223,0.0016538751,0.0015299413,0.0011972067,0.003843046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019547007,0.00016543655,0.00043879106,0.00062718923,0.00009598045,0.000060967996,0.00014684623,0.33357885,0.011325796,0.15331239,0.016227143,0.4838252],"study_design_scores_gemma":[0.00009234947,0.00014170635,0.00011102057,0.000079087935,0.000043382675,0.00009169952,0.00006078067,0.8941094,0.0072155986,0.07838928,0.019649485,0.000016194635],"about_ca_topic_score_codex":0.00039980226,"about_ca_topic_score_gemma":0.0010188217,"teacher_disagreement_score":0.009768832,"about_ca_system_score_codex":0.0006129196,"about_ca_system_score_gemma":0.0006325578,"threshold_uncertainty_score":0.032680035},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012610483,0.00011991165,0.9653468,0.00011651434,0.000031742926,0.0002533811,0.00022697971,0.017625922,0.003668324],"genre_scores_gemma":[0.113826856,0.00010701888,0.8809207,0.000119879136,0.000018593104,0.00045626127,0.0011018877,0.0016162969,0.00183248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801207,0.0007047055,0.00015300127,0.00038732012,0.0005877692,0.00015510847],"domain_scores_gemma":[0.99614185,0.0021193675,0.000228327,0.0010627902,0.0003541967,0.00009339786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023510007,0.0014275883,0.000887607,0.0010655238,0.00063520187,0.0019031172,0.0035947089,0.0012519856,0.008954324],"category_scores_gemma":[0.010362874,0.001242179,0.0015818591,0.0014439753,0.0012568233,0.0033925392,0.0030954562,0.0021192036,0.002583949],"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.00041529333,0.00032262193,0.0041137086,0.0010723505,0.00031675745,0.00026782145,0.0004484276,0.45847842,0.02023801,0.08478189,0.020269277,0.4092755],"study_design_scores_gemma":[0.00007804243,0.00005167748,0.00019850075,0.000025645892,0.000035832934,0.00006643619,0.000047048623,0.9667627,0.010094717,0.014858673,0.0077653783,0.000015278863],"about_ca_topic_score_codex":0.0021679571,"about_ca_topic_score_gemma":0.004884949,"teacher_disagreement_score":0.008954324,"about_ca_system_score_codex":0.0013995357,"about_ca_system_score_gemma":0.002628358,"threshold_uncertainty_score":0.029955149},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005252688,0.011784977,0.3832783,0.0026252274,0.00066121935,0.000084433916,0.0012539335,0.0004244092,0.5946349],"genre_scores_gemma":[0.28113413,0.036193345,0.2816253,0.0028487043,0.0025692198,0.0007204737,0.0052540475,0.001776209,0.38787854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938726,0.00012785915,0.000035383582,0.00014102139,0.00025702573,0.000051455027],"domain_scores_gemma":[0.99944764,0.0002106663,0.00003669297,0.00012984421,0.00013332517,0.00004179824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000847529,0.0009517246,0.00064577634,0.0014518705,0.0013507683,0.0025105844,0.0010923289,0.000836276,0.027743338],"category_scores_gemma":[0.0027070504,0.00059700356,0.00072621653,0.0030994155,0.0016931093,0.004812531,0.0013945198,0.0025881885,0.0073303035],"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.000016338354,0.000010041817,0.00005686717,0.000082224666,0.000008547358,0.000035568617,0.00007172413,0.0015880782,0.00043631415,0.90478563,0.023975305,0.068933375],"study_design_scores_gemma":[0.0000062374934,0.000006103063,0.00006339603,0.000056747354,0.0000066019556,0.00010942618,0.00002543525,0.0040229503,0.0004986722,0.8375719,0.15762322,0.000009343882],"about_ca_topic_score_codex":0.0016115967,"about_ca_topic_score_gemma":0.0012690508,"teacher_disagreement_score":0.027743338,"about_ca_system_score_codex":0.001211783,"about_ca_system_score_gemma":0.00092028774,"threshold_uncertainty_score":0.09281069},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017120097,0.00091693224,0.9743828,0.00031280585,0.00017988264,0.000049780167,0.0007540767,0.0007477601,0.02094392],"genre_scores_gemma":[0.21395977,0.0061562923,0.6918981,0.00045020023,0.00047882585,0.0004786797,0.00412439,0.00093620527,0.0815175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990252,0.00019285198,0.00009080547,0.00021086121,0.0004057501,0.0000746079],"domain_scores_gemma":[0.99829334,0.00075803004,0.00014251749,0.00045500376,0.000271923,0.00007916845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012283277,0.0011712254,0.00074129284,0.0011335799,0.00054451264,0.0031919824,0.002728324,0.0012709305,0.020108718],"category_scores_gemma":[0.0046949643,0.00078860926,0.0013397799,0.0022010983,0.0016087643,0.0047452473,0.0016073495,0.002259931,0.005182923],"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.00003843457,0.00001275011,0.00007572883,0.00009238925,0.000014607928,0.00008328051,0.00009861983,0.050352868,0.0006774388,0.9116706,0.005266139,0.031617142],"study_design_scores_gemma":[0.000016139738,0.00001791792,0.000035395264,0.000054804426,0.000022323515,0.000108579225,0.00003013259,0.21945733,0.0010345808,0.73082024,0.04838263,0.000019992394],"about_ca_topic_score_codex":0.0039445464,"about_ca_topic_score_gemma":0.0043549617,"teacher_disagreement_score":0.020108718,"about_ca_system_score_codex":0.0016228325,"about_ca_system_score_gemma":0.0015728433,"threshold_uncertainty_score":0.0672704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017275186,0.0004985033,0.9417889,0.00077890395,0.00013968069,0.00008320344,0.0011581632,0.00070747314,0.03756989],"genre_scores_gemma":[0.6061128,0.001141559,0.37071022,0.00020034736,0.00010542914,0.00022452277,0.0010274708,0.0003170176,0.020160647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998354,0.000035509336,0.000010034942,0.00003121331,0.00005124152,0.000036664595],"domain_scores_gemma":[0.99956554,0.00015839019,0.000059384038,0.00006613733,0.0000844755,0.00006615525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039876372,0.00039441505,0.00030706462,0.0010557134,0.00084591814,0.002357845,0.0009782112,0.00067182886,0.012892013],"category_scores_gemma":[0.0012380453,0.00037962876,0.0007601861,0.0014111579,0.0021326644,0.002412025,0.0012513234,0.0011070921,0.0007562803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026775462,0.000009858684,0.00038501716,0.00010126583,0.0000099297085,0.00029158205,0.0011776795,0.039089266,0.0025438291,0.94671065,0.0021508771,0.0075032506],"study_design_scores_gemma":[0.000025658415,0.000029860777,0.00087659515,0.00007067267,0.000027387028,0.00033396925,0.0011162261,0.15325736,0.0011219364,0.78614336,0.056960206,0.000036652018],"about_ca_topic_score_codex":0.014715693,"about_ca_topic_score_gemma":0.012598192,"teacher_disagreement_score":0.014715693,"about_ca_system_score_codex":0.001061491,"about_ca_system_score_gemma":0.00093265285,"threshold_uncertainty_score":0.043128073},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010179466,0.004733677,0.9272511,0.006255805,0.00076919247,0.000812318,0.0051584244,0.0028575629,0.041982364],"genre_scores_gemma":[0.12785856,0.0035553363,0.8343039,0.0019104726,0.00063340657,0.001597027,0.0105663,0.0013079756,0.018267082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.997479,0.00094170356,0.00021459763,0.0006279625,0.00042017858,0.00031641277],"domain_scores_gemma":[0.9881138,0.010121043,0.00030765956,0.00063589064,0.00067201146,0.00014961191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031977862,0.0026098024,0.0019104979,0.001582516,0.0013537393,0.0035204461,0.003106274,0.0028634653,0.03235856],"category_scores_gemma":[0.013788022,0.001001857,0.0036420827,0.0029390194,0.0015343707,0.0042791935,0.0032471532,0.005597086,0.0040822267],"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.000339641,0.00031849652,0.001252768,0.0021136135,0.00035355645,0.00022059082,0.00028006118,0.4168521,0.0008893178,0.20216206,0.07228353,0.30293435],"study_design_scores_gemma":[0.00019238709,0.00007701852,0.00025812408,0.00018883788,0.00005612715,0.00012531971,0.00014518622,0.5722757,0.00043970929,0.40662995,0.01958665,0.000024952848],"about_ca_topic_score_codex":0.006000842,"about_ca_topic_score_gemma":0.009229048,"teacher_disagreement_score":0.03235856,"about_ca_system_score_codex":0.002824416,"about_ca_system_score_gemma":0.0037338077,"threshold_uncertainty_score":0.10825014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010439734,0.33044243,0.007768931,0.01569494,0.0058652675,0.000058325306,0.000403336,0.00049710675,0.63822573],"genre_scores_gemma":[0.011928091,0.1653513,0.005357234,0.0014293226,0.0023653675,0.00008730057,0.000439006,0.00025844137,0.81278396],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990048,0.00018825912,0.0000640531,0.00017922845,0.00048151147,0.00008215079],"domain_scores_gemma":[0.9986827,0.00058102666,0.00008831246,0.00017258797,0.00027874255,0.00019662363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009795784,0.00081975287,0.00084957713,0.0017182506,0.00076725543,0.0058039264,0.0005599233,0.0014653801,0.082067214],"category_scores_gemma":[0.0021581284,0.00036683847,0.00032484162,0.0033401104,0.0016367673,0.004250161,0.0016441012,0.0019133386,0.035154477],"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.00003059259,0.000025545054,0.00017097418,0.00091085094,0.000010155522,0.00007480492,0.000645543,0.00034239292,0.0008511134,0.10498658,0.47870412,0.41324726],"study_design_scores_gemma":[0.0000029292014,0.000014650856,0.00027870093,0.0003353696,0.0000027174108,0.00008231936,0.00008162922,0.000069214686,0.00017110194,0.008848251,0.9901093,0.0000039123024],"about_ca_topic_score_codex":0.0014572685,"about_ca_topic_score_gemma":0.0028980994,"teacher_disagreement_score":0.082067214,"about_ca_system_score_codex":0.001999297,"about_ca_system_score_gemma":0.0020453434,"threshold_uncertainty_score":0.2745422},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035552446,0.00090676843,0.82389104,0.006699802,0.0003361768,0.00006155787,0.00041925546,0.000302705,0.1318302],"genre_scores_gemma":[0.78783137,0.00057414226,0.19447897,0.0011597595,0.00021683706,0.00018847629,0.00026268707,0.00011194414,0.015175715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988171,0.0003353471,0.00006397441,0.00026171235,0.00041292637,0.00010900081],"domain_scores_gemma":[0.9991716,0.00020535832,0.00006587494,0.00029083382,0.00017853771,0.00008779427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643907,0.0003028989,0.000454154,0.0008989191,0.0015895859,0.003019528,0.0014663285,0.0010197345,0.00575161],"category_scores_gemma":[0.0021690403,0.00031366487,0.000816295,0.0011456644,0.0076133306,0.0069483244,0.0024228191,0.0020450854,0.00044559586],"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.0000011986282,0.0000013384779,0.000015577185,0.000005281222,8.716621e-7,0.0000033118422,0.000021728905,0.0002709047,0.000045783887,0.9989095,0.00014591582,0.00057862385],"study_design_scores_gemma":[0.0000042076713,0.0000037662908,0.00003082348,0.0000057845286,0.0000026805137,0.000015265934,0.000027164038,0.0043034856,0.000114387556,0.9904879,0.005000245,0.0000044142475],"about_ca_topic_score_codex":0.0029747568,"about_ca_topic_score_gemma":0.0037582691,"teacher_disagreement_score":0.00575161,"about_ca_system_score_codex":0.0030834943,"about_ca_system_score_gemma":0.0019025357,"threshold_uncertainty_score":0.022372425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017671076,0.00055668043,0.9838139,0.0010399997,0.0000955104,0.00014224372,0.000080145204,0.00028757434,0.012216892],"genre_scores_gemma":[0.035394624,0.0014047899,0.95651436,0.0004874801,0.0001430023,0.0002650768,0.00023020981,0.00011136721,0.005449012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769443,0.0007768099,0.0001886138,0.00027020104,0.0008715769,0.00019836752],"domain_scores_gemma":[0.99687284,0.0021353762,0.00022885745,0.00029391792,0.00037388236,0.00009512887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003011898,0.0011645827,0.0007373604,0.0016615932,0.0012369539,0.004781138,0.002508862,0.0016179666,0.005933836],"category_scores_gemma":[0.006978488,0.00074177445,0.0016944977,0.0031263002,0.0023384243,0.0045126555,0.002561993,0.0023499173,0.0011315779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055412293,0.00013975652,0.00043672524,0.0004803052,0.00008957085,0.00023857738,0.00034060673,0.08184131,0.0010765988,0.7601788,0.009144202,0.14597814],"study_design_scores_gemma":[0.00009151222,0.000040250387,0.00010409753,0.0001537252,0.00005512021,0.00018688086,0.00021677112,0.23080248,0.0029913331,0.68362856,0.08168682,0.0000423928],"about_ca_topic_score_codex":0.0046660416,"about_ca_topic_score_gemma":0.006196427,"teacher_disagreement_score":0.005933836,"about_ca_system_score_codex":0.0016309393,"about_ca_system_score_gemma":0.0024851416,"threshold_uncertainty_score":0.01985073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016051572,0.00045678052,0.97431004,0.0006056806,0.0002523651,0.000092897506,0.00046886396,0.0006766315,0.007085102],"genre_scores_gemma":[0.30980158,0.0006296884,0.6765552,0.0009843362,0.00027646057,0.00039318364,0.0009669062,0.00077056285,0.009622007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922565,0.0018714648,0.00060032686,0.0018952811,0.0025175747,0.000858825],"domain_scores_gemma":[0.98145294,0.008934176,0.0016617201,0.0046399115,0.0025846583,0.00072665676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033608146,0.001003467,0.0013444985,0.001096636,0.0016150036,0.0025952219,0.0039790315,0.0019402254,0.007190499],"category_scores_gemma":[0.0180649,0.00075856847,0.0011590039,0.0018156344,0.00228391,0.006567568,0.0039135814,0.004945207,0.0017216565],"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.0007175521,0.0004417204,0.005054868,0.0008632714,0.0001879879,0.001047899,0.00078047626,0.18681377,0.03895848,0.5287186,0.017095959,0.2193195],"study_design_scores_gemma":[0.00015203864,0.00040476918,0.0019712949,0.0001773223,0.00012727143,0.0013854945,0.00021223816,0.51996726,0.05921041,0.2747688,0.14140089,0.00022221991],"about_ca_topic_score_codex":0.0030814311,"about_ca_topic_score_gemma":0.0030010326,"teacher_disagreement_score":0.007190499,"about_ca_system_score_codex":0.00083292543,"about_ca_system_score_gemma":0.0025022798,"threshold_uncertainty_score":0.024054587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011678531,0.0005872667,0.96734357,0.0010855694,0.00015811707,0.00028523436,0.0013949093,0.00026825943,0.01719866],"genre_scores_gemma":[0.36687016,0.0016161539,0.6079632,0.00044175325,0.00020436382,0.0009856331,0.0019427526,0.0003382356,0.019637644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987692,0.0004630358,0.00006481566,0.00020565712,0.00032089307,0.00017645309],"domain_scores_gemma":[0.99827874,0.0010624552,0.00019815819,0.0000977045,0.00023684672,0.00012617785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018196668,0.0010204677,0.0008971825,0.001011036,0.00077279954,0.0023670709,0.003432348,0.0014869416,0.0071311994],"category_scores_gemma":[0.0042697443,0.0007597708,0.0019303068,0.0020533146,0.0007352715,0.0018443571,0.0010775651,0.002145055,0.00084033347],"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.000046810277,0.00006316673,0.00030963597,0.00014271447,0.000036217985,0.00014444854,0.000060816987,0.9213902,0.0005215223,0.06383476,0.003657901,0.009791809],"study_design_scores_gemma":[0.000011997034,0.000016883812,0.000071488954,0.000019092824,0.000010916478,0.000033312863,0.00002847186,0.9801165,0.00013928892,0.016675536,0.002868297,0.0000081937205],"about_ca_topic_score_codex":0.044678174,"about_ca_topic_score_gemma":0.051695153,"teacher_disagreement_score":0.044678174,"about_ca_system_score_codex":0.0026688245,"about_ca_system_score_gemma":0.0049968455,"threshold_uncertainty_score":0.08883625},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01592977,0.0005481013,0.9544378,0.00048205408,0.00019428198,0.00018505697,0.00038110098,0.0039639287,0.023877844],"genre_scores_gemma":[0.21201682,0.0011303279,0.74634606,0.00026382023,0.0003294644,0.0003956258,0.002148253,0.0022307702,0.035138857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971522,0.0006104488,0.00020195651,0.0003322024,0.0013602974,0.00034285814],"domain_scores_gemma":[0.99394906,0.0032393949,0.00027245097,0.001400512,0.00071225304,0.00042638605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031484729,0.000993795,0.0009902022,0.0015814623,0.0017288062,0.0037418138,0.0028487649,0.0009301216,0.012764978],"category_scores_gemma":[0.009487559,0.0010753998,0.0015944208,0.0032190015,0.0016720019,0.009891808,0.0069336,0.003615534,0.0025243724],"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.00020188544,0.00021135551,0.00097444456,0.00056827575,0.00007964877,0.0007479389,0.00070420327,0.04514836,0.0076139746,0.66373867,0.026434423,0.25357676],"study_design_scores_gemma":[0.00004315671,0.000054381955,0.00030448096,0.000099384655,0.00010405217,0.0006056026,0.00024525024,0.19878061,0.012555494,0.6983109,0.08883322,0.00006346778],"about_ca_topic_score_codex":0.0016111479,"about_ca_topic_score_gemma":0.0038964287,"teacher_disagreement_score":0.012764978,"about_ca_system_score_codex":0.0009213028,"about_ca_system_score_gemma":0.0020910117,"threshold_uncertainty_score":0.04270315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24813527,0.00256782,0.6726429,0.009319089,0.00022077496,0.00066858134,0.00037909203,0.001639614,0.06442678],"genre_scores_gemma":[0.5363581,0.00053329545,0.45586914,0.0005126872,0.000063810396,0.00027817968,0.00016823267,0.00018565379,0.0060309186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99216753,0.005305996,0.0002718628,0.00059301464,0.00135034,0.00031114428],"domain_scores_gemma":[0.97792196,0.018406123,0.00034467093,0.0022091665,0.00083571253,0.00028222072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006719293,0.0006805187,0.0006157532,0.0009742898,0.0021211808,0.0028826445,0.0021519247,0.0035532198,0.0044714673],"category_scores_gemma":[0.0275412,0.00051192427,0.0012226601,0.001424001,0.0027541432,0.0047711744,0.0025943716,0.0037783503,0.0005871447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001753138,0.0016007238,0.008795504,0.0013433656,0.00016159739,0.006463591,0.00682954,0.08827799,0.017475922,0.52834654,0.009055737,0.3298963],"study_design_scores_gemma":[0.0007842631,0.0010280687,0.0037881942,0.0004998659,0.0001691359,0.006889084,0.0038435308,0.49352416,0.05072963,0.28806078,0.1505236,0.00015971174],"about_ca_topic_score_codex":0.003349701,"about_ca_topic_score_gemma":0.0045979647,"teacher_disagreement_score":0.006719293,"about_ca_system_score_codex":0.0023300247,"about_ca_system_score_gemma":0.0013324452,"threshold_uncertainty_score":0.035535455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009540078,0.00011633587,0.95379686,0.00016556325,0.00006132739,0.00044971742,0.0011053851,0.02766929,0.007095404],"genre_scores_gemma":[0.20807427,0.00029717552,0.7693958,0.00031356394,0.000088684516,0.0013949386,0.003663636,0.001564945,0.015206962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989938,0.00030877464,0.00011439654,0.00015449242,0.00035506173,0.000073466275],"domain_scores_gemma":[0.99849296,0.0005164454,0.00008675337,0.0004083222,0.00034906305,0.00014637348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448245,0.0007424598,0.00080636906,0.0011128082,0.00072441454,0.0017276084,0.0014952373,0.0011525535,0.024486903],"category_scores_gemma":[0.0041462635,0.00041187147,0.00082027947,0.0014804461,0.00033220183,0.0019881886,0.0020777055,0.0012870646,0.005780148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030202381,0.0013395255,0.003191439,0.0010613813,0.00034227764,0.0010102006,0.0010392813,0.042457826,0.058980986,0.06809435,0.08551017,0.7339523],"study_design_scores_gemma":[0.0003135995,0.00044503642,0.0025832956,0.00007018128,0.00015222524,0.00090003724,0.00017895903,0.8101132,0.026033228,0.03637667,0.12259294,0.00024066302],"about_ca_topic_score_codex":0.0019987891,"about_ca_topic_score_gemma":0.0029522663,"teacher_disagreement_score":0.024486903,"about_ca_system_score_codex":0.00052914576,"about_ca_system_score_gemma":0.0010363533,"threshold_uncertainty_score":0.08191687},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1871282,0.0012832714,0.15272292,0.004557761,0.0008122608,0.00014266501,0.0003083081,0.00041762684,0.65262705],"genre_scores_gemma":[0.8519806,0.0016881711,0.05521512,0.0017848691,0.00092930114,0.00020274954,0.00063175906,0.00037269696,0.08719468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979512,0.0008920282,0.00011563404,0.0003405082,0.0004424535,0.0002581735],"domain_scores_gemma":[0.9943258,0.0036750392,0.00043150777,0.0007603127,0.00045184765,0.00035555928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015258763,0.0007736156,0.0008954957,0.0023875409,0.0045371694,0.0042207614,0.0020619447,0.0018027056,0.03578403],"category_scores_gemma":[0.011816455,0.00053159805,0.00081927096,0.0041495864,0.0033940196,0.00916462,0.0034229076,0.0040319646,0.0032949788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021605745,0.000024374189,0.00011168457,0.000035645095,0.0000019884517,0.00004187033,0.00016039246,0.00047928616,0.00013148857,0.9903458,0.0013467962,0.007299078],"study_design_scores_gemma":[0.000006528434,0.000013087143,0.00010448285,0.000019270878,0.0000028830625,0.000087668035,0.00019595225,0.0019555546,0.00032602833,0.9905758,0.006707148,0.000005567502],"about_ca_topic_score_codex":0.0005701491,"about_ca_topic_score_gemma":0.00064441207,"teacher_disagreement_score":0.03578403,"about_ca_system_score_codex":0.0013697703,"about_ca_system_score_gemma":0.0007756146,"threshold_uncertainty_score":0.11970955},"labels":[],"label_agreement":null},{"id":"W1972237262","doi":"10.1007/s10601-012-9136-9","title":"Using dual presolving reductions to reformulate cumulative constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Solver; Computer science; Constraint programming; Dual (grammatical number); Benchmark (surveying); Integer programming; Scheduling (production processes); Variable (mathematics); Linear programming; Domain (mathematical analysis); Constraint (computer-aided design); State variable; Computational complexity theory; Mathematics; Algorithm; Stochastic programming","score_opus":0.044537481272602576,"score_gpt":0.2950699864660795,"score_spread":0.2505325051934769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972237262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051187747,0.00015786993,0.9818133,0.00024343435,0.00012399025,0.000040167266,0.000101053905,0.00016167475,0.0122398315],"genre_scores_gemma":[0.22729295,0.0005940901,0.74522036,0.0004456277,0.00031687008,0.00027669905,0.00079181115,0.0007322833,0.024329321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891484,0.0003412597,0.000052363725,0.00018363795,0.0003817137,0.00012616006],"domain_scores_gemma":[0.99820995,0.000997557,0.0000953821,0.0002937244,0.00033409367,0.0000692139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014421977,0.0012554337,0.0008888296,0.0015271053,0.0009008757,0.002217495,0.0019419333,0.00075993594,0.00973809],"category_scores_gemma":[0.0068850066,0.00076109805,0.0017348547,0.0017443257,0.0015484623,0.003122719,0.0026274733,0.0056710136,0.0013537478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054059547,0.00010504001,0.00021381825,0.00016654943,0.000043065273,0.0001259985,0.000150752,0.114561446,0.0018878413,0.7965779,0.008062835,0.07805069],"study_design_scores_gemma":[0.000023518822,0.000023671744,0.00008350863,0.00005369309,0.000030743795,0.000058466398,0.00005258181,0.3819958,0.0023249765,0.602511,0.01281803,0.00002403251],"about_ca_topic_score_codex":0.0036239298,"about_ca_topic_score_gemma":0.0065627913,"teacher_disagreement_score":0.00973809,"about_ca_system_score_codex":0.0013824721,"about_ca_system_score_gemma":0.0015372225,"threshold_uncertainty_score":0.032577157},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09493224,0.00031998538,0.89239496,0.00034088912,0.00012048577,0.00018362075,0.00020659591,0.008342129,0.0031591244],"genre_scores_gemma":[0.6451348,0.00014202055,0.34898221,0.00046792513,0.000083205094,0.00047429794,0.00063514285,0.0008331717,0.0032472005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980799,0.0005682027,0.00016124934,0.0004494403,0.0006128147,0.00012832585],"domain_scores_gemma":[0.9939203,0.002450452,0.0005178914,0.0017806859,0.0010505276,0.00028010178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022455982,0.00080780376,0.0011454849,0.0008748019,0.00094210915,0.0013048601,0.002910423,0.0016076925,0.0021589233],"category_scores_gemma":[0.010678947,0.00055199227,0.00064235023,0.0011475065,0.0014924208,0.0020977056,0.002266826,0.0015765798,0.001227166],"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.0014545311,0.0005961226,0.007939604,0.00040944736,0.00026012745,0.00032734676,0.00049102766,0.5653886,0.07683033,0.06847987,0.010905788,0.26691705],"study_design_scores_gemma":[0.00007475991,0.00015900681,0.00046768057,0.000012977233,0.000030486335,0.0001285273,0.000024079722,0.968008,0.013314488,0.0145449955,0.003198041,0.000036935708],"about_ca_topic_score_codex":0.0008372128,"about_ca_topic_score_gemma":0.0016729534,"teacher_disagreement_score":0.002910423,"about_ca_system_score_codex":0.00070154865,"about_ca_system_score_gemma":0.0010140791,"threshold_uncertainty_score":0.011876047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007930325,0.00019924926,0.9964228,0.00008115156,0.000024660649,0.000033510092,0.000017456394,0.00006333429,0.0023647258],"genre_scores_gemma":[0.099396326,0.0008130479,0.8916273,0.00017717585,0.00010747878,0.00083620945,0.00012727927,0.00023897435,0.0066762217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987198,0.0005089685,0.00006982341,0.00014855951,0.0004870707,0.00006584824],"domain_scores_gemma":[0.9978137,0.0011947886,0.00012988201,0.00031926896,0.00044723463,0.00009502172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025798746,0.00067863695,0.0013521687,0.0011087396,0.0009991095,0.0016983504,0.003134897,0.0013826414,0.0047158306],"category_scores_gemma":[0.009092733,0.0007621446,0.0009458894,0.0012478937,0.0019920147,0.0025080733,0.0024517647,0.0022191785,0.0011014133],"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.000029994952,0.00003608626,0.00018295589,0.000119469085,0.00003177957,0.00004121636,0.00011107414,0.18187612,0.0012973436,0.77220875,0.0027749238,0.041290242],"study_design_scores_gemma":[0.000031127733,0.000048153448,0.000075327436,0.000040480998,0.000013579339,0.00006387216,0.00002751074,0.7095341,0.00065653183,0.27567774,0.013814975,0.000016533266],"about_ca_topic_score_codex":0.0022362766,"about_ca_topic_score_gemma":0.0031257947,"teacher_disagreement_score":0.0047158306,"about_ca_system_score_codex":0.0011168991,"about_ca_system_score_gemma":0.0015278509,"threshold_uncertainty_score":0.015776038},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47768784,0.0012885797,0.44872278,0.0040610447,0.00029522914,0.00041872676,0.020393506,0.0070776115,0.04005467],"genre_scores_gemma":[0.6097418,0.0004261039,0.33800554,0.0005007643,0.00017491022,0.00016139582,0.037985727,0.0014090525,0.011594636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987018,0.00033499452,0.00009804625,0.00038014774,0.00025040135,0.00023457529],"domain_scores_gemma":[0.9907222,0.0074867867,0.0003446793,0.0005678643,0.00061237445,0.0002661666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012465157,0.0011600975,0.0010274452,0.0015009107,0.0011348315,0.0028166827,0.0024739571,0.0018853659,0.030571435],"category_scores_gemma":[0.013156209,0.0008065627,0.001354937,0.0026599106,0.00091674906,0.003961013,0.0013587995,0.0018477663,0.0029237056],"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.0023871108,0.0009841317,0.01442115,0.00291465,0.00046046768,0.0012686086,0.00052053295,0.46478057,0.009112928,0.12129791,0.08904548,0.2928064],"study_design_scores_gemma":[0.00027773596,0.00017902438,0.0026523888,0.00007478798,0.00010226889,0.00027412642,0.0004456165,0.82764614,0.007558046,0.15454683,0.006208852,0.000034244127],"about_ca_topic_score_codex":0.0066242856,"about_ca_topic_score_gemma":0.017611805,"teacher_disagreement_score":0.030571435,"about_ca_system_score_codex":0.0014280989,"about_ca_system_score_gemma":0.0020093208,"threshold_uncertainty_score":0.10227162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14427109,0.010865338,0.83012974,0.0046193097,0.00031021822,0.000806206,0.00031565837,0.00042004118,0.00826235],"genre_scores_gemma":[0.62186116,0.0011628241,0.37290654,0.000664536,0.00022325669,0.0010799681,0.00045730599,0.00033083215,0.0013135559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.6250473,0.34257764,0.009535678,0.005246369,0.01632258,0.0012704576],"domain_scores_gemma":[0.11286261,0.86601686,0.0049749184,0.010236404,0.0047664824,0.0011427013],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.28266767,0.0026849268,0.0043227524,0.0052337795,0.0016766886,0.0074362596,0.0056075654,0.00844013,0.00410611],"category_scores_gemma":[0.6881793,0.0027062949,0.003018905,0.0043036873,0.0066814325,0.012280306,0.0056917276,0.006778096,0.0005169469],"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.006226404,0.0008949479,0.018868035,0.0018651506,0.0022299534,0.00021500504,0.001353239,0.5641229,0.00084860704,0.2096616,0.0035534326,0.19016074],"study_design_scores_gemma":[0.0009861911,0.0018458259,0.0026032294,0.00042617435,0.00048018014,0.00027290263,0.00022081702,0.8165006,0.00080910715,0.17393939,0.0017908405,0.00012474235],"about_ca_topic_score_codex":0.0016523352,"about_ca_topic_score_gemma":0.0018069234,"teacher_disagreement_score":0.28266767,"about_ca_system_score_codex":0.0049952595,"about_ca_system_score_gemma":0.0040750774,"threshold_uncertainty_score":0.8845985},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2445962,0.0016622647,0.5652032,0.0057312343,0.0008117607,0.00022656092,0.0010247657,0.00033592377,0.18040815],"genre_scores_gemma":[0.8709585,0.00066575495,0.084974654,0.000850195,0.0005936028,0.00019127024,0.00062974973,0.00012326628,0.04101308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983317,0.00042055384,0.00013541023,0.00031681434,0.0005075006,0.00028804326],"domain_scores_gemma":[0.99765766,0.0009872467,0.00022004706,0.00020314958,0.00042311757,0.0005087133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127945,0.00064971554,0.00093606295,0.002203545,0.0032771057,0.005811746,0.0014287274,0.0011463746,0.010666662],"category_scores_gemma":[0.003931146,0.0007947239,0.0017232759,0.0019682054,0.0042203106,0.008446733,0.0033305176,0.005440743,0.00094850064],"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.000010986957,0.000014038467,0.000039121795,0.000009029449,0.000003665759,0.00001864213,0.000067164074,0.00011279307,0.00012513876,0.9985769,0.00021006264,0.0008124324],"study_design_scores_gemma":[0.000015764854,0.000005936079,0.000037790374,0.000005225339,0.0000056218178,0.000047730617,0.000055076933,0.0015949013,0.00022075001,0.99652547,0.0014782738,0.000007357],"about_ca_topic_score_codex":0.0011808284,"about_ca_topic_score_gemma":0.0013865444,"teacher_disagreement_score":0.010666662,"about_ca_system_score_codex":0.0022819955,"about_ca_system_score_gemma":0.0012584943,"threshold_uncertainty_score":0.035683572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7444499,0.012912606,0.1803985,0.02128839,0.001313579,0.000517686,0.008749088,0.0047720587,0.025598215],"genre_scores_gemma":[0.9007234,0.0014765648,0.08411177,0.001230419,0.0006298213,0.00027848486,0.006553142,0.0012521682,0.0037442045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9833129,0.008427324,0.0013207631,0.0025697632,0.0028639182,0.0015053733],"domain_scores_gemma":[0.6414585,0.33585054,0.0045484044,0.011756404,0.0036900798,0.0026960769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014400963,0.0019076169,0.0025998831,0.002824843,0.0015986939,0.0040032505,0.0043791295,0.0035222634,0.011426044],"category_scores_gemma":[0.1498153,0.0013642613,0.0021610844,0.004853383,0.0036394296,0.009169211,0.003290903,0.005791498,0.001213276],"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.0043629017,0.001520179,0.030682698,0.0015456105,0.0006556922,0.00037019714,0.00042943333,0.7593332,0.0024742354,0.032521386,0.033026952,0.13307756],"study_design_scores_gemma":[0.00035551446,0.00028339433,0.0043938123,0.00007196223,0.00011699296,0.00026361103,0.0002839254,0.9676138,0.0011200065,0.02425292,0.0012106786,0.000033337525],"about_ca_topic_score_codex":0.011300886,"about_ca_topic_score_gemma":0.014400766,"teacher_disagreement_score":0.014400963,"about_ca_system_score_codex":0.0046118153,"about_ca_system_score_gemma":0.0061271875,"threshold_uncertainty_score":0.07616049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044026896,0.00031065205,0.9427782,0.0011497651,0.00004162996,0.00033268842,0.0014087862,0.0011814112,0.008769868],"genre_scores_gemma":[0.51109874,0.0003229282,0.48273966,0.00030850337,0.000031108208,0.0008288836,0.0018563688,0.0001460624,0.0026677996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99409544,0.0037347877,0.0004778342,0.0005467136,0.0009406996,0.00020452148],"domain_scores_gemma":[0.9881052,0.0071812714,0.00081151153,0.0017263575,0.0019979686,0.00017775207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004712226,0.0007275077,0.00047387733,0.0013695695,0.0005434,0.0022961206,0.0012592126,0.0009718483,0.0038942234],"category_scores_gemma":[0.018508885,0.00040913178,0.001060791,0.0017284959,0.0007753951,0.0055039423,0.001140772,0.0015239306,0.0007875917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000910126,0.0005194337,0.0075370506,0.0013420783,0.00023956079,0.0007403116,0.009115028,0.07367472,0.027380725,0.655154,0.010161031,0.21322595],"study_design_scores_gemma":[0.00016399847,0.00037900428,0.003165125,0.00031284933,0.00020692163,0.0008528772,0.0022155298,0.591378,0.016146235,0.33773482,0.047253843,0.00019068367],"about_ca_topic_score_codex":0.0021301038,"about_ca_topic_score_gemma":0.00387464,"teacher_disagreement_score":0.004712226,"about_ca_system_score_codex":0.0010678708,"about_ca_system_score_gemma":0.001006204,"threshold_uncertainty_score":0.02492094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31212544,0.0011201595,0.64370376,0.00067443063,0.000037317044,0.000253063,0.00049563823,0.0013313963,0.040258817],"genre_scores_gemma":[0.9137167,0.00041343155,0.077503905,0.000110220186,0.00006702933,0.0003175439,0.00054301607,0.0004353516,0.0068927873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977404,0.0009502104,0.00011041365,0.00019940812,0.00079958595,0.0001999474],"domain_scores_gemma":[0.9702892,0.022551544,0.002054202,0.0028520485,0.0017470792,0.00050590205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028117532,0.00029453673,0.0011538145,0.00135501,0.0007970774,0.0017922182,0.0012298193,0.0007355322,0.008252863],"category_scores_gemma":[0.030471088,0.0004221695,0.0005652415,0.002112168,0.0014650509,0.00312347,0.0011902414,0.0014998742,0.0007931749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010309257,0.00034927353,0.00865357,0.0006879641,0.0001402973,0.00054250064,0.0015220488,0.3177278,0.014517011,0.4917179,0.007071815,0.15603885],"study_design_scores_gemma":[0.00011470568,0.0003295768,0.003536641,0.00007322766,0.000120701145,0.0005356197,0.0004595308,0.703845,0.010136624,0.2753092,0.0054925047,0.000046696616],"about_ca_topic_score_codex":0.0011629255,"about_ca_topic_score_gemma":0.0023650378,"teacher_disagreement_score":0.008252863,"about_ca_system_score_codex":0.0009418713,"about_ca_system_score_gemma":0.0014501419,"threshold_uncertainty_score":0.027608573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52883005,0.0005426957,0.44056153,0.0004741502,0.000057223846,0.00025664933,0.0014340084,0.00032633005,0.027517349],"genre_scores_gemma":[0.90033495,0.00015878983,0.0958348,0.000056401717,0.00003300511,0.00017055137,0.001359327,0.00003263976,0.0020194538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626875,0.0010893532,0.0005627814,0.0005755919,0.0012086455,0.00029479162],"domain_scores_gemma":[0.9948448,0.0019269516,0.00097267574,0.00089421927,0.0011104896,0.0002508054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017777068,0.00051012106,0.00048886565,0.0039317845,0.0015214055,0.003857941,0.001037945,0.0010015115,0.004092625],"category_scores_gemma":[0.009219252,0.0003817751,0.0010100103,0.0035170654,0.0026782013,0.005004787,0.0017472875,0.00062400504,0.00044840472],"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.00050318503,0.00010158662,0.012805009,0.0006017996,0.00013144694,0.00276068,0.008700516,0.02756636,0.019909576,0.85971445,0.0020817393,0.06512371],"study_design_scores_gemma":[0.000101205784,0.00029193432,0.026350243,0.00033596213,0.00032864124,0.003172826,0.009582493,0.14701736,0.019018425,0.7447618,0.04876886,0.00027020893],"about_ca_topic_score_codex":0.0020509486,"about_ca_topic_score_gemma":0.002247332,"teacher_disagreement_score":0.004092625,"about_ca_system_score_codex":0.0014423818,"about_ca_system_score_gemma":0.0008836784,"threshold_uncertainty_score":0.0136912465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008075557,0.00008561218,0.9842107,0.0001754095,0.000038413364,0.000122053214,0.00017016762,0.0035182028,0.0036039331],"genre_scores_gemma":[0.22684613,0.00026727212,0.76643217,0.00013500599,0.00007410902,0.00040254256,0.00056958623,0.00027385517,0.004999271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999017,0.00021276249,0.000104388986,0.00023310698,0.00036336508,0.000069270194],"domain_scores_gemma":[0.99891305,0.00042706597,0.00014221508,0.00016230418,0.00021877499,0.00013665296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014029453,0.00043722626,0.0008137453,0.0007001281,0.0011962719,0.0020115997,0.0018802653,0.00061569543,0.0055179494],"category_scores_gemma":[0.0026384336,0.00045808993,0.00070719875,0.0011569159,0.00072364934,0.0027233127,0.0013972471,0.0011202738,0.001146451],"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.0005281706,0.00040690316,0.0016670972,0.00035566586,0.00012928649,0.0006659126,0.0006249105,0.45712093,0.021053359,0.24903454,0.011479782,0.2569334],"study_design_scores_gemma":[0.00007899459,0.000052826894,0.00013323392,0.000011812705,0.000027696251,0.00008735494,0.000034979632,0.95347863,0.0035944611,0.028641405,0.0138347745,0.0000238676],"about_ca_topic_score_codex":0.007468275,"about_ca_topic_score_gemma":0.008015689,"teacher_disagreement_score":0.007468275,"about_ca_system_score_codex":0.0010497606,"about_ca_system_score_gemma":0.0026250638,"threshold_uncertainty_score":0.01845944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06951844,0.0006033761,0.91405815,0.0014075765,0.00012681872,0.00026110455,0.0004854634,0.0009490665,0.012590078],"genre_scores_gemma":[0.60486335,0.00089166424,0.3822985,0.00038549866,0.0001785843,0.00033584627,0.0009685059,0.00037459927,0.0097035365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555236,0.0016877007,0.00033436398,0.0005523634,0.0012969937,0.0005762004],"domain_scores_gemma":[0.9925874,0.0046160035,0.00045557102,0.001136857,0.0006924378,0.0005117679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038601297,0.0009204184,0.0013569515,0.001045228,0.0013462848,0.0041290084,0.0028290693,0.0012199983,0.0042458004],"category_scores_gemma":[0.011718877,0.0010154945,0.0013729936,0.0033829052,0.0014743936,0.009131287,0.005012493,0.0034242056,0.0006662456],"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.00035789656,0.00035784568,0.0017798232,0.0006372096,0.00024753832,0.0012415587,0.0008005035,0.33592117,0.0057746237,0.5092236,0.01033322,0.13332497],"study_design_scores_gemma":[0.00007302475,0.000053042048,0.00013980448,0.000040121864,0.00008298583,0.00025939025,0.0003320217,0.6019286,0.004254061,0.3806726,0.01213015,0.000034249326],"about_ca_topic_score_codex":0.0024922146,"about_ca_topic_score_gemma":0.004958971,"teacher_disagreement_score":0.0042458004,"about_ca_system_score_codex":0.0011833603,"about_ca_system_score_gemma":0.0018070715,"threshold_uncertainty_score":0.02041459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13208124,0.0027348618,0.7881167,0.0034411976,0.0003947101,0.00008405562,0.0004892545,0.00058161945,0.07207637],"genre_scores_gemma":[0.8458491,0.0013909457,0.12571928,0.0006491707,0.0005800841,0.0001363258,0.0007620943,0.00016914487,0.024743788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784124,0.0007934657,0.0002020841,0.00036923485,0.000546118,0.00024780084],"domain_scores_gemma":[0.9950051,0.003409301,0.00041315344,0.00043002723,0.0005496006,0.00019280634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039905,0.00088106876,0.0011333654,0.0019128888,0.0018322068,0.0041075647,0.0023588615,0.0011577455,0.0084380675],"category_scores_gemma":[0.009257187,0.0009706828,0.0017608847,0.0030535723,0.0050595063,0.00669776,0.002557627,0.004855818,0.00071581855],"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.000008165184,0.000009310947,0.0001398678,0.00001893795,0.0000065872546,0.000020761041,0.00007687166,0.0016898193,0.00009583699,0.99488837,0.00045916226,0.0025862977],"study_design_scores_gemma":[0.0000042931474,0.00000215269,0.00004296275,0.000004225049,0.0000051981333,0.000011187533,0.000013037271,0.0057036756,0.00009415795,0.99339736,0.00071687496,0.0000049104524],"about_ca_topic_score_codex":0.005451149,"about_ca_topic_score_gemma":0.0075741797,"teacher_disagreement_score":0.0084380675,"about_ca_system_score_codex":0.0028636914,"about_ca_system_score_gemma":0.0012738428,"threshold_uncertainty_score":0.028228164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019111361,0.0004028658,0.9737507,0.0009606266,0.00009453263,0.00021464117,0.00029650013,0.0009103812,0.0042584236],"genre_scores_gemma":[0.09094508,0.00024328688,0.9047412,0.00033424367,0.000107518965,0.00032239928,0.0008733294,0.00037614355,0.0020566974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975618,0.0010143383,0.00012504232,0.000474827,0.00055520737,0.000268773],"domain_scores_gemma":[0.98863435,0.009436348,0.00043313645,0.0006272789,0.0007035746,0.0001653462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003710805,0.0016162089,0.0023793785,0.0010060531,0.000976556,0.0023211574,0.002404224,0.0016931727,0.011795072],"category_scores_gemma":[0.014330341,0.00091243326,0.002083995,0.0025087283,0.0008493278,0.0037352107,0.0018841677,0.0047695017,0.0013212475],"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.00041890735,0.00052258954,0.0016914287,0.0010772352,0.00021231196,0.0002501761,0.00041939862,0.55380565,0.0037650948,0.07970807,0.01784313,0.34028596],"study_design_scores_gemma":[0.00010504985,0.00008087448,0.00021037708,0.00003387225,0.000026016418,0.0000692121,0.000106244355,0.9358283,0.0011133974,0.059131455,0.0032786403,0.000016499973],"about_ca_topic_score_codex":0.004949094,"about_ca_topic_score_gemma":0.006365741,"teacher_disagreement_score":0.011795072,"about_ca_system_score_codex":0.0010559874,"about_ca_system_score_gemma":0.0023837925,"threshold_uncertainty_score":0.039458454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018296884,0.000065749125,0.972629,0.00038305527,0.00001716438,0.000047998423,0.000023200717,0.00033930925,0.008197706],"genre_scores_gemma":[0.39102355,0.00016978067,0.5991578,0.00014014088,0.00002301743,0.00014546812,0.00010201545,0.0002479801,0.008990268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986602,0.0005223759,0.000068345245,0.00022593512,0.0003837988,0.00013927148],"domain_scores_gemma":[0.99854624,0.0006890957,0.00014262035,0.00038530733,0.0001599394,0.00007676282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113162,0.00080189516,0.00060394796,0.0006735223,0.0015199974,0.0025621012,0.0014735071,0.0020518962,0.003069383],"category_scores_gemma":[0.004962259,0.0005806717,0.0010816349,0.00094516465,0.005502577,0.0039668684,0.0033466998,0.0023805357,0.00055760203],"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.00004316433,0.00002545858,0.0003849327,0.00006765751,0.000016132393,0.000605843,0.0019937535,0.087104574,0.003299786,0.87870026,0.00074413576,0.02701432],"study_design_scores_gemma":[0.000035614077,0.00006449054,0.00020092452,0.00005214809,0.00003395983,0.00036882196,0.0005921983,0.48486912,0.0059604375,0.4770686,0.030709287,0.000044368655],"about_ca_topic_score_codex":0.004137947,"about_ca_topic_score_gemma":0.0053627286,"teacher_disagreement_score":0.004137947,"about_ca_system_score_codex":0.0010624096,"about_ca_system_score_gemma":0.0012593889,"threshold_uncertainty_score":0.0111756325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02515813,0.0002801511,0.9599113,0.0007113721,0.00008886646,0.00006681572,0.0005070049,0.0006930831,0.012583252],"genre_scores_gemma":[0.6304461,0.00039602196,0.36415276,0.00026069453,0.00011282633,0.0000926905,0.00087839784,0.00024443713,0.003416146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907124,0.0002332197,0.000074783726,0.00020642937,0.00030843925,0.00010585686],"domain_scores_gemma":[0.9988067,0.0004899535,0.00017546845,0.00018971108,0.00027382272,0.00006427265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656846,0.0006600642,0.00054177555,0.0016503629,0.0007727403,0.0031392826,0.0019996597,0.001091513,0.006122372],"category_scores_gemma":[0.0039061978,0.0005760984,0.0013753932,0.0014098188,0.0025686887,0.0044751875,0.0014877744,0.0016911606,0.00050805334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019683497,0.00006660934,0.0009892903,0.00035735124,0.00007198526,0.0007351315,0.0009712703,0.07651322,0.009645485,0.8560791,0.0030195299,0.051354174],"study_design_scores_gemma":[0.000043572087,0.00003658997,0.0006606813,0.000057767247,0.00007795274,0.000206019,0.00036999094,0.3252132,0.003720095,0.65992546,0.009651014,0.000037738715],"about_ca_topic_score_codex":0.005103836,"about_ca_topic_score_gemma":0.0068427315,"teacher_disagreement_score":0.006122372,"about_ca_system_score_codex":0.0014006104,"about_ca_system_score_gemma":0.0007505042,"threshold_uncertainty_score":0.020481408},"labels":[],"label_agreement":null},{"id":"W1996357025","doi":"10.1007/s10601-014-9178-2","title":"The salesman and the tree: the importance of search in CP","year":2014,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Generalization; Mathematical optimization; Computer science; Heuristic; Graph; Mathematics; Theoretical computer science","score_opus":0.01036059648106432,"score_gpt":0.23661172094358165,"score_spread":0.22625112446251733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996357025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012792009,0.01764332,0.9354659,0.008157487,0.00074110826,0.000093257615,0.00025017746,0.00015956938,0.024697239],"genre_scores_gemma":[0.4336437,0.03403643,0.5084381,0.0022721414,0.004467433,0.00042878784,0.00042089514,0.000549843,0.015742747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959329,0.0023036303,0.00014282385,0.00044379086,0.0009802369,0.00019672546],"domain_scores_gemma":[0.9632595,0.033413764,0.0005960102,0.0011175724,0.0011300206,0.0004831248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281647,0.0011304467,0.0028409935,0.0025339515,0.0013396766,0.004477942,0.002310605,0.0030595849,0.009069896],"category_scores_gemma":[0.04600269,0.0011013907,0.0011634384,0.0056073745,0.0053130193,0.016381467,0.0024873447,0.006877571,0.0007847886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017680599,0.000044524175,0.00046353025,0.0003861367,0.000049091585,0.00008529688,0.00011775022,0.06866558,0.00017221556,0.8466524,0.008923897,0.074262775],"study_design_scores_gemma":[0.00002993149,0.00001977445,0.000091651076,0.00006258381,0.00001765798,0.000040246578,0.000030952528,0.20606998,0.0000973238,0.78938067,0.0041448656,0.000014359162],"about_ca_topic_score_codex":0.0089204,"about_ca_topic_score_gemma":0.006272345,"teacher_disagreement_score":0.009069896,"about_ca_system_score_codex":0.0022625485,"about_ca_system_score_gemma":0.0025853761,"threshold_uncertainty_score":0.030341804},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019958997,0.0002317977,0.96954453,0.000493335,0.000101868565,0.00012434684,0.00019095512,0.0007084857,0.008645695],"genre_scores_gemma":[0.33179277,0.00043864665,0.65946615,0.00049525895,0.0001213175,0.00028531605,0.0007170447,0.0004958901,0.006187641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995667,0.0014414164,0.00027185265,0.00074322114,0.0014897697,0.00038684177],"domain_scores_gemma":[0.992939,0.002791802,0.0005500467,0.002288926,0.0011636247,0.00026650837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029314726,0.0008095858,0.0010940712,0.0015317074,0.00095747184,0.0033623162,0.0029749165,0.0012890716,0.0048632547],"category_scores_gemma":[0.013391558,0.00073465897,0.0015120943,0.0030172651,0.0019881744,0.005374373,0.005344764,0.003844271,0.0008986451],"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.00029245022,0.00035107817,0.0014432815,0.00038926912,0.000102611724,0.00027914447,0.0005646652,0.118834995,0.0065270932,0.5834365,0.0059581525,0.28182077],"study_design_scores_gemma":[0.00010380342,0.00014140063,0.00029371795,0.000110648965,0.00007224042,0.0003958711,0.00015682387,0.5467491,0.009773397,0.41425422,0.027898083,0.000050762763],"about_ca_topic_score_codex":0.0019610166,"about_ca_topic_score_gemma":0.0016757885,"teacher_disagreement_score":0.0048632547,"about_ca_system_score_codex":0.0014615775,"about_ca_system_score_gemma":0.0021920404,"threshold_uncertainty_score":0.016269207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052746743,0.0018300748,0.8615219,0.010607106,0.00021295108,0.0003497005,0.0011702869,0.0005590213,0.07100215],"genre_scores_gemma":[0.6085934,0.0040215165,0.35760576,0.004983801,0.0014308437,0.0020321764,0.0031766247,0.00042307057,0.01773291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946779,0.0010976718,0.00028244514,0.0011223684,0.0021540115,0.0006655491],"domain_scores_gemma":[0.9804007,0.016995426,0.00067462213,0.0008134098,0.0007067856,0.00040915114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039638,0.0010620751,0.0017266276,0.0020603724,0.002463088,0.006370883,0.0023564815,0.0023415333,0.01302575],"category_scores_gemma":[0.015063456,0.00076158525,0.0034274275,0.0028847437,0.0060543357,0.012755861,0.0049244566,0.010788444,0.0017938653],"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.00013945297,0.00011501585,0.0005150461,0.00030750321,0.00005596739,0.00011970917,0.0003747119,0.014752746,0.0013452641,0.9472016,0.007054168,0.028018748],"study_design_scores_gemma":[0.00004267443,0.000040228246,0.0002859077,0.00005424004,0.000018036142,0.000101103615,0.00006563434,0.049521506,0.0008195988,0.9435154,0.0055182967,0.000017279246],"about_ca_topic_score_codex":0.0017394677,"about_ca_topic_score_gemma":0.0012540036,"teacher_disagreement_score":0.01302575,"about_ca_system_score_codex":0.0035235004,"about_ca_system_score_gemma":0.0018812875,"threshold_uncertainty_score":0.043575525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011978585,0.00062943413,0.9744184,0.0032669068,0.000060200033,0.00013574127,0.0003997155,0.00034284184,0.008768163],"genre_scores_gemma":[0.32292145,0.0022651288,0.6663657,0.0011415588,0.00057140813,0.00048899645,0.0018581698,0.00027787377,0.004109664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924624,0.0036936565,0.000366182,0.0010504486,0.0019381274,0.00048917014],"domain_scores_gemma":[0.972779,0.023828765,0.00079922244,0.0013599951,0.00090255134,0.0003304695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062822383,0.0015223527,0.0015305075,0.002009909,0.0016489014,0.005253282,0.002896146,0.0024331098,0.00697039],"category_scores_gemma":[0.033988338,0.0014245489,0.003328622,0.0033018403,0.004187472,0.012393224,0.0060609793,0.008282601,0.00080006756],"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.00006438994,0.00008903192,0.00030414163,0.0003784768,0.000077794226,0.00035813273,0.00044509472,0.1213329,0.0008083544,0.8476825,0.004179747,0.024279531],"study_design_scores_gemma":[0.000024843253,0.000008883624,0.00004425601,0.000030222027,0.000013918334,0.000052210366,0.000098344906,0.1398481,0.00030898087,0.8567259,0.0028363513,0.000008043661],"about_ca_topic_score_codex":0.004947455,"about_ca_topic_score_gemma":0.006677896,"teacher_disagreement_score":0.00697039,"about_ca_system_score_codex":0.0029877466,"about_ca_system_score_gemma":0.0020584115,"threshold_uncertainty_score":0.033224046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034331944,0.00065734016,0.9163326,0.0010061385,0.00019553363,0.0004337636,0.00048529514,0.006186887,0.040370498],"genre_scores_gemma":[0.20657565,0.00044090053,0.78025645,0.0006670097,0.0000790522,0.0002110867,0.0008671337,0.00060107955,0.010301658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977584,0.00059548847,0.00014141959,0.00027075206,0.0010217502,0.0002121731],"domain_scores_gemma":[0.9960091,0.0024475756,0.00018684236,0.00061660475,0.0006482894,0.00009149275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020187537,0.0012180808,0.00086387416,0.0017497054,0.0006326112,0.002122633,0.0033463673,0.0012337692,0.013193563],"category_scores_gemma":[0.00919187,0.0006852252,0.0013809234,0.0020283116,0.0014920485,0.0041200146,0.0035779523,0.0024250157,0.0019367049],"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.00045568563,0.00049762905,0.0014612873,0.00096041337,0.00012372257,0.00059142156,0.000500541,0.1586245,0.016870266,0.32212248,0.017972037,0.47981995],"study_design_scores_gemma":[0.0002684387,0.0001598928,0.00028793263,0.00010457814,0.00009163693,0.0002782441,0.00012474858,0.76164335,0.031860135,0.1707495,0.03437195,0.00005953934],"about_ca_topic_score_codex":0.0053923777,"about_ca_topic_score_gemma":0.010352909,"teacher_disagreement_score":0.013193563,"about_ca_system_score_codex":0.0013820772,"about_ca_system_score_gemma":0.0017380707,"threshold_uncertainty_score":0.04413694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008796183,0.04967941,0.8436508,0.045344476,0.006329112,0.00007761342,0.0022452115,0.0011020255,0.04277519],"genre_scores_gemma":[0.4607738,0.031920046,0.36912313,0.041895993,0.030793283,0.00079167925,0.0041983305,0.005296304,0.055207502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9809378,0.0062748278,0.0011474028,0.0035795812,0.006132261,0.0019281869],"domain_scores_gemma":[0.9342532,0.047602214,0.0025407441,0.0075922585,0.006799637,0.0012119217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018158015,0.0032596318,0.004154685,0.003964032,0.0030049002,0.007812824,0.0052296626,0.00735396,0.02861491],"category_scores_gemma":[0.076577686,0.0018136452,0.0034304531,0.006132076,0.006455588,0.022066416,0.00726132,0.019380143,0.007724295],"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.000404825,0.00008394306,0.0011167885,0.00036692942,0.00024990385,0.00017005936,0.00030222716,0.021993857,0.0012840176,0.7810153,0.11007202,0.0829401],"study_design_scores_gemma":[0.000086380925,0.00008014188,0.0010686517,0.00038035458,0.00017331065,0.00026248535,0.00008057364,0.056576166,0.0018668532,0.8929057,0.046389725,0.00012961823],"about_ca_topic_score_codex":0.004887279,"about_ca_topic_score_gemma":0.004700187,"teacher_disagreement_score":0.02861491,"about_ca_system_score_codex":0.0068290634,"about_ca_system_score_gemma":0.0030136527,"threshold_uncertainty_score":0.09602994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025402455,0.00008474146,0.99749833,0.00009246083,0.000018868692,0.00002400987,0.000016153443,0.00008273778,0.0019286075],"genre_scores_gemma":[0.031216353,0.0005554345,0.96054965,0.00022353856,0.00011297948,0.00044566405,0.00012836458,0.00028188858,0.006486087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843687,0.00053390703,0.000077284654,0.00028672346,0.0005719324,0.00009333206],"domain_scores_gemma":[0.9985337,0.0007856243,0.00006403206,0.0003121919,0.0002534689,0.000050961935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020844254,0.0014332592,0.0020129345,0.0017182718,0.0013088987,0.0020751662,0.0051658144,0.0023585104,0.011252262],"category_scores_gemma":[0.006865683,0.0010165137,0.0023935963,0.0036835473,0.0023388392,0.00391646,0.0036662314,0.004081358,0.002874718],"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.00004020459,0.00006602396,0.00018155681,0.00039550697,0.00012415387,0.00012462222,0.00023750169,0.26415038,0.0026560656,0.62856245,0.0071757105,0.09628583],"study_design_scores_gemma":[0.000034574397,0.000036527807,0.000053912154,0.000042757125,0.000038922713,0.00009259625,0.000032889307,0.68468493,0.0008681284,0.3009865,0.0131012015,0.000027061724],"about_ca_topic_score_codex":0.004196543,"about_ca_topic_score_gemma":0.005403104,"teacher_disagreement_score":0.011252262,"about_ca_system_score_codex":0.0010284338,"about_ca_system_score_gemma":0.0015635227,"threshold_uncertainty_score":0.03764254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19091219,0.0070869285,0.71686697,0.018444683,0.00047711498,0.00063639146,0.0029941767,0.006528401,0.056053184],"genre_scores_gemma":[0.8379222,0.002132457,0.13811266,0.0035959014,0.0007198641,0.0010896147,0.0025651983,0.0020276797,0.0118343355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9845271,0.004281926,0.0008799261,0.0028382456,0.004700762,0.0027720907],"domain_scores_gemma":[0.87468964,0.104513705,0.0041874754,0.010080425,0.0036241545,0.002904618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013809397,0.0020398584,0.0027175352,0.0024108023,0.0023247502,0.0061022537,0.0059638754,0.003304424,0.014803054],"category_scores_gemma":[0.07538947,0.0017179421,0.0026090294,0.0028570706,0.005893194,0.016805781,0.0075251358,0.0088657765,0.0023365903],"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.0030046932,0.0007974315,0.006622901,0.0018331516,0.00033416375,0.00045996817,0.0006634162,0.35674924,0.015319689,0.49864653,0.029500093,0.086068794],"study_design_scores_gemma":[0.00023807022,0.00015756518,0.0005172938,0.00010494233,0.000101826365,0.00017293404,0.000054991902,0.6402224,0.004388853,0.3507577,0.0032412244,0.000042295287],"about_ca_topic_score_codex":0.002119508,"about_ca_topic_score_gemma":0.0026079947,"teacher_disagreement_score":0.014803054,"about_ca_system_score_codex":0.009418349,"about_ca_system_score_gemma":0.004155058,"threshold_uncertainty_score":0.07303196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023045924,0.0007307308,0.98378205,0.0007187662,0.000076006996,0.000046702393,0.00011985676,0.00015413339,0.012067241],"genre_scores_gemma":[0.3027583,0.0029810646,0.66601515,0.0007829951,0.0004617022,0.00050095294,0.00079918373,0.00037680537,0.025323732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967855,0.001653988,0.00012317675,0.00041986324,0.00088804984,0.00012931212],"domain_scores_gemma":[0.9913448,0.006942913,0.00027432636,0.0006868589,0.00064225926,0.000108821325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037375519,0.0012685771,0.0013967907,0.0021621594,0.00083710987,0.0031624835,0.0026550286,0.001845821,0.007872073],"category_scores_gemma":[0.01550808,0.0011790253,0.0014203537,0.00477021,0.0027225073,0.0050257733,0.0022599408,0.0033201817,0.0011737394],"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.000049565664,0.000055182445,0.0001849785,0.00018113032,0.00007794851,0.00005600159,0.00009488401,0.15766542,0.00049870735,0.7606208,0.007717187,0.07279814],"study_design_scores_gemma":[0.000009324796,0.000010397979,0.000056910325,0.00002727342,0.000020382948,0.000022098318,0.000008504732,0.44656783,0.0005338606,0.548992,0.0037418471,0.000009663795],"about_ca_topic_score_codex":0.0042221327,"about_ca_topic_score_gemma":0.003811402,"teacher_disagreement_score":0.007872073,"about_ca_system_score_codex":0.0020115413,"about_ca_system_score_gemma":0.0016196489,"threshold_uncertainty_score":0.026334703},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06003673,0.0003536908,0.9335511,0.00036334485,0.00004540808,0.00025384288,0.00014630507,0.0010060316,0.004243468],"genre_scores_gemma":[0.3162474,0.000539333,0.6799832,0.00015030507,0.00005206729,0.00032308605,0.00066563557,0.0001146071,0.001924427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986749,0.00052279525,0.00007787766,0.00016652017,0.00040578016,0.00015212904],"domain_scores_gemma":[0.9945471,0.0040250756,0.00031081357,0.0005959422,0.00045121138,0.00006980402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015925886,0.0006130134,0.00075908116,0.00077952765,0.00061739126,0.000956257,0.001805352,0.0009167158,0.002802696],"category_scores_gemma":[0.008824099,0.000528356,0.0014415104,0.0010951665,0.00083008735,0.001715877,0.0014722674,0.001159787,0.00031502516],"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.00022708297,0.00034067887,0.0048858644,0.0010550992,0.0002754741,0.0006207703,0.0005794709,0.4259429,0.017820794,0.1274205,0.0073895464,0.4134419],"study_design_scores_gemma":[0.00007835742,0.00014215702,0.0006468323,0.000049863465,0.000115016155,0.0002957361,0.00014498059,0.90159184,0.012032004,0.078708865,0.006171055,0.000023171577],"about_ca_topic_score_codex":0.0023613865,"about_ca_topic_score_gemma":0.004542158,"teacher_disagreement_score":0.002802696,"about_ca_system_score_codex":0.000739753,"about_ca_system_score_gemma":0.0019801727,"threshold_uncertainty_score":0.009375989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09155708,0.00038186452,0.9036554,0.0004878019,0.000025244386,0.00015274194,0.00009694602,0.00039786779,0.0032450547],"genre_scores_gemma":[0.56551,0.00031207898,0.4326155,0.00018027466,0.000024537549,0.00023648051,0.00019355133,0.000058181748,0.00086947175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739134,0.0015961485,0.00014600994,0.00029671603,0.00039897053,0.00017072832],"domain_scores_gemma":[0.9912574,0.006664498,0.00060311874,0.00073799095,0.00053389143,0.00020312102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521979,0.00094430044,0.00092591357,0.0012892633,0.0006273602,0.0022436483,0.0015408781,0.0010764694,0.0016229578],"category_scores_gemma":[0.016827518,0.00067233684,0.00090997753,0.0015653638,0.002027806,0.00406398,0.001653476,0.0018218663,0.00020138074],"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.00015768083,0.00015316874,0.0021319091,0.00017662834,0.000094686344,0.000077225486,0.0003155247,0.83136123,0.001508727,0.051187165,0.00063103106,0.11220504],"study_design_scores_gemma":[0.000034388613,0.00005625392,0.00019067281,0.000027540817,0.000018955134,0.000020185314,0.00007362731,0.93701184,0.0009974451,0.060967907,0.00058617623,0.000015057022],"about_ca_topic_score_codex":0.0046985084,"about_ca_topic_score_gemma":0.008134406,"teacher_disagreement_score":0.0046985084,"about_ca_system_score_codex":0.0017695962,"about_ca_system_score_gemma":0.0022862495,"threshold_uncertainty_score":0.018626213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113049366,0.0014929647,0.86123633,0.0015799724,0.000082510895,0.000062558946,0.00019660906,0.0008223661,0.021477338],"genre_scores_gemma":[0.70691776,0.001378184,0.2779058,0.0006216341,0.00023877854,0.00010647225,0.0002909212,0.0003545192,0.012185959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993783,0.00020173905,0.000037957954,0.00011187125,0.0001865929,0.00008340836],"domain_scores_gemma":[0.99932647,0.00035331445,0.00008073319,0.00010765087,0.00008872744,0.000043121556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012083845,0.00039147376,0.00046813212,0.0013342389,0.0012427298,0.001867725,0.0007805337,0.0010184171,0.0013345521],"category_scores_gemma":[0.0018318668,0.0003503885,0.0010794705,0.0015094178,0.0027202996,0.005678259,0.0010090019,0.0018478172,0.00032369778],"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.000020895337,0.000013003802,0.00009718583,0.000022853183,0.000006120482,0.000105569095,0.000336833,0.0036814308,0.0019077703,0.98487616,0.0005684139,0.0083636455],"study_design_scores_gemma":[0.000011370226,0.000021981996,0.00017487818,0.000017213402,0.000015602916,0.0001485534,0.000094551186,0.023722025,0.0016956798,0.96356124,0.010518244,0.000018767156],"about_ca_topic_score_codex":0.0024440435,"about_ca_topic_score_gemma":0.0022383067,"teacher_disagreement_score":0.0024440435,"about_ca_system_score_codex":0.0013462623,"about_ca_system_score_gemma":0.0008427479,"threshold_uncertainty_score":0.00976783},"labels":[],"label_agreement":null},{"id":"W2005924051","doi":"10.1007/s10601-005-0552-y","title":"An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint","year":2005,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; Cardinality (data modeling); Constraint programming; Consistency (knowledge bases); Constraint (computer-aided design); Benchmark (surveying); Computer science; Mathematical optimization; Constraint logic programming; Constraint satisfaction; Algorithm; Mathematics; Stochastic programming; Artificial intelligence; Probabilistic logic; Data mining","score_opus":0.017217442439509133,"score_gpt":0.2827290062673527,"score_spread":0.2655115638278436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005924051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003021688,0.00019597434,0.9927511,0.00017283346,0.000060687726,0.00009533944,0.00017488012,0.0010270927,0.002500277],"genre_scores_gemma":[0.067185916,0.00022065725,0.9277301,0.00015445739,0.00008964194,0.0002486471,0.000838777,0.0006533,0.002878557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959837,0.000942833,0.0002395382,0.0008532901,0.0016140196,0.00036663588],"domain_scores_gemma":[0.9925565,0.0038266657,0.00038066972,0.0017798169,0.0012747197,0.00018172734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030972282,0.0015382767,0.0022069488,0.0024421134,0.001448332,0.0040370747,0.0040238216,0.0021198874,0.010316404],"category_scores_gemma":[0.015306269,0.0012792678,0.0016474592,0.0040396024,0.0011951848,0.0060627065,0.004556483,0.00467304,0.0022503533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005105662,0.00028842784,0.00085097004,0.00034740125,0.00015269643,0.00014924702,0.00027965597,0.2005251,0.008608475,0.12336909,0.02447748,0.64044094],"study_design_scores_gemma":[0.00015229186,0.000058541482,0.00026515123,0.0000535785,0.000060125083,0.0001160349,0.00007825428,0.89255077,0.0078585,0.08881631,0.00995415,0.000036321442],"about_ca_topic_score_codex":0.0048660683,"about_ca_topic_score_gemma":0.005549349,"teacher_disagreement_score":0.010316404,"about_ca_system_score_codex":0.001638005,"about_ca_system_score_gemma":0.0034041815,"threshold_uncertainty_score":0.034511805},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009399485,0.36920807,0.11591298,0.052394487,0.29341224,0.00020767386,0.00281515,0.0008249072,0.16428459],"genre_scores_gemma":[0.008891956,0.28026214,0.049853336,0.02583343,0.451905,0.000420312,0.003092489,0.001114243,0.17862706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789196,0.00047090455,0.00017975127,0.00036893963,0.0009415266,0.00014689281],"domain_scores_gemma":[0.9919012,0.0051358864,0.00031797914,0.00051612663,0.0014198201,0.0007089199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022098601,0.002175401,0.0034633758,0.0048669646,0.0010130559,0.005597596,0.0020647184,0.0025497563,0.081901096],"category_scores_gemma":[0.007821308,0.0007992697,0.0020569859,0.008253999,0.002080426,0.005632059,0.0016669449,0.0076490403,0.0311811],"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.000025195943,0.000055930515,0.00010530809,0.00043541807,0.000025895757,0.000045021094,0.000027544238,0.0007146398,0.0002098748,0.035422232,0.89174694,0.071186],"study_design_scores_gemma":[0.000011644571,0.000030183304,0.00029023888,0.000316021,0.000017509336,0.00016085169,0.00003022164,0.0010125053,0.00007521517,0.07699158,0.9210373,0.000026697837],"about_ca_topic_score_codex":0.0013622404,"about_ca_topic_score_gemma":0.0030488463,"teacher_disagreement_score":0.081901096,"about_ca_system_score_codex":0.0017620014,"about_ca_system_score_gemma":0.0029051877,"threshold_uncertainty_score":0.27398646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054424256,0.00019787344,0.98788106,0.00019083096,0.00006452955,0.000062983534,0.00012136088,0.0006228624,0.005415957],"genre_scores_gemma":[0.12611751,0.0005595615,0.86171734,0.0002545746,0.00013525282,0.00019300361,0.0007145215,0.00044916043,0.009859038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946938,0.0015439431,0.00032370846,0.00083103706,0.0022446937,0.00036286312],"domain_scores_gemma":[0.9972492,0.0013346513,0.00017881778,0.000678441,0.0004434325,0.00011551423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036217386,0.0013810385,0.0010031932,0.0013401059,0.001024854,0.0025115614,0.0024192918,0.001227788,0.008011543],"category_scores_gemma":[0.0074397055,0.0007680942,0.0029186031,0.0014819257,0.002318256,0.0052478,0.003305492,0.0034631735,0.0013112737],"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.00011114894,0.000051347793,0.000561455,0.0003154357,0.000112673195,0.00040014175,0.00063634774,0.060003404,0.0054832627,0.82765436,0.0036119623,0.101058505],"study_design_scores_gemma":[0.00005971354,0.000075987184,0.00035270271,0.00010212602,0.0000942752,0.00050666265,0.00024985516,0.35938212,0.012023344,0.53422034,0.092861615,0.00007127907],"about_ca_topic_score_codex":0.003815275,"about_ca_topic_score_gemma":0.006021689,"teacher_disagreement_score":0.008011543,"about_ca_system_score_codex":0.0015375483,"about_ca_system_score_gemma":0.0012708724,"threshold_uncertainty_score":0.026801288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16134584,0.0010156275,0.82618433,0.0020740863,0.00009382191,0.0004580587,0.00081379904,0.00058491447,0.007429523],"genre_scores_gemma":[0.839408,0.0007496845,0.15175696,0.00040648656,0.00021449158,0.0008206056,0.0019273836,0.00038085427,0.0043355385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870586,0.0062038363,0.0004459711,0.0013596356,0.0039662486,0.0009657171],"domain_scores_gemma":[0.82713825,0.1556228,0.0053488254,0.0051789447,0.005460812,0.001250366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014126504,0.0009128251,0.0017862993,0.003012346,0.001572347,0.0027790943,0.0044332263,0.0022490462,0.0073073176],"category_scores_gemma":[0.0975343,0.0014628996,0.0019906065,0.0035309067,0.0027852391,0.0045509823,0.00264799,0.0035203043,0.00044065516],"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.00050269853,0.0002901615,0.004316227,0.0003081596,0.00014914485,0.00012705651,0.00033077857,0.67404354,0.001465808,0.2812,0.0047737067,0.032492764],"study_design_scores_gemma":[0.000037949165,0.000036773035,0.0006554646,0.0000183772,0.00001853791,0.00004157012,0.00003029229,0.9549952,0.00032862488,0.043325085,0.0004954874,0.00001661005],"about_ca_topic_score_codex":0.003942743,"about_ca_topic_score_gemma":0.005141411,"teacher_disagreement_score":0.014126504,"about_ca_system_score_codex":0.0033809477,"about_ca_system_score_gemma":0.0023151888,"threshold_uncertainty_score":0.074709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09908196,0.00062517065,0.88916856,0.0004651167,0.00008643615,0.00024473955,0.000054858436,0.0005631842,0.00970995],"genre_scores_gemma":[0.80339336,0.0003304635,0.19323649,0.00019256197,0.00004953467,0.00018013209,0.00008220954,0.0001375698,0.002397772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404514,0.0029807698,0.0003858759,0.0006177604,0.0013905894,0.00057989126],"domain_scores_gemma":[0.9871317,0.008183413,0.0007225732,0.0018447788,0.0015033265,0.00061420567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00764709,0.0009682683,0.001957723,0.001035288,0.0014594245,0.0054609994,0.003170304,0.0019200386,0.0037854756],"category_scores_gemma":[0.016421892,0.00087065814,0.0010705405,0.0016917154,0.0021353392,0.004846557,0.00477789,0.0025232513,0.0005539905],"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.0010682171,0.000534239,0.002939199,0.0003513695,0.00038454589,0.0001153855,0.00085576816,0.74245286,0.0032404133,0.094435796,0.0010494684,0.15257277],"study_design_scores_gemma":[0.0000697669,0.0001973424,0.0005063689,0.000026265512,0.0000998555,0.000034606986,0.000253982,0.94646037,0.001155779,0.049910937,0.0012562685,0.000028469292],"about_ca_topic_score_codex":0.008286734,"about_ca_topic_score_gemma":0.010572897,"teacher_disagreement_score":0.008286734,"about_ca_system_score_codex":0.0018793428,"about_ca_system_score_gemma":0.0029966915,"threshold_uncertainty_score":0.04044217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043334655,0.00006311874,0.95071006,0.00011734551,0.000009398985,0.00009042576,0.000028613134,0.0015228674,0.0041235937],"genre_scores_gemma":[0.19917884,0.00010345709,0.79779345,0.000056616056,0.000009362684,0.0001009373,0.00012304042,0.0003803158,0.0022540211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991725,0.0002120192,0.0000400147,0.00016616248,0.00034906183,0.00006019924],"domain_scores_gemma":[0.998379,0.00042715424,0.00015549228,0.00075291866,0.00020334302,0.000082104816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214943,0.00060971535,0.000559316,0.00048559165,0.00057756715,0.00115141,0.0016346796,0.00092404877,0.0016561222],"category_scores_gemma":[0.0028525558,0.0004287184,0.00078952056,0.00057506346,0.0015408238,0.0024171476,0.00296067,0.0009801218,0.00043392405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019078552,0.00037753745,0.0066727083,0.00046402574,0.00016697885,0.0008804881,0.004434807,0.3052702,0.07897273,0.15103742,0.0055810334,0.44595125],"study_design_scores_gemma":[0.0000523574,0.00014643566,0.0017598013,0.000044872922,0.00005087771,0.00047366015,0.00073096924,0.84643614,0.03541787,0.066325665,0.048498448,0.000062896506],"about_ca_topic_score_codex":0.003531039,"about_ca_topic_score_gemma":0.0049008294,"teacher_disagreement_score":0.003531039,"about_ca_system_score_codex":0.000472886,"about_ca_system_score_gemma":0.00075447356,"threshold_uncertainty_score":0.0070209503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014154877,0.00030936245,0.9784328,0.00042803824,0.0000731095,0.00022857756,0.00038486172,0.00043995952,0.00554836],"genre_scores_gemma":[0.21270058,0.0008128868,0.77719676,0.00032334434,0.0001887368,0.0007740618,0.0013563394,0.00038343712,0.0062637953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950324,0.0018728618,0.00039337738,0.0010691357,0.0011717968,0.00046038924],"domain_scores_gemma":[0.984535,0.0113054365,0.0012623288,0.0012084839,0.0013405292,0.00034814497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006421211,0.0011680545,0.0014164714,0.001782707,0.0013234989,0.0035240145,0.00253105,0.0016471486,0.008126538],"category_scores_gemma":[0.022780025,0.0010402749,0.0018897213,0.0034058252,0.0027114914,0.005137705,0.003200371,0.0050656092,0.00088569056],"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.0002798804,0.00015755378,0.0012763347,0.00064607884,0.00013270053,0.00037980222,0.0002390704,0.60101014,0.0024019387,0.30104366,0.0033213503,0.08911147],"study_design_scores_gemma":[0.00009516464,0.00011203429,0.00027176645,0.00009133384,0.000054493892,0.00021404093,0.00011589829,0.61001706,0.003115947,0.37644222,0.009430813,0.00003920865],"about_ca_topic_score_codex":0.0073939688,"about_ca_topic_score_gemma":0.005528292,"teacher_disagreement_score":0.008126538,"about_ca_system_score_codex":0.001880542,"about_ca_system_score_gemma":0.0042985943,"threshold_uncertainty_score":0.03395903},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050186655,0.37608048,0.28276822,0.010507621,0.009764954,0.00029140548,0.0015123887,0.00065345375,0.3134028],"genre_scores_gemma":[0.14188333,0.44471002,0.26339763,0.014494485,0.026165249,0.0015405905,0.0042681084,0.0011660939,0.10237456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697185,0.00082164165,0.00028420452,0.000754951,0.0009931658,0.00017419393],"domain_scores_gemma":[0.99712604,0.0018248226,0.00013516068,0.00030163417,0.00047590132,0.00013643621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034268,0.0016228325,0.0013072566,0.00523131,0.0024948213,0.006381841,0.002658177,0.003283754,0.020257635],"category_scores_gemma":[0.0054768794,0.00095721096,0.0018839488,0.005269811,0.0047054775,0.012672375,0.0046000318,0.0060277283,0.0074688364],"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.00001803714,0.00004356739,0.0004736099,0.0009365843,0.000025876068,0.00022976637,0.00065303117,0.001364198,0.00035897386,0.88408315,0.027120568,0.084692694],"study_design_scores_gemma":[0.0000041406724,0.00003601208,0.00031253614,0.0005533315,0.000012466705,0.00078962836,0.00022625097,0.001856858,0.00016118007,0.44993562,0.5460846,0.00002741165],"about_ca_topic_score_codex":0.0021831351,"about_ca_topic_score_gemma":0.0011606225,"teacher_disagreement_score":0.020257635,"about_ca_system_score_codex":0.003034674,"about_ca_system_score_gemma":0.0015980349,"threshold_uncertainty_score":0.067768514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055525873,0.0037729999,0.4792166,0.06825097,0.0030323383,0.00013008651,0.001513182,0.000825668,0.38773233],"genre_scores_gemma":[0.831933,0.0048609795,0.07057783,0.014840187,0.0063116527,0.00051490066,0.001216209,0.00053109997,0.06921412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983581,0.00046524996,0.00010356972,0.00031872286,0.0005431216,0.00021126772],"domain_scores_gemma":[0.9951013,0.003526401,0.00018861689,0.0004941223,0.0004545413,0.00023509395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026740665,0.0007819932,0.0011379323,0.001816044,0.0038844761,0.003145444,0.0021946297,0.0028925708,0.028145345],"category_scores_gemma":[0.0075244806,0.0005442192,0.0015635422,0.0030509357,0.0062629245,0.018107206,0.0033751605,0.005166006,0.0015792736],"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.000009219352,0.000006312129,0.000028298467,0.000020003547,0.0000023227224,0.000026350244,0.00010849008,0.00020946021,0.00007087052,0.9954007,0.0027153413,0.0014026832],"study_design_scores_gemma":[0.000006437618,0.0000036322522,0.000058871115,0.0000067849696,0.000002961506,0.000017600483,0.000049390124,0.0007205522,0.0000934616,0.9938583,0.00517772,0.0000042956967],"about_ca_topic_score_codex":0.0032331345,"about_ca_topic_score_gemma":0.0025549424,"teacher_disagreement_score":0.028145345,"about_ca_system_score_codex":0.0024893095,"about_ca_system_score_gemma":0.0007479453,"threshold_uncertainty_score":0.09415555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022603396,0.00096630707,0.96888685,0.00060498243,0.0001652378,0.00034302383,0.00011374728,0.0012819375,0.0050345347],"genre_scores_gemma":[0.3756763,0.00069534744,0.61687064,0.0004738806,0.00019939466,0.0007687683,0.00036079928,0.00036240937,0.0045924936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496436,0.0023373112,0.00042876805,0.0008430911,0.0010671491,0.00035933993],"domain_scores_gemma":[0.9828415,0.010900117,0.0014314303,0.0028582898,0.0011501312,0.00081868103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009013747,0.0014053126,0.0023568391,0.0016460316,0.0010735671,0.0021685667,0.0031920734,0.002126285,0.0058400636],"category_scores_gemma":[0.04487096,0.0010395374,0.0010070226,0.0018579005,0.0015962298,0.004988798,0.003238568,0.003266482,0.0014537326],"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.0006776383,0.0005098285,0.0028403846,0.00037975394,0.00011302116,0.00013882485,0.0002600687,0.5824155,0.002192076,0.100034125,0.0068251644,0.3036136],"study_design_scores_gemma":[0.00015816266,0.00026155045,0.00022405136,0.00005790221,0.00003259712,0.00006428976,0.000047911966,0.91486144,0.0011634779,0.07869475,0.004413302,0.000020479376],"about_ca_topic_score_codex":0.001159898,"about_ca_topic_score_gemma":0.0016960503,"teacher_disagreement_score":0.009013747,"about_ca_system_score_codex":0.0016282053,"about_ca_system_score_gemma":0.0027589404,"threshold_uncertainty_score":0.04766977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028315708,0.000118720556,0.99444443,0.0003750269,0.000076418415,0.00007340555,0.000116124575,0.00038101355,0.0015832699],"genre_scores_gemma":[0.30843243,0.00088038616,0.67491746,0.0010624753,0.00033461401,0.0009824026,0.0006467079,0.00035793093,0.012385577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962572,0.0017076113,0.00018842008,0.0007088941,0.0008467886,0.00029107413],"domain_scores_gemma":[0.99123526,0.0050964984,0.0004943124,0.001882087,0.000987745,0.00030408864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043088803,0.0008094099,0.0013538754,0.0017265051,0.0013565968,0.002467091,0.0031179874,0.0015822238,0.007050019],"category_scores_gemma":[0.017955888,0.0007612928,0.0013536576,0.0032489859,0.0023494589,0.007788418,0.0034644888,0.002483022,0.0012045399],"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.00021270773,0.000052557156,0.0007729031,0.00027214817,0.000094565265,0.00009298133,0.0002265744,0.10591051,0.0018405531,0.7835851,0.006831066,0.10010829],"study_design_scores_gemma":[0.000040805113,0.00007046109,0.00017399337,0.000030421605,0.000056367906,0.00009360242,0.000047283283,0.49712262,0.0029434273,0.4838111,0.015566002,0.000043842258],"about_ca_topic_score_codex":0.0030936275,"about_ca_topic_score_gemma":0.0039894576,"teacher_disagreement_score":0.007050019,"about_ca_system_score_codex":0.0017682473,"about_ca_system_score_gemma":0.0023687952,"threshold_uncertainty_score":0.023584604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020736227,0.0006517232,0.9563824,0.0006963282,0.00013589587,0.000077093675,0.0008134429,0.0005146731,0.019992152],"genre_scores_gemma":[0.3847906,0.001196782,0.5904222,0.00037949288,0.00042006135,0.00034847812,0.0024340237,0.0003273991,0.01968099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967727,0.00089514337,0.0002843237,0.00061776175,0.0011580172,0.00027195894],"domain_scores_gemma":[0.98976433,0.0070530344,0.0006724205,0.000984597,0.0009480876,0.0005776132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00396129,0.00079393864,0.00088639674,0.0014997848,0.0011495026,0.002979249,0.0015386736,0.0009968588,0.011660383],"category_scores_gemma":[0.01193002,0.00079082395,0.0018335049,0.0033578817,0.0022626305,0.0071918396,0.0025992028,0.0032009813,0.00086737954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011110539,0.000049898397,0.000438302,0.00013830863,0.000033385448,0.00017415953,0.00013291083,0.033382308,0.00092635886,0.940485,0.0035215435,0.020606775],"study_design_scores_gemma":[0.000023112034,0.00002362711,0.00027637318,0.000024016446,0.000035002555,0.00018178052,0.00005386505,0.17570181,0.0010369017,0.81166065,0.010961054,0.000021785625],"about_ca_topic_score_codex":0.0032936477,"about_ca_topic_score_gemma":0.0068994355,"teacher_disagreement_score":0.011660383,"about_ca_system_score_codex":0.001293636,"about_ca_system_score_gemma":0.002377566,"threshold_uncertainty_score":0.039007902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009944898,0.0006624335,0.97183627,0.00067710807,0.000116587406,0.00018976576,0.00039784695,0.0009853152,0.015189827],"genre_scores_gemma":[0.108384,0.0004986978,0.88096255,0.0003554459,0.00013074963,0.0008070896,0.0009623577,0.00081887434,0.0070802174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704677,0.0015600999,0.000083696876,0.00018532801,0.0007235632,0.0004005678],"domain_scores_gemma":[0.9909615,0.007240686,0.00032128402,0.0006369996,0.00069248467,0.0001469741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003606599,0.0015554583,0.0019156457,0.0027241586,0.0016605826,0.0027437052,0.0029246872,0.0026758295,0.019147629],"category_scores_gemma":[0.01773713,0.0011141256,0.0017454321,0.0045075607,0.0015627183,0.0027678353,0.0020273535,0.004604132,0.0030211965],"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.00021063608,0.00029376434,0.00034717078,0.00025771224,0.000055043216,0.000051490762,0.00019332134,0.66525626,0.0011241218,0.12026702,0.015445638,0.19649789],"study_design_scores_gemma":[0.000048962836,0.00003182131,0.00012131381,0.000048949623,0.0000135533,0.00001897506,0.000034893717,0.94588304,0.00051091245,0.050836917,0.0024352488,0.000015482105],"about_ca_topic_score_codex":0.009088437,"about_ca_topic_score_gemma":0.011636366,"teacher_disagreement_score":0.019147629,"about_ca_system_score_codex":0.0021299648,"about_ca_system_score_gemma":0.0032983173,"threshold_uncertainty_score":0.064055204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006354679,0.0065172487,0.9800355,0.00085203437,0.0003176341,0.00009441919,0.00023553541,0.00045656788,0.0108555565],"genre_scores_gemma":[0.024845053,0.0117870895,0.9488552,0.00048969383,0.00068098964,0.0006093554,0.00059715804,0.00046441387,0.011671094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976057,0.0009119848,0.00016088587,0.0002576022,0.00099025,0.00007354114],"domain_scores_gemma":[0.99364144,0.0045803473,0.00020685753,0.00054861547,0.0009137363,0.00010906854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022879993,0.0023691594,0.0020809902,0.0023582152,0.0012157983,0.0032145155,0.0026668808,0.0018361493,0.019260362],"category_scores_gemma":[0.009727557,0.0009960595,0.0016336155,0.0077086287,0.0023214489,0.0032101688,0.0016834346,0.00524781,0.004969094],"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.00004370201,0.00009240747,0.00022891296,0.0017338194,0.00012025821,0.00008213734,0.00023776431,0.032701172,0.0013221109,0.57866627,0.0467358,0.33803564],"study_design_scores_gemma":[0.000051686497,0.000022704882,0.00015205436,0.00040633453,0.00005934216,0.000096039876,0.000093223185,0.15096314,0.0013895063,0.6999683,0.14676397,0.00003371069],"about_ca_topic_score_codex":0.005810369,"about_ca_topic_score_gemma":0.0069616493,"teacher_disagreement_score":0.019260362,"about_ca_system_score_codex":0.0014060201,"about_ca_system_score_gemma":0.0023806046,"threshold_uncertainty_score":0.06443238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.167085,0.00054986606,0.82627743,0.0004990835,0.000029893432,0.00012520744,0.00029687022,0.00023247584,0.004904106],"genre_scores_gemma":[0.93695974,0.00031239996,0.058724232,0.00009074095,0.000028929922,0.00017272861,0.00033179251,0.00006554657,0.0033138616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729604,0.0014141009,0.00010616523,0.0003085511,0.00045292,0.0004222126],"domain_scores_gemma":[0.99006313,0.0080974065,0.00049761304,0.00027106248,0.00068877265,0.00038195724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038936073,0.0012253054,0.001784902,0.0010221452,0.0005426769,0.0019821802,0.0016342914,0.0018800577,0.0042281128],"category_scores_gemma":[0.016371904,0.0009877806,0.0007839735,0.0013098146,0.0011493777,0.002458814,0.0016024817,0.0017848951,0.00042815087],"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.00015620785,0.000047772923,0.0013720735,0.000053847634,0.00003206628,0.00006759768,0.000078641744,0.9817151,0.000276351,0.009488692,0.00046958728,0.006242106],"study_design_scores_gemma":[0.000004358407,0.000013075539,0.000103069964,0.0000025239922,0.0000022700913,0.0000055235787,0.0000134925185,0.99723524,0.00003962541,0.0025219005,0.00005639119,0.0000026371745],"about_ca_topic_score_codex":0.012886376,"about_ca_topic_score_gemma":0.0068397596,"teacher_disagreement_score":0.012886376,"about_ca_system_score_codex":0.0017752488,"about_ca_system_score_gemma":0.0009428697,"threshold_uncertainty_score":0.025622725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042024165,0.0009980615,0.8630867,0.0036837107,0.00038309587,0.000084177555,0.00039104765,0.0002954258,0.08905355],"genre_scores_gemma":[0.8120132,0.0006277956,0.17575416,0.0009628352,0.00033272026,0.00024829572,0.00047642118,0.00015642113,0.009428185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972819,0.0009364553,0.00025345557,0.00059164176,0.0007404864,0.00019593353],"domain_scores_gemma":[0.99682176,0.0013024353,0.00037519133,0.00084985315,0.00045951235,0.00019123165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024059995,0.0005895931,0.00048842013,0.0015981414,0.0018221751,0.0036241382,0.0009927186,0.0013052281,0.006426769],"category_scores_gemma":[0.0048100743,0.0005701668,0.0014604623,0.0013998023,0.009510135,0.011280716,0.0045704204,0.0035342854,0.00075891695],"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.0000035258665,0.000002648505,0.000057721234,0.000013562952,0.0000026646003,0.000020238247,0.00009264265,0.00027322726,0.00018056965,0.9979055,0.0001817304,0.0012660207],"study_design_scores_gemma":[0.0000042106644,0.0000113811075,0.00015563186,0.000014639157,0.0000052063288,0.00009864347,0.000074716285,0.0020733457,0.00042147606,0.9889235,0.008208417,0.000008749514],"about_ca_topic_score_codex":0.0010258147,"about_ca_topic_score_gemma":0.001129336,"teacher_disagreement_score":0.006426769,"about_ca_system_score_codex":0.0016233348,"about_ca_system_score_gemma":0.0008891018,"threshold_uncertainty_score":0.021499753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010186333,0.00010058915,0.995184,0.00069081946,0.000056814122,0.00004756623,0.00006255994,0.00011934031,0.0027196384],"genre_scores_gemma":[0.19552943,0.00088269653,0.7960644,0.0004186764,0.0007583739,0.0005176645,0.00029588345,0.00023073335,0.0053021195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367213,0.002646014,0.00034813787,0.0007474847,0.0020856522,0.00050055655],"domain_scores_gemma":[0.9917767,0.00479978,0.0005402065,0.0013590577,0.0010315378,0.000492735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006873243,0.0018466576,0.0018583243,0.002044562,0.0024403678,0.0052980664,0.0044761417,0.002794301,0.0072475807],"category_scores_gemma":[0.018738072,0.0015626826,0.001959689,0.0033892067,0.0053364662,0.007011371,0.0045427056,0.0063891504,0.001233782],"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.000023255889,0.00004959794,0.00012513272,0.00007066453,0.000019267567,0.000072437906,0.00010418194,0.19293119,0.0004396228,0.7935154,0.002392587,0.010256773],"study_design_scores_gemma":[0.000017015123,0.000028303923,0.000041428357,0.000018486553,0.000010955585,0.000056231176,0.00004727744,0.54700834,0.00019424583,0.44725934,0.0053000995,0.000018281724],"about_ca_topic_score_codex":0.006934546,"about_ca_topic_score_gemma":0.007183987,"teacher_disagreement_score":0.0072475807,"about_ca_system_score_codex":0.004201659,"about_ca_system_score_gemma":0.006145223,"threshold_uncertainty_score":0.036349654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009439571,0.00007200276,0.98739237,0.00007747677,0.000012446711,0.00011835019,0.00011493287,0.0012074568,0.0015653872],"genre_scores_gemma":[0.14479354,0.00006625185,0.8532599,0.000055470588,0.000011989471,0.0003796389,0.00021816592,0.00011175667,0.0011031919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998906,0.00049202394,0.000080198835,0.00015686217,0.00029154035,0.000073492614],"domain_scores_gemma":[0.9978002,0.001693412,0.000113105234,0.000101158555,0.00022744772,0.00006463931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024137178,0.0010100852,0.00080804277,0.0011577632,0.0004026314,0.0011354483,0.0011378478,0.00093163684,0.00758302],"category_scores_gemma":[0.0043709753,0.0004234149,0.0010583637,0.0008774051,0.00041523384,0.00090761663,0.00095740706,0.0008837479,0.00060559006],"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.00037020762,0.00033256484,0.0014200364,0.00062210526,0.00018565089,0.00049348804,0.00081017707,0.6036131,0.00916378,0.039675955,0.0040435465,0.3392695],"study_design_scores_gemma":[0.00008721047,0.0000738127,0.00025464367,0.000045641125,0.000035304634,0.000087405395,0.00006469132,0.98066115,0.0023496593,0.0101858545,0.0061276583,0.00002697098],"about_ca_topic_score_codex":0.00268531,"about_ca_topic_score_gemma":0.0037744113,"teacher_disagreement_score":0.00758302,"about_ca_system_score_codex":0.000678472,"about_ca_system_score_gemma":0.0010534679,"threshold_uncertainty_score":0.025367737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6176532,0.000811878,0.36806569,0.002157834,0.000022782488,0.00024068185,0.0007635567,0.00031601268,0.009968425],"genre_scores_gemma":[0.9341984,0.00066527724,0.06228119,0.00014777576,0.00009548265,0.00022527072,0.00091857044,0.000045659108,0.0014223414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951031,0.0016275733,0.00047832655,0.0008359481,0.001453992,0.00050107046],"domain_scores_gemma":[0.9799168,0.01498477,0.00194793,0.0018141387,0.0007426206,0.00059381325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030638054,0.00052306574,0.0011368765,0.002715432,0.0013069093,0.005754228,0.0015350342,0.0013593652,0.0032102237],"category_scores_gemma":[0.01814604,0.00048192046,0.0021861098,0.002914454,0.004282611,0.014247015,0.0026155582,0.0025133372,0.000199937],"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.00016409776,0.00020818118,0.006120481,0.00028244383,0.00013996338,0.00016895063,0.0007973919,0.099348746,0.0036255699,0.85715294,0.00092251704,0.031068861],"study_design_scores_gemma":[0.00002611031,0.000034477307,0.0011156814,0.000028464798,0.000027461847,0.0000763849,0.00018458204,0.14146283,0.0017291072,0.8542411,0.0010446494,0.000029158366],"about_ca_topic_score_codex":0.0030378264,"about_ca_topic_score_gemma":0.0022030817,"teacher_disagreement_score":0.005754228,"about_ca_system_score_codex":0.0035504303,"about_ca_system_score_gemma":0.001958695,"threshold_uncertainty_score":0.025760233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029403264,0.00020791884,0.95979714,0.0007948316,0.000036378122,0.00016491604,0.0007295917,0.00079670385,0.008069139],"genre_scores_gemma":[0.44549432,0.0008410464,0.5378852,0.00065423356,0.00036768644,0.0006830002,0.004020379,0.0005608913,0.009493295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99138314,0.0018554576,0.0006262065,0.0018146932,0.0032210704,0.001099445],"domain_scores_gemma":[0.9584879,0.033943634,0.0019640492,0.0038885854,0.0012553849,0.00046040505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059168693,0.00084548024,0.001190254,0.0017779396,0.0019840666,0.0043888805,0.0026264875,0.0013708188,0.0077644875],"category_scores_gemma":[0.029496253,0.0015081299,0.00449175,0.0028211435,0.003482979,0.0104693035,0.0034482006,0.007441396,0.00085938437],"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.00022142424,0.00020262103,0.0020114614,0.00037382255,0.00008783071,0.00036349834,0.0007719365,0.047309026,0.0036614009,0.8704905,0.0035774133,0.07092901],"study_design_scores_gemma":[0.000056139324,0.000045459066,0.00054268294,0.000054135136,0.00006195347,0.00030994494,0.00010102255,0.18685097,0.00667761,0.79882824,0.006432902,0.00003902109],"about_ca_topic_score_codex":0.0050631706,"about_ca_topic_score_gemma":0.008730722,"teacher_disagreement_score":0.0077644875,"about_ca_system_score_codex":0.0026581693,"about_ca_system_score_gemma":0.003099567,"threshold_uncertainty_score":0.031291723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058816228,0.00022880861,0.9316226,0.0008592086,0.000080728074,0.00013863022,0.0004007116,0.00085541577,0.0069975248],"genre_scores_gemma":[0.5806954,0.00058404624,0.4134705,0.00040295057,0.000118161246,0.00033007757,0.0013175788,0.00035128414,0.0027300257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9796067,0.0055276295,0.0023017747,0.0025927757,0.008464382,0.0015066685],"domain_scores_gemma":[0.9664156,0.016426116,0.0031053924,0.008244633,0.0051953956,0.0006128571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010469476,0.0007428277,0.0012871694,0.002014114,0.0019532691,0.0044198213,0.0036240472,0.0021699353,0.0026632042],"category_scores_gemma":[0.04301233,0.0010043029,0.004382838,0.0030682874,0.006824508,0.012054087,0.007452509,0.0039889067,0.0005115774],"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.00012911523,0.00003683913,0.0011058456,0.00013221934,0.00011565208,0.00020880584,0.00077998487,0.0359811,0.002864701,0.9379934,0.0007651364,0.019887324],"study_design_scores_gemma":[0.0000698731,0.000044110122,0.00041848447,0.00007424544,0.00009038208,0.000121569276,0.00044759654,0.09123659,0.011342293,0.88752455,0.008567958,0.00006234166],"about_ca_topic_score_codex":0.010606032,"about_ca_topic_score_gemma":0.0056827506,"teacher_disagreement_score":0.010606032,"about_ca_system_score_codex":0.0033485247,"about_ca_system_score_gemma":0.0050589084,"threshold_uncertainty_score":0.055368543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002067583,0.00034605543,0.9897934,0.00034518295,0.00006538622,0.000094942065,0.000058163863,0.000128727,0.0071005286],"genre_scores_gemma":[0.16257612,0.0010157052,0.82423514,0.000239734,0.00022399475,0.0007570613,0.00030568108,0.00021840126,0.010428079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720407,0.001413008,0.00015282884,0.00029016536,0.0006964159,0.00024357319],"domain_scores_gemma":[0.9978574,0.0013826053,0.00010841414,0.00021648766,0.00022339082,0.0002116951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434424,0.0012309966,0.001823151,0.0016335462,0.0019943917,0.0041156127,0.005088882,0.0023197003,0.010116659],"category_scores_gemma":[0.008312771,0.0011051323,0.0022987265,0.0030377556,0.002070205,0.0050236825,0.004382339,0.0043404526,0.0012864769],"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.000048756767,0.00008874869,0.00010223351,0.00010685195,0.000054061285,0.00012280757,0.00016482739,0.1430359,0.00049028604,0.82479167,0.0034984173,0.027495451],"study_design_scores_gemma":[0.000049462473,0.000024610548,0.000037133403,0.000032381595,0.00002309206,0.000049773786,0.000051126794,0.6209632,0.00017789626,0.36999804,0.008573902,0.000019292942],"about_ca_topic_score_codex":0.0048883366,"about_ca_topic_score_gemma":0.0047993697,"teacher_disagreement_score":0.010116659,"about_ca_system_score_codex":0.0018771653,"about_ca_system_score_gemma":0.0022474185,"threshold_uncertainty_score":0.033843637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01297809,0.00042286576,0.98123807,0.00022031623,0.000057184792,0.0003006063,0.000080025224,0.00039843205,0.0043044495],"genre_scores_gemma":[0.14389768,0.0005456678,0.8528997,0.00011971417,0.000055721226,0.00039288023,0.00022566217,0.00012214856,0.0017408527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972669,0.0011668666,0.00015642444,0.00023554961,0.0008871587,0.00028719348],"domain_scores_gemma":[0.996002,0.0027450444,0.00036027742,0.00033879484,0.0004215007,0.00013234907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027945666,0.001292309,0.0013933894,0.0023947034,0.0011509291,0.001548489,0.0018582508,0.00094100833,0.0035830152],"category_scores_gemma":[0.008213724,0.000731195,0.0011165816,0.0033133405,0.0014213672,0.0019019935,0.0014673902,0.0016493723,0.00049515895],"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.00015161179,0.00022106034,0.0009816581,0.00041832225,0.000083227475,0.00024380877,0.00030994412,0.6711393,0.0049700197,0.13198732,0.004669792,0.18482386],"study_design_scores_gemma":[0.000119819175,0.00009267875,0.00021181365,0.000061396575,0.000034185123,0.000117296666,0.000120876924,0.9178196,0.0037000861,0.07045287,0.007236635,0.000032716496],"about_ca_topic_score_codex":0.003915229,"about_ca_topic_score_gemma":0.0066641853,"teacher_disagreement_score":0.003915229,"about_ca_system_score_codex":0.0015160989,"about_ca_system_score_gemma":0.003039738,"threshold_uncertainty_score":0.01477927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011616084,0.0013645145,0.9488678,0.006026787,0.0005575395,0.000103315375,0.0011390181,0.00095629925,0.029368624],"genre_scores_gemma":[0.2871255,0.0021291908,0.69306475,0.002921446,0.00065501593,0.00029878737,0.0023280936,0.0005484033,0.010928849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997131,0.0011689754,0.00026260575,0.000602824,0.0007380345,0.00009655365],"domain_scores_gemma":[0.9953732,0.0023810707,0.00041495793,0.0008742516,0.00083983364,0.00011668082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027869628,0.00093418744,0.00054261356,0.00208217,0.0017849656,0.0044299383,0.0016713715,0.0014508187,0.009254813],"category_scores_gemma":[0.011940912,0.00046550183,0.0008992489,0.0021962998,0.004410176,0.010464952,0.0020741324,0.002468684,0.0027003696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074574855,0.000015901845,0.0008573627,0.00037912495,0.000045926015,0.0002793424,0.0049040685,0.0045918394,0.004495583,0.9010902,0.01562654,0.067639515],"study_design_scores_gemma":[0.000018549074,0.000048416976,0.0007251501,0.0002084197,0.00004744642,0.0006684618,0.0031477686,0.022075808,0.004154324,0.67995447,0.28888017,0.00007103273],"about_ca_topic_score_codex":0.003549418,"about_ca_topic_score_gemma":0.0028281168,"teacher_disagreement_score":0.009254813,"about_ca_system_score_codex":0.0011450534,"about_ca_system_score_gemma":0.0008706084,"threshold_uncertainty_score":0.03096044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034568384,0.0005306884,0.9889414,0.00016500606,0.00008710978,0.00018500892,0.00012215707,0.0012301318,0.005281755],"genre_scores_gemma":[0.039056845,0.00038360173,0.9543443,0.00020151759,0.00006568682,0.00045999582,0.0006097074,0.0005428329,0.0043355455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963187,0.0013188676,0.00023033695,0.0005304436,0.0011521021,0.0004495758],"domain_scores_gemma":[0.989239,0.0073126783,0.0005243114,0.0014147715,0.0012372616,0.00027194014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003812733,0.002243755,0.0026400778,0.0035053836,0.001452091,0.0034794062,0.006596986,0.0026965942,0.017324805],"category_scores_gemma":[0.021725986,0.0017575794,0.0019030899,0.007672381,0.0014053409,0.0056398436,0.0028982372,0.004774964,0.0036950025],"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.00041683708,0.00039722407,0.0005105385,0.0005160959,0.00011250378,0.000069261485,0.00016630975,0.2512099,0.0023326236,0.12823682,0.022804629,0.5932272],"study_design_scores_gemma":[0.00009657919,0.000060991417,0.00014119394,0.000076406905,0.000043800832,0.000050580205,0.000033515014,0.90695155,0.0017293252,0.08589337,0.0048984247,0.00002429243],"about_ca_topic_score_codex":0.0054374496,"about_ca_topic_score_gemma":0.008464715,"teacher_disagreement_score":0.017324805,"about_ca_system_score_codex":0.0028327908,"about_ca_system_score_gemma":0.0038024508,"threshold_uncertainty_score":0.057957232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05782711,0.00032702074,0.90110666,0.0007456694,0.00025481786,0.0003414809,0.0021093427,0.0070012794,0.030286696],"genre_scores_gemma":[0.257171,0.00021773297,0.7294673,0.00023744644,0.000079854195,0.0003530663,0.0024463595,0.00041188585,0.009615422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.000089384484,0.000021842781,0.000123314,0.00011217914,0.00008066971],"domain_scores_gemma":[0.9994623,0.00027390107,0.00005065462,0.000087692104,0.000088255816,0.00003718185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047964865,0.0007436168,0.0005732168,0.00049496,0.00059154595,0.0009237143,0.0015507784,0.0007487743,0.0110684335],"category_scores_gemma":[0.0012756567,0.00050733617,0.0010852064,0.00109755,0.00042762776,0.0008403987,0.0009086321,0.001055001,0.0014699965],"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.00030415188,0.00016914868,0.0011746443,0.00027786652,0.00009774751,0.00031175968,0.00007380994,0.8390207,0.008783227,0.03589092,0.017628677,0.09626729],"study_design_scores_gemma":[0.00009242471,0.000045569697,0.00016670387,0.0000057619145,0.000014434195,0.00005415903,0.000018579283,0.9800541,0.0024727425,0.01109506,0.0059724385,0.000007980872],"about_ca_topic_score_codex":0.005600208,"about_ca_topic_score_gemma":0.010558083,"teacher_disagreement_score":0.0110684335,"about_ca_system_score_codex":0.0007082343,"about_ca_system_score_gemma":0.0020965273,"threshold_uncertainty_score":0.037027597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013785428,0.000533173,0.97314817,0.000564151,0.00013626076,0.00015441001,0.0004987112,0.0005367726,0.010642937],"genre_scores_gemma":[0.1786436,0.0009052342,0.80944854,0.0003351754,0.00027178932,0.0004021738,0.0019344068,0.00035754713,0.0077015827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646395,0.0010641178,0.00020984419,0.00076299626,0.0011303928,0.0003687043],"domain_scores_gemma":[0.9933695,0.004907308,0.0003198438,0.00046399178,0.0006955949,0.00024371495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030635435,0.0014293744,0.0012561567,0.0011093768,0.0009309554,0.0022594763,0.0018470375,0.0014464181,0.012479311],"category_scores_gemma":[0.010967519,0.00063338043,0.0018999152,0.0023571071,0.0012637086,0.0030169338,0.0032558383,0.0029364843,0.0010336023],"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.0002765552,0.0002850071,0.0016834866,0.001629288,0.00031229836,0.0008786081,0.00042835955,0.44052458,0.005599602,0.33536962,0.022135334,0.19087733],"study_design_scores_gemma":[0.00008723047,0.00008655196,0.0004316062,0.00008694924,0.000083816114,0.0003343637,0.00019663502,0.72179776,0.0038880361,0.24870828,0.024255572,0.000043252607],"about_ca_topic_score_codex":0.0022864782,"about_ca_topic_score_gemma":0.003869163,"teacher_disagreement_score":0.012479311,"about_ca_system_score_codex":0.00079606177,"about_ca_system_score_gemma":0.0021941483,"threshold_uncertainty_score":0.04174745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056180614,0.00015921817,0.9906544,0.0006710125,0.000025025121,0.00008157825,0.00028388688,0.00041621516,0.0020905884],"genre_scores_gemma":[0.113740005,0.00046041782,0.8801715,0.0005128579,0.000077986886,0.00035360747,0.00083568715,0.0002971207,0.003550829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99328965,0.0026644277,0.0007384412,0.0013197436,0.0014938817,0.0004939212],"domain_scores_gemma":[0.9827723,0.011485794,0.0013152467,0.0027039356,0.0014825957,0.00024026046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009701204,0.00092304475,0.0010950075,0.001580344,0.0013918622,0.006138374,0.0038846093,0.0017716079,0.00348966],"category_scores_gemma":[0.021186868,0.0011458964,0.0020302276,0.0036971555,0.0042107045,0.012842016,0.004850162,0.0043577724,0.0005121688],"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.00009554237,0.00002955621,0.0009876769,0.0003581136,0.000055129658,0.00060599326,0.0010707378,0.07669552,0.0014538548,0.8460075,0.004310628,0.06832977],"study_design_scores_gemma":[0.00006566458,0.000052976906,0.00030490351,0.00021798973,0.000078991165,0.00058875186,0.0004693854,0.26363274,0.006757449,0.6706938,0.057073656,0.000063531865],"about_ca_topic_score_codex":0.00818987,"about_ca_topic_score_gemma":0.008406635,"teacher_disagreement_score":0.009701204,"about_ca_system_score_codex":0.0026557648,"about_ca_system_score_gemma":0.0032248267,"threshold_uncertainty_score":0.051305473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032728252,0.0016982659,0.98486507,0.0005388571,0.0006429265,0.000081132064,0.00044269857,0.00036323824,0.008094887],"genre_scores_gemma":[0.12736346,0.004720258,0.84656173,0.0010723337,0.0010927789,0.00031311135,0.002362408,0.00064767484,0.015866298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984118,0.00021342572,0.00013626849,0.00046547205,0.0006612929,0.00011170989],"domain_scores_gemma":[0.99885166,0.00026553203,0.00014366681,0.0002488498,0.00041275244,0.000077479155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128022,0.000979145,0.0009790619,0.0023828265,0.0007155979,0.0026850877,0.0017765319,0.001273958,0.004907715],"category_scores_gemma":[0.0039354987,0.00046915334,0.001262212,0.00424143,0.002499538,0.0050242096,0.0027940073,0.0025921972,0.0029125814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001286714,0.00010400766,0.0021896248,0.00060075213,0.00012905075,0.00028930116,0.0002484472,0.03026046,0.021055775,0.45054367,0.033060182,0.46139005],"study_design_scores_gemma":[0.000062902756,0.00047602068,0.002876497,0.00035500783,0.00011593997,0.0020950804,0.0004361069,0.1957028,0.027616454,0.31725168,0.45259228,0.0004191548],"about_ca_topic_score_codex":0.0034248387,"about_ca_topic_score_gemma":0.0022502558,"teacher_disagreement_score":0.004907715,"about_ca_system_score_codex":0.0010002814,"about_ca_system_score_gemma":0.0012966958,"threshold_uncertainty_score":0.01641798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03025546,0.00018618783,0.96204764,0.0006070651,0.000029128787,0.00012612609,0.00014151461,0.00035803384,0.0062488923],"genre_scores_gemma":[0.36839563,0.00030316538,0.62743664,0.00022989887,0.00006837076,0.00016978795,0.00029462084,0.00011271444,0.0029891888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532914,0.0019634455,0.00032400823,0.0005551396,0.0015095648,0.00031857635],"domain_scores_gemma":[0.99209917,0.004895296,0.0005846525,0.0013030272,0.0008030758,0.00031487976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037921888,0.00083682314,0.0007428702,0.0010735077,0.0010536506,0.0029698196,0.0016270223,0.0009542366,0.0051372345],"category_scores_gemma":[0.014008967,0.0004981416,0.0012382488,0.0024502082,0.0015678656,0.006038654,0.0027532002,0.002348404,0.0005131324],"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.00023581478,0.0001898314,0.0016360901,0.00039675363,0.00013261862,0.00045309155,0.0007441338,0.32548317,0.008982659,0.44359323,0.0058121793,0.21234044],"study_design_scores_gemma":[0.000030949162,0.000058830352,0.00027016987,0.00005245465,0.00004105779,0.0002028114,0.00020809149,0.74217,0.0060736015,0.24020602,0.010657328,0.000028676575],"about_ca_topic_score_codex":0.0043222657,"about_ca_topic_score_gemma":0.0046325424,"teacher_disagreement_score":0.0051372345,"about_ca_system_score_codex":0.0011967933,"about_ca_system_score_gemma":0.001866075,"threshold_uncertainty_score":0.020055234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006673618,0.00005469887,0.99639773,0.00037698765,0.000023072029,0.00008699465,0.0001461611,0.0003215481,0.0019253205],"genre_scores_gemma":[0.036010228,0.00015467829,0.96215963,0.00010890391,0.00003679907,0.00037040943,0.00037248596,0.00007648424,0.0007103618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705935,0.0011784298,0.00033314255,0.00045921354,0.000732601,0.00023724175],"domain_scores_gemma":[0.99470705,0.002608636,0.0005604339,0.00095202605,0.0008123378,0.00035959357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068995925,0.0015812682,0.0011059447,0.0029741218,0.0021634684,0.004807206,0.004998567,0.002177415,0.007921578],"category_scores_gemma":[0.012362655,0.0011754748,0.004154772,0.0027824529,0.004793722,0.0057640984,0.0058276877,0.0037667986,0.0011394133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018483055,0.000047701284,0.00024347231,0.00015752335,0.00004801154,0.00023671084,0.0005223902,0.080824815,0.00072664913,0.90078855,0.0015950388,0.014790684],"study_design_scores_gemma":[0.000052006173,0.00004133356,0.000111881614,0.00013431288,0.000051330328,0.00018097144,0.00033354716,0.33204296,0.0009723258,0.63504916,0.030976368,0.000053813634],"about_ca_topic_score_codex":0.02238425,"about_ca_topic_score_gemma":0.020100594,"teacher_disagreement_score":0.02238425,"about_ca_system_score_codex":0.002825852,"about_ca_system_score_gemma":0.0047095655,"threshold_uncertainty_score":0.04450792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024149385,0.0032291575,0.88555795,0.0009014135,0.0005652936,0.0001473375,0.0007513836,0.0006125877,0.10581989],"genre_scores_gemma":[0.117225155,0.008198501,0.83643824,0.0011284535,0.0011016802,0.00062054995,0.0019007346,0.00050022436,0.03288654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976802,0.00043953216,0.00025670123,0.00044968145,0.0010256805,0.00014828503],"domain_scores_gemma":[0.99832064,0.0005811781,0.00018912157,0.00041300504,0.0004236225,0.000072427865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015239858,0.0011538513,0.00076946453,0.0014869453,0.0010614197,0.0045737447,0.0024944975,0.00090599793,0.018707218],"category_scores_gemma":[0.006281598,0.00046771666,0.0010221803,0.0032600097,0.002681909,0.005901007,0.0027683843,0.0029765577,0.0066960696],"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.000014177537,0.000007990341,0.00005135633,0.00011546648,0.0000069794028,0.00002654602,0.00009342916,0.0023708784,0.0003830274,0.96276796,0.0058536916,0.028308515],"study_design_scores_gemma":[0.000015552596,0.0000317546,0.000113178685,0.00014008128,0.000014178003,0.00019437475,0.000085131964,0.011393107,0.0012743549,0.760539,0.22617765,0.000021711476],"about_ca_topic_score_codex":0.0012535589,"about_ca_topic_score_gemma":0.0011332575,"teacher_disagreement_score":0.018707218,"about_ca_system_score_codex":0.0014452809,"about_ca_system_score_gemma":0.0011539585,"threshold_uncertainty_score":0.0625819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042023216,0.00036441805,0.97542,0.00032310476,0.00011645434,0.00013636606,0.0006903312,0.002581147,0.016165912],"genre_scores_gemma":[0.14853822,0.000742031,0.8384904,0.0005699542,0.00020593728,0.00041652398,0.0030052115,0.0010721702,0.006959617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586713,0.0011079132,0.00028682704,0.0010322637,0.0012609641,0.0004448571],"domain_scores_gemma":[0.99627185,0.0013106252,0.00018872821,0.0016060512,0.0005039616,0.000118889744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001966056,0.0013928867,0.0011896215,0.0015017156,0.0008940247,0.0029857317,0.0035154098,0.0013216151,0.015073223],"category_scores_gemma":[0.008052883,0.00095538097,0.0023029558,0.0038418686,0.0022184353,0.0051651383,0.0056089805,0.0049872175,0.0029281015],"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.0001733009,0.00013988408,0.0009874976,0.00081440987,0.0002156956,0.00040804697,0.00028039629,0.1280851,0.0051337522,0.57656986,0.015568913,0.2716231],"study_design_scores_gemma":[0.00008190117,0.000120673016,0.000587914,0.0001819285,0.00019767504,0.0003477075,0.000096242875,0.39906642,0.008768,0.49698514,0.09351013,0.000056245895],"about_ca_topic_score_codex":0.004797846,"about_ca_topic_score_gemma":0.0075679705,"teacher_disagreement_score":0.015073223,"about_ca_system_score_codex":0.001091879,"about_ca_system_score_gemma":0.0021181079,"threshold_uncertainty_score":0.050424933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069855107,0.0014121559,0.94521946,0.00063300447,0.00027120102,0.00013336021,0.00033821852,0.0013466413,0.043660473],"genre_scores_gemma":[0.18046694,0.0011382055,0.7786574,0.00076654035,0.00023612197,0.00031003254,0.0013214917,0.0009815838,0.0361217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980621,0.00080629624,0.0000633094,0.00043058168,0.0005227207,0.00011505998],"domain_scores_gemma":[0.9985537,0.0006196625,0.00006644579,0.00052628474,0.00017313108,0.00006082424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013861451,0.0012450621,0.0019384263,0.0018734783,0.0010353709,0.0024419727,0.0022239455,0.001928844,0.030444436],"category_scores_gemma":[0.0055998606,0.0007429492,0.0015456025,0.0028366498,0.00153296,0.0025298586,0.0035619033,0.0028281289,0.005108092],"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.0001783481,0.00014118159,0.00034763128,0.0004392519,0.00017799248,0.0002310143,0.00014699281,0.11376403,0.00323752,0.5332203,0.025749695,0.3223661],"study_design_scores_gemma":[0.00011535417,0.00008939265,0.00024278084,0.000113366004,0.00008563185,0.0002574593,0.00008927704,0.48098338,0.0030532235,0.46298307,0.051945083,0.000041929947],"about_ca_topic_score_codex":0.0014201609,"about_ca_topic_score_gemma":0.0029460397,"teacher_disagreement_score":0.030444436,"about_ca_system_score_codex":0.00089886686,"about_ca_system_score_gemma":0.0011899616,"threshold_uncertainty_score":0.101846814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11681313,0.0013572619,0.85396177,0.0035363869,0.0001083279,0.00026902466,0.00064466184,0.0006994916,0.02260992],"genre_scores_gemma":[0.92673737,0.0009832891,0.061300855,0.0007665492,0.00022711288,0.00060299656,0.00052038394,0.00015863594,0.008702828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617445,0.0011709642,0.0002273647,0.00064208236,0.0011643032,0.0006208432],"domain_scores_gemma":[0.98563355,0.009352142,0.001966627,0.0012170577,0.000911192,0.0009193901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003329951,0.00088323565,0.0016048531,0.0015821115,0.0008910829,0.0036124468,0.002560358,0.0026287432,0.0059645567],"category_scores_gemma":[0.021597149,0.00079359906,0.0016685406,0.0014927201,0.0028558753,0.0061245514,0.0023872673,0.0037446006,0.00063941383],"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.000056271496,0.00007113953,0.0010172199,0.00008872375,0.000041016152,0.00018202378,0.00034551913,0.07910939,0.0016357382,0.9101265,0.0022977116,0.0050285566],"study_design_scores_gemma":[0.000038860297,0.000041411295,0.00032109255,0.000023643152,0.000013877118,0.00014866557,0.000075343276,0.31917557,0.00033727573,0.67772603,0.002068432,0.000029744431],"about_ca_topic_score_codex":0.0021594863,"about_ca_topic_score_gemma":0.0015708229,"teacher_disagreement_score":0.0059645567,"about_ca_system_score_codex":0.0024194184,"about_ca_system_score_gemma":0.001013998,"threshold_uncertainty_score":0.01995337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034487803,0.0010517167,0.9546716,0.0018671899,0.00012611797,0.00020955085,0.0006441105,0.0016666121,0.0052751815],"genre_scores_gemma":[0.7710171,0.0022627662,0.18181151,0.0012275258,0.00062358484,0.0016710961,0.0023825124,0.0012259358,0.037777916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961958,0.0013660999,0.00020852669,0.000999339,0.0006742149,0.0005560258],"domain_scores_gemma":[0.97768265,0.015757158,0.0016274503,0.00259099,0.0017127496,0.00062886946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068389634,0.0018393848,0.0035733639,0.0029990545,0.0016999058,0.004775451,0.006930731,0.0045776283,0.012716792],"category_scores_gemma":[0.035542313,0.0019820065,0.0033323858,0.0031098684,0.0038551912,0.010195794,0.0037411419,0.006032936,0.004782629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047707657,0.0001957403,0.0035433208,0.00031728199,0.00020608655,0.00020999217,0.0006746272,0.45471922,0.0023649922,0.5031335,0.008284322,0.025873872],"study_design_scores_gemma":[0.000038705617,0.000048821934,0.00037979762,0.000022493208,0.00003293046,0.00006299809,0.00003121411,0.889791,0.00022001058,0.10816384,0.0011813692,0.000026834465],"about_ca_topic_score_codex":0.010235387,"about_ca_topic_score_gemma":0.008985208,"teacher_disagreement_score":0.012716792,"about_ca_system_score_codex":0.0031595507,"about_ca_system_score_gemma":0.0018461188,"threshold_uncertainty_score":0.04254192},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03616869,0.005593776,0.13583079,0.013709401,0.0019394708,0.00003611803,0.000306686,0.00026484623,0.8061502],"genre_scores_gemma":[0.7822503,0.0053374134,0.042656146,0.005085209,0.002160726,0.00013700953,0.0005620166,0.00036732343,0.16144386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984528,0.0003703335,0.0000859251,0.000381696,0.0005341287,0.0001750974],"domain_scores_gemma":[0.99723935,0.0014199651,0.00019238096,0.00065793935,0.00031787905,0.00017247336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015268794,0.00056875095,0.00092800014,0.0023314608,0.00398303,0.0034755692,0.0016696539,0.0017379606,0.027587023],"category_scores_gemma":[0.0050134086,0.00042176805,0.0010485636,0.003414109,0.0077292416,0.011553389,0.003598289,0.006827963,0.003044351],"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.0000023161906,0.0000021532107,0.000015746897,0.000005850528,0.0000010519723,0.000007968366,0.00006551853,0.000029747525,0.000019027399,0.9976503,0.00074366765,0.0014566645],"study_design_scores_gemma":[0.0000023055652,0.0000020397365,0.000046565903,0.000007269108,0.0000020708562,0.000026257298,0.000053135722,0.00015406213,0.000050216244,0.9912777,0.008376134,0.0000023814869],"about_ca_topic_score_codex":0.0017660117,"about_ca_topic_score_gemma":0.0024821858,"teacher_disagreement_score":0.027587023,"about_ca_system_score_codex":0.0015887318,"about_ca_system_score_gemma":0.0009926028,"threshold_uncertainty_score":0.09228778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033935994,0.00036200648,0.9610954,0.00027391643,0.00006913905,0.00010350228,0.0001609059,0.0009766441,0.0030225236],"genre_scores_gemma":[0.31675336,0.00033726564,0.67658335,0.00017903213,0.000056668123,0.00046850287,0.00042997696,0.0004813732,0.004710456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934787,0.0002770145,0.000033687687,0.00013626026,0.00012711347,0.000077976154],"domain_scores_gemma":[0.99776995,0.0017177896,0.0000964066,0.00010351306,0.00025713968,0.00005512005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016729756,0.001496738,0.0014195505,0.0012767774,0.00069624523,0.0011391378,0.0012991695,0.001471926,0.005248818],"category_scores_gemma":[0.0056028054,0.0006939724,0.0009508894,0.0011766421,0.00085429923,0.0012579964,0.00091276114,0.0012361765,0.0007250797],"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.00018070615,0.00004749411,0.00084797834,0.000094449526,0.000081803744,0.000052046144,0.000041170944,0.91363716,0.0010574276,0.0065173907,0.0009969521,0.0764454],"study_design_scores_gemma":[0.000022652732,0.000021830967,0.000105041174,0.0000054453058,0.0000059857935,0.000010195528,0.000007141655,0.9968821,0.00042745649,0.0019063276,0.00060224795,0.0000036111296],"about_ca_topic_score_codex":0.025076337,"about_ca_topic_score_gemma":0.020360569,"teacher_disagreement_score":0.025076337,"about_ca_system_score_codex":0.0017241193,"about_ca_system_score_gemma":0.002296689,"threshold_uncertainty_score":0.049860716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949804,0.00042774188,0.29470527,0.0005842866,0.000034471344,0.000116745236,0.00026500702,0.0008358909,0.008050154],"genre_scores_gemma":[0.95241624,0.00009226433,0.045250993,0.00017730816,0.00002623749,0.00012491914,0.00025378392,0.000097417564,0.0015607738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804544,0.0007519203,0.00011858728,0.00031480618,0.00051625574,0.0002529382],"domain_scores_gemma":[0.98505014,0.009843964,0.0017503893,0.0013702142,0.0012500499,0.0007353326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088483,0.00025699247,0.00076323084,0.0019168678,0.0006717927,0.0017518721,0.0009422066,0.0007770194,0.0025740908],"category_scores_gemma":[0.018517315,0.0007758695,0.00060017215,0.0010825241,0.001723929,0.0025825778,0.001369613,0.0012136117,0.00019589628],"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.0006963592,0.00017768101,0.010784214,0.00018387873,0.00010603617,0.00073061144,0.0006062512,0.13200656,0.011745242,0.7918308,0.0038000424,0.047332447],"study_design_scores_gemma":[0.00009227467,0.00008045331,0.0024261319,0.00003208111,0.000032095493,0.00037355136,0.00012241838,0.47838318,0.0058855773,0.5108154,0.0017309374,0.000025909852],"about_ca_topic_score_codex":0.0010830805,"about_ca_topic_score_gemma":0.001638112,"teacher_disagreement_score":0.0025740908,"about_ca_system_score_codex":0.0014988775,"about_ca_system_score_gemma":0.00055021734,"threshold_uncertainty_score":0.011045098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08292734,0.0003927342,0.90925366,0.0016200981,0.00004752084,0.00014934676,0.0002722055,0.0013851305,0.003952015],"genre_scores_gemma":[0.40752968,0.00056076987,0.5881952,0.00034549562,0.00008230996,0.00015668038,0.00041662034,0.0006323186,0.002080945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913605,0.0035575202,0.0007774548,0.00075093633,0.00325237,0.00030112066],"domain_scores_gemma":[0.97900826,0.015976429,0.0014829198,0.0017222837,0.0016720238,0.00013805239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068937014,0.0007257274,0.0009221951,0.00156542,0.0011652107,0.0032275089,0.0013513601,0.0011747562,0.0013759801],"category_scores_gemma":[0.031784292,0.000779544,0.0009780197,0.0022766925,0.0036550644,0.0054296567,0.002986165,0.0021849899,0.0002811122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042143834,0.0001572528,0.007870135,0.00072674826,0.00018807362,0.0044740387,0.012148025,0.2691539,0.018187135,0.41622376,0.009694529,0.26075488],"study_design_scores_gemma":[0.0000789021,0.00009461995,0.0014416899,0.00014737985,0.00015454278,0.0014767735,0.0023606538,0.45709282,0.031315017,0.47405714,0.0316225,0.00015795724],"about_ca_topic_score_codex":0.0037995044,"about_ca_topic_score_gemma":0.004674968,"teacher_disagreement_score":0.0068937014,"about_ca_system_score_codex":0.0010496696,"about_ca_system_score_gemma":0.001653865,"threshold_uncertainty_score":0.036457777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038576203,0.00024674268,0.9926957,0.00026560057,0.000016246593,0.000108271015,0.00014444515,0.0016554584,0.0010098453],"genre_scores_gemma":[0.09132635,0.00032705057,0.90584874,0.00009441278,0.000041203235,0.00019520089,0.0007376963,0.00031874256,0.001110654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9871796,0.006019284,0.00077232474,0.0012588433,0.004415285,0.00035465258],"domain_scores_gemma":[0.98079556,0.009184896,0.0018148005,0.0042520743,0.0037371393,0.00021554968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067893695,0.0009129276,0.0009872575,0.0029107886,0.0011536304,0.0038618902,0.0019519234,0.0008267798,0.0039018847],"category_scores_gemma":[0.025820078,0.00057883887,0.001401884,0.0030189136,0.0019484329,0.0024248948,0.0025234506,0.0015012015,0.0009822189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023183656,0.00017441412,0.0025853228,0.0009300263,0.00015090052,0.0003222147,0.0005419671,0.1240371,0.022726238,0.11870511,0.0119682355,0.7176267],"study_design_scores_gemma":[0.000095662515,0.00011412762,0.0014502935,0.00015717637,0.000078344194,0.00029935376,0.00024068599,0.7878702,0.028667195,0.15357526,0.027382502,0.000069203554],"about_ca_topic_score_codex":0.005382134,"about_ca_topic_score_gemma":0.0046232445,"teacher_disagreement_score":0.0067893695,"about_ca_system_score_codex":0.002352953,"about_ca_system_score_gemma":0.0037730758,"threshold_uncertainty_score":0.035906076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052694514,0.00061429595,0.9204029,0.00053513556,0.00017674387,0.00011810025,0.00066017313,0.0002787506,0.024519378],"genre_scores_gemma":[0.45591235,0.0006021863,0.532825,0.00023220779,0.00024560065,0.0003374398,0.0009340597,0.00014881934,0.00876224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989231,0.00018905746,0.00011,0.0002886672,0.00036386529,0.0001252335],"domain_scores_gemma":[0.99837947,0.0005790278,0.00020915845,0.00022200683,0.00045733617,0.00015303642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014614223,0.00054350385,0.00052900123,0.0029068636,0.0016511409,0.0030865036,0.0012719599,0.0011325171,0.005127498],"category_scores_gemma":[0.0033445037,0.00058049103,0.0011875457,0.0024437679,0.0022380874,0.0071247094,0.0012840568,0.0018169387,0.0006502898],"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.000040446143,0.00001756839,0.00018952758,0.000060451533,0.000011483019,0.00007866686,0.00031970046,0.0022387493,0.001744616,0.9811787,0.0006268631,0.013493155],"study_design_scores_gemma":[0.000036946083,0.000033187334,0.0003599452,0.000045821766,0.00003931045,0.00019604717,0.0002900624,0.021217486,0.0018217413,0.9595451,0.016385995,0.000028366228],"about_ca_topic_score_codex":0.0030658292,"about_ca_topic_score_gemma":0.0038652157,"teacher_disagreement_score":0.005127498,"about_ca_system_score_codex":0.0011265589,"about_ca_system_score_gemma":0.00063223817,"threshold_uncertainty_score":0.017153144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017593725,0.0031065189,0.94172686,0.0010786046,0.00029921735,0.00006890168,0.00018745624,0.000075658165,0.03586315],"genre_scores_gemma":[0.43982401,0.009012743,0.4819304,0.0012716198,0.000881266,0.0007743553,0.0011145336,0.0004864641,0.0647046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845564,0.00078965013,0.000058102807,0.00019695294,0.0003524957,0.00014713455],"domain_scores_gemma":[0.99884796,0.0006436468,0.00012467903,0.00011244815,0.00017172952,0.00009954348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002790664,0.002109729,0.0016302267,0.0018162836,0.00091174414,0.0021463926,0.0012544738,0.0011868281,0.010534881],"category_scores_gemma":[0.0069549936,0.0006369535,0.0010418156,0.0031464892,0.0019602338,0.003973121,0.003349728,0.0025486422,0.0012197567],"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.000049279424,0.000026161648,0.0001228046,0.0001111262,0.000030844745,0.000033969045,0.00006433074,0.04517128,0.0007757586,0.91666424,0.0034052988,0.033544913],"study_design_scores_gemma":[0.000020343805,0.000031835676,0.000113352464,0.00003832173,0.000015114859,0.000032163887,0.000034994806,0.09791759,0.00023704303,0.8931757,0.0083745755,0.000008938107],"about_ca_topic_score_codex":0.001518798,"about_ca_topic_score_gemma":0.0016641848,"teacher_disagreement_score":0.010534881,"about_ca_system_score_codex":0.0015635146,"about_ca_system_score_gemma":0.0009855119,"threshold_uncertainty_score":0.035242677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017346188,0.00047914026,0.9931338,0.0005813781,0.00004616677,0.000046858655,0.00006048862,0.00032173048,0.0035958493],"genre_scores_gemma":[0.23853733,0.0024604248,0.7435664,0.0010963033,0.00056892255,0.000358576,0.00034336344,0.0011288945,0.011939735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962967,0.0011306428,0.00028124126,0.0008211588,0.0010228311,0.0004474832],"domain_scores_gemma":[0.9924279,0.0028206208,0.00031557187,0.003315323,0.0008410669,0.0002795548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00435662,0.0011438761,0.0021082377,0.0018372595,0.0021671446,0.0069001126,0.0061134007,0.0027328844,0.008217815],"category_scores_gemma":[0.013214687,0.0014504658,0.0020824724,0.0035675247,0.0073388373,0.014785054,0.008276595,0.0057685813,0.0012378437],"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.000051663792,0.000034751352,0.00015252148,0.00010215813,0.000034796423,0.00010329621,0.00015338062,0.027147861,0.00085784704,0.9415693,0.0023734292,0.027418897],"study_design_scores_gemma":[0.00001392394,0.000014188143,0.000051542836,0.0000278179,0.000022644712,0.00006414316,0.00003786335,0.15505552,0.00072346866,0.8388792,0.0050866473,0.000023011671],"about_ca_topic_score_codex":0.0067721787,"about_ca_topic_score_gemma":0.0089956885,"teacher_disagreement_score":0.008217815,"about_ca_system_score_codex":0.0019793692,"about_ca_system_score_gemma":0.003576669,"threshold_uncertainty_score":0.027491331},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032165054,0.006501838,0.9156349,0.007774723,0.0003152654,0.00035104618,0.001616172,0.0003387272,0.03530236],"genre_scores_gemma":[0.43196234,0.011682933,0.5304971,0.0025188308,0.0021370011,0.0012937145,0.0047967085,0.000385655,0.014725699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99062294,0.0036999611,0.00046165916,0.0018466401,0.0025539873,0.00081488775],"domain_scores_gemma":[0.97396594,0.021940963,0.0013937432,0.0012131515,0.0010722721,0.0004139907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037462073,0.0019251406,0.0018797178,0.0014638668,0.0015731675,0.004658509,0.0021171828,0.0025724324,0.0099189365],"category_scores_gemma":[0.018992549,0.0008424741,0.00211565,0.0058124545,0.0044620316,0.0114205405,0.0034050583,0.008291183,0.0007576459],"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.000113049326,0.0001370575,0.00074105663,0.0008580857,0.00016658523,0.00032513568,0.0006077739,0.087610155,0.0010327521,0.8442002,0.013209963,0.050998133],"study_design_scores_gemma":[0.00004923713,0.00003966208,0.0002874751,0.00010892484,0.00005000034,0.0002545213,0.00039966183,0.07560063,0.0009618292,0.90226996,0.01995293,0.000025222056],"about_ca_topic_score_codex":0.0030873546,"about_ca_topic_score_gemma":0.002426682,"teacher_disagreement_score":0.0099189365,"about_ca_system_score_codex":0.0025781537,"about_ca_system_score_gemma":0.002040877,"threshold_uncertainty_score":0.033182144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010471979,0.12469086,0.8090029,0.011083369,0.0007872094,0.00007958779,0.0006932902,0.00039966032,0.042791206],"genre_scores_gemma":[0.21798502,0.18006909,0.5864354,0.0017821977,0.002481401,0.00020851797,0.0024447613,0.00016470905,0.008428889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591196,0.0009397329,0.00042087797,0.00042535612,0.0021581096,0.00014402778],"domain_scores_gemma":[0.99069715,0.0069197817,0.0003725243,0.00078228884,0.0011118843,0.00011644432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036849175,0.0009886548,0.0015301089,0.0029498965,0.0005769518,0.0046110796,0.0032507356,0.0016158674,0.0037576011],"category_scores_gemma":[0.013843128,0.00077420933,0.0017704,0.0058931997,0.003103554,0.0100865625,0.0014999856,0.0028041105,0.0007557735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000682049,0.00006682519,0.0011005739,0.0019163666,0.0002613474,0.00017019518,0.0002100394,0.044893887,0.00088669633,0.6008498,0.014173138,0.33540297],"study_design_scores_gemma":[0.000023989951,0.000023787237,0.00062219973,0.00037255394,0.00009867645,0.00030446734,0.0001566252,0.0984124,0.0010918545,0.84399396,0.054856844,0.00004268607],"about_ca_topic_score_codex":0.00664838,"about_ca_topic_score_gemma":0.008306778,"teacher_disagreement_score":0.00664838,"about_ca_system_score_codex":0.002347613,"about_ca_system_score_gemma":0.0024779672,"threshold_uncertainty_score":0.019487977},"labels":[],"label_agreement":null},{"id":"W2062540065","doi":"10.1007/s10601-013-9140-8","title":"View-based propagation of decomposable constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Propagator; Constraint (computer-aided design); Decomposition; Local consistency; Simple (philosophy); Decomposition method (queueing theory); Code (set theory)","score_opus":0.011620119285205061,"score_gpt":0.22887508763400452,"score_spread":0.21725496834879945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062540065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094287805,0.00025116818,0.9837298,0.0002506021,0.00008755164,0.0001571793,0.0004556326,0.00080050435,0.0048389267],"genre_scores_gemma":[0.23113412,0.00083281763,0.7588148,0.00029243503,0.00011173816,0.00022864644,0.002046228,0.0005920649,0.005947244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996819,0.00076120073,0.00013754643,0.00039648617,0.0016391368,0.0002465673],"domain_scores_gemma":[0.9914692,0.0049683424,0.00045991104,0.0014262627,0.0014530774,0.00022326101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027019083,0.0014000275,0.0010906237,0.0027832624,0.00083213375,0.0026700827,0.0028062381,0.0012792076,0.0082581565],"category_scores_gemma":[0.014647659,0.0012193931,0.0020701874,0.002963811,0.00096055056,0.0049251085,0.0036497805,0.0031570466,0.0010089552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032520015,0.0003648086,0.0021415225,0.0005773523,0.0002712694,0.0007999896,0.0006383331,0.32210788,0.013181341,0.21764268,0.019265765,0.42268392],"study_design_scores_gemma":[0.000033893408,0.000050131446,0.00035781966,0.000086880806,0.0000892522,0.0001527185,0.00011472512,0.86537653,0.007842948,0.11798761,0.007869245,0.00003827697],"about_ca_topic_score_codex":0.007670272,"about_ca_topic_score_gemma":0.013782558,"teacher_disagreement_score":0.0082581565,"about_ca_system_score_codex":0.0011076243,"about_ca_system_score_gemma":0.0017585894,"threshold_uncertainty_score":0.027626336},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026562745,0.010020486,0.9141059,0.012329882,0.000700959,0.0002842174,0.00073124096,0.003295328,0.031969335],"genre_scores_gemma":[0.5587479,0.008991348,0.3966438,0.00629099,0.0030227003,0.0011464678,0.0013574283,0.0048384606,0.018961007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.964872,0.0099889245,0.0017307681,0.005672005,0.011576425,0.006159866],"domain_scores_gemma":[0.60763407,0.34408572,0.0058848117,0.029368943,0.0073260725,0.005700343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026251486,0.0049057105,0.0061155367,0.007220441,0.0032310206,0.0146106705,0.010405834,0.00904359,0.01858016],"category_scores_gemma":[0.22050567,0.0051669586,0.006070323,0.007180035,0.010611296,0.04105743,0.013528566,0.031052077,0.0052458714],"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.0020937985,0.00078905385,0.003727982,0.0019055255,0.00034692866,0.0003614933,0.0009550284,0.09868736,0.015081297,0.6882346,0.026129132,0.1616879],"study_design_scores_gemma":[0.00011005107,0.00022927996,0.00069062586,0.00036531893,0.00020106276,0.00033281196,0.00011834522,0.3218755,0.008001424,0.6624849,0.005488024,0.000102682236],"about_ca_topic_score_codex":0.0020242166,"about_ca_topic_score_gemma":0.002760963,"teacher_disagreement_score":0.026251486,"about_ca_system_score_codex":0.009107842,"about_ca_system_score_gemma":0.007143813,"threshold_uncertainty_score":0.13883275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075335787,0.0029499708,0.97929823,0.00045364667,0.00010499914,0.00031727413,0.00030011762,0.0006485156,0.008393617],"genre_scores_gemma":[0.13465463,0.006443836,0.85284865,0.00020665041,0.00009134724,0.00065912073,0.0008999747,0.00037574788,0.0038200698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98597336,0.00491581,0.001072376,0.000732973,0.0069519305,0.00035346253],"domain_scores_gemma":[0.96787506,0.020316716,0.001076747,0.0033080822,0.006836191,0.00058715243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01397857,0.0014861631,0.0024322753,0.0073614647,0.0010098919,0.006618674,0.0068827705,0.0023086593,0.010154386],"category_scores_gemma":[0.035782017,0.0011596549,0.0029521596,0.008074268,0.0021162874,0.008971605,0.0045288485,0.002863031,0.0018351803],"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.0011974066,0.00033229493,0.0022448995,0.0018615895,0.00064855046,0.00010680096,0.0020636015,0.09784372,0.0019480641,0.34760913,0.004163937,0.53997993],"study_design_scores_gemma":[0.00019379116,0.0004008536,0.0026612778,0.0006991845,0.00042906258,0.0002493271,0.0017350408,0.72323036,0.003813615,0.2439575,0.02245079,0.00017915676],"about_ca_topic_score_codex":0.012439058,"about_ca_topic_score_gemma":0.015373198,"teacher_disagreement_score":0.01397857,"about_ca_system_score_codex":0.0035252622,"about_ca_system_score_gemma":0.0038564221,"threshold_uncertainty_score":0.07392663},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0642374,0.0007737345,0.8886877,0.00069560274,0.00026932365,0.00087036,0.004740336,0.016483027,0.023242466],"genre_scores_gemma":[0.3906854,0.0006749566,0.5912252,0.00038766663,0.00026211733,0.0028333804,0.005528938,0.0038894932,0.004512837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904598,0.0022519012,0.0007096651,0.0016406226,0.004489032,0.00044913465],"domain_scores_gemma":[0.92400116,0.046628702,0.004353755,0.014636071,0.009649656,0.0007306999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061296327,0.0015425098,0.0012619884,0.0044758082,0.0007836863,0.0029468003,0.0018848897,0.0011017952,0.013812106],"category_scores_gemma":[0.06470071,0.0006555304,0.0011873506,0.0038775215,0.0013254136,0.0045712595,0.0023306236,0.00300097,0.002914648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087621977,0.00065894274,0.019915396,0.0013707231,0.00030175,0.00058452017,0.0013779843,0.12634572,0.030456029,0.11625345,0.041771997,0.6600872],"study_design_scores_gemma":[0.00014637005,0.00040860556,0.012319312,0.00025037248,0.00009928669,0.0006703671,0.00066222984,0.7989142,0.036086027,0.08417587,0.06611221,0.00015516876],"about_ca_topic_score_codex":0.0014804503,"about_ca_topic_score_gemma":0.00097465795,"teacher_disagreement_score":0.013812106,"about_ca_system_score_codex":0.0011987437,"about_ca_system_score_gemma":0.0020826843,"threshold_uncertainty_score":0.046206057},"labels":[],"label_agreement":null},{"id":"W2072384654","doi":"10.1007/s10601-007-9026-8","title":"A Constraint-Based Autonomous 3D Camera System","year":2007,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Exploit; Computer science; Constraint (computer-aided design); Cinematography; Solver; Constraint satisfaction problem; Digital camera; Constraint satisfaction; Smart camera; Simple (philosophy); Computer vision; Artificial intelligence; Computer graphics (images); Real-time computing; Engineering; Programming language; Computer security","score_opus":0.011346852216264703,"score_gpt":0.23404778957776173,"score_spread":0.22270093736149704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072384654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008305703,0.000099248056,0.98443514,0.000104622595,0.00003510814,0.00010704299,0.00027887494,0.0028516813,0.0037826032],"genre_scores_gemma":[0.19802108,0.00020666386,0.7943969,0.00014812834,0.000026208018,0.0003078224,0.0007180511,0.00039522914,0.0057799052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992854,0.00008045978,0.00003397511,0.00021183514,0.00034375992,0.00004455054],"domain_scores_gemma":[0.9994716,0.0001130882,0.000048557384,0.00011354066,0.00018679138,0.00006636437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038876684,0.00079515536,0.0009940042,0.00050243584,0.00086556486,0.0013677861,0.0021003545,0.001101789,0.0078102336],"category_scores_gemma":[0.0011428784,0.0007160952,0.0006077627,0.0008015419,0.000618218,0.0010832513,0.001831503,0.000822415,0.0018710982],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006926353,0.00020075445,0.001236178,0.00044422672,0.0001681489,0.0007627352,0.00035204503,0.35067368,0.21415599,0.03447261,0.017718887,0.3791221],"study_design_scores_gemma":[0.00007668801,0.00009696529,0.0005168087,0.000013291321,0.000034459583,0.0001936636,0.000031483232,0.9537491,0.025720445,0.0042771627,0.015233963,0.000055887886],"about_ca_topic_score_codex":0.012178359,"about_ca_topic_score_gemma":0.015547756,"teacher_disagreement_score":0.012178359,"about_ca_system_score_codex":0.00077023846,"about_ca_system_score_gemma":0.0018017757,"threshold_uncertainty_score":0.026127815},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010538207,0.00036895135,0.9845734,0.00014064756,0.000045448356,0.000031602078,0.000077478246,0.00019293946,0.004031341],"genre_scores_gemma":[0.68117815,0.0010465704,0.30499685,0.00016174668,0.00008655075,0.0002811402,0.0002670577,0.000053435586,0.011928501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.00003849797,0.000009739114,0.000039985614,0.000057609825,0.000022394972],"domain_scores_gemma":[0.9998049,0.000099544915,0.000020563011,0.000016675573,0.000046246398,0.000012019386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000371737,0.00045665205,0.00046256807,0.000293086,0.00034467503,0.00071525254,0.0014450944,0.00109941,0.002535044],"category_scores_gemma":[0.00092597766,0.00023404567,0.00043092357,0.0005377229,0.00057347503,0.0010395255,0.00041495112,0.0008530534,0.0003514046],"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.00004195727,0.000023753406,0.00026494457,0.000068375986,0.000022649625,0.000077104145,0.000041085437,0.94670576,0.0034760658,0.017281739,0.00057979504,0.031416938],"study_design_scores_gemma":[0.0000029506994,0.0000070495194,0.000025417086,0.0000026971009,0.0000034352586,0.000009892531,0.000002244031,0.99719703,0.0002889031,0.0021165358,0.00034111383,0.0000027314816],"about_ca_topic_score_codex":0.01298441,"about_ca_topic_score_gemma":0.0118684005,"teacher_disagreement_score":0.01298441,"about_ca_system_score_codex":0.0008534994,"about_ca_system_score_gemma":0.0009516829,"threshold_uncertainty_score":0.025817633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12509917,0.00035585562,0.8597741,0.00065858156,0.00010948749,0.00028581178,0.0012778243,0.0020258531,0.010413322],"genre_scores_gemma":[0.6596569,0.00038934784,0.32807672,0.00021955576,0.0001542639,0.00022076914,0.0027068101,0.00066811335,0.007907495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582505,0.0011408399,0.00029468647,0.00068047026,0.0014597091,0.0005993574],"domain_scores_gemma":[0.9879308,0.0067800023,0.0010219257,0.0025875932,0.001158278,0.0005215194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199593,0.000918467,0.0017139626,0.0010955188,0.0011029205,0.0035059515,0.001512754,0.00075613125,0.0065581887],"category_scores_gemma":[0.011760983,0.000886368,0.0013468355,0.0018296594,0.0013673635,0.005809347,0.0031800703,0.0021938297,0.0010494691],"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.00090519513,0.0005143107,0.0013797182,0.0006404892,0.00011328106,0.00041863683,0.0015852555,0.06726913,0.026742002,0.5990086,0.019423263,0.28200012],"study_design_scores_gemma":[0.00012767939,0.00031474238,0.00037621194,0.00007173683,0.000046865163,0.000325024,0.00058756047,0.24930045,0.018031951,0.720776,0.009996957,0.00004482464],"about_ca_topic_score_codex":0.0020778656,"about_ca_topic_score_gemma":0.004236954,"teacher_disagreement_score":0.0065581887,"about_ca_system_score_codex":0.0010420087,"about_ca_system_score_gemma":0.0017864022,"threshold_uncertainty_score":0.021939278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16611676,0.0015674483,0.75669134,0.008619297,0.00044089044,0.00021878115,0.0021085504,0.0013804679,0.06285658],"genre_scores_gemma":[0.8499501,0.0007499963,0.13983461,0.0006175167,0.00026248948,0.00007785065,0.0018439501,0.00030772918,0.0063557485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955037,0.0010285231,0.0003728323,0.0012438189,0.0012645995,0.0005864502],"domain_scores_gemma":[0.9865008,0.008645847,0.0007950808,0.0023005307,0.0012459725,0.00051172165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003045723,0.0010285092,0.0011576511,0.002936754,0.0024909368,0.0065327007,0.0028330903,0.0025445228,0.008805472],"category_scores_gemma":[0.024256125,0.0017082187,0.0036377353,0.0026491976,0.0046005123,0.025886368,0.005656316,0.00561815,0.0007031816],"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.00015996724,0.00007951782,0.00263363,0.00021896439,0.00013606613,0.00047433135,0.0010011059,0.008982845,0.0016841125,0.95073867,0.0044221585,0.029468577],"study_design_scores_gemma":[0.000026450476,0.000016981956,0.00032335857,0.00005136104,0.000097705306,0.00016891255,0.00031604906,0.026190054,0.0019710087,0.9647083,0.0061073713,0.000022316355],"about_ca_topic_score_codex":0.0064261025,"about_ca_topic_score_gemma":0.0054920553,"teacher_disagreement_score":0.008805472,"about_ca_system_score_codex":0.0016191184,"about_ca_system_score_gemma":0.0013188218,"threshold_uncertainty_score":0.029457271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31570804,0.002199328,0.59048855,0.01812725,0.00031489605,0.00042830477,0.0042489287,0.00074601354,0.06773878],"genre_scores_gemma":[0.89658767,0.0014167147,0.08329656,0.0009282341,0.0004296546,0.00042621625,0.0022513964,0.00027406943,0.014389459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956643,0.00153623,0.00022329835,0.00065079966,0.0012315452,0.00069381564],"domain_scores_gemma":[0.9707946,0.02437701,0.0013345242,0.0015135407,0.0011344462,0.0008457884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024810645,0.0009990932,0.0022843753,0.0011644767,0.0020910534,0.0064871996,0.0029191454,0.0025846052,0.015152443],"category_scores_gemma":[0.02515207,0.0010649713,0.0019221646,0.0032392426,0.0032780094,0.011448261,0.0030838386,0.0046940683,0.00067488285],"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.0002859222,0.00017084708,0.0012559317,0.0003162387,0.000112182395,0.00016800116,0.00037412075,0.174,0.0005428608,0.79410917,0.008458029,0.020206572],"study_design_scores_gemma":[0.00005042008,0.000012897086,0.00022772874,0.000015900008,0.000020683203,0.000036205733,0.00006834626,0.19877023,0.00013965658,0.7994757,0.0011658922,0.000016334354],"about_ca_topic_score_codex":0.016563294,"about_ca_topic_score_gemma":0.013407468,"teacher_disagreement_score":0.016563294,"about_ca_system_score_codex":0.0050456943,"about_ca_system_score_gemma":0.0048806765,"threshold_uncertainty_score":0.050689995},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073077288,0.1335056,0.24797094,0.44192424,0.014041903,0.00012534116,0.0010133027,0.00078049605,0.15333045],"genre_scores_gemma":[0.34064573,0.1843518,0.2726896,0.056709804,0.0702547,0.0011237502,0.0018772526,0.0014527453,0.07089467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934198,0.0026401049,0.0003461123,0.00096861756,0.0022577439,0.0003675632],"domain_scores_gemma":[0.9673282,0.02520278,0.0005789073,0.003495194,0.0023769855,0.001018028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0099605555,0.0012069236,0.0024071306,0.0025829254,0.0045976113,0.0101815155,0.0028936148,0.0052210866,0.017490823],"category_scores_gemma":[0.036211617,0.0008206524,0.002021399,0.0029496988,0.013130419,0.02605662,0.0067072175,0.015955962,0.0070139975],"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.000009226058,0.000013319523,0.000052000643,0.00014904252,0.000012594782,0.000022134189,0.00010774403,0.000822876,0.000049484916,0.9640456,0.024187783,0.010528077],"study_design_scores_gemma":[0.0000040178293,0.0000042877714,0.0000255479,0.000052605286,0.0000020302614,0.0000313403,0.000052871805,0.0014549817,0.000023314888,0.95510226,0.043240316,0.000006426789],"about_ca_topic_score_codex":0.0012211476,"about_ca_topic_score_gemma":0.00090578647,"teacher_disagreement_score":0.017490823,"about_ca_system_score_codex":0.0037338038,"about_ca_system_score_gemma":0.0032442238,"threshold_uncertainty_score":0.058512688},"labels":[],"label_agreement":null},{"id":"W2082779900","doi":"10.1007/s10601-012-9119-x","title":"Improved filtering for weighted circuit constraints","year":2012,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Relaxation (psychology); Constraint satisfaction problem; Computer science; Travelling salesman problem; Search tree; Linear programming relaxation; Bounding overwatch; Domain (mathematical analysis); Context (archaeology); Mathematical optimization; Solver; Tree (set theory); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Constraint logic programming; Routing (electronic design automation); Lagrangian relaxation; Integer programming; Mathematics; Probabilistic logic; Search algorithm; Artificial intelligence; Stochastic programming","score_opus":0.028373339513326462,"score_gpt":0.25406665282411695,"score_spread":0.22569331331079048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082779900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035494033,0.00020532569,0.9940462,0.000065933295,0.000065217806,0.000025987982,0.00012073098,0.00022379543,0.0016973709],"genre_scores_gemma":[0.1708998,0.00085139216,0.8124434,0.00029205656,0.0002257874,0.00018044964,0.0016816091,0.00051040604,0.012915162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824333,0.0003625315,0.00010469542,0.00033465622,0.0007842915,0.00017039038],"domain_scores_gemma":[0.996935,0.001737925,0.00015488628,0.00046698554,0.0006406085,0.000064710635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015708983,0.0016065263,0.0018613907,0.0019345897,0.00071111444,0.0021068477,0.0019808693,0.0014785695,0.011088765],"category_scores_gemma":[0.0069902153,0.0009042085,0.001558447,0.002774412,0.0005760251,0.003037594,0.0012231639,0.002080337,0.0014507752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000293977,0.00016053293,0.00061314023,0.00045998217,0.0001727783,0.0002494917,0.00011521893,0.4493287,0.017896656,0.109303005,0.013555674,0.4078509],"study_design_scores_gemma":[0.000015982694,0.000024712117,0.00012847496,0.00002038329,0.00002706674,0.000048947684,0.000011115788,0.9687421,0.0027725175,0.024681155,0.0035123439,0.000015222459],"about_ca_topic_score_codex":0.01051463,"about_ca_topic_score_gemma":0.014020465,"teacher_disagreement_score":0.011088765,"about_ca_system_score_codex":0.0011920462,"about_ca_system_score_gemma":0.0012583464,"threshold_uncertainty_score":0.037095606},"labels":[],"label_agreement":null},{"id":"W2083081391","doi":"10.1007/s10601-013-9143-5","title":"Introduction to the special issue on constraint modelling and reformulation","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Computer science; Management science; Engineering; Mechanical engineering","score_opus":0.013945866611072541,"score_gpt":0.2255223947929468,"score_spread":0.21157652818187428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083081391","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007341331,0.107553616,0.55900085,0.03332666,0.19044591,0.00031063048,0.002014736,0.0017481073,0.1048653],"genre_scores_gemma":[0.014600352,0.13151424,0.26829532,0.020916123,0.38774,0.0008113275,0.0059087034,0.004347524,0.16586643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617094,0.0010452358,0.00042746883,0.0008575658,0.0013312281,0.0001675054],"domain_scores_gemma":[0.99135065,0.0053089536,0.00029727595,0.0011242608,0.0016163362,0.0003026092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041417927,0.0025629897,0.0030131154,0.0041353935,0.0015219258,0.0064709135,0.003369875,0.00335204,0.06125475],"category_scores_gemma":[0.01368895,0.0014289716,0.0036010838,0.00694014,0.0030531918,0.009871574,0.0031628578,0.010243515,0.027394611],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029638939,0.0000685428,0.00010218108,0.0009110285,0.000059138045,0.00013432321,0.00011044849,0.0017491346,0.00059391564,0.13270262,0.7292992,0.13423984],"study_design_scores_gemma":[0.000008290606,0.000020427467,0.00014378283,0.00032545382,0.000024321504,0.0002716363,0.000032114825,0.0025791693,0.00028863625,0.09982131,0.89644694,0.000037886333],"about_ca_topic_score_codex":0.0017852103,"about_ca_topic_score_gemma":0.0022449787,"teacher_disagreement_score":0.06125475,"about_ca_system_score_codex":0.002077132,"about_ca_system_score_gemma":0.0021005673,"threshold_uncertainty_score":0.20491755},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036246736,0.003751374,0.7044065,0.0037192747,0.0014223172,0.0009098443,0.004373713,0.006722986,0.23844735],"genre_scores_gemma":[0.35605758,0.0034297735,0.57436424,0.003349802,0.00039214388,0.000993045,0.011022977,0.0015442373,0.04884617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864215,0.00031730297,0.00007255961,0.000313705,0.0004176051,0.00023666376],"domain_scores_gemma":[0.9982368,0.0008915251,0.00010515293,0.0004521948,0.000247493,0.00006671846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008919707,0.00087007094,0.0007674294,0.00076286506,0.0008996809,0.002535279,0.002711587,0.0012099493,0.016336817],"category_scores_gemma":[0.004259812,0.0004018377,0.0010398573,0.0012649754,0.0010355953,0.0026224735,0.0020992644,0.0019398745,0.0029637262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002829179,0.00030127759,0.0015771129,0.000835858,0.00012192268,0.00035826422,0.00014492367,0.13691346,0.004479975,0.5083711,0.06760158,0.27901164],"study_design_scores_gemma":[0.00012937447,0.00016288173,0.0004097573,0.00020433356,0.00005927552,0.0005884091,0.00012302242,0.29480416,0.00634729,0.44941348,0.24772082,0.00003721844],"about_ca_topic_score_codex":0.001955183,"about_ca_topic_score_gemma":0.003340469,"teacher_disagreement_score":0.016336817,"about_ca_system_score_codex":0.0012245931,"about_ca_system_score_gemma":0.0021360351,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1828933,0.0019373324,0.71575814,0.0030361086,0.00030535323,0.00017282594,0.00032147535,0.00077006436,0.0948054],"genre_scores_gemma":[0.8206178,0.0013196326,0.1312893,0.0006408255,0.00016430307,0.00021059703,0.0005522372,0.0005213948,0.04468382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.00028249755,0.000020246369,0.00014762586,0.00013323271,0.00012755636],"domain_scores_gemma":[0.995194,0.002950264,0.00022992713,0.00071378343,0.00049817236,0.00041381907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014453834,0.00045567477,0.0006879354,0.0011040643,0.002016953,0.0019797338,0.0018869522,0.0010416608,0.0056716157],"category_scores_gemma":[0.00737329,0.0011700161,0.00090731366,0.001300613,0.0033992478,0.0040856223,0.0023136146,0.004225223,0.00061877386],"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.000032201813,0.000024899657,0.00037515143,0.000043114833,0.000008680847,0.00008475257,0.0003123827,0.0104426555,0.0007102333,0.97553355,0.0030538873,0.009378545],"study_design_scores_gemma":[0.000011132678,0.0000083949435,0.00012710215,0.000013811545,0.000008784027,0.000044655066,0.000067408946,0.03067218,0.0005082307,0.9653815,0.0031492936,0.0000075166154],"about_ca_topic_score_codex":0.008003358,"about_ca_topic_score_gemma":0.009883406,"teacher_disagreement_score":0.008003358,"about_ca_system_score_codex":0.002354253,"about_ca_system_score_gemma":0.0017406266,"threshold_uncertainty_score":0.01897347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2887507,0.0037110655,0.6135734,0.017175002,0.0007727354,0.00052503607,0.0042355354,0.0029909448,0.06826563],"genre_scores_gemma":[0.9192491,0.0011669676,0.0655867,0.0015247092,0.0006502277,0.00042335523,0.0020087725,0.0009147277,0.008475281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909814,0.0016960418,0.0006422483,0.002037056,0.0024619778,0.0021811465],"domain_scores_gemma":[0.9229794,0.06362764,0.0022760767,0.007175389,0.0022294747,0.0017120308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042070793,0.0014966249,0.003118161,0.0016396794,0.0035872448,0.008751538,0.007419641,0.0029140108,0.018416433],"category_scores_gemma":[0.04005218,0.0016772689,0.003500044,0.0035712998,0.0051145325,0.029907003,0.010068235,0.01171971,0.0019846049],"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.0033628729,0.000632862,0.00791471,0.0026587157,0.00040639957,0.001005945,0.0020395806,0.14190336,0.011740189,0.68622375,0.035807744,0.10630386],"study_design_scores_gemma":[0.00015121233,0.00008938006,0.0010668997,0.00009209126,0.00017725259,0.00051827496,0.00032254413,0.19119538,0.0053249304,0.7963682,0.004615706,0.000078198595],"about_ca_topic_score_codex":0.0036901312,"about_ca_topic_score_gemma":0.0048319474,"teacher_disagreement_score":0.018416433,"about_ca_system_score_codex":0.0044084243,"about_ca_system_score_gemma":0.004794464,"threshold_uncertainty_score":0.06160909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024657752,0.0004968301,0.8524651,0.0014698494,0.000838617,0.000104939005,0.00065885164,0.0016114649,0.13988863],"genre_scores_gemma":[0.08024076,0.001894976,0.7966204,0.0013984356,0.0010168131,0.00048562323,0.002002137,0.0032203288,0.11312059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985921,0.00040456126,0.00013110717,0.00035295883,0.0004137154,0.000105629355],"domain_scores_gemma":[0.9990552,0.00025692367,0.000055174685,0.0003505761,0.0001886081,0.000093490555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013957841,0.000940986,0.00081239024,0.0019258766,0.002226104,0.005704468,0.0022036866,0.000985281,0.039363667],"category_scores_gemma":[0.003714262,0.0008718341,0.0016317206,0.0026875685,0.0035366558,0.008953419,0.004967892,0.005442036,0.013345821],"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.000024608426,0.00001748567,0.00008211896,0.000063594016,0.00000800363,0.00006613122,0.00021227723,0.0007525114,0.00035484188,0.9510337,0.014669867,0.032714956],"study_design_scores_gemma":[0.000018390143,0.000014489508,0.0000898877,0.000062790095,0.000015012918,0.0001444958,0.00009325028,0.009454098,0.0010650603,0.69519615,0.29382616,0.000020167363],"about_ca_topic_score_codex":0.0022656012,"about_ca_topic_score_gemma":0.0055101626,"teacher_disagreement_score":0.039363667,"about_ca_system_score_codex":0.0011020037,"about_ca_system_score_gemma":0.0023531981,"threshold_uncertainty_score":0.13168454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005217899,0.0004632271,0.9885874,0.0002948456,0.000041046922,0.000053314616,0.00049878296,0.0002761028,0.0045674243],"genre_scores_gemma":[0.270377,0.0020092507,0.7184234,0.00024364387,0.00019056203,0.00037505443,0.0024022548,0.0001457438,0.0058330223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975604,0.0007372385,0.00017392135,0.0006356981,0.00075311103,0.00013963848],"domain_scores_gemma":[0.9967325,0.001984447,0.00041885467,0.0002832802,0.0004709521,0.00011001909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018450166,0.00081932644,0.0007317676,0.0014942153,0.00087237335,0.0024198568,0.0021090654,0.0010460737,0.0056887926],"category_scores_gemma":[0.010252027,0.0005855427,0.0010539548,0.0037785138,0.0013191339,0.005006316,0.0019266916,0.001662579,0.00079983356],"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.00014621652,0.000039089155,0.0008294789,0.00022797883,0.00008460829,0.00019982312,0.00016156795,0.40098405,0.0013724491,0.4914344,0.0045701293,0.099950284],"study_design_scores_gemma":[0.000019495521,0.000016592534,0.00015602376,0.000034608896,0.00003805124,0.00010622983,0.000038248214,0.6476761,0.00078541896,0.3383107,0.012799882,0.000018769393],"about_ca_topic_score_codex":0.0045025027,"about_ca_topic_score_gemma":0.004728836,"teacher_disagreement_score":0.0056887926,"about_ca_system_score_codex":0.0014049809,"about_ca_system_score_gemma":0.0012871755,"threshold_uncertainty_score":0.019030869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4807424,0.0012000179,0.48525012,0.0028617387,0.00009326485,0.0001480771,0.0010926927,0.0010724507,0.027539302],"genre_scores_gemma":[0.96624017,0.00031997,0.031045271,0.0002395306,0.00007580069,0.000117937474,0.00050285785,0.00012393072,0.0013346077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963856,0.0009112004,0.00020545414,0.0010247945,0.0008798678,0.0005929973],"domain_scores_gemma":[0.95489895,0.036047924,0.0032446405,0.0033733167,0.0013635217,0.001071563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029216907,0.000602142,0.0011164795,0.001399543,0.0010245295,0.0029408196,0.0020264834,0.001825042,0.004518591],"category_scores_gemma":[0.04025192,0.00056190597,0.0007986466,0.0017850923,0.0031364337,0.0053152046,0.0020803388,0.0031197576,0.0005878314],"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.0006600047,0.00025186464,0.012603596,0.00041513384,0.00018535947,0.00056148245,0.0005810706,0.21393928,0.016239883,0.7040756,0.007321499,0.04316524],"study_design_scores_gemma":[0.000044634202,0.00010698359,0.0016916877,0.00003505046,0.000040738545,0.0005221375,0.00013315669,0.47355103,0.009105634,0.5130443,0.0016902364,0.000034398396],"about_ca_topic_score_codex":0.00066320924,"about_ca_topic_score_gemma":0.00062351336,"teacher_disagreement_score":0.004518591,"about_ca_system_score_codex":0.0022015434,"about_ca_system_score_gemma":0.00086655223,"threshold_uncertainty_score":0.01597339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005607614,0.00033295996,0.98210573,0.0006357047,0.000119033946,0.00022648729,0.0004410025,0.00022944438,0.010302007],"genre_scores_gemma":[0.16504745,0.00076168595,0.82308394,0.00059778854,0.0002728294,0.000615871,0.0007259288,0.00014851963,0.008746028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921177,0.003453726,0.0005993445,0.0010632955,0.0023841846,0.00038171082],"domain_scores_gemma":[0.9885747,0.0071641025,0.0009893398,0.0018407344,0.0009769758,0.0004542222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057106353,0.0013940558,0.00080938445,0.0011462299,0.0010366698,0.002988082,0.0018672762,0.0012446507,0.0107807685],"category_scores_gemma":[0.016522681,0.00064599543,0.0017509442,0.0032502473,0.0023545967,0.0074684196,0.003289379,0.003515283,0.0013497197],"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.000119018034,0.00010756629,0.00083940057,0.0005997693,0.00012942396,0.00045233016,0.00038442508,0.07644477,0.002475055,0.81658447,0.008287637,0.09357611],"study_design_scores_gemma":[0.000053075564,0.000116516574,0.00045896447,0.00013196863,0.000078150064,0.00067093165,0.00025397213,0.2710499,0.0037943737,0.67100596,0.052321635,0.00006450489],"about_ca_topic_score_codex":0.0020311214,"about_ca_topic_score_gemma":0.005187596,"teacher_disagreement_score":0.0107807685,"about_ca_system_score_codex":0.0010130927,"about_ca_system_score_gemma":0.0025946454,"threshold_uncertainty_score":0.03606528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029523848,0.0002073027,0.96188086,0.00030222224,0.000033272852,0.00013634701,0.0003478411,0.002245941,0.0053223236],"genre_scores_gemma":[0.21749996,0.00016878075,0.7783009,0.00009577427,0.000009674048,0.00025817016,0.00084204273,0.00017964646,0.002644991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942553,0.00011534436,0.000041803054,0.00016796852,0.0001686573,0.000080617625],"domain_scores_gemma":[0.9990491,0.0005639862,0.000070192866,0.00009168697,0.00019153049,0.00003359255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743554,0.00054820016,0.00073720445,0.00097101857,0.0011365396,0.0011537606,0.0010557299,0.0008798799,0.006557791],"category_scores_gemma":[0.002788633,0.000511536,0.0012022542,0.00072962744,0.0009339556,0.0011863653,0.00092073466,0.0007617925,0.0012656563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038323534,0.0002784735,0.005214437,0.0011666442,0.000199485,0.0008537524,0.0006467976,0.3544243,0.052571714,0.16463654,0.010635071,0.40898955],"study_design_scores_gemma":[0.000060027036,0.00016637133,0.0005091565,0.00012377142,0.000108460496,0.0002874313,0.0002520147,0.867253,0.017930113,0.09924887,0.014019682,0.000041165073],"about_ca_topic_score_codex":0.004122322,"about_ca_topic_score_gemma":0.006206763,"teacher_disagreement_score":0.006557791,"about_ca_system_score_codex":0.0007386355,"about_ca_system_score_gemma":0.002440044,"threshold_uncertainty_score":0.021938026},"labels":[],"label_agreement":null},{"id":"W2099452584","doi":"10.1007/s10601-015-9193-y","title":"Lagrangian bounds from decision diagrams","year":2015,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Lagrangian relaxation; Influence diagram; Travelling salesman problem; Diagram; Constraint (computer-aided design); Relaxation (psychology); Mathematical optimization; Representation (politics); Constraint programming; Computer science; Lagrangian; Combinatorial optimization; Mathematics; Applied mathematics; Decision tree; Artificial intelligence; Stochastic programming","score_opus":0.02494302236139297,"score_gpt":0.25400062977385135,"score_spread":0.22905760741245837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099452584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033098708,0.0005017402,0.98051363,0.00040143542,0.00005826872,0.00004677413,0.00036895144,0.00020518182,0.014594123],"genre_scores_gemma":[0.31046873,0.0024102093,0.6603965,0.00047562397,0.00026297904,0.00063686195,0.0025222392,0.00080474693,0.022022163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957794,0.0017994976,0.00019134309,0.0004843668,0.0014665768,0.00027871045],"domain_scores_gemma":[0.98706853,0.010597936,0.00056818925,0.00070460705,0.0008214419,0.00023930662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388477,0.001586941,0.0017005759,0.0031537123,0.0009300015,0.0040018894,0.00200966,0.0015214034,0.015642386],"category_scores_gemma":[0.023387685,0.0013691221,0.0015286192,0.0034428714,0.0017968084,0.0051804474,0.0027962148,0.0038487762,0.002023345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067508816,0.000053089643,0.00019129203,0.00024668043,0.000036661364,0.000059453207,0.00012248095,0.21985684,0.00045492355,0.7064212,0.007104359,0.06538555],"study_design_scores_gemma":[0.000012573418,0.000011663807,0.00005876904,0.00008526188,0.0000128107495,0.000016990367,0.000016640814,0.24042548,0.0004391472,0.75182253,0.007087941,0.000010127238],"about_ca_topic_score_codex":0.0037936196,"about_ca_topic_score_gemma":0.0046205046,"teacher_disagreement_score":0.015642386,"about_ca_system_score_codex":0.002774238,"about_ca_system_score_gemma":0.0015446453,"threshold_uncertainty_score":0.052328944},"labels":[],"label_agreement":null},{"id":"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013059776,0.000114097915,0.98929507,0.00021569149,0.00004076781,0.00006788445,0.00019686959,0.004093541,0.004670107],"genre_scores_gemma":[0.02877724,0.00028710612,0.9663049,0.00014468827,0.000027464355,0.00020163484,0.0005086513,0.0006096102,0.0031386495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993394,0.00013389277,0.0000668729,0.00012456729,0.000275533,0.000059680555],"domain_scores_gemma":[0.9984139,0.00086235063,0.000108054584,0.00037974975,0.00014980792,0.00008601875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011757459,0.001027847,0.00072385493,0.0015737668,0.0005880506,0.003412416,0.0027222913,0.0014812901,0.010418018],"category_scores_gemma":[0.0040998356,0.00074934756,0.0013786468,0.0016468443,0.0010474215,0.0036725458,0.0025845068,0.0021039594,0.0020143124],"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.00023437367,0.00021896776,0.0010564564,0.0009700863,0.00022184932,0.00068233337,0.0008648986,0.07190271,0.008571075,0.36510184,0.024539428,0.525636],"study_design_scores_gemma":[0.00013055383,0.00010664145,0.0004354194,0.00031602304,0.00017881519,0.0006418227,0.00021763974,0.5235112,0.019466734,0.22349295,0.23141956,0.000082691506],"about_ca_topic_score_codex":0.0025655692,"about_ca_topic_score_gemma":0.0035298467,"teacher_disagreement_score":0.010418018,"about_ca_system_score_codex":0.0006556695,"about_ca_system_score_gemma":0.0014474598,"threshold_uncertainty_score":0.03485179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011860691,0.00013856227,0.9851736,0.00050477905,0.000045260593,0.00006309951,0.000054759475,0.00038459618,0.001774718],"genre_scores_gemma":[0.7546747,0.0001863855,0.2411222,0.00037041635,0.00016137306,0.0002691799,0.00023042443,0.00011124833,0.0028740643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99421126,0.0015322343,0.00028387227,0.0015741958,0.0018665536,0.0005319256],"domain_scores_gemma":[0.9866976,0.008121931,0.0010171632,0.0022468034,0.0016115382,0.00030484353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053835055,0.00089654623,0.0015984001,0.00082408707,0.0008335614,0.0022332335,0.0021877591,0.001688531,0.002582724],"category_scores_gemma":[0.016906423,0.00046145098,0.00087413733,0.0010326215,0.002737386,0.0034635784,0.0042807464,0.0027736563,0.00032693907],"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.000733363,0.00017930841,0.002572189,0.0004610848,0.00020920037,0.0009774126,0.0004678168,0.45566916,0.009486407,0.35160923,0.004493286,0.17314157],"study_design_scores_gemma":[0.00014871861,0.00012200275,0.0003064874,0.000029117009,0.000050820836,0.00023693181,0.000093339586,0.7440355,0.005568538,0.24726127,0.0021265578,0.00002073569],"about_ca_topic_score_codex":0.0012605008,"about_ca_topic_score_gemma":0.0011688231,"teacher_disagreement_score":0.0053835055,"about_ca_system_score_codex":0.0013589879,"about_ca_system_score_gemma":0.002152493,"threshold_uncertainty_score":0.028471053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056561206,0.0006796023,0.9303511,0.00049852073,0.000059803264,0.00021319596,0.00046660213,0.0015736864,0.009596385],"genre_scores_gemma":[0.25693247,0.0006253073,0.7388151,0.000117689306,0.00004008265,0.00031549705,0.00074409664,0.00041058686,0.001999132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991259,0.00026318937,0.000041375046,0.00010640325,0.00034457856,0.00011860477],"domain_scores_gemma":[0.9982703,0.0011373546,0.0001280757,0.00013878998,0.0002773507,0.000048110855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795138,0.00068620936,0.0007693538,0.0006670404,0.00071493123,0.0010198341,0.0010168367,0.0004939554,0.003562458],"category_scores_gemma":[0.0037958943,0.000531124,0.00069434155,0.0016055751,0.0006243069,0.0014332059,0.0005756598,0.00096689473,0.00040438722],"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.00008876125,0.000067465044,0.000530763,0.0001658193,0.000023671933,0.00005734143,0.00005524641,0.9016946,0.0033563555,0.02308514,0.0040101227,0.06686472],"study_design_scores_gemma":[0.000028424545,0.000028858705,0.00009688103,0.0000073198185,0.0000068215586,0.00001031691,0.00001527194,0.9866954,0.0016419595,0.009378706,0.0020828203,0.0000072787197],"about_ca_topic_score_codex":0.014716918,"about_ca_topic_score_gemma":0.02487906,"teacher_disagreement_score":0.014716918,"about_ca_system_score_codex":0.0013021935,"about_ca_system_score_gemma":0.0046246885,"threshold_uncertainty_score":0.029262543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642616,0.00041569717,0.02302844,0.00042498088,0.00003305053,0.000105972904,0.00023042918,0.000355891,0.011143944],"genre_scores_gemma":[0.9824385,0.0002960043,0.015643036,0.0000800944,0.000014921828,0.0000638924,0.0003208806,0.00006534515,0.0010773198],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9947712,0.0031161052,0.00026643905,0.00076673285,0.00078788947,0.00029158307],"domain_scores_gemma":[0.9570186,0.03236283,0.003514009,0.0033565878,0.0023369277,0.0014110088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005226709,0.0009177156,0.0006460207,0.0008475431,0.0005842694,0.0027650215,0.0009258448,0.0011113744,0.0031657503],"category_scores_gemma":[0.05115392,0.00021122818,0.00040341885,0.0010930658,0.0010125219,0.0020356975,0.0010678489,0.00056797225,0.0010557555],"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.0036922714,0.0025513812,0.20056489,0.002031691,0.00080126815,0.00061750435,0.02630688,0.09023029,0.038199905,0.012281835,0.013695963,0.60902625],"study_design_scores_gemma":[0.00061434385,0.012730988,0.23624633,0.00092188333,0.000429231,0.0026061116,0.047538683,0.53299874,0.041319866,0.0711655,0.05269238,0.0007359503],"about_ca_topic_score_codex":0.0024768866,"about_ca_topic_score_gemma":0.0019169755,"teacher_disagreement_score":0.005226709,"about_ca_system_score_codex":0.00040302888,"about_ca_system_score_gemma":0.0005579537,"threshold_uncertainty_score":0.027641833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13572969,0.0015276147,0.83041877,0.0047598765,0.000091123824,0.00011773556,0.00048473818,0.00047750212,0.026392965],"genre_scores_gemma":[0.77035147,0.0019505898,0.21566276,0.000720183,0.00046313126,0.0004401215,0.00073280203,0.00020269262,0.009476233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967043,0.0012534838,0.00023211134,0.0005808622,0.0009617326,0.00026748047],"domain_scores_gemma":[0.9809022,0.015657857,0.00090302643,0.0012334724,0.00090015936,0.00040328587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033556407,0.0010813758,0.00107528,0.0023622462,0.0013882145,0.0044748075,0.0020539109,0.0014003216,0.0036667087],"category_scores_gemma":[0.024038859,0.0005701437,0.002079555,0.005418752,0.0041282536,0.0125226,0.0035663245,0.005383845,0.0004094607],"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.00003303633,0.000031683558,0.0004641,0.000059709633,0.000009868231,0.00007140162,0.00020870882,0.018174533,0.0009019515,0.9637756,0.0007305163,0.01553906],"study_design_scores_gemma":[0.000014197354,0.000018798468,0.00018586717,0.000022021653,0.000013153969,0.000086348686,0.00007216657,0.12092348,0.0009125451,0.87525004,0.0024858296,0.000015557482],"about_ca_topic_score_codex":0.0034756337,"about_ca_topic_score_gemma":0.0019895923,"teacher_disagreement_score":0.0044748075,"about_ca_system_score_codex":0.0040328894,"about_ca_system_score_gemma":0.0012115205,"threshold_uncertainty_score":0.029260814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02447624,0.00023251833,0.9623635,0.0005934422,0.000026851238,0.00004136792,0.0005755644,0.0013151732,0.010375386],"genre_scores_gemma":[0.66392773,0.000462317,0.32832935,0.000224584,0.000042229785,0.00022348207,0.0008068221,0.00037115882,0.0056122467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972314,0.00007458985,0.000013832808,0.000072053226,0.000088825494,0.000027592956],"domain_scores_gemma":[0.99936956,0.0002626602,0.00009773797,0.000110750254,0.00011188148,0.00004744793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007150208,0.0003990432,0.00040687338,0.00076854887,0.000434417,0.0013616041,0.0017678654,0.0004677365,0.005707929],"category_scores_gemma":[0.0028753933,0.00041888928,0.0008887262,0.0008904711,0.0011896669,0.0019874498,0.0012013603,0.0007711076,0.00044098042],"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.000121524026,0.000051954095,0.0018261063,0.00013669192,0.000074875854,0.00013405355,0.0001824269,0.5761412,0.002120746,0.35910442,0.0049122046,0.05519394],"study_design_scores_gemma":[0.000010803862,0.000008934237,0.0003716574,0.000015809535,0.000008710205,0.00002749402,0.000015544554,0.882062,0.0007207285,0.112805165,0.0039447364,0.000008420045],"about_ca_topic_score_codex":0.012599179,"about_ca_topic_score_gemma":0.009877807,"teacher_disagreement_score":0.012599179,"about_ca_system_score_codex":0.0013516884,"about_ca_system_score_gemma":0.0012641853,"threshold_uncertainty_score":0.025051653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38806278,0.0012752146,0.59978044,0.000491594,0.000021593532,0.00015818812,0.00029461467,0.0011464794,0.008769058],"genre_scores_gemma":[0.9155771,0.00022649554,0.08174226,0.000079686484,0.00003293365,0.00017772026,0.00026922597,0.00018766201,0.0017068906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971294,0.0012094163,0.00016459334,0.00044816436,0.0008614284,0.00018704055],"domain_scores_gemma":[0.9680759,0.022683175,0.004027823,0.0027739748,0.0019150241,0.00052413344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038668464,0.00037114247,0.00085759297,0.0018179994,0.00057395245,0.0011614531,0.0010745426,0.0009311013,0.0022832593],"category_scores_gemma":[0.030042117,0.00036960337,0.0005981626,0.0011725505,0.0018996402,0.002371605,0.0009735897,0.0014069069,0.0002629223],"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.000707165,0.00024854217,0.026232705,0.0005468134,0.00019606049,0.00030743447,0.0010266498,0.63774276,0.018534085,0.13279812,0.0032107846,0.17844896],"study_design_scores_gemma":[0.000035780206,0.00017412713,0.0035748559,0.000027565366,0.000034002085,0.0001691612,0.00007443501,0.9628126,0.004905148,0.027339125,0.0008306859,0.000022517645],"about_ca_topic_score_codex":0.0019921665,"about_ca_topic_score_gemma":0.0027688951,"teacher_disagreement_score":0.0038668464,"about_ca_system_score_codex":0.0015190048,"about_ca_system_score_gemma":0.00092319696,"threshold_uncertainty_score":0.020450115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043436633,0.00017030921,0.9895586,0.0003905027,0.00004621004,0.00020361312,0.0001949252,0.00031874742,0.0047735004],"genre_scores_gemma":[0.109912276,0.0004773907,0.8857013,0.00021107533,0.00007160201,0.00058765884,0.00095845375,0.00023512283,0.00184512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811304,0.00067907927,0.00008943119,0.00023538666,0.0006992631,0.00018371765],"domain_scores_gemma":[0.9934429,0.0047762007,0.0003340734,0.0005584826,0.000734484,0.00015384231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024526592,0.0012480482,0.0013674665,0.0030903001,0.0016507697,0.0028023378,0.0030043987,0.0014281037,0.0062011126],"category_scores_gemma":[0.014108193,0.0013684501,0.0017490067,0.0035560457,0.0017781301,0.0033114261,0.0018237637,0.003595013,0.0007217574],"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.00008213481,0.00016953882,0.0006225429,0.00025576245,0.00007201607,0.00009772642,0.00018552325,0.6845816,0.0015955582,0.20827061,0.005114105,0.09895294],"study_design_scores_gemma":[0.000018569552,0.000019606829,0.000067300556,0.000029741972,0.000016648624,0.000015968037,0.000033428092,0.8976538,0.0005337023,0.099035166,0.002566668,0.000009297389],"about_ca_topic_score_codex":0.009203472,"about_ca_topic_score_gemma":0.0138902515,"teacher_disagreement_score":0.009203472,"about_ca_system_score_codex":0.0025944505,"about_ca_system_score_gemma":0.004370639,"threshold_uncertainty_score":0.0207448},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005144292,0.00020801464,0.99154013,0.00048433122,0.000036447294,0.00008886327,0.00010539116,0.00042067908,0.0019718346],"genre_scores_gemma":[0.16300352,0.00047027358,0.83205664,0.00045574876,0.00012056484,0.00054169365,0.000616585,0.0001965823,0.0025383746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737597,0.0010991498,0.00016159914,0.0005148969,0.00061904354,0.00022931889],"domain_scores_gemma":[0.99057007,0.007559969,0.00045773684,0.0004475267,0.0008395008,0.00012524005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032820846,0.0013261315,0.0013873449,0.0011719748,0.0007392404,0.001497242,0.0020274827,0.0016644273,0.006710601],"category_scores_gemma":[0.02065816,0.00070478773,0.0013854429,0.0017065876,0.0015216294,0.0026925746,0.0016073739,0.0022952305,0.00089318055],"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.00012213347,0.00024016527,0.0015038163,0.0007236228,0.0001307581,0.00016789543,0.00028078552,0.57086414,0.001478076,0.13958675,0.0072105504,0.27769136],"study_design_scores_gemma":[0.000050208513,0.000050136023,0.00008052734,0.000037792826,0.000018992829,0.000037088754,0.000029995515,0.8619145,0.0008062074,0.13456526,0.0023997133,0.000009592583],"about_ca_topic_score_codex":0.0046275123,"about_ca_topic_score_gemma":0.006063864,"teacher_disagreement_score":0.006710601,"about_ca_system_score_codex":0.0014063804,"about_ca_system_score_gemma":0.0030097151,"threshold_uncertainty_score":0.022449136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005536912,0.00014710255,0.98787886,0.00022049586,0.00006106236,0.00016134714,0.00012903228,0.00058918004,0.005275859],"genre_scores_gemma":[0.15164067,0.00044604458,0.8313236,0.0003903993,0.00011404228,0.00091410935,0.0012004812,0.0010281621,0.012942505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967752,0.000992915,0.00013204305,0.000598326,0.0012038173,0.00029766664],"domain_scores_gemma":[0.9957314,0.002176618,0.0002511793,0.0010705538,0.00063749857,0.00013268815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018221778,0.0010868614,0.0013768144,0.0016507776,0.0017524577,0.0018425365,0.0033396801,0.0011151816,0.009155895],"category_scores_gemma":[0.009231237,0.00075070915,0.0022024738,0.002285282,0.0015694503,0.003398167,0.0039731567,0.004569043,0.001633936],"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.0002112506,0.00031090024,0.0008611157,0.000528676,0.00022797394,0.00043286465,0.0004527309,0.4473654,0.01437655,0.24711259,0.012538809,0.27558103],"study_design_scores_gemma":[0.00007954665,0.000096777105,0.00036558145,0.00006565901,0.000099746256,0.00019194698,0.00015471973,0.7096597,0.0147275925,0.24983384,0.024673091,0.00005180367],"about_ca_topic_score_codex":0.005720358,"about_ca_topic_score_gemma":0.007773516,"teacher_disagreement_score":0.009155895,"about_ca_system_score_codex":0.0015570074,"about_ca_system_score_gemma":0.0024201665,"threshold_uncertainty_score":0.030629516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036460273,0.00047042783,0.94174904,0.0028736198,0.00010356472,0.00025040813,0.0016923044,0.0011578546,0.015242546],"genre_scores_gemma":[0.50238615,0.00086040876,0.4731004,0.0016838725,0.00026717337,0.0014244863,0.005016392,0.0015476358,0.013713606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878664,0.004731551,0.0006930686,0.0025331324,0.003040884,0.0011349606],"domain_scores_gemma":[0.94069445,0.041930284,0.0015432108,0.0130631,0.0022654026,0.00050340523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010257176,0.0016907589,0.0027217346,0.0025348582,0.0021454745,0.004000567,0.006407272,0.0025565762,0.011178648],"category_scores_gemma":[0.05896621,0.0014867187,0.0047304407,0.0054621804,0.0054267375,0.011705476,0.005623435,0.007825568,0.0011608602],"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.000345464,0.00024900868,0.0011015394,0.00042489855,0.00015228274,0.00020373252,0.00027595623,0.22250818,0.0013502747,0.715967,0.010394764,0.047026854],"study_design_scores_gemma":[0.00005382457,0.000020393667,0.00011613631,0.000031528634,0.00003460198,0.000044480144,0.000029628498,0.1984105,0.00075726013,0.7988596,0.0016227068,0.000019374831],"about_ca_topic_score_codex":0.011145275,"about_ca_topic_score_gemma":0.0138555085,"teacher_disagreement_score":0.011178648,"about_ca_system_score_codex":0.0054312795,"about_ca_system_score_gemma":0.00419675,"threshold_uncertainty_score":0.05424577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029704263,0.00014061246,0.9606916,0.00021434686,0.00006931687,0.00016107067,0.00011605735,0.0010712061,0.007831649],"genre_scores_gemma":[0.2443233,0.0001115005,0.75120807,0.00012656864,0.000038689526,0.00029252554,0.0004353616,0.00029242833,0.003171511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774927,0.0006879258,0.00016052047,0.00035210495,0.0007618682,0.00028834917],"domain_scores_gemma":[0.9915752,0.006490885,0.00025284654,0.0009189055,0.0005937091,0.00016849895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002548915,0.0010149287,0.00152882,0.0015375912,0.001186753,0.0022621374,0.00328137,0.0018600461,0.01210392],"category_scores_gemma":[0.014157051,0.0016926401,0.0016489915,0.0017819334,0.0018184234,0.004497961,0.004964539,0.0035253593,0.0011444085],"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.00065329956,0.00054769265,0.0015824052,0.0007705422,0.00020728233,0.00031513613,0.0005538652,0.48284373,0.008667166,0.20562534,0.0061649783,0.29206857],"study_design_scores_gemma":[0.00010205516,0.000060485923,0.000076670796,0.000021587477,0.00004675747,0.000046331916,0.00007765954,0.89002484,0.0028914483,0.10423132,0.002401778,0.000019015288],"about_ca_topic_score_codex":0.004048268,"about_ca_topic_score_gemma":0.008752128,"teacher_disagreement_score":0.01210392,"about_ca_system_score_codex":0.0010703324,"about_ca_system_score_gemma":0.0021961827,"threshold_uncertainty_score":0.04049164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027807195,0.00024361577,0.9300793,0.00031539274,0.00014705416,0.000066292436,0.00058459176,0.000559275,0.04019731],"genre_scores_gemma":[0.60367364,0.00040176505,0.3860706,0.00007934344,0.00008140974,0.0001431602,0.0008116737,0.00016125372,0.008577195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999546,0.00009082759,0.000040122337,0.0000435892,0.00023789081,0.000041567724],"domain_scores_gemma":[0.9991062,0.00026468816,0.000107761385,0.00015004509,0.0003179613,0.000053187665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060604163,0.000295028,0.0003309516,0.0009360223,0.0004183921,0.0023878282,0.00076581974,0.0004266221,0.010917955],"category_scores_gemma":[0.004286877,0.00015604543,0.00026921002,0.001512746,0.00065686565,0.001410961,0.0004965679,0.0010189712,0.0013858369],"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.00012601454,0.00005101995,0.0005717673,0.00012325164,0.000007398082,0.00010973944,0.00020690786,0.16925944,0.003702484,0.7358121,0.0030649465,0.08696486],"study_design_scores_gemma":[0.00002326359,0.000048038062,0.00030318112,0.00003929643,0.000005136487,0.0001084821,0.00009783516,0.73768926,0.0018370812,0.24517073,0.014658013,0.000019736115],"about_ca_topic_score_codex":0.001626999,"about_ca_topic_score_gemma":0.0015067188,"teacher_disagreement_score":0.010917955,"about_ca_system_score_codex":0.00068770925,"about_ca_system_score_gemma":0.000586554,"threshold_uncertainty_score":0.036524236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045101563,0.0012927619,0.8748593,0.0028797195,0.0005659409,0.00006384858,0.0002347762,0.00069618167,0.1148975],"genre_scores_gemma":[0.17532289,0.0062187887,0.66745716,0.0025811587,0.00074483117,0.00018267379,0.0010964515,0.001055259,0.1453408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947566,0.00016455715,0.000044163968,0.00010099635,0.00014111702,0.000073518255],"domain_scores_gemma":[0.99921656,0.00041521664,0.00008098355,0.00009177513,0.00015613559,0.000039303897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011388427,0.0008043219,0.00045819624,0.002290513,0.001794575,0.0027098467,0.0013383062,0.0014687749,0.02195262],"category_scores_gemma":[0.0030168649,0.0004535684,0.0010248725,0.0018210304,0.0027216207,0.0038591728,0.0015036352,0.0015257753,0.007103168],"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.00005852085,0.000037472422,0.0005195899,0.0001801222,0.000026824066,0.0004907956,0.0011608648,0.014395004,0.0032775204,0.8292543,0.02680484,0.12379409],"study_design_scores_gemma":[0.000010946844,0.000072952134,0.00084893557,0.00017864488,0.00003899781,0.0007013668,0.0011298535,0.04441807,0.007104123,0.684097,0.26132324,0.000075889475],"about_ca_topic_score_codex":0.007318825,"about_ca_topic_score_gemma":0.011353554,"teacher_disagreement_score":0.02195262,"about_ca_system_score_codex":0.0011051944,"about_ca_system_score_gemma":0.0007274813,"threshold_uncertainty_score":0.07343888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012492045,0.00008876874,0.98048764,0.00020423852,0.00008329316,0.000082222796,0.000040656952,0.00052684604,0.005994252],"genre_scores_gemma":[0.37730372,0.00018436713,0.6114999,0.00030318645,0.00010146998,0.00029614745,0.00020182428,0.00017539899,0.009933918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993136,0.00019955651,0.000032124488,0.0001520409,0.00022018877,0.00008247651],"domain_scores_gemma":[0.9991689,0.00035560282,0.00005560177,0.0001744139,0.00017760813,0.00006787096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009326258,0.0004722252,0.0006085971,0.00052614976,0.0006566788,0.0007845508,0.0021891564,0.0009160165,0.004733751],"category_scores_gemma":[0.0028461774,0.00031973294,0.00040662623,0.0006045509,0.0006326567,0.001631875,0.0016309563,0.0014091812,0.0008799621],"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.00034772215,0.0002348618,0.00081913476,0.00013260306,0.00006274786,0.00019157275,0.00021438357,0.5193663,0.008189494,0.10555435,0.0060785883,0.35880822],"study_design_scores_gemma":[0.000045689038,0.000035567118,0.00004889406,0.000005254061,0.0000053430995,0.000036439294,0.000010666534,0.98020685,0.00080754154,0.015676891,0.0031131348,0.0000076941515],"about_ca_topic_score_codex":0.0019175776,"about_ca_topic_score_gemma":0.002344487,"teacher_disagreement_score":0.004733751,"about_ca_system_score_codex":0.00048979314,"about_ca_system_score_gemma":0.0012338397,"threshold_uncertainty_score":0.01583594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020125431,0.0009564176,0.98626584,0.00025193294,0.000082689454,0.000042028645,0.0000874962,0.0002299917,0.010071126],"genre_scores_gemma":[0.0619323,0.0019771263,0.92802435,0.00021901538,0.00017667645,0.00016451621,0.0006435256,0.00037289257,0.006489555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986922,0.0005825171,0.00006444831,0.0001389028,0.00042777814,0.00009418958],"domain_scores_gemma":[0.9981127,0.0012743641,0.00008375935,0.00029490324,0.0001752106,0.000059026333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016287914,0.0014634333,0.001204623,0.0011728314,0.00047292924,0.0017112975,0.0012412055,0.00079336425,0.0072263605],"category_scores_gemma":[0.005410904,0.0010403458,0.0016504689,0.0028828173,0.00093843834,0.0027608473,0.0026362173,0.003765106,0.0016495609],"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.00012725737,0.00016051729,0.00038903372,0.0007053526,0.0001579011,0.00017078815,0.00018204853,0.16025978,0.0052297395,0.40406471,0.023345098,0.4052078],"study_design_scores_gemma":[0.000031528776,0.000032317053,0.0001365058,0.00012851924,0.000043016546,0.0001141797,0.00003731366,0.49724784,0.0018663354,0.47435117,0.025991878,0.000019351097],"about_ca_topic_score_codex":0.0015217672,"about_ca_topic_score_gemma":0.0021047136,"teacher_disagreement_score":0.0072263605,"about_ca_system_score_codex":0.00064783124,"about_ca_system_score_gemma":0.0008535432,"threshold_uncertainty_score":0.024174571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038843937,0.00011791207,0.9535618,0.00087250076,0.000029885088,0.0001356959,0.00020597756,0.0003681207,0.0058642025],"genre_scores_gemma":[0.7040501,0.00024777194,0.2888987,0.00054205715,0.000106473046,0.0006412487,0.0006942186,0.00025506213,0.0045643505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923253,0.0034129436,0.00037547929,0.0012846583,0.0019945984,0.0006071115],"domain_scores_gemma":[0.97579896,0.016071755,0.0018534765,0.0044467556,0.001317721,0.00051126734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004732098,0.0007103413,0.0010370337,0.0009797399,0.0012765889,0.0023715792,0.003044533,0.0017321339,0.0057245875],"category_scores_gemma":[0.027648399,0.0008801591,0.0014765481,0.0016747573,0.0035814033,0.0060597127,0.0025622146,0.0029705353,0.0005272062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007372761,0.00008562951,0.0007212636,0.00010684361,0.000055467124,0.00014414036,0.00020424832,0.17603819,0.0014815304,0.81047356,0.0012987506,0.0093166595],"study_design_scores_gemma":[0.000052550917,0.000043020875,0.00016613516,0.000014343321,0.000015982236,0.000105736464,0.00005335008,0.4164213,0.0014961599,0.57894295,0.0026683856,0.000020066162],"about_ca_topic_score_codex":0.0018049489,"about_ca_topic_score_gemma":0.00207395,"teacher_disagreement_score":0.0057245875,"about_ca_system_score_codex":0.0015334439,"about_ca_system_score_gemma":0.001793482,"threshold_uncertainty_score":0.025026023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064217344,0.0013804989,0.92640567,0.00096515886,0.000086458596,0.0004174946,0.00015088213,0.0013716812,0.0050048204],"genre_scores_gemma":[0.46775916,0.00084983394,0.5257113,0.0005763369,0.00018486936,0.00080243876,0.0006211917,0.0003853655,0.003109542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942578,0.0031975757,0.0004041698,0.00082623644,0.0009186724,0.00039548363],"domain_scores_gemma":[0.9631238,0.02929734,0.0017035027,0.0033273874,0.0017867688,0.00076120824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013089362,0.0015902513,0.0028601775,0.0023180477,0.001078994,0.0025047376,0.0031233456,0.002456358,0.0038334338],"category_scores_gemma":[0.056463484,0.0012534925,0.0008732741,0.002448916,0.0019278538,0.006024113,0.0031735545,0.002847684,0.0009792215],"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.00058874866,0.0004629249,0.0042930325,0.00018400537,0.00010822133,0.00011400904,0.00022964376,0.7299767,0.0009597919,0.036428362,0.0028203288,0.22383425],"study_design_scores_gemma":[0.00006671392,0.00012098442,0.00017086843,0.000026586991,0.000017549548,0.000026599646,0.000030568626,0.96903,0.00033872886,0.02939642,0.00076669577,0.000008224374],"about_ca_topic_score_codex":0.0026841967,"about_ca_topic_score_gemma":0.0033679202,"teacher_disagreement_score":0.013089362,"about_ca_system_score_codex":0.0017628889,"about_ca_system_score_gemma":0.0023036595,"threshold_uncertainty_score":0.069224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105683014,0.0024567316,0.8468935,0.0138829,0.00022625836,0.00027409685,0.0010402368,0.0008889916,0.028654274],"genre_scores_gemma":[0.8518386,0.0025827012,0.12797572,0.0034161273,0.001347434,0.0015553408,0.0016890297,0.00065484014,0.008940328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98949057,0.0035535572,0.00045075166,0.0020005791,0.0031212878,0.0013833034],"domain_scores_gemma":[0.8805782,0.10634162,0.003228092,0.006113458,0.0019807764,0.0017578757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01236746,0.0016089327,0.0030082117,0.0026492998,0.0025643043,0.0070360373,0.0047089825,0.0033044147,0.010786013],"category_scores_gemma":[0.084016904,0.0010961117,0.0027766135,0.0028621014,0.006847473,0.019997174,0.0064009363,0.010756756,0.0014169072],"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.0003864398,0.00022165566,0.0014610813,0.0003551962,0.00012830402,0.00023015175,0.00038098576,0.055760562,0.0023961538,0.9046036,0.007462662,0.026613379],"study_design_scores_gemma":[0.00008934894,0.000063501255,0.0005236057,0.00005159721,0.0000311129,0.00016496233,0.000058508016,0.22898485,0.0009430324,0.7673431,0.0017098077,0.000036616173],"about_ca_topic_score_codex":0.0011286126,"about_ca_topic_score_gemma":0.00066743686,"teacher_disagreement_score":0.01236746,"about_ca_system_score_codex":0.005062469,"about_ca_system_score_gemma":0.0023800398,"threshold_uncertainty_score":0.06540614},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055385776,0.041104425,0.4068786,0.41286948,0.003996864,0.00012500925,0.001938484,0.00065954484,0.07704187],"genre_scores_gemma":[0.77791774,0.033369664,0.0981686,0.033574663,0.022023275,0.00038282358,0.0024709252,0.0012762957,0.030816056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99162966,0.0034890897,0.00030863946,0.00099367,0.003042675,0.0005362429],"domain_scores_gemma":[0.9028812,0.08478839,0.0017689145,0.0055512646,0.0036155868,0.0013945845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0091397,0.0007643415,0.0025103108,0.001655613,0.0022251066,0.007426088,0.0028559095,0.005131114,0.012413744],"category_scores_gemma":[0.0601624,0.00085999956,0.0019770619,0.0026509368,0.007528905,0.03050026,0.0042559,0.013658057,0.0015648983],"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.00012533397,0.0000925702,0.0006127308,0.000373593,0.00010919414,0.00009413778,0.0002747597,0.011078019,0.00038230847,0.913228,0.041835934,0.03179345],"study_design_scores_gemma":[0.000031777086,0.00000987097,0.00019176396,0.00004498059,0.000008900583,0.000058453585,0.00011010523,0.014346023,0.00012993279,0.97490746,0.010140623,0.00002005255],"about_ca_topic_score_codex":0.0019056286,"about_ca_topic_score_gemma":0.0012769927,"teacher_disagreement_score":0.012413744,"about_ca_system_score_codex":0.0024467688,"about_ca_system_score_gemma":0.001389477,"threshold_uncertainty_score":0.04833597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021798012,0.009818759,0.53728276,0.010815264,0.00086559757,0.00017146165,0.00021452767,0.0010692531,0.43758252],"genre_scores_gemma":[0.17237422,0.010214008,0.6941656,0.0029454506,0.0007419403,0.001079704,0.0007505525,0.0005990861,0.117129505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974267,0.0010215119,0.00020625394,0.0004663429,0.0007356442,0.00014343872],"domain_scores_gemma":[0.9982078,0.0005196916,0.00011238712,0.0007501165,0.00030861204,0.000101503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032864036,0.0010138535,0.0007074606,0.0019623197,0.0023368562,0.007517092,0.0023299262,0.002416989,0.018075226],"category_scores_gemma":[0.004449588,0.00064844306,0.0009737223,0.0015840876,0.011201082,0.0072343317,0.003843674,0.003205832,0.007095565],"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.0000027333215,0.0000048875095,0.00003697149,0.000048835984,0.0000040312134,0.000017218577,0.00015332195,0.00069336663,0.00009804456,0.98519045,0.0030748055,0.010675223],"study_design_scores_gemma":[0.000006492047,0.000008903372,0.000039984425,0.000104682935,0.0000050251742,0.00005461195,0.00008462548,0.0025717423,0.00017298321,0.77495956,0.22198209,0.000009343254],"about_ca_topic_score_codex":0.0019716525,"about_ca_topic_score_gemma":0.0021842448,"teacher_disagreement_score":0.018075226,"about_ca_system_score_codex":0.0031279544,"about_ca_system_score_gemma":0.0027071713,"threshold_uncertainty_score":0.06046766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009764291,0.012909208,0.27967122,0.0015828852,0.0012807597,0.00005241883,0.00043733837,0.0006600747,0.69364184],"genre_scores_gemma":[0.25384486,0.022529334,0.14026548,0.0010588474,0.0021516623,0.00027156793,0.0014133087,0.001223926,0.577241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957293,0.000087671964,0.0000286313,0.00006070323,0.00022057234,0.000029504006],"domain_scores_gemma":[0.9997863,0.00007218096,0.000014364436,0.000044690347,0.00006416143,0.000018274015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004814099,0.00076987635,0.00070385,0.00094576273,0.0009907777,0.001980335,0.0007173188,0.00040415925,0.020330591],"category_scores_gemma":[0.0006741439,0.0005402824,0.00056944555,0.0019507767,0.0019743727,0.0041090376,0.0011714554,0.0021058617,0.0074844267],"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.000005544394,0.000008598356,0.00001521563,0.00007097089,0.0000039771007,0.00001728587,0.000106160194,0.00068125327,0.00036555965,0.9658626,0.008920347,0.023942497],"study_design_scores_gemma":[0.0000025851596,0.000007441487,0.000025945908,0.00002822772,0.0000029807006,0.000075254466,0.000038384278,0.0012119283,0.0005094821,0.9115907,0.08649978,0.0000072998937],"about_ca_topic_score_codex":0.0009311221,"about_ca_topic_score_gemma":0.0013926107,"teacher_disagreement_score":0.020330591,"about_ca_system_score_codex":0.001021619,"about_ca_system_score_gemma":0.0009367044,"threshold_uncertainty_score":0.068012536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023846347,0.0004172034,0.96805644,0.0003929149,0.00005173563,0.00023186876,0.00027782726,0.00092995464,0.0057956637],"genre_scores_gemma":[0.21530403,0.0002813733,0.78096867,0.00016291147,0.000046951398,0.0004610376,0.00056829187,0.00017115573,0.0020355284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865997,0.00052004156,0.00007346092,0.00026701394,0.00027621252,0.00020337036],"domain_scores_gemma":[0.99600947,0.0031389268,0.00021321821,0.00026464192,0.0002606777,0.000113067974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018869332,0.0011363232,0.0011459138,0.0013352196,0.00080981955,0.0016064865,0.0021428475,0.0015607338,0.005880007],"category_scores_gemma":[0.0074358545,0.00072619994,0.0009705676,0.002183988,0.0008377889,0.0024528694,0.0013820574,0.0014880905,0.0006715395],"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.00016224482,0.00015269949,0.00061861105,0.00021107587,0.00006129363,0.00009878991,0.00014710812,0.8073002,0.0011293056,0.06896514,0.005033831,0.11611965],"study_design_scores_gemma":[0.00005384657,0.000026109068,0.000055640146,0.000012977865,0.000013974404,0.000023524271,0.000045758738,0.9528232,0.00065384066,0.044789627,0.0014929548,0.0000084694075],"about_ca_topic_score_codex":0.005184484,"about_ca_topic_score_gemma":0.007554813,"teacher_disagreement_score":0.005880007,"about_ca_system_score_codex":0.002039738,"about_ca_system_score_gemma":0.0025082938,"threshold_uncertainty_score":0.019670546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005161229,0.003711348,0.810354,0.01488526,0.0012243572,0.0011708384,0.0027536112,0.0008906866,0.15984872],"genre_scores_gemma":[0.1006941,0.0068143723,0.82468826,0.0020406526,0.00093275297,0.0018983316,0.0047816373,0.00044146244,0.057708453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959139,0.0016118854,0.0004554317,0.00079670665,0.0008231496,0.00039889314],"domain_scores_gemma":[0.995754,0.0015265874,0.00044325885,0.0006264884,0.0012559419,0.00039368123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004625253,0.0017912869,0.0012118539,0.003419235,0.0039996607,0.00812192,0.003387479,0.003972719,0.035944205],"category_scores_gemma":[0.01082044,0.00088836555,0.0018014482,0.005189317,0.0040496984,0.010515285,0.00534114,0.0042158524,0.006441791],"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.000017624658,0.000026986449,0.00017620398,0.00015841224,0.000009341978,0.000096398166,0.00045463044,0.005546258,0.00015676032,0.94302803,0.018304005,0.03202541],"study_design_scores_gemma":[0.000027382115,0.00003425635,0.00020891408,0.00028471334,0.00001867779,0.00019704428,0.00095208315,0.011027606,0.0004600879,0.4767779,0.5099745,0.000036821475],"about_ca_topic_score_codex":0.016109826,"about_ca_topic_score_gemma":0.012371403,"teacher_disagreement_score":0.035944205,"about_ca_system_score_codex":0.00450799,"about_ca_system_score_gemma":0.0057066293,"threshold_uncertainty_score":0.12024528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106152035,0.00035237998,0.97608215,0.00031516544,0.00013277715,0.00023371128,0.000517687,0.0048366315,0.006914352],"genre_scores_gemma":[0.30210996,0.00048341748,0.6814963,0.00064327626,0.00013409484,0.00040122264,0.0022022466,0.0014507193,0.011078773],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957963,0.0010858129,0.00025712542,0.00067447085,0.0015447208,0.0006415424],"domain_scores_gemma":[0.9926789,0.0034714835,0.00039054675,0.0022365784,0.0010649394,0.00015767789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033364326,0.0010405614,0.0013892705,0.0016651786,0.0015865285,0.0023137995,0.0034152854,0.0012125237,0.009932272],"category_scores_gemma":[0.010935708,0.0007609392,0.0025482774,0.001523906,0.002561558,0.0035145835,0.004090975,0.001965724,0.0021761246],"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.00068225025,0.00033841812,0.003350805,0.0013320098,0.0003043285,0.0008404351,0.00049693603,0.1054457,0.019754745,0.3598549,0.027821336,0.4797782],"study_design_scores_gemma":[0.0002136277,0.0002568924,0.00059607014,0.0002157908,0.00024321923,0.00059251627,0.00014606399,0.35381484,0.035786934,0.56899285,0.03903421,0.00010709185],"about_ca_topic_score_codex":0.0047217202,"about_ca_topic_score_gemma":0.0070464523,"teacher_disagreement_score":0.009932272,"about_ca_system_score_codex":0.0012491131,"about_ca_system_score_gemma":0.003972215,"threshold_uncertainty_score":0.033226788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009102817,0.000091186856,0.98426473,0.000542749,0.000018631437,0.00004565223,0.00017599504,0.00028470292,0.005473503],"genre_scores_gemma":[0.34526527,0.00020974947,0.6502876,0.00020365807,0.00003839599,0.00029683355,0.00048355298,0.00014010891,0.0030748504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990127,0.00026359333,0.00008714307,0.0002693098,0.00022456612,0.00014261746],"domain_scores_gemma":[0.9980496,0.0008650361,0.00024161748,0.00036439998,0.00031626696,0.00016311186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173484,0.0006796832,0.00053921796,0.0012135318,0.001194862,0.004436117,0.0021785074,0.0014925984,0.0074138665],"category_scores_gemma":[0.005410496,0.000720484,0.001736626,0.0016208119,0.0036824693,0.0067377584,0.0020623254,0.001838478,0.00076683733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024915587,0.000032838372,0.00043954686,0.00011004329,0.00002994185,0.000118794116,0.0010548345,0.034931596,0.0029802145,0.94380313,0.0009824918,0.01549163],"study_design_scores_gemma":[0.00002449294,0.000028124554,0.00035016378,0.000043162596,0.000038343103,0.00009920095,0.00035473076,0.20002429,0.0013110065,0.7903947,0.0073007587,0.0000310995],"about_ca_topic_score_codex":0.010966826,"about_ca_topic_score_gemma":0.013683987,"teacher_disagreement_score":0.010966826,"about_ca_system_score_codex":0.0018288821,"about_ca_system_score_gemma":0.0023051898,"threshold_uncertainty_score":0.02480185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03857043,0.092604265,0.45642322,0.03456824,0.0017288493,0.00009305173,0.0003562174,0.0004153068,0.37524045],"genre_scores_gemma":[0.7525348,0.049229108,0.12344978,0.0029218409,0.0016573962,0.00029032864,0.00046828724,0.00026288984,0.069185436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991837,0.0003510585,0.00003903679,0.00012704557,0.00024325297,0.000055933666],"domain_scores_gemma":[0.9991358,0.0004947151,0.000094041534,0.00008344286,0.00012227897,0.0000696168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086125795,0.0004097223,0.0005576475,0.00086170615,0.0010635271,0.003529595,0.0006892061,0.0013132528,0.004901506],"category_scores_gemma":[0.0023963181,0.0003521021,0.000345939,0.0015197361,0.0075952085,0.0041052205,0.0017955842,0.0023993452,0.0005612789],"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.000004615545,0.000004559902,0.00024749193,0.00005706674,0.00000813777,0.00004334723,0.00031688192,0.0045829844,0.00022709704,0.97877824,0.003084796,0.012644757],"study_design_scores_gemma":[0.000003392269,0.0000074498976,0.00027257236,0.000033080436,0.0000035349753,0.00007487002,0.00021920651,0.006346633,0.00013233056,0.93615043,0.056747295,0.000009139207],"about_ca_topic_score_codex":0.0075397477,"about_ca_topic_score_gemma":0.005867778,"teacher_disagreement_score":0.0075397477,"about_ca_system_score_codex":0.0021177228,"about_ca_system_score_gemma":0.0012315337,"threshold_uncertainty_score":0.016397119},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011994608,0.00011302168,0.98544127,0.00018621725,0.000020693074,0.000057209014,0.0000649515,0.00013860548,0.0019835015],"genre_scores_gemma":[0.26815698,0.0002469248,0.7281961,0.00014605068,0.00004896108,0.00025452385,0.0003427179,0.00007438462,0.0025333592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886227,0.00035720615,0.00005124245,0.0002580529,0.00036540042,0.00010585662],"domain_scores_gemma":[0.99826694,0.0010051718,0.00017315696,0.00021769803,0.0002417473,0.00009526818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012228226,0.0005623936,0.00073047244,0.0005870126,0.0007446794,0.0013183125,0.001876749,0.0008460315,0.0033510015],"category_scores_gemma":[0.0040081493,0.00046071547,0.0007917386,0.0013423586,0.0009413106,0.0020492626,0.0017543999,0.0016763133,0.00028978626],"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.00007345089,0.00007111891,0.0006642567,0.00012079818,0.00006563013,0.00017642516,0.00011544641,0.796362,0.0026570559,0.13108805,0.002244029,0.06636169],"study_design_scores_gemma":[0.000017846738,0.00002467267,0.00006812694,0.000007736268,0.000009369934,0.000038467093,0.000023559785,0.9554399,0.0008532134,0.040962927,0.0025470534,0.000007050008],"about_ca_topic_score_codex":0.0046559297,"about_ca_topic_score_gemma":0.007859886,"teacher_disagreement_score":0.0046559297,"about_ca_system_score_codex":0.0011069562,"about_ca_system_score_gemma":0.0017995627,"threshold_uncertainty_score":0.011210203},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023261877,0.00014377359,0.9940936,0.00019875621,0.000032538584,0.000050224837,0.00008524553,0.00020668066,0.002863042],"genre_scores_gemma":[0.21942087,0.001106773,0.7738333,0.00023117686,0.000251703,0.00040853443,0.00038833224,0.00010076451,0.004258549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698573,0.0007969653,0.0002658694,0.0005611795,0.001176563,0.00021364876],"domain_scores_gemma":[0.99767524,0.000988128,0.0004306893,0.00035582922,0.0003847897,0.00016543145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00286674,0.00076701894,0.0009306463,0.0012142707,0.0009694803,0.0030086394,0.0031751387,0.0010501342,0.0046720114],"category_scores_gemma":[0.005115144,0.00049557514,0.002101212,0.001950616,0.0015637238,0.0068183793,0.0024020313,0.0023333658,0.00083683117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008872793,0.00009600613,0.000521211,0.0001676382,0.000074366086,0.00034337866,0.00032788303,0.28737572,0.003798413,0.639991,0.0022676364,0.06494813],"study_design_scores_gemma":[0.000026306758,0.00006583539,0.00008918204,0.000035952307,0.000048005284,0.00017730707,0.00006138067,0.78598255,0.0019013548,0.19973287,0.011838274,0.000040934887],"about_ca_topic_score_codex":0.004115898,"about_ca_topic_score_gemma":0.0042063007,"teacher_disagreement_score":0.0046720114,"about_ca_system_score_codex":0.0010878216,"about_ca_system_score_gemma":0.0022562912,"threshold_uncertainty_score":0.01562947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003012671,0.00042985906,0.98696196,0.00053023285,0.00010660351,0.00008477187,0.00016691464,0.00040225068,0.0083046695],"genre_scores_gemma":[0.13729459,0.0010346767,0.85129637,0.00041870587,0.0003784731,0.0005541014,0.0006943672,0.00031410746,0.008014634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965848,0.0009757773,0.00042252088,0.000676924,0.0010099118,0.00032997955],"domain_scores_gemma":[0.9953063,0.0021747032,0.00068938365,0.00083769904,0.0007320902,0.0002598498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005431756,0.0011103426,0.00066198694,0.0016954481,0.0019681249,0.0038902394,0.0032548034,0.0016753856,0.006489973],"category_scores_gemma":[0.006871639,0.0010530681,0.0025070296,0.0022710045,0.007051682,0.012027205,0.003586752,0.0043048374,0.0011519328],"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.000006835043,0.0000062739355,0.000055195498,0.00003649442,0.0000044121607,0.00008848229,0.0004176613,0.0022702904,0.00046557197,0.9915182,0.0004093975,0.0047211396],"study_design_scores_gemma":[0.000022910097,0.0000567586,0.00011326864,0.00012859987,0.000035468187,0.00037148423,0.00026691915,0.03315678,0.0021921156,0.88615584,0.07745207,0.00004779075],"about_ca_topic_score_codex":0.005449386,"about_ca_topic_score_gemma":0.004152805,"teacher_disagreement_score":0.006489973,"about_ca_system_score_codex":0.0023922906,"about_ca_system_score_gemma":0.0026107943,"threshold_uncertainty_score":0.02872622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012757169,0.00009261833,0.98421115,0.00008098716,0.00002033573,0.000042782864,0.000009734047,0.00020510389,0.0025801826],"genre_scores_gemma":[0.52148324,0.00013542676,0.47478303,0.00014390731,0.000027115846,0.00025993763,0.000059800423,0.00006765957,0.0030399153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964905,0.00012450053,0.000015814237,0.00005131799,0.00012430464,0.00003501085],"domain_scores_gemma":[0.9995172,0.00029534186,0.000041976084,0.000027704704,0.000100023026,0.000017814502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008090606,0.0004955416,0.0006964364,0.00044117408,0.00041378444,0.00058779056,0.0008034777,0.0010922571,0.0014340605],"category_scores_gemma":[0.002064019,0.0003073323,0.00039062658,0.00064206286,0.0006780706,0.000455253,0.00054967013,0.0006864926,0.00018419158],"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.000024963543,0.000018894234,0.0001316614,0.000018665545,0.000015475638,0.0000352697,0.000027558619,0.9645333,0.0011383613,0.0064636124,0.00030992719,0.027282301],"study_design_scores_gemma":[0.0000058488063,0.0000061717883,0.000016490214,0.0000013898361,0.0000017131639,0.000004161347,0.0000015788503,0.9985759,0.00021532468,0.0010370022,0.00013304259,0.0000013590293],"about_ca_topic_score_codex":0.008027167,"about_ca_topic_score_gemma":0.0067731403,"teacher_disagreement_score":0.008027167,"about_ca_system_score_codex":0.0010716333,"about_ca_system_score_gemma":0.0010178549,"threshold_uncertainty_score":0.015960872},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01348182,0.000079122154,0.9841055,0.00005418134,0.000013495808,0.000043959895,0.00008250346,0.00018084593,0.0019584752],"genre_scores_gemma":[0.2013522,0.00011200023,0.7965104,0.000037307622,0.000014711381,0.00009828829,0.00034228072,0.000074574375,0.0014581842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998982,0.0001921422,0.000055857887,0.00021826262,0.00048141737,0.00007025786],"domain_scores_gemma":[0.99916697,0.00027691203,0.00009211755,0.00011127626,0.00028464047,0.00006812231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079488644,0.00050958013,0.0007521549,0.0030721931,0.0008256815,0.0018121783,0.0012472698,0.00075229286,0.0037148776],"category_scores_gemma":[0.0030982723,0.00041980375,0.0009628888,0.0027821881,0.0011347699,0.002081749,0.0016509623,0.00092190166,0.0005220524],"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.0003200059,0.00015659332,0.0044756234,0.00030304285,0.00012243011,0.00021970562,0.000745281,0.3111618,0.020318374,0.28113812,0.002811367,0.37822768],"study_design_scores_gemma":[0.000029331486,0.00004780411,0.000617928,0.000023585802,0.000024030058,0.000078955214,0.00017167573,0.8983032,0.0039516687,0.09095855,0.005763654,0.000029622777],"about_ca_topic_score_codex":0.0071748095,"about_ca_topic_score_gemma":0.009030801,"teacher_disagreement_score":0.0071748095,"about_ca_system_score_codex":0.001211726,"about_ca_system_score_gemma":0.0012352902,"threshold_uncertainty_score":0.014266133},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019890012,0.00026028225,0.975105,0.0005092668,0.000067872985,0.000121030025,0.0002241243,0.0007074159,0.003115025],"genre_scores_gemma":[0.35689005,0.0006463838,0.63566417,0.00064346107,0.00014205708,0.00040875896,0.00072792516,0.00040971732,0.004467491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968732,0.0011669557,0.00024366377,0.0006027322,0.00084288104,0.0002705596],"domain_scores_gemma":[0.99341005,0.003919867,0.00039650613,0.0010890093,0.0009275556,0.00025698132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033866353,0.0008109578,0.0010504193,0.0009663551,0.0011334264,0.0019070939,0.002026497,0.000996199,0.0044157007],"category_scores_gemma":[0.011934922,0.00061622437,0.0016813123,0.0013684514,0.0028956668,0.0052361214,0.00322852,0.003713175,0.00055396033],"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.00019805506,0.00013473607,0.0012037032,0.0005171665,0.00011872922,0.00035554182,0.0004141726,0.28786922,0.0048850835,0.56528014,0.0051218634,0.13390172],"study_design_scores_gemma":[0.000035243294,0.000032878004,0.00011404212,0.000026351216,0.00002471014,0.00009809757,0.00006751413,0.23075514,0.002422502,0.76095265,0.0054466417,0.000024321202],"about_ca_topic_score_codex":0.0039226613,"about_ca_topic_score_gemma":0.007416582,"teacher_disagreement_score":0.0044157007,"about_ca_system_score_codex":0.001362969,"about_ca_system_score_gemma":0.0024330611,"threshold_uncertainty_score":0.01791042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00167911,0.00028161774,0.9945933,0.00070863776,0.00004330122,0.00004155875,0.00013494614,0.00023362944,0.002283912],"genre_scores_gemma":[0.115079455,0.00079036393,0.87943226,0.0006274313,0.00027197006,0.00021208679,0.0006243561,0.00050578825,0.0024562562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98417133,0.0064518815,0.00082313234,0.0037245627,0.004221656,0.00060750265],"domain_scores_gemma":[0.928386,0.053364966,0.0026175564,0.010565728,0.0042044595,0.00086139893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012407501,0.0019128441,0.0021567477,0.003339782,0.002230961,0.0059810895,0.0075579104,0.0034826563,0.014097758],"category_scores_gemma":[0.0795828,0.0019450864,0.0034722907,0.007731981,0.007372735,0.02039525,0.007809623,0.010062281,0.0017769457],"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.00008956179,0.000085008185,0.0014173627,0.0005404158,0.00019739868,0.000113592,0.00034979824,0.08787839,0.0008925786,0.7545962,0.008351231,0.14548844],"study_design_scores_gemma":[0.000018339946,0.000013980079,0.00021146174,0.000056459558,0.00003163511,0.00011792639,0.00004440979,0.20059049,0.0010327413,0.7926286,0.005221168,0.000032761596],"about_ca_topic_score_codex":0.009148496,"about_ca_topic_score_gemma":0.007374829,"teacher_disagreement_score":0.014097758,"about_ca_system_score_codex":0.003969122,"about_ca_system_score_gemma":0.0042863027,"threshold_uncertainty_score":0.06561792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27395448,0.007128766,0.618539,0.0027545332,0.00036927368,0.0005198806,0.0006597817,0.0011380257,0.09493633],"genre_scores_gemma":[0.86413074,0.002779202,0.11313808,0.00082454854,0.0004911079,0.0004561535,0.0006124019,0.0007256138,0.0168422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720925,0.000933321,0.00010068146,0.0002827524,0.0008934386,0.000580463],"domain_scores_gemma":[0.9780638,0.018376626,0.0007578561,0.0010889908,0.0011895023,0.0005231881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004377573,0.0013855386,0.0014477645,0.0015337301,0.0011418093,0.0037316491,0.0034593577,0.0014710804,0.010669077],"category_scores_gemma":[0.021590328,0.00121788,0.0013280564,0.002359554,0.0021345294,0.006640827,0.002840783,0.0031057305,0.0007723645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001218546,0.00044369773,0.005205055,0.0007825478,0.000103659506,0.0001472852,0.00046008042,0.23137298,0.0037834013,0.6151472,0.0146407485,0.12669481],"study_design_scores_gemma":[0.00005402829,0.00021546717,0.0011778921,0.00012503949,0.0000758165,0.00016683931,0.00017822356,0.72690266,0.0013236591,0.26669163,0.0030674408,0.000021296937],"about_ca_topic_score_codex":0.0013457867,"about_ca_topic_score_gemma":0.0030914298,"teacher_disagreement_score":0.010669077,"about_ca_system_score_codex":0.0027657396,"about_ca_system_score_gemma":0.0023948106,"threshold_uncertainty_score":0.03569162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051376805,0.0003342792,0.938663,0.00042548493,0.00003668845,0.00017091655,0.00006120912,0.00040311157,0.008528413],"genre_scores_gemma":[0.6315013,0.0002146283,0.3633893,0.00044576536,0.00012530368,0.0005623744,0.0001760599,0.000284643,0.0033006826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976579,0.0009704009,0.00017003453,0.0002970728,0.0006780388,0.00022650533],"domain_scores_gemma":[0.9924204,0.0048524644,0.00047108028,0.0008707953,0.0009209926,0.00046420892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005304999,0.0006783611,0.001369763,0.0019748397,0.000838933,0.0016623591,0.0018274542,0.0013207739,0.004105168],"category_scores_gemma":[0.01653216,0.00044774095,0.00073507323,0.0013850742,0.0021361,0.002679283,0.0036505852,0.002164185,0.00049633556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777077,0.00023908797,0.0054801977,0.00026885894,0.0001701061,0.0002800067,0.0007641963,0.33541337,0.02365376,0.3355913,0.0042437133,0.2933178],"study_design_scores_gemma":[0.00011464784,0.00030531178,0.0011854753,0.000049153266,0.000043982025,0.00014935253,0.00007327042,0.86789197,0.0053568487,0.122394666,0.0023887418,0.000046572804],"about_ca_topic_score_codex":0.00070623227,"about_ca_topic_score_gemma":0.00087449764,"teacher_disagreement_score":0.005304999,"about_ca_system_score_codex":0.0013983325,"about_ca_system_score_gemma":0.0007918209,"threshold_uncertainty_score":0.028055787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068386365,0.00007657156,0.98041016,0.0002942474,0.000030866566,0.000044797485,0.00007011393,0.00017316929,0.012061394],"genre_scores_gemma":[0.47145373,0.00057300896,0.51951754,0.00030581528,0.0000820729,0.00033922828,0.0004481823,0.00015840649,0.007121969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985417,0.0005114653,0.00008591432,0.00023228479,0.00047440943,0.00015420999],"domain_scores_gemma":[0.9966344,0.002126604,0.00030777467,0.00041714768,0.00036571498,0.00014826542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622057,0.00042949128,0.00036414718,0.00076998124,0.0007112209,0.0021146245,0.0011946992,0.0005822576,0.0073659793],"category_scores_gemma":[0.007026525,0.000285008,0.00082790677,0.0012910961,0.002040405,0.0046454165,0.0025170664,0.0025638079,0.0007974751],"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.000025767149,0.000035931942,0.00024028288,0.00008762864,0.000014913209,0.00011766987,0.00019005693,0.05343002,0.0019609467,0.91515815,0.00085027376,0.027888354],"study_design_scores_gemma":[0.000011143311,0.000014043354,0.00008117542,0.0000238999,0.00000933427,0.0000875881,0.00010410951,0.17811863,0.0021659366,0.8115222,0.007850224,0.000011826164],"about_ca_topic_score_codex":0.002698946,"about_ca_topic_score_gemma":0.002388202,"teacher_disagreement_score":0.0073659793,"about_ca_system_score_codex":0.001158643,"about_ca_system_score_gemma":0.0014257106,"threshold_uncertainty_score":0.024641633},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17383787,0.0007141108,0.7799953,0.0012975878,0.0002720504,0.00030085878,0.0023310184,0.0059651625,0.035286132],"genre_scores_gemma":[0.7648708,0.00029507055,0.220846,0.00033412257,0.00006906671,0.0001552573,0.0040490204,0.0002967958,0.009083948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.0002102147,0.00004537644,0.0002972863,0.00014781285,0.0000682164],"domain_scores_gemma":[0.9983637,0.0008300078,0.000099735465,0.00039316423,0.00022040006,0.00009302878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662266,0.0008089557,0.0007108201,0.0009929248,0.0006215513,0.0016448199,0.0017701708,0.0010708562,0.01423957],"category_scores_gemma":[0.0070364536,0.00036403732,0.0008327203,0.001153153,0.001006032,0.005577005,0.0033724573,0.0017145282,0.0025239643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005014237,0.00033981164,0.0069352686,0.00038963498,0.000109674074,0.00029322942,0.0007786954,0.040719498,0.0048340773,0.13007277,0.0287116,0.7863143],"study_design_scores_gemma":[0.00007607658,0.00014480966,0.0016896487,0.00015720077,0.000057385267,0.00012725615,0.0010013401,0.46066502,0.0036736522,0.518644,0.013719393,0.000044317138],"about_ca_topic_score_codex":0.0021409518,"about_ca_topic_score_gemma":0.004883322,"teacher_disagreement_score":0.01423957,"about_ca_system_score_codex":0.0007304348,"about_ca_system_score_gemma":0.0007251543,"threshold_uncertainty_score":0.04763615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002599024,0.000120420176,0.9937505,0.00012343538,0.000020660094,0.000058556336,0.000075463235,0.00007795038,0.0031739096],"genre_scores_gemma":[0.21735732,0.0006975897,0.77329165,0.00025528247,0.000081467995,0.0009847265,0.0005350682,0.0001421014,0.0066548996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829584,0.0009579586,0.00008393371,0.00020090035,0.0003462165,0.00011527992],"domain_scores_gemma":[0.9964618,0.0027844196,0.00022993192,0.00016394629,0.00027072377,0.00008919404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00320911,0.0015729916,0.0013575125,0.0010420672,0.0005682541,0.001823512,0.0016402542,0.0013551925,0.0049027996],"category_scores_gemma":[0.007762008,0.0009758473,0.0012911317,0.0022188416,0.0013803876,0.002574437,0.0018948907,0.0024729606,0.00057403586],"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.00004421805,0.000030974363,0.0001316588,0.000085517415,0.000033778808,0.00003903186,0.000022387705,0.8776661,0.00018889691,0.10542199,0.0008246029,0.015510758],"study_design_scores_gemma":[0.000021610289,0.000012113271,0.000018888704,0.000011490478,0.0000069638986,0.000007926376,0.0000060829125,0.91829866,0.00017577228,0.080288954,0.0011455537,0.0000060575167],"about_ca_topic_score_codex":0.007688899,"about_ca_topic_score_gemma":0.0087261675,"teacher_disagreement_score":0.007688899,"about_ca_system_score_codex":0.0017837597,"about_ca_system_score_gemma":0.0022863455,"threshold_uncertainty_score":0.016971648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033261052,0.00054379075,0.982537,0.00097496825,0.00021323381,0.0000865961,0.00044168325,0.0003195312,0.011557074],"genre_scores_gemma":[0.18075208,0.0011665907,0.80813634,0.0008047465,0.0002172945,0.00039394633,0.0008119916,0.0001375663,0.0075793522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983935,0.0003864437,0.000188595,0.0002838787,0.00057728786,0.00017035441],"domain_scores_gemma":[0.9988207,0.00055058044,0.00012548667,0.00016087825,0.00022673799,0.00011564596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019695968,0.00075112196,0.000609422,0.0021780666,0.0014775074,0.0041180057,0.001911119,0.001333852,0.005276171],"category_scores_gemma":[0.0030517334,0.00051898323,0.00231396,0.0025585564,0.0038485336,0.006469914,0.00265189,0.0028413434,0.0008716264],"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.000015098449,0.000013969591,0.00005570459,0.00007907462,0.000012938218,0.00010139912,0.00016010205,0.003511759,0.0007719065,0.9813182,0.0015159749,0.01244388],"study_design_scores_gemma":[0.000033819262,0.00004210983,0.00012345328,0.00007532892,0.00006180907,0.00020175375,0.00012914444,0.04045612,0.0017505934,0.9211671,0.03591772,0.000041139418],"about_ca_topic_score_codex":0.0055998657,"about_ca_topic_score_gemma":0.005580875,"teacher_disagreement_score":0.0055998657,"about_ca_system_score_codex":0.002737067,"about_ca_system_score_gemma":0.0019497093,"threshold_uncertainty_score":0.019858837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014457676,0.00030571732,0.9816736,0.00049620285,0.000029128172,0.00018868441,0.0003481299,0.0006346855,0.0018662531],"genre_scores_gemma":[0.25146827,0.0006314441,0.74008316,0.0005175274,0.00013162717,0.00091300026,0.002506955,0.00032816612,0.0034197848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996345,0.0018993417,0.00014928434,0.0005772756,0.0007845608,0.00024444028],"domain_scores_gemma":[0.99122155,0.0064728805,0.0005700621,0.0008441869,0.00072741887,0.00016392083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005185345,0.0011559222,0.001549672,0.0017391465,0.00096189906,0.0018300514,0.0026833187,0.0018078232,0.004354397],"category_scores_gemma":[0.021735054,0.0012990215,0.0020541013,0.003025041,0.0013982694,0.0047177537,0.0032923534,0.0027762295,0.00069133926],"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.00044457937,0.000194897,0.003602764,0.00063700817,0.0002878661,0.00020278803,0.00042373865,0.5567967,0.0029752657,0.1791232,0.013788951,0.24152227],"study_design_scores_gemma":[0.000047902227,0.00006207273,0.00036013458,0.000028645742,0.00003200088,0.00007287789,0.00004618501,0.9043718,0.0008691851,0.09118349,0.0029083265,0.000017375613],"about_ca_topic_score_codex":0.004376833,"about_ca_topic_score_gemma":0.0062855906,"teacher_disagreement_score":0.005185345,"about_ca_system_score_codex":0.0016372631,"about_ca_system_score_gemma":0.0025608172,"threshold_uncertainty_score":0.027423084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008501389,0.002230125,0.8912321,0.0024297622,0.0017677257,0.00048943714,0.0022936047,0.005222466,0.08583344],"genre_scores_gemma":[0.084234916,0.0031307018,0.83751184,0.0016034703,0.0014469268,0.00093314436,0.01006185,0.00330201,0.05777507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821967,0.00035032933,0.00012655626,0.00042048737,0.0007897459,0.00009306452],"domain_scores_gemma":[0.99682933,0.0020871174,0.00004716089,0.0007960032,0.00018754898,0.000052878422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011675217,0.0021008993,0.0015662361,0.0014879162,0.00085284613,0.0016333153,0.0030527797,0.0012607703,0.05835878],"category_scores_gemma":[0.005819712,0.0014623132,0.0030277788,0.003310015,0.0011610847,0.0033820437,0.0027045412,0.00426866,0.011499755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029858836,0.00044101948,0.00048593036,0.00091757573,0.00023126652,0.00038361372,0.0002253879,0.07200044,0.008246549,0.16385143,0.1318102,0.62110806],"study_design_scores_gemma":[0.00036206335,0.00022268711,0.0013150023,0.00019334332,0.00020415128,0.0005984826,0.000102735,0.22068182,0.008470875,0.6522542,0.115475774,0.00011888556],"about_ca_topic_score_codex":0.0037947495,"about_ca_topic_score_gemma":0.0064303875,"teacher_disagreement_score":0.05835878,"about_ca_system_score_codex":0.0014722891,"about_ca_system_score_gemma":0.0012387867,"threshold_uncertainty_score":0.19522959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003714424,0.00066618156,0.9693048,0.0012597964,0.00013302479,0.000068558926,0.00019914575,0.0002065786,0.024447521],"genre_scores_gemma":[0.2556398,0.0015860357,0.72131336,0.0010276365,0.0004409936,0.00059975416,0.0006226951,0.00033381395,0.018435916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981178,0.0006664002,0.00014653607,0.00035159968,0.00054734055,0.00017034555],"domain_scores_gemma":[0.99793315,0.0009645897,0.00031135883,0.0003472942,0.00031258966,0.00013102878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003256174,0.000900659,0.0006437595,0.0018485913,0.0016134476,0.0033037774,0.0024354048,0.001607518,0.007780779],"category_scores_gemma":[0.0045402395,0.0006127695,0.0019318324,0.0023556578,0.008461499,0.010321862,0.0027242545,0.0032618556,0.0012245203],"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.00000389871,0.0000029189464,0.000029488778,0.000018833729,0.0000028751506,0.000028551072,0.00017157702,0.0012011878,0.00017477847,0.9954781,0.00038537313,0.0025023627],"study_design_scores_gemma":[0.000009567686,0.000017860953,0.00005038848,0.000044665227,0.000009948981,0.00010444829,0.00012065444,0.013860383,0.0005400858,0.95965147,0.02557548,0.0000150522255],"about_ca_topic_score_codex":0.0035722875,"about_ca_topic_score_gemma":0.003006026,"teacher_disagreement_score":0.007780779,"about_ca_system_score_codex":0.0025858225,"about_ca_system_score_gemma":0.002667656,"threshold_uncertainty_score":0.026029348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021274824,0.0041882205,0.9582368,0.0017772872,0.00028900444,0.00017779527,0.0012294248,0.0028738999,0.009952655],"genre_scores_gemma":[0.44910702,0.0022710238,0.53579104,0.00065413467,0.00021974645,0.00087019434,0.0024119758,0.00037582678,0.008298968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.00014462869,0.000042229585,0.00014648277,0.00005653083,0.00005903118],"domain_scores_gemma":[0.99678326,0.0025869422,0.000199909,0.00014673421,0.00018796323,0.00009520799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845204,0.0014058535,0.001084168,0.0010092537,0.0006816244,0.0017720745,0.001736898,0.0018176144,0.010339642],"category_scores_gemma":[0.0072955396,0.00073540886,0.0013625291,0.0012567837,0.0007164416,0.002428451,0.0017281651,0.0023338988,0.0011239444],"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.00021623551,0.00012569809,0.00219394,0.0005314558,0.00023573416,0.0001592831,0.000166538,0.69853735,0.0010853006,0.03507403,0.0068473173,0.25482702],"study_design_scores_gemma":[0.000011838541,0.000009311517,0.00011991229,0.000026515141,0.000016968637,0.00001822086,0.000017997938,0.9657856,0.00017749913,0.032592416,0.0012180458,0.000005703737],"about_ca_topic_score_codex":0.015889771,"about_ca_topic_score_gemma":0.024319774,"teacher_disagreement_score":0.015889771,"about_ca_system_score_codex":0.0013224706,"about_ca_system_score_gemma":0.0016762553,"threshold_uncertainty_score":0.03458959},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025632263,0.005239292,0.49249914,0.0014569807,0.0010639664,0.0001265757,0.00045218397,0.0011791735,0.4954196],"genre_scores_gemma":[0.10535335,0.010832302,0.29319972,0.001243685,0.0008085693,0.0004914338,0.0015876216,0.0013175743,0.58516574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996001,0.00006490863,0.000017784896,0.000086019325,0.00020465675,0.000026640886],"domain_scores_gemma":[0.9997211,0.00006903144,0.000011815938,0.000078786325,0.000097499345,0.000021788304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041201693,0.00071656174,0.0004448487,0.0011563693,0.00081552716,0.0024437832,0.0010021452,0.0006597033,0.042421803],"category_scores_gemma":[0.00093636493,0.00052127865,0.00044632453,0.001342103,0.0013689455,0.0026648524,0.0010611239,0.0013890953,0.0137260705],"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.000023389142,0.000023944029,0.000081283826,0.0002121816,0.000009488068,0.000053998647,0.00012898451,0.006629114,0.002684593,0.7044271,0.05342855,0.23229732],"study_design_scores_gemma":[0.000008601888,0.000028857248,0.00011406931,0.00012954006,0.000012207468,0.00022083976,0.00007960466,0.009465899,0.0030029665,0.36629972,0.62062085,0.000016886597],"about_ca_topic_score_codex":0.0008314458,"about_ca_topic_score_gemma":0.0011951062,"teacher_disagreement_score":0.042421803,"about_ca_system_score_codex":0.0013703528,"about_ca_system_score_gemma":0.0009044735,"threshold_uncertainty_score":0.14191502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030512622,0.0005630703,0.9615569,0.0007281461,0.000025850939,0.000059077083,0.00017094977,0.00017175294,0.006211727],"genre_scores_gemma":[0.35977316,0.0007895528,0.6357752,0.0001531713,0.000029869307,0.000096391996,0.00019106123,0.00012835026,0.0030632366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892753,0.00045579762,0.000053061485,0.0002235016,0.0002842839,0.000055805423],"domain_scores_gemma":[0.9959357,0.0031471269,0.00019224934,0.00044111902,0.00020591852,0.000077924604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017991499,0.00053920253,0.0006128729,0.0012424398,0.0007343919,0.0019545103,0.0015623255,0.001823677,0.0039485563],"category_scores_gemma":[0.0061580297,0.0006326115,0.001125103,0.00084295834,0.0040127607,0.0033616822,0.0024431183,0.0011243155,0.00029400425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010161714,0.000065879554,0.0035496969,0.00054068683,0.000039434748,0.0006993784,0.0013592539,0.26700735,0.009278426,0.64528316,0.0020802536,0.06999487],"study_design_scores_gemma":[0.000032692995,0.000069007285,0.0012642442,0.000105218336,0.000020619293,0.0007888569,0.00061397103,0.6329061,0.0049864445,0.34810528,0.011065902,0.000041660223],"about_ca_topic_score_codex":0.0025129882,"about_ca_topic_score_gemma":0.0020080942,"teacher_disagreement_score":0.0039485563,"about_ca_system_score_codex":0.0008685924,"about_ca_system_score_gemma":0.000545213,"threshold_uncertainty_score":0.013209283},"labels":[],"label_agreement":null},{"id":"W2137578750","doi":"10.1007/s10601-008-9067-7","title":"New filtering algorithms for combinations of among constraints","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Subsequence; Sequence (biology); Consistency (knowledge bases); Constraint (computer-aided design); Algorithm; Constraint programming; Domain (mathematical analysis); Computer science; Longest common subsequence problem; Local consistency; Time complexity; Mathematics; Constraint satisfaction; Mathematical optimization; Artificial intelligence; Stochastic programming","score_opus":0.022042688135491338,"score_gpt":0.26948883090847336,"score_spread":0.24744614277298202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137578750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001741939,0.00020662327,0.99644357,0.00007241299,0.000071535505,0.00005114909,0.00007653779,0.00038959613,0.0009466383],"genre_scores_gemma":[0.018841859,0.00024838446,0.9773221,0.00011489273,0.00010877722,0.000109047476,0.0004974618,0.00020767614,0.0025497202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995706,0.00085138844,0.00037614332,0.0010122037,0.0017712616,0.0002830592],"domain_scores_gemma":[0.99098796,0.005636087,0.0004448603,0.0011470286,0.0015744601,0.00020954537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004715466,0.0025011555,0.0027430567,0.0051519996,0.0016763901,0.0036428114,0.003456142,0.002770407,0.009980511],"category_scores_gemma":[0.015049102,0.00195481,0.0030179783,0.0057746535,0.0010993095,0.0065872124,0.0023320995,0.0033215405,0.0020384728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022922314,0.00028963495,0.0010918811,0.00035000156,0.00026907164,0.00014515624,0.00016016507,0.13118365,0.004989456,0.06605542,0.0168706,0.77836573],"study_design_scores_gemma":[0.000051352552,0.000045512978,0.0002542195,0.00005485203,0.00009886161,0.00014526534,0.000042229407,0.9451876,0.0028552415,0.043801207,0.00742674,0.000037027698],"about_ca_topic_score_codex":0.0071700495,"about_ca_topic_score_gemma":0.013621945,"teacher_disagreement_score":0.009980511,"about_ca_system_score_codex":0.0016267519,"about_ca_system_score_gemma":0.0019470499,"threshold_uncertainty_score":0.03338808},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136994915,0.010145558,0.50970566,0.034155253,0.0016244975,0.00016213478,0.00046225003,0.0006503836,0.42939472],"genre_scores_gemma":[0.79251647,0.007326671,0.15966961,0.00561347,0.0013508409,0.0005328932,0.00048640382,0.00037819982,0.032125447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927955,0.0028167577,0.00070681307,0.0013866087,0.0017028257,0.0005914431],"domain_scores_gemma":[0.99112916,0.0042701694,0.0007000279,0.0022703304,0.0011650154,0.00046532002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065688686,0.0011320345,0.0009126329,0.002573802,0.0039405487,0.012261096,0.0022262153,0.003532481,0.0073253955],"category_scores_gemma":[0.016243747,0.0006133716,0.0016001894,0.0020489418,0.024883978,0.020661594,0.008712233,0.0049273996,0.0015264722],"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.000003860695,0.0000028522416,0.000063877014,0.000024568044,0.0000054708516,0.00003657829,0.0007218268,0.0003372896,0.000057610905,0.99327576,0.0013870525,0.0040832506],"study_design_scores_gemma":[0.00000451095,0.0000080620175,0.00007017196,0.00006185695,0.0000063408297,0.00008118754,0.0003247031,0.00083847315,0.00008149255,0.9489063,0.049604513,0.000012462451],"about_ca_topic_score_codex":0.0032355865,"about_ca_topic_score_gemma":0.0015492013,"teacher_disagreement_score":0.012261096,"about_ca_system_score_codex":0.0031446365,"about_ca_system_score_gemma":0.002411613,"threshold_uncertainty_score":0.03473991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004819121,0.00029294845,0.9913038,0.00024059073,0.000031849133,0.00011215515,0.00010176639,0.00009335074,0.0030044003],"genre_scores_gemma":[0.13607515,0.00073967216,0.85834795,0.0001653425,0.00005967938,0.00049264124,0.00025500663,0.00010549745,0.0037591427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984438,0.00082644407,0.00006645191,0.00017954322,0.0003582988,0.00012555876],"domain_scores_gemma":[0.9972408,0.0021918747,0.00013727,0.000091469876,0.0002548477,0.00008362492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020729848,0.0012114282,0.001258667,0.00088843156,0.0010117076,0.001746245,0.0019825066,0.0018070524,0.004257909],"category_scores_gemma":[0.0052651814,0.00074134476,0.0009863733,0.0027260222,0.0011414232,0.0015962701,0.0010211831,0.0018603835,0.00046076966],"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.000043777804,0.00004160208,0.00012012708,0.00007195067,0.000030065183,0.000046131943,0.00003814477,0.9587329,0.00041638876,0.017520428,0.000994043,0.021944346],"study_design_scores_gemma":[0.000020397447,0.000025904328,0.00004281076,0.000008361657,0.000008138025,0.000016477434,0.0000145192225,0.993764,0.00023682912,0.0047274437,0.0011277617,0.0000073428146],"about_ca_topic_score_codex":0.026194604,"about_ca_topic_score_gemma":0.020579504,"teacher_disagreement_score":0.026194604,"about_ca_system_score_codex":0.0020074483,"about_ca_system_score_gemma":0.0032657008,"threshold_uncertainty_score":0.052084267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06806438,0.00067923643,0.9258629,0.00016685422,0.000038016176,0.000080510035,0.000035006717,0.00024870268,0.004824391],"genre_scores_gemma":[0.38521725,0.00060458784,0.6122139,0.00013883536,0.000041299332,0.00020269181,0.00012490423,0.000066071465,0.0013905672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992023,0.00040586496,0.00003321321,0.000058625334,0.0002387088,0.00006124168],"domain_scores_gemma":[0.9986339,0.0009911798,0.000099650744,0.000102294754,0.0001454591,0.000027465021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013591264,0.0007069548,0.0006964394,0.001014554,0.0003722294,0.0007808759,0.00072646776,0.00097422017,0.0010423621],"category_scores_gemma":[0.0039672395,0.00036724086,0.0006544892,0.0012042428,0.00057602837,0.00068063865,0.00055340043,0.0006626018,0.00014832588],"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.000040540726,0.00004975384,0.0006528799,0.00006689846,0.000065605396,0.00007307763,0.00004705292,0.9365681,0.001652678,0.010101693,0.00032873364,0.050352927],"study_design_scores_gemma":[0.00002549314,0.000043747026,0.00016956516,0.000011603809,0.000015309668,0.00005176493,0.000021835072,0.9937622,0.0008023927,0.004152493,0.0009366104,0.000007042847],"about_ca_topic_score_codex":0.002655531,"about_ca_topic_score_gemma":0.0024195875,"teacher_disagreement_score":0.002655531,"about_ca_system_score_codex":0.0004977894,"about_ca_system_score_gemma":0.0006482262,"threshold_uncertainty_score":0.0071877837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019812072,0.00024649326,0.9942082,0.00027781806,0.000046146688,0.00010188824,0.00011026542,0.000113196686,0.002914756],"genre_scores_gemma":[0.11411898,0.001147985,0.8790588,0.00026857256,0.00015141795,0.0008857437,0.00039436782,0.0001141157,0.0038601768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978393,0.0008489984,0.000121399426,0.00042845614,0.000547497,0.00021427874],"domain_scores_gemma":[0.9961248,0.003214032,0.00014253348,0.000096263604,0.00031903054,0.00010335323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002507738,0.0021115327,0.0012621051,0.0011196326,0.0012132712,0.0023229956,0.0025393772,0.0021797223,0.004740131],"category_scores_gemma":[0.0061009675,0.001090228,0.0015866184,0.0030979791,0.0016462408,0.0017166268,0.0013865312,0.0032805437,0.00055770646],"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.000046367655,0.000061467304,0.00013288719,0.00017666651,0.000047233727,0.000106190586,0.0000668858,0.9166957,0.0006476197,0.051781744,0.0019102906,0.028326964],"study_design_scores_gemma":[0.000024641822,0.000022418732,0.000029594816,0.000014443237,0.000012982753,0.000021570064,0.000017613385,0.98457956,0.00027355584,0.013107428,0.0018862566,0.000009920748],"about_ca_topic_score_codex":0.026149286,"about_ca_topic_score_gemma":0.017368127,"teacher_disagreement_score":0.026149286,"about_ca_system_score_codex":0.002435816,"about_ca_system_score_gemma":0.004838301,"threshold_uncertainty_score":0.051994145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006601939,0.00017466382,0.98964906,0.00032648,0.000013913381,0.000060306164,0.00036281729,0.00047868275,0.002332144],"genre_scores_gemma":[0.1467968,0.0007660888,0.8478582,0.00013130603,0.000029626259,0.00032561953,0.002086029,0.00010520393,0.0019012076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.00028639907,0.000052173513,0.00013085023,0.00022601217,0.000033293745],"domain_scores_gemma":[0.9984125,0.00090291986,0.00012955802,0.00036195255,0.00014803033,0.000044942954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068944367,0.0005431429,0.00042103633,0.0018049593,0.00058764324,0.0019113407,0.001161057,0.0007672518,0.002977384],"category_scores_gemma":[0.0036105523,0.00032865664,0.00088696193,0.002798701,0.0011012029,0.003692383,0.0014706153,0.0011616328,0.00054498075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011006149,0.00014643109,0.0011044386,0.0004631716,0.0001256134,0.00055626174,0.00079556473,0.3301933,0.00799202,0.22736357,0.0056461864,0.42550334],"study_design_scores_gemma":[0.000033437067,0.000034385546,0.000445567,0.00009430985,0.00006486218,0.0001554997,0.00024912134,0.672877,0.006056678,0.29577678,0.024177013,0.000035307756],"about_ca_topic_score_codex":0.007463504,"about_ca_topic_score_gemma":0.01389212,"teacher_disagreement_score":0.007463504,"about_ca_system_score_codex":0.00099903,"about_ca_system_score_gemma":0.0014290655,"threshold_uncertainty_score":0.014840126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36089233,0.0010300739,0.54194474,0.0020784226,0.00010266486,0.00011634773,0.00023698025,0.00040469665,0.09319378],"genre_scores_gemma":[0.9499409,0.00031943366,0.044933755,0.00010006074,0.00006181305,0.000113976144,0.00015610964,0.000043642984,0.0043303953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984535,0.0006108002,0.000093946044,0.00022976396,0.000434817,0.00017717622],"domain_scores_gemma":[0.9984817,0.0007421964,0.00021740666,0.000246903,0.00018226958,0.00012949832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016907696,0.0005000143,0.00054087775,0.0013606411,0.0014817338,0.0036196504,0.0010985396,0.0010221871,0.0037651563],"category_scores_gemma":[0.0030668497,0.0003183156,0.0014675565,0.0013039346,0.0065907175,0.008238085,0.0030094932,0.0018374686,0.0002675517],"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.0000027362978,0.0000037993286,0.000055819546,0.000005703359,0.0000024658511,0.000024672523,0.00011383365,0.0010461021,0.00013463735,0.9980584,0.000039424358,0.0005124554],"study_design_scores_gemma":[0.0000066864704,0.000011110059,0.00006316213,0.000008939383,0.0000067378455,0.00004101671,0.00019279636,0.010241752,0.00041792117,0.9869199,0.0020832694,0.0000067038695],"about_ca_topic_score_codex":0.0019500166,"about_ca_topic_score_gemma":0.001892332,"teacher_disagreement_score":0.0037651563,"about_ca_system_score_codex":0.0024063978,"about_ca_system_score_gemma":0.0013019788,"threshold_uncertainty_score":0.01745975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007150915,0.00015782691,0.9872792,0.00035480896,0.00001749705,0.00018725402,0.000077130404,0.00006128424,0.00471424],"genre_scores_gemma":[0.3230669,0.00037706585,0.6715096,0.00019328954,0.000053900934,0.0010173406,0.00026211748,0.00012525234,0.0033945816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98348,0.012420547,0.0004916588,0.00087181805,0.002328577,0.00040734917],"domain_scores_gemma":[0.97032994,0.025937634,0.00078179984,0.0010413688,0.0015713451,0.0003379534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012081378,0.0016082956,0.002615171,0.0018978339,0.0010090701,0.0027983992,0.0024105061,0.0021916754,0.0063614394],"category_scores_gemma":[0.040091228,0.0011045844,0.0013524231,0.0032423907,0.0018607565,0.00325123,0.0027335798,0.0025363788,0.000629323],"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.00036036308,0.0002741942,0.00065644644,0.00051114033,0.00019623352,0.000119022385,0.00043153737,0.5731917,0.0012402866,0.29885367,0.004409086,0.119756356],"study_design_scores_gemma":[0.000051969422,0.00007021793,0.00013104593,0.000051870742,0.000020277668,0.000024211628,0.00004386359,0.8685714,0.0007229687,0.1292657,0.001024551,0.000021927666],"about_ca_topic_score_codex":0.003961762,"about_ca_topic_score_gemma":0.0047745924,"teacher_disagreement_score":0.012081378,"about_ca_system_score_codex":0.0024200652,"about_ca_system_score_gemma":0.0034789448,"threshold_uncertainty_score":0.06389326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22022818,0.0007316217,0.7634111,0.0011520177,0.00006334587,0.00023508613,0.00005274847,0.0046858722,0.009439993],"genre_scores_gemma":[0.7576485,0.00027885556,0.23909724,0.00017492438,0.000026466363,0.00012504525,0.00009240091,0.00020851502,0.0023480929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733967,0.0012721597,0.00012542994,0.0003022941,0.00073643244,0.00022405475],"domain_scores_gemma":[0.9887207,0.00729171,0.00070535345,0.0025454052,0.0005224085,0.00021449703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033785084,0.0006049607,0.0008276642,0.0004879294,0.0008444171,0.0020918616,0.0020371606,0.001456454,0.002248965],"category_scores_gemma":[0.01193761,0.00039887548,0.0004632772,0.001424743,0.0016329149,0.003986272,0.0014402727,0.0016517132,0.0003010638],"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.0017818982,0.00085149443,0.0032943606,0.00035243836,0.00016480421,0.00030666415,0.00080704724,0.44794315,0.026748164,0.08182103,0.0035691038,0.43235996],"study_design_scores_gemma":[0.00012433268,0.00012765532,0.0002415501,0.000013198397,0.000039772363,0.000077743105,0.00005681865,0.96197164,0.01776139,0.017963395,0.0016058818,0.000016645798],"about_ca_topic_score_codex":0.004093414,"about_ca_topic_score_gemma":0.0047463956,"teacher_disagreement_score":0.004093414,"about_ca_system_score_codex":0.0009389172,"about_ca_system_score_gemma":0.002105004,"threshold_uncertainty_score":0.017867506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029010892,0.0046056015,0.895347,0.008639239,0.00077774806,0.0002574941,0.0015694484,0.0012430009,0.058549594],"genre_scores_gemma":[0.6676254,0.0074776695,0.2647198,0.0071099293,0.0049768332,0.0019680276,0.0044319993,0.0028407702,0.038849544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822827,0.007352474,0.00090671575,0.0027818892,0.004964584,0.0017116099],"domain_scores_gemma":[0.9202651,0.06267099,0.0031067312,0.008023372,0.0037941565,0.0021397413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016965313,0.0035480994,0.005039928,0.0057734926,0.0037071912,0.009318782,0.008497845,0.005176124,0.018564448],"category_scores_gemma":[0.07568291,0.0030350378,0.0061818804,0.0066344063,0.010227095,0.022797557,0.009837535,0.014249304,0.0026948622],"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.00013485923,0.000113223185,0.000591401,0.00033428948,0.00011248595,0.000076762975,0.000118570126,0.02122524,0.0006215302,0.9593572,0.007586017,0.00972849],"study_design_scores_gemma":[0.000053951117,0.00003026646,0.0002477053,0.00004928602,0.00004193027,0.00006893974,0.00002577638,0.06377093,0.0002940527,0.93324065,0.0021459905,0.000030463667],"about_ca_topic_score_codex":0.0027495567,"about_ca_topic_score_gemma":0.00349174,"teacher_disagreement_score":0.018564448,"about_ca_system_score_codex":0.006504861,"about_ca_system_score_gemma":0.0041387314,"threshold_uncertainty_score":0.089722216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02139261,0.000907001,0.95071995,0.0006951679,0.00019547802,0.0007775427,0.00095186563,0.015837014,0.008523314],"genre_scores_gemma":[0.18787,0.0003715409,0.8007858,0.0005309802,0.00020479651,0.0014140788,0.003272606,0.001965727,0.0035846017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917258,0.0042639743,0.0004296505,0.0009375994,0.0021105101,0.0005324443],"domain_scores_gemma":[0.98871094,0.007056963,0.00069307594,0.0022937066,0.0009198337,0.0003255747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008243506,0.0023428213,0.0021803903,0.0037397223,0.0010551699,0.0026779186,0.0038699221,0.0021479465,0.009380968],"category_scores_gemma":[0.023801146,0.0012823695,0.0022981807,0.0033787955,0.0011285357,0.003167713,0.003297297,0.0031854631,0.0039702067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059291197,0.0005672815,0.0063455193,0.0004394731,0.0004090352,0.00014387655,0.00017088419,0.31257036,0.0033306077,0.028456455,0.051761817,0.59521174],"study_design_scores_gemma":[0.00018816102,0.00012209939,0.00039664088,0.000024128864,0.000036299072,0.00007503811,0.000023333252,0.97054976,0.0017413164,0.02159689,0.0052303025,0.000016007969],"about_ca_topic_score_codex":0.0019646464,"about_ca_topic_score_gemma":0.0042532925,"teacher_disagreement_score":0.009380968,"about_ca_system_score_codex":0.0019318508,"about_ca_system_score_gemma":0.0036881315,"threshold_uncertainty_score":0.043596327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089669466,0.00008292453,0.99737287,0.000103705795,0.000031198288,0.00004113393,0.0001004395,0.00029361754,0.0010774141],"genre_scores_gemma":[0.04404384,0.00032261934,0.9516706,0.00013782838,0.00012751113,0.00022877616,0.00043092715,0.00014154312,0.0028964044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980082,0.00055637694,0.00015141284,0.00035863777,0.0007591811,0.00016615463],"domain_scores_gemma":[0.99804616,0.00095034664,0.00020896221,0.00024196667,0.0004019167,0.00015065588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002035147,0.0009510779,0.0010651579,0.0009891443,0.000856222,0.0019997642,0.002409855,0.0011221188,0.0051574353],"category_scores_gemma":[0.0036260912,0.0005452706,0.0018454996,0.0024429383,0.0013506801,0.0034250699,0.001945605,0.0026721125,0.00083519414],"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.00016433289,0.00015706917,0.0006340043,0.00053970004,0.00008272354,0.00071371516,0.00032399193,0.30794445,0.011312345,0.46676052,0.010903116,0.20046407],"study_design_scores_gemma":[0.00005906444,0.000058735728,0.00014354227,0.00003748701,0.00003925605,0.0003346934,0.00005529343,0.8702994,0.0037976548,0.09328628,0.031852163,0.000036448982],"about_ca_topic_score_codex":0.007117883,"about_ca_topic_score_gemma":0.009157348,"teacher_disagreement_score":0.007117883,"about_ca_system_score_codex":0.0009358182,"about_ca_system_score_gemma":0.004324446,"threshold_uncertainty_score":0.01725334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028737136,0.000694013,0.9726556,0.0039049704,0.00030334078,0.000057781133,0.00017361133,0.00029353588,0.01904335],"genre_scores_gemma":[0.44913888,0.0032101197,0.5084957,0.0053118276,0.002203663,0.0007593062,0.0007005023,0.00077595125,0.029404067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944511,0.0029184222,0.00022550765,0.000994119,0.0010572557,0.0003536743],"domain_scores_gemma":[0.98619163,0.009366884,0.00068829564,0.0018853098,0.0015025919,0.00036525764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00727492,0.0008639095,0.0012266465,0.002333499,0.0022872048,0.0046929256,0.0031675594,0.0028419583,0.009661562],"category_scores_gemma":[0.026991462,0.00084735174,0.001485421,0.0035099254,0.0073126713,0.012857119,0.003947913,0.005009697,0.0011804164],"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.000012096149,0.0000048902602,0.00010401099,0.000036929698,0.000008801067,0.0000213142,0.00012272895,0.0036739164,0.000069233545,0.9883562,0.0011469472,0.0064429087],"study_design_scores_gemma":[0.000009153077,0.00000993112,0.000066377754,0.000027934499,0.000011954018,0.000040297287,0.000044313278,0.025504917,0.00021244628,0.9625211,0.011538289,0.000013256762],"about_ca_topic_score_codex":0.0048903716,"about_ca_topic_score_gemma":0.0030838035,"teacher_disagreement_score":0.009661562,"about_ca_system_score_codex":0.0025975176,"about_ca_system_score_gemma":0.0018427769,"threshold_uncertainty_score":0.038473964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012968411,0.0003571626,0.97495544,0.0004882353,0.000076070995,0.0002862259,0.0008221613,0.00093465607,0.009111729],"genre_scores_gemma":[0.15984938,0.0005244695,0.83182573,0.0001852949,0.000100008496,0.0004589963,0.0017951273,0.00039542472,0.004865612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959461,0.0014435321,0.00056357816,0.0008376318,0.0010143347,0.00019490415],"domain_scores_gemma":[0.99348277,0.0032520301,0.0003997916,0.0017402796,0.0010102397,0.00011489986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003575835,0.001090938,0.00075258216,0.002801556,0.001182196,0.0028052628,0.0020590131,0.00092078856,0.010451288],"category_scores_gemma":[0.012567102,0.00096340553,0.0020322565,0.003042496,0.0040250598,0.011086109,0.0029786911,0.0021206178,0.0027152696],"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.00010202386,0.000034334502,0.0006626242,0.00046081835,0.0000496934,0.00030312676,0.0043744147,0.011560764,0.0045323274,0.8581921,0.0038456838,0.11588197],"study_design_scores_gemma":[0.000027232298,0.00005238491,0.0003160498,0.00014879613,0.00006899789,0.00036359075,0.0012798595,0.05748174,0.005421497,0.8752132,0.059563022,0.000063578744],"about_ca_topic_score_codex":0.0038835576,"about_ca_topic_score_gemma":0.0057283915,"teacher_disagreement_score":0.010451288,"about_ca_system_score_codex":0.0012913045,"about_ca_system_score_gemma":0.0010312815,"threshold_uncertainty_score":0.03496301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09978329,0.0037294999,0.81756383,0.002943684,0.00056810275,0.000102362654,0.00019960204,0.000793231,0.074316405],"genre_scores_gemma":[0.846771,0.001869792,0.12220094,0.0010232887,0.00041075388,0.00019461126,0.00022835944,0.00062380277,0.026677558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846834,0.00053640356,0.000057991278,0.00031964298,0.00038152418,0.00023614646],"domain_scores_gemma":[0.99073714,0.006643094,0.0006991984,0.00087142584,0.00048368564,0.00056555594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002645822,0.00073846057,0.001074248,0.0012134411,0.0014853942,0.002553634,0.0015397047,0.0015819902,0.011960693],"category_scores_gemma":[0.021970365,0.0007319406,0.0011549505,0.0011374344,0.005355076,0.004112393,0.002968463,0.0039888895,0.001379934],"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.00007305814,0.000020944844,0.00032527943,0.000074350304,0.00001395624,0.00010117544,0.00032846813,0.02486698,0.0008413496,0.959694,0.0019786337,0.011681863],"study_design_scores_gemma":[0.000020756175,0.000027753384,0.00012739554,0.000022667145,0.000005593598,0.00003851945,0.000061462044,0.057953745,0.00034070085,0.9385279,0.0028614474,0.000012225559],"about_ca_topic_score_codex":0.0019373631,"about_ca_topic_score_gemma":0.0015974826,"teacher_disagreement_score":0.011960693,"about_ca_system_score_codex":0.0015365611,"about_ca_system_score_gemma":0.00073213415,"threshold_uncertainty_score":0.04001248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023834337,0.00025537304,0.99278885,0.00034743338,0.000048105925,0.000042105003,0.000060452738,0.00016500015,0.003909256],"genre_scores_gemma":[0.14579122,0.00078532053,0.8459773,0.00055025925,0.00042261477,0.00043817493,0.00043215993,0.00039245866,0.005210468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950588,0.0014275233,0.00055603404,0.0011970226,0.0013131542,0.00044749165],"domain_scores_gemma":[0.99038917,0.004668924,0.0017351782,0.0014718601,0.0013453763,0.0003894975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006138313,0.0012740223,0.00095663796,0.0023441168,0.0015722497,0.0039806683,0.004270044,0.0021459972,0.0041943514],"category_scores_gemma":[0.010112572,0.0011184771,0.0034037705,0.0030935998,0.009623244,0.0170264,0.004691371,0.005727843,0.0013235953],"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.00001290714,0.000017534085,0.00013422461,0.00005210773,0.000011627195,0.00010811501,0.00047232627,0.0069772652,0.0009517334,0.98328674,0.00042193139,0.007553452],"study_design_scores_gemma":[0.000024364299,0.00007064756,0.00012776234,0.00008130027,0.00003453472,0.00023978137,0.00018393427,0.060808346,0.0018487531,0.90865153,0.027867874,0.000061156],"about_ca_topic_score_codex":0.004749814,"about_ca_topic_score_gemma":0.0030491361,"teacher_disagreement_score":0.006138313,"about_ca_system_score_codex":0.0027321307,"about_ca_system_score_gemma":0.002337391,"threshold_uncertainty_score":0.032462895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016818961,0.001879584,0.96566695,0.0009936491,0.00008265293,0.0001255459,0.0005140759,0.00028977336,0.013628798],"genre_scores_gemma":[0.44176325,0.005640262,0.53583026,0.0005767932,0.00067435537,0.0005022244,0.0015845017,0.00047312086,0.012955213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975805,0.0011238245,0.000088856956,0.00052944093,0.0003962309,0.0002810545],"domain_scores_gemma":[0.9920387,0.0064488384,0.0005274974,0.00047401726,0.00032271756,0.00018822873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028929901,0.002052248,0.0018029783,0.0015000935,0.0011019848,0.0024951692,0.0019136791,0.001900389,0.010568524],"category_scores_gemma":[0.015136471,0.00097247906,0.001588089,0.003809232,0.002239525,0.006733595,0.0016223622,0.0031532745,0.0012215414],"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.00016938998,0.00010537784,0.00065190194,0.000553357,0.00011590015,0.00013099134,0.00021999491,0.3670364,0.0010577933,0.5608651,0.009414028,0.059679747],"study_design_scores_gemma":[0.000028449827,0.00003936322,0.00017964578,0.000039668957,0.00002670769,0.00007637917,0.000061175866,0.36132446,0.0006310528,0.6310595,0.006518858,0.000014783496],"about_ca_topic_score_codex":0.003188155,"about_ca_topic_score_gemma":0.0026660124,"teacher_disagreement_score":0.010568524,"about_ca_system_score_codex":0.0023217814,"about_ca_system_score_gemma":0.0010183952,"threshold_uncertainty_score":0.03535527},"labels":[],"label_agreement":null},{"id":"W2151266168","doi":"10.1023/a:1011402324562","title":"Random Constraint Satisfaction: A More Accurate Picture","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complement (music); Constraint (computer-aided design); Mathematics; Applied mathematics; Point (geometry); Constraint satisfaction problem; Mathematical optimization; Statistics; Geometry","score_opus":0.015994956451348324,"score_gpt":0.257697762280475,"score_spread":0.24170280582912665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151266168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040109917,0.028681256,0.8691533,0.048914902,0.0021063657,0.00005562537,0.00080418075,0.0003948259,0.045878425],"genre_scores_gemma":[0.3673832,0.077631146,0.45996892,0.025668519,0.019728087,0.00065816246,0.0026779808,0.0016565607,0.0446274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952304,0.0017798388,0.0002453367,0.0007270986,0.0018059908,0.00021132732],"domain_scores_gemma":[0.9912621,0.0047140447,0.000417743,0.0022030657,0.0011413778,0.0002617172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006009879,0.0020333235,0.0028016383,0.0036206702,0.0015490862,0.008718511,0.0050283447,0.005002607,0.012606535],"category_scores_gemma":[0.020106126,0.00121909,0.0014394397,0.003679507,0.01088816,0.028683508,0.0035453865,0.010598843,0.0023722944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019611238,0.000018398965,0.00011673081,0.00016934467,0.00002381868,0.000034469118,0.0000953218,0.004316008,0.00020005829,0.97243047,0.00923128,0.013344497],"study_design_scores_gemma":[0.000012959963,0.0000114159875,0.0000839208,0.00005454241,0.000009843937,0.000059171645,0.000055990004,0.014947095,0.00010689004,0.9641216,0.020518832,0.000017714912],"about_ca_topic_score_codex":0.0034638317,"about_ca_topic_score_gemma":0.0027547693,"teacher_disagreement_score":0.012606535,"about_ca_system_score_codex":0.002287357,"about_ca_system_score_gemma":0.001656693,"threshold_uncertainty_score":0.042173028},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058062593,0.00012814329,0.9908222,0.00023929293,0.00003320389,0.00012546586,0.00018259477,0.0012860902,0.0013768014],"genre_scores_gemma":[0.08441039,0.0002027298,0.9115469,0.00019268112,0.00003541487,0.00040337135,0.0008372241,0.00040155055,0.0019697475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686253,0.0010357057,0.00025452056,0.00040841155,0.00117699,0.00026192536],"domain_scores_gemma":[0.9953825,0.0022719628,0.00038659,0.0011725993,0.0006625767,0.00012371027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023742896,0.0012057654,0.0011839343,0.0017360614,0.0011953185,0.0033592354,0.0037070063,0.0023572408,0.004662628],"category_scores_gemma":[0.01086854,0.0007562826,0.0017223048,0.0027948336,0.0014884915,0.004786589,0.0031123767,0.0033842528,0.0014417623],"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.00045317048,0.0003631821,0.0006603099,0.0005930456,0.000089135305,0.00025906984,0.00096779177,0.3521853,0.0103487,0.14542502,0.009881447,0.47877383],"study_design_scores_gemma":[0.00015128784,0.00020520219,0.0001353746,0.000091010945,0.00005497806,0.00013569828,0.00015135827,0.85853374,0.0097760325,0.11978908,0.010919055,0.000057113266],"about_ca_topic_score_codex":0.0029778825,"about_ca_topic_score_gemma":0.004345463,"teacher_disagreement_score":0.004662628,"about_ca_system_score_codex":0.0013447796,"about_ca_system_score_gemma":0.0028926092,"threshold_uncertainty_score":0.015598059},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012754617,0.0007125062,0.9923423,0.00077056524,0.000045379988,0.000069714326,0.000039322204,0.00011835012,0.004626362],"genre_scores_gemma":[0.049299005,0.0020075338,0.94611996,0.0002345663,0.00017059431,0.00025670053,0.00013696818,0.000077675904,0.0016969782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99089736,0.0036748333,0.0008442227,0.0011123847,0.0032483232,0.00022289956],"domain_scores_gemma":[0.98703873,0.009386314,0.0007573446,0.0016342093,0.0010139447,0.00016963271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010618443,0.0022960661,0.0016098998,0.0034553686,0.001955977,0.009528464,0.0039022593,0.0019157204,0.0050750165],"category_scores_gemma":[0.020361008,0.0010300301,0.003405634,0.0026064944,0.008121597,0.0095497705,0.0050000986,0.00366903,0.0012377865],"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.000029435661,0.000035167533,0.00036283548,0.00064798485,0.0001391682,0.00021819731,0.0010784547,0.085327394,0.0009824312,0.83630955,0.0018229756,0.07304631],"study_design_scores_gemma":[0.000016834842,0.000014851368,0.000069558875,0.00019582029,0.000038070437,0.00007320857,0.00020424517,0.07785373,0.0006736129,0.90394676,0.016882587,0.000030722633],"about_ca_topic_score_codex":0.0037341088,"about_ca_topic_score_gemma":0.0029825312,"teacher_disagreement_score":0.010618443,"about_ca_system_score_codex":0.00252274,"about_ca_system_score_gemma":0.004104831,"threshold_uncertainty_score":0.056156397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029498369,0.0000860262,0.9687262,0.000058667563,0.000008300217,0.000017024668,0.000050506304,0.00014697663,0.0014079934],"genre_scores_gemma":[0.5743389,0.00019881611,0.4227798,0.000045308025,0.000025049545,0.0000757812,0.00020170333,0.00004118361,0.0022935187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995272,0.00006315431,0.000029751407,0.00012043691,0.00020636451,0.0000530861],"domain_scores_gemma":[0.9992217,0.000337208,0.000101487174,0.0001042643,0.00019094998,0.00004445747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066391024,0.00040409435,0.0006962101,0.0011980868,0.00041997927,0.0011496531,0.0010133606,0.0005565645,0.001446219],"category_scores_gemma":[0.0028902679,0.0003175103,0.0006914664,0.0011531991,0.0006661361,0.0015571335,0.00083863037,0.00037270022,0.00026230334],"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.0002687418,0.00006176756,0.0029836614,0.0001708599,0.00006650687,0.00016570279,0.00037866135,0.5693379,0.018332634,0.08500938,0.0017703119,0.32145396],"study_design_scores_gemma":[0.000015388805,0.000042535663,0.00065854297,0.000012230378,0.000018093404,0.000069883696,0.000042370397,0.9790125,0.0034838219,0.015560234,0.001062267,0.000022090751],"about_ca_topic_score_codex":0.007567544,"about_ca_topic_score_gemma":0.006309726,"teacher_disagreement_score":0.007567544,"about_ca_system_score_codex":0.0009733323,"about_ca_system_score_gemma":0.00080076285,"threshold_uncertainty_score":0.015047014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008843433,0.00009955491,0.985427,0.00022211552,0.000024676889,0.00007582345,0.000035041176,0.00056279264,0.004709499],"genre_scores_gemma":[0.18430755,0.00018421662,0.8132188,0.00013388529,0.000032265583,0.00014984621,0.00010616227,0.000120652396,0.0017465923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905294,0.00035287664,0.000054859072,0.0001425166,0.00033191132,0.00006481126],"domain_scores_gemma":[0.99763227,0.0012000053,0.00015718008,0.00062188995,0.00025296444,0.00013568984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014500205,0.0006478476,0.000759524,0.0008693455,0.0004007543,0.0015956478,0.0020791602,0.000882365,0.004485143],"category_scores_gemma":[0.0059009623,0.00048033267,0.0011903385,0.0009466201,0.0028800387,0.0026267911,0.0027396858,0.0020452277,0.00053091877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001340019,0.00016968246,0.0011726125,0.00033990343,0.00016445458,0.00018771249,0.00073956803,0.3285411,0.011725368,0.39823097,0.0022454066,0.2563492],"study_design_scores_gemma":[0.000026316928,0.00008476466,0.00022695625,0.000029153196,0.000023790606,0.0000639117,0.00006556542,0.8195875,0.0026081644,0.17155509,0.005701605,0.000027172107],"about_ca_topic_score_codex":0.004553554,"about_ca_topic_score_gemma":0.0062890886,"teacher_disagreement_score":0.004553554,"about_ca_system_score_codex":0.0010523249,"about_ca_system_score_gemma":0.0016646057,"threshold_uncertainty_score":0.015004277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00472635,0.000085251835,0.9561587,0.00030654727,0.00016893182,0.00026544055,0.00072925224,0.030587967,0.0069714366],"genre_scores_gemma":[0.11850872,0.00018743852,0.8630692,0.0005538165,0.000092803835,0.0005180197,0.0021435558,0.004088731,0.010837722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965108,0.00081005465,0.00037213502,0.00077024236,0.0011115925,0.00042518493],"domain_scores_gemma":[0.9948767,0.0023079778,0.00030258493,0.0014190292,0.000943503,0.00015037437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040331385,0.000780825,0.0008339878,0.0012487657,0.0008985295,0.0033898158,0.00614076,0.0025011706,0.026450012],"category_scores_gemma":[0.00848189,0.001021454,0.0020039808,0.0014021418,0.0019551262,0.0038886042,0.0026423878,0.0033201945,0.0066288305],"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.0012972085,0.0006410976,0.0020850454,0.001838576,0.00029413443,0.0016267087,0.001427011,0.069780625,0.057121664,0.5624032,0.04239056,0.25909418],"study_design_scores_gemma":[0.000781667,0.0005273081,0.0007068568,0.00024685575,0.0002801861,0.0015554448,0.0003054084,0.5804809,0.1196966,0.12006016,0.17501576,0.00034285607],"about_ca_topic_score_codex":0.0040495214,"about_ca_topic_score_gemma":0.0033292957,"teacher_disagreement_score":0.026450012,"about_ca_system_score_codex":0.001056866,"about_ca_system_score_gemma":0.0027605835,"threshold_uncertainty_score":0.08848411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016721787,0.00015380952,0.97649336,0.00026256466,0.00007499024,0.0002362414,0.00030741974,0.001976067,0.0037737966],"genre_scores_gemma":[0.20326284,0.0002019273,0.7917368,0.00017222183,0.00004674593,0.00041320742,0.0009930324,0.0005007187,0.0026725957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925655,0.00023391924,0.000032928354,0.00014282542,0.0002232122,0.00011054337],"domain_scores_gemma":[0.9983896,0.001041974,0.00008649046,0.00020116309,0.00017315248,0.0001075722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092547876,0.00092099304,0.00094698905,0.00087103236,0.00083077024,0.0010449447,0.0016009726,0.0010616624,0.009538951],"category_scores_gemma":[0.0031837258,0.0005879752,0.0010784437,0.0017790308,0.0007494597,0.0012796011,0.0011107636,0.0017357318,0.0013100791],"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.00009992546,0.00021311514,0.00062182883,0.00014978646,0.000040756528,0.00015864553,0.00010442261,0.78515184,0.004302324,0.027667934,0.009291224,0.17219815],"study_design_scores_gemma":[0.000038366157,0.000035336,0.000098765435,0.0000059665795,0.000011299267,0.0000331553,0.00002957317,0.9759553,0.0016885216,0.019538969,0.0025529794,0.0000116814945],"about_ca_topic_score_codex":0.008113592,"about_ca_topic_score_gemma":0.013064961,"teacher_disagreement_score":0.009538951,"about_ca_system_score_codex":0.0012160091,"about_ca_system_score_gemma":0.00333949,"threshold_uncertainty_score":0.031910956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440543,0.000385853,0.14729658,0.0014613114,0.000050031445,0.000058137655,0.0012308762,0.001410661,0.0040522655],"genre_scores_gemma":[0.97994107,0.000084127416,0.017992124,0.00011328207,0.000027454656,0.00003068706,0.0012763184,0.000047703244,0.00048724917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993729,0.00018915557,0.000029218347,0.00016681192,0.00015336821,0.000088616885],"domain_scores_gemma":[0.9919595,0.0058428813,0.0006246896,0.0007790341,0.0005468025,0.00024699533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015108127,0.00043957992,0.0006675279,0.0009877002,0.00037398507,0.0012308311,0.00084045203,0.0009926514,0.0013557625],"category_scores_gemma":[0.015015996,0.00027781102,0.0007071603,0.00083638314,0.00072800845,0.0026467962,0.00079772057,0.0016842097,0.0005091092],"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.000705726,0.00038773622,0.09295244,0.00020178358,0.00012239761,0.00026686868,0.0002170008,0.73864055,0.0072260336,0.037193224,0.010492948,0.11159322],"study_design_scores_gemma":[0.000009918419,0.00001944421,0.0023337589,0.0000059862823,0.000004979324,0.000022603093,0.000018904422,0.9760074,0.0017394507,0.019572021,0.00026080653,0.0000047649582],"about_ca_topic_score_codex":0.0028553812,"about_ca_topic_score_gemma":0.00434769,"teacher_disagreement_score":0.0028553812,"about_ca_system_score_codex":0.00087936735,"about_ca_system_score_gemma":0.0007373731,"threshold_uncertainty_score":0.007990062},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013090745,0.00021734629,0.98047733,0.0006000185,0.00009915012,0.00009582413,0.00011199835,0.00019304836,0.005114526],"genre_scores_gemma":[0.4880894,0.0006093138,0.49958086,0.00045045876,0.00030123245,0.0005309023,0.00040993074,0.0002538449,0.00977409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982597,0.0005911534,0.00009081778,0.00036619225,0.0004372027,0.00025494758],"domain_scores_gemma":[0.994922,0.004233544,0.00020987322,0.00014345303,0.00032575225,0.00016529807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026806123,0.001252428,0.0018410123,0.000672184,0.00097137666,0.0026776067,0.0024558427,0.0029514143,0.0051282668],"category_scores_gemma":[0.008664384,0.0012501993,0.0014074463,0.0019195909,0.0014511109,0.0016539334,0.0018641053,0.0026584475,0.0003275109],"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.000053681866,0.000052587813,0.0001390109,0.00007770367,0.000033275104,0.00006980148,0.000034903584,0.9633111,0.00047684732,0.022846205,0.0013034552,0.0116014555],"study_design_scores_gemma":[0.000017125474,0.000011700777,0.000026774405,0.000004698743,0.0000057034817,0.0000074143504,0.000007956934,0.9922214,0.00016569706,0.007190016,0.00033693542,0.0000045731927],"about_ca_topic_score_codex":0.021800987,"about_ca_topic_score_gemma":0.011879691,"teacher_disagreement_score":0.021800987,"about_ca_system_score_codex":0.0018462314,"about_ca_system_score_gemma":0.00413147,"threshold_uncertainty_score":0.043348193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040087752,0.0013802748,0.93039334,0.0027476521,0.0004607443,0.00018166752,0.00030232404,0.00023525335,0.024210922],"genre_scores_gemma":[0.6928072,0.001972571,0.29146004,0.0011666795,0.00053120806,0.00024969387,0.0003905983,0.00029833443,0.011123646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985133,0.00076995895,0.000050037837,0.00017498064,0.00028246787,0.00020932376],"domain_scores_gemma":[0.9913298,0.007015067,0.0003789829,0.0004099506,0.0006047294,0.00026149658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900182,0.0012297414,0.0014428865,0.0016192626,0.0011351829,0.002307637,0.0020547798,0.0018277281,0.009074659],"category_scores_gemma":[0.013651974,0.00083265366,0.0012304104,0.0020201027,0.0026036296,0.0077604805,0.00315198,0.0038737252,0.00034225886],"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.00018731749,0.0000817134,0.00060065364,0.00026245572,0.00006415991,0.00015487516,0.00023422927,0.62484235,0.000797142,0.30316618,0.006251024,0.06335792],"study_design_scores_gemma":[0.000042023275,0.00005204645,0.00026001842,0.000056624423,0.000036004418,0.000041449406,0.00009886426,0.6607459,0.0006185342,0.33392525,0.004093905,0.000029477142],"about_ca_topic_score_codex":0.0067356043,"about_ca_topic_score_gemma":0.007869856,"teacher_disagreement_score":0.009074659,"about_ca_system_score_codex":0.0011675701,"about_ca_system_score_gemma":0.0012064317,"threshold_uncertainty_score":0.030357778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31984705,0.0075228754,0.5427045,0.022335831,0.0005696719,0.00020086969,0.0017053842,0.00045954148,0.10465435],"genre_scores_gemma":[0.85863245,0.0043538855,0.110487394,0.0010876661,0.0010171434,0.00028441873,0.0018899408,0.00029507114,0.021952119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959609,0.0013545252,0.00021353421,0.00050153246,0.0015444274,0.00042505],"domain_scores_gemma":[0.96564454,0.028705476,0.0014696436,0.0019230897,0.0013054637,0.00095178385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039027578,0.0010368881,0.0019488537,0.002443833,0.0019911428,0.0058937524,0.002901484,0.0022158024,0.011533471],"category_scores_gemma":[0.031206839,0.00085499056,0.0014937595,0.0031183357,0.005459513,0.014688313,0.0046636793,0.007726382,0.0007935113],"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.00013001001,0.00007738533,0.000662442,0.00018414448,0.00003451015,0.00008366152,0.0002676296,0.038395535,0.00027267684,0.9385156,0.004439658,0.016936792],"study_design_scores_gemma":[0.000015097656,0.000007832786,0.00013059622,0.000013394777,0.000006745782,0.00002403131,0.00004385658,0.04939287,0.00008867498,0.94904846,0.0012201172,0.000008474495],"about_ca_topic_score_codex":0.0027439035,"about_ca_topic_score_gemma":0.0027159024,"teacher_disagreement_score":0.011533471,"about_ca_system_score_codex":0.0028748468,"about_ca_system_score_gemma":0.0015530356,"threshold_uncertainty_score":0.03858328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08396756,0.00039838805,0.87297535,0.0023766786,0.00012668301,0.00047657438,0.0013564486,0.00056331244,0.037758987],"genre_scores_gemma":[0.6621451,0.0004932761,0.30686298,0.00021597873,0.00007591327,0.00091086834,0.0013126717,0.00016653643,0.02781667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840647,0.00061470625,0.00006324843,0.00032555038,0.00027849994,0.00031154635],"domain_scores_gemma":[0.9979924,0.0013110612,0.00019400072,0.00008686598,0.00019159065,0.00022405175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841191,0.0006298798,0.00079060765,0.0008906704,0.0008077645,0.0035191218,0.0026036594,0.002526935,0.012207719],"category_scores_gemma":[0.0055189854,0.0010527817,0.0011645161,0.0019358183,0.0011663178,0.003060424,0.0021772336,0.0016716222,0.00090424425],"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.00012416454,0.00011756066,0.0010724727,0.00010115167,0.000036593363,0.0002631759,0.0002676333,0.8234687,0.0004360167,0.15390982,0.002685591,0.017517114],"study_design_scores_gemma":[0.0000537429,0.000048938415,0.00015141594,0.000021748394,0.000020404925,0.000026399563,0.00014067425,0.9494374,0.00024670764,0.04617717,0.0036590665,0.000016247974],"about_ca_topic_score_codex":0.030469723,"about_ca_topic_score_gemma":0.027102029,"teacher_disagreement_score":0.030469723,"about_ca_system_score_codex":0.0022324042,"about_ca_system_score_gemma":0.003114511,"threshold_uncertainty_score":0.060584724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004281334,0.00006600394,0.9985384,0.00006852278,0.000010840305,0.000021365799,0.00005201109,0.00012361749,0.00069116405],"genre_scores_gemma":[0.036735564,0.00027304742,0.9605421,0.00014907471,0.000045548502,0.0002165651,0.00037792107,0.00012923051,0.0015311037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816436,0.00038204074,0.00012276786,0.0003025008,0.0009304521,0.0000978688],"domain_scores_gemma":[0.99885774,0.00049125537,0.00009891911,0.00020105732,0.00028532112,0.00006564801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056546,0.001281906,0.0012039212,0.0011266436,0.0010055327,0.0018706128,0.0030962538,0.0013861946,0.0056955256],"category_scores_gemma":[0.0028625356,0.0008202814,0.0019522429,0.0025694133,0.0017294111,0.0018676425,0.0025472909,0.0022789252,0.0015951418],"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.00010480976,0.00015307147,0.0005068818,0.00058803183,0.00018624478,0.0005005528,0.00023644757,0.42851588,0.021262892,0.19677022,0.011250258,0.33992478],"study_design_scores_gemma":[0.0000162389,0.000031525113,0.00011794548,0.000019977788,0.000020200137,0.00013226095,0.000031514985,0.9205521,0.0044361106,0.06597761,0.008637425,0.000027134547],"about_ca_topic_score_codex":0.0066964184,"about_ca_topic_score_gemma":0.007682179,"teacher_disagreement_score":0.0066964184,"about_ca_system_score_codex":0.0010073421,"about_ca_system_score_gemma":0.0017011929,"threshold_uncertainty_score":0.0190534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024294404,0.00026983843,0.9614454,0.0005850171,0.00007861259,0.00017055703,0.00059038354,0.00023801875,0.012327836],"genre_scores_gemma":[0.34509578,0.00042699804,0.64555794,0.00032547666,0.00012775842,0.00035866973,0.0007273286,0.000102992526,0.0072770016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99407804,0.002064939,0.0005405488,0.0008511471,0.002115859,0.00034950316],"domain_scores_gemma":[0.98963004,0.0066482755,0.0009043659,0.0014998646,0.0009674323,0.00035009603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048802183,0.0009410985,0.0005869606,0.00092076097,0.0008579882,0.0024998933,0.0014047861,0.001032085,0.007400856],"category_scores_gemma":[0.0146219,0.0004448517,0.0014348611,0.0023058413,0.0017990428,0.005673552,0.0022500094,0.0022577678,0.00068314257],"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.00022074755,0.000110795256,0.0016309707,0.0004495496,0.00010484922,0.0007975764,0.0005841056,0.13609809,0.0051697097,0.746829,0.004360537,0.1036441],"study_design_scores_gemma":[0.000061035033,0.000110807545,0.00085404876,0.000098783305,0.0000818171,0.0006690999,0.00030142753,0.41107404,0.0074885213,0.55056494,0.028633492,0.000061985316],"about_ca_topic_score_codex":0.0025181475,"about_ca_topic_score_gemma":0.005096014,"teacher_disagreement_score":0.007400856,"about_ca_system_score_codex":0.00090191665,"about_ca_system_score_gemma":0.0018887304,"threshold_uncertainty_score":0.025809348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011536057,0.0005540458,0.9723585,0.0012884248,0.00010364431,0.000060531223,0.00027382394,0.00020208079,0.0136228455],"genre_scores_gemma":[0.5629645,0.0024525959,0.41491222,0.0012572346,0.0008097489,0.00067288213,0.0011812897,0.0004225173,0.015326981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968689,0.0012748764,0.00017017055,0.0006662909,0.00069574104,0.00032396184],"domain_scores_gemma":[0.99397296,0.0036009748,0.00043654503,0.0010419424,0.00069254526,0.0002549766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003896943,0.0008533977,0.0014998927,0.0023387903,0.0017892886,0.0044950605,0.002353879,0.001987548,0.005309875],"category_scores_gemma":[0.011288064,0.00080058083,0.002171059,0.0042797932,0.006452096,0.009870755,0.0038998297,0.004022646,0.00073246704],"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.000008010318,0.0000058962514,0.00008584827,0.000020217662,0.0000062283125,0.000018454373,0.00007795476,0.0039753406,0.00011411008,0.99096525,0.0004652899,0.004257457],"study_design_scores_gemma":[0.0000046895616,0.00000614629,0.00004095603,0.000008900166,0.000005191208,0.000022137168,0.000022079166,0.029597173,0.00011257394,0.9686979,0.0014726577,0.000009599496],"about_ca_topic_score_codex":0.004088002,"about_ca_topic_score_gemma":0.0033586111,"teacher_disagreement_score":0.005309875,"about_ca_system_score_codex":0.0021599631,"about_ca_system_score_gemma":0.0018168541,"threshold_uncertainty_score":0.0206092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03663031,0.00030767426,0.95813304,0.00040385957,0.000016783511,0.00008384636,0.00041573375,0.00049015315,0.0035185877],"genre_scores_gemma":[0.45816997,0.00082093454,0.5358136,0.0001241103,0.000032965367,0.00026077393,0.0012137637,0.00011347024,0.0034503243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998857,0.0004065179,0.000106683154,0.0001566374,0.00040292836,0.00007021504],"domain_scores_gemma":[0.99932146,0.0002327692,0.00010692276,0.0001311908,0.00016242875,0.000045256675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009792346,0.00042094823,0.00043312766,0.00055392523,0.00056364044,0.0022798704,0.0016339491,0.00067585864,0.0011759166],"category_scores_gemma":[0.0029706513,0.00034773513,0.00042238366,0.001345148,0.0006237077,0.0031582953,0.0009334063,0.00061293686,0.000283459],"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.00022886765,0.000086530265,0.0019666646,0.00021981196,0.000049700677,0.0004771963,0.00074208435,0.6401346,0.0117003955,0.27279183,0.0037459661,0.06785651],"study_design_scores_gemma":[0.00001716428,0.000030121806,0.00020157197,0.000012271461,0.000020928119,0.00006448159,0.0001386067,0.96136516,0.0029383716,0.02605341,0.009146739,0.000011245922],"about_ca_topic_score_codex":0.013524964,"about_ca_topic_score_gemma":0.012432172,"teacher_disagreement_score":0.013524964,"about_ca_system_score_codex":0.0011974581,"about_ca_system_score_gemma":0.0010935096,"threshold_uncertainty_score":0.026892424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014242793,0.00060787564,0.9775333,0.0002528993,0.000052293646,0.000109039844,0.00026221664,0.0015377771,0.005401798],"genre_scores_gemma":[0.25340265,0.0003228314,0.7416447,0.00017549294,0.00003750108,0.00017361934,0.00067273894,0.00018955613,0.0033809203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863774,0.0002957387,0.00007946092,0.00032803763,0.00046940174,0.00018965924],"domain_scores_gemma":[0.99765503,0.0013017004,0.00018065298,0.00048753334,0.0003089608,0.000066111475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011207088,0.0010223984,0.0013568366,0.000812672,0.0008492553,0.0009846626,0.0022421596,0.0011868305,0.0049764696],"category_scores_gemma":[0.005122181,0.00064377,0.00075344933,0.0020826408,0.00056690647,0.0023447692,0.0018371476,0.0012898123,0.0009123816],"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.00020277791,0.00012705974,0.0009349282,0.0002631105,0.000057061945,0.00007151692,0.00014725643,0.6175873,0.0025065439,0.04777924,0.0066939406,0.32362935],"study_design_scores_gemma":[0.000028464565,0.000025525984,0.00012431768,0.000008313291,0.000007831242,0.000039224607,0.000017638687,0.9688467,0.0008302198,0.027817577,0.0022474534,0.000006661188],"about_ca_topic_score_codex":0.006246342,"about_ca_topic_score_gemma":0.009951643,"teacher_disagreement_score":0.006246342,"about_ca_system_score_codex":0.0013673916,"about_ca_system_score_gemma":0.0017729113,"threshold_uncertainty_score":0.016647995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050353818,0.00026524905,0.9345851,0.0007009972,0.00006139026,0.00016580524,0.0014652258,0.002060816,0.010341618],"genre_scores_gemma":[0.3017494,0.00023741707,0.6878146,0.00021678976,0.00006156603,0.00014632376,0.0034185194,0.00029495935,0.006060479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.00015796586,0.00008771312,0.00023103667,0.00033709477,0.0001363249],"domain_scores_gemma":[0.997624,0.0009149356,0.00023365358,0.0005793564,0.0005076242,0.00014043818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006102479,0.00067947013,0.0006400888,0.0013011991,0.00083405484,0.0017809668,0.0012314063,0.0008038584,0.00584332],"category_scores_gemma":[0.005245468,0.00034592664,0.0006063241,0.0023146428,0.0013710944,0.004924473,0.002021878,0.0013343316,0.0011624796],"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.0004930281,0.00018156848,0.0032910837,0.0004102023,0.000045966444,0.00027229998,0.00081556034,0.053986046,0.019172939,0.42661875,0.016424704,0.47828788],"study_design_scores_gemma":[0.00005566698,0.00008461498,0.0010004174,0.0000658565,0.000030420604,0.00033861038,0.0004943127,0.21274635,0.018993048,0.7418328,0.024299208,0.00005876377],"about_ca_topic_score_codex":0.008532653,"about_ca_topic_score_gemma":0.011165883,"teacher_disagreement_score":0.008532653,"about_ca_system_score_codex":0.0014532966,"about_ca_system_score_gemma":0.0014036234,"threshold_uncertainty_score":0.01954782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022499505,0.000022161543,0.99661607,0.000051472667,0.0000064290502,0.000079762955,0.0000827681,0.00039982016,0.00049155933],"genre_scores_gemma":[0.08190085,0.00015028424,0.91584736,0.00007791708,0.000014257986,0.00055732566,0.00047686094,0.0001671301,0.0008079367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981598,0.0007991886,0.00018058416,0.00021979971,0.00050900533,0.0001315277],"domain_scores_gemma":[0.9968466,0.0020250676,0.00023608284,0.00051859504,0.0002724669,0.00010108695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025133672,0.0010308473,0.00088687113,0.0008558134,0.00085376983,0.0016882762,0.0023453403,0.0010449582,0.004323198],"category_scores_gemma":[0.0055876994,0.0008720351,0.0025099362,0.0012150164,0.001793465,0.002531906,0.0016229646,0.0021022502,0.0006391774],"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.00011432968,0.000112375164,0.00045418306,0.00027260394,0.00005654469,0.00023079598,0.0002086502,0.73418385,0.0047331816,0.21288677,0.0015944312,0.045152232],"study_design_scores_gemma":[0.00003065535,0.000031534488,0.00003604351,0.000021601856,0.00001532128,0.00006833858,0.000031819483,0.94946265,0.003060225,0.04333135,0.0038941104,0.00001635267],"about_ca_topic_score_codex":0.003824651,"about_ca_topic_score_gemma":0.005435889,"teacher_disagreement_score":0.004323198,"about_ca_system_score_codex":0.0012159478,"about_ca_system_score_gemma":0.003068003,"threshold_uncertainty_score":0.014462471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017965442,0.000055477663,0.9780366,0.00009334963,0.000025154392,0.00008853198,0.00005896017,0.0012114103,0.0024650285],"genre_scores_gemma":[0.4646748,0.0002911437,0.5315049,0.00015285493,0.000030911382,0.0004167813,0.00048977666,0.00050059607,0.0019382628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975988,0.0011345352,0.00012290735,0.0002426576,0.0007166412,0.00018433132],"domain_scores_gemma":[0.9896904,0.0076161595,0.00041981906,0.0012661947,0.00081446854,0.00019304152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002411091,0.0012227136,0.0009697631,0.0008896734,0.00061877,0.0012097078,0.0015755713,0.00081709377,0.0042162566],"category_scores_gemma":[0.009964256,0.00057752454,0.001349906,0.001252632,0.0011385893,0.002175966,0.0017925423,0.0015500091,0.0007106629],"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.00014444208,0.00013432793,0.00086649344,0.00010549746,0.000057194316,0.00008136538,0.00007585606,0.91716033,0.0064893775,0.031570405,0.00076198176,0.04255273],"study_design_scores_gemma":[0.000016645232,0.000024668707,0.000031691958,0.0000049390183,0.000008336984,0.000010530816,0.00000529793,0.98911524,0.0036615536,0.0063941237,0.0007207164,0.000006253361],"about_ca_topic_score_codex":0.003982605,"about_ca_topic_score_gemma":0.0043938546,"teacher_disagreement_score":0.0042162566,"about_ca_system_score_codex":0.00087662,"about_ca_system_score_gemma":0.0016940386,"threshold_uncertainty_score":0.014104784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03046193,0.00011621479,0.96474,0.00020936603,0.00003604213,0.00011060258,0.00028024716,0.0006013155,0.0034443717],"genre_scores_gemma":[0.22347145,0.00018079494,0.77215,0.000098328856,0.000038546696,0.00021306975,0.00070766127,0.00019034026,0.0029498532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807584,0.00059434894,0.000119350385,0.00034520397,0.00066801894,0.0001971638],"domain_scores_gemma":[0.9925505,0.005814438,0.0004388087,0.00046785577,0.0005851438,0.00014323316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020907093,0.00091302686,0.00080372737,0.00079473533,0.0007550853,0.0013679196,0.0013905228,0.001031307,0.0059748306],"category_scores_gemma":[0.009050182,0.00057271874,0.0011601958,0.001677847,0.00094404863,0.001982099,0.0019072464,0.0016676934,0.00040948705],"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.00023807595,0.00018299253,0.0023890897,0.00072446006,0.00013439494,0.000739467,0.0003527196,0.6941098,0.011958528,0.104075514,0.0068901423,0.1782048],"study_design_scores_gemma":[0.00003472077,0.000041954718,0.00035496912,0.000022077737,0.000030314595,0.00016173064,0.00009286772,0.95300245,0.0071435445,0.034027487,0.005069813,0.000018007007],"about_ca_topic_score_codex":0.0053075408,"about_ca_topic_score_gemma":0.007948463,"teacher_disagreement_score":0.0059748306,"about_ca_system_score_codex":0.0006294273,"about_ca_system_score_gemma":0.0023079454,"threshold_uncertainty_score":0.019987822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025961999,0.000063796775,0.97146094,0.00016256452,0.000014015334,0.000041467927,0.00015271989,0.00034396368,0.0017984705],"genre_scores_gemma":[0.42693368,0.00017082617,0.5701067,0.000082789506,0.00002690213,0.00016777248,0.0005593027,0.00013223405,0.0018197233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885535,0.00031584353,0.000100388796,0.00023853968,0.00040035602,0.00008957694],"domain_scores_gemma":[0.9971609,0.0017545276,0.0002777631,0.0002211589,0.00047326568,0.00011238569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580782,0.00046993414,0.0006259519,0.0016843604,0.000794328,0.0014408777,0.0013356756,0.0008395219,0.0068645226],"category_scores_gemma":[0.009950756,0.00026093444,0.00080891256,0.0016775765,0.00070512766,0.0041781687,0.0010584656,0.00088819634,0.000645123],"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.0004165639,0.00017421365,0.005216048,0.0003445219,0.000104748484,0.00048583336,0.0004735758,0.57145107,0.011255362,0.23408867,0.0031702893,0.17281911],"study_design_scores_gemma":[0.000013182946,0.00001997017,0.00018828629,0.000014199783,0.000011652742,0.000060086375,0.000061211205,0.94249386,0.0036096498,0.05228645,0.0012278621,0.000013592756],"about_ca_topic_score_codex":0.004276941,"about_ca_topic_score_gemma":0.0026160022,"teacher_disagreement_score":0.0068645226,"about_ca_system_score_codex":0.001023548,"about_ca_system_score_gemma":0.0018023049,"threshold_uncertainty_score":0.02296412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031811285,0.00007865166,0.99471694,0.000087140186,0.000014616683,0.000019936802,0.000034636396,0.00018612205,0.0016808624],"genre_scores_gemma":[0.14300327,0.00029143208,0.854157,0.0000906561,0.000038070782,0.00012757521,0.00027271855,0.000093424904,0.0019259398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590486,0.0011054078,0.00030261095,0.0004965458,0.0020351037,0.0001554173],"domain_scores_gemma":[0.9952827,0.002535261,0.00042604134,0.0009979004,0.0006104175,0.00014761908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00371154,0.0008203569,0.0012892068,0.0021675392,0.0011973503,0.0037051996,0.0026924557,0.0014890126,0.0036134252],"category_scores_gemma":[0.014403501,0.0009658382,0.0022086608,0.0017821445,0.002617676,0.007939226,0.004895855,0.0018954525,0.0006656798],"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.00016080902,0.00005049928,0.0005916305,0.00027987733,0.00010403427,0.00039520388,0.0010332025,0.2800067,0.0046941964,0.6196952,0.0023049016,0.0906837],"study_design_scores_gemma":[0.000030484103,0.00003575156,0.000121608806,0.000058119847,0.000039377195,0.0001430881,0.00014523124,0.7191191,0.0048340503,0.26515123,0.010279461,0.000042412037],"about_ca_topic_score_codex":0.0047378438,"about_ca_topic_score_gemma":0.0041948315,"teacher_disagreement_score":0.0047378438,"about_ca_system_score_codex":0.0015274762,"about_ca_system_score_gemma":0.001373635,"threshold_uncertainty_score":0.019628704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006292056,0.00017855251,0.9865188,0.000116309486,0.000017293469,0.0001291488,0.00015573017,0.001508428,0.0050837058],"genre_scores_gemma":[0.09424468,0.000365476,0.90153015,0.000078456505,0.000013447464,0.00027338896,0.00039902044,0.0002588249,0.002836506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939895,0.00019667987,0.000043400207,0.000113134665,0.00022046454,0.00002729813],"domain_scores_gemma":[0.99916506,0.00041754174,0.00007931961,0.00018184219,0.00012670513,0.000029535706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007143421,0.0007787258,0.00051664346,0.00069003826,0.00054352096,0.001160806,0.0013779477,0.0010186154,0.008915714],"category_scores_gemma":[0.003218018,0.0004196983,0.00063669984,0.0014421558,0.0005710149,0.0013111426,0.00083469454,0.00086613034,0.0010977638],"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.00023950526,0.00012539182,0.0007482106,0.00051989005,0.00007683426,0.000560507,0.00022976674,0.4374012,0.035055872,0.085863836,0.013265044,0.42591384],"study_design_scores_gemma":[0.000052211773,0.00007028542,0.00019908573,0.000033230262,0.000031268843,0.00033158163,0.000028135586,0.95367205,0.009465098,0.009534223,0.026550082,0.000032723685],"about_ca_topic_score_codex":0.003363579,"about_ca_topic_score_gemma":0.0044908165,"teacher_disagreement_score":0.008915714,"about_ca_system_score_codex":0.00064663024,"about_ca_system_score_gemma":0.0009440118,"threshold_uncertainty_score":0.029826045},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018914794,0.00008460001,0.9940561,0.00023863817,0.00008064179,0.00003169047,0.00003310713,0.00022668656,0.0033571427],"genre_scores_gemma":[0.115763426,0.00032664352,0.86418897,0.0006292857,0.0003596905,0.00037571116,0.0002493816,0.0007317043,0.017375119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740237,0.00079163566,0.00010954884,0.00037889025,0.0010365215,0.00028103055],"domain_scores_gemma":[0.99260545,0.004626956,0.0005064228,0.0010328635,0.0009804337,0.00024776527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003746921,0.0011813174,0.000987926,0.0012237827,0.0009929489,0.0014546702,0.0024751201,0.0016135757,0.010507186],"category_scores_gemma":[0.011616037,0.0005769303,0.0011003473,0.0015080472,0.0020815984,0.0036551198,0.0028232222,0.004526339,0.002634137],"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.00034428522,0.0003285568,0.00064632506,0.0005505803,0.00007055922,0.00039372037,0.0003961633,0.24668294,0.027399335,0.50894415,0.020029949,0.19421345],"study_design_scores_gemma":[0.00009771183,0.00016822468,0.00011077367,0.000046468544,0.000028254623,0.00019800362,0.000026065572,0.8596151,0.007782819,0.11744978,0.014435916,0.000040881834],"about_ca_topic_score_codex":0.0011180482,"about_ca_topic_score_gemma":0.001602105,"teacher_disagreement_score":0.010507186,"about_ca_system_score_codex":0.0011893677,"about_ca_system_score_gemma":0.0020930704,"threshold_uncertainty_score":0.03515005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20305124,0.0013949752,0.51688135,0.006493093,0.00071518734,0.00014402163,0.000285485,0.00086533837,0.27016932],"genre_scores_gemma":[0.87375253,0.00053523615,0.054701813,0.0004789033,0.00020254123,0.0001354712,0.0001353289,0.00034397186,0.06971419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773717,0.0013621271,0.00006576789,0.00021061345,0.00035049106,0.00027378422],"domain_scores_gemma":[0.98987216,0.0077360785,0.00045493676,0.0007704012,0.00070204516,0.0004645509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032770203,0.00078210206,0.0012014294,0.00085836224,0.0019927903,0.0047886996,0.0023596876,0.0023313432,0.042504337],"category_scores_gemma":[0.028506914,0.00081754633,0.0007596257,0.0012067518,0.0052179173,0.009671368,0.0035129169,0.0036435402,0.002543804],"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.00019163202,0.00008505784,0.00043001527,0.00008305857,0.000014428254,0.000082014296,0.0003159508,0.02558233,0.0010821888,0.9463451,0.005305452,0.02048282],"study_design_scores_gemma":[0.000066451794,0.00010194792,0.00035776728,0.000040595223,0.000016485554,0.000058253656,0.0002954936,0.10699731,0.0007050898,0.8881472,0.003180531,0.00003295855],"about_ca_topic_score_codex":0.0043028696,"about_ca_topic_score_gemma":0.0047745854,"teacher_disagreement_score":0.042504337,"about_ca_system_score_codex":0.0017091394,"about_ca_system_score_gemma":0.001702524,"threshold_uncertainty_score":0.14219117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011793224,0.00057742395,0.98469675,0.00017816613,0.000028308676,0.00016959988,0.00009236686,0.0007648567,0.0016993566],"genre_scores_gemma":[0.18423022,0.0004908977,0.8130314,0.00023320151,0.00005121106,0.00038556973,0.000441888,0.00026143395,0.0008741705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971411,0.001466381,0.00020673677,0.0003305251,0.0006261749,0.00022904197],"domain_scores_gemma":[0.9915023,0.006203283,0.0006743075,0.00087286846,0.00055055646,0.00019674268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044170236,0.0012779331,0.0015884701,0.002082513,0.0007643208,0.0014913745,0.002523106,0.0015527693,0.0023525343],"category_scores_gemma":[0.018763328,0.00060763967,0.0010102027,0.0042246995,0.0016219467,0.0022846523,0.0015497472,0.002073417,0.00041329977],"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.00024134321,0.00019122215,0.0019004481,0.00039849518,0.00010643664,0.000109571345,0.00022224506,0.64616597,0.003650113,0.054685637,0.0042397613,0.28808877],"study_design_scores_gemma":[0.0000730566,0.00006495733,0.0001777633,0.0000344029,0.000024009192,0.000056923243,0.000035613266,0.9634135,0.0015473099,0.032622233,0.0019343072,0.00001590946],"about_ca_topic_score_codex":0.0038066742,"about_ca_topic_score_gemma":0.005127515,"teacher_disagreement_score":0.0044170236,"about_ca_system_score_codex":0.001796906,"about_ca_system_score_gemma":0.0019519392,"threshold_uncertainty_score":0.023359716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009960973,0.0010356759,0.9767016,0.0003040442,0.000095831645,0.00007908717,0.00016327215,0.00093911483,0.0107203],"genre_scores_gemma":[0.35834315,0.0009555363,0.6201148,0.00030946266,0.0002729996,0.0006067375,0.0009733994,0.0007389585,0.017684914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880743,0.00049641356,0.00005563315,0.00018616805,0.00035302757,0.00010133053],"domain_scores_gemma":[0.9973556,0.0019243853,0.000113814036,0.00031042338,0.00021407624,0.000081765116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398286,0.00087375846,0.0015787496,0.0009581353,0.00064046774,0.0011263636,0.0027893719,0.0010547016,0.0080401255],"category_scores_gemma":[0.0061298274,0.0007620161,0.0013391881,0.0019183462,0.0011471971,0.0023616562,0.0022042517,0.0025344796,0.0011869039],"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.00027314117,0.00017783332,0.00047446898,0.00042874576,0.00010371175,0.00010267802,0.000135618,0.463155,0.002699321,0.32301152,0.015382396,0.19405547],"study_design_scores_gemma":[0.00003266505,0.000038238075,0.000112343485,0.000014527911,0.000022329397,0.000032580865,0.000010469233,0.86862934,0.00063433615,0.12785704,0.0026051395,0.000010905648],"about_ca_topic_score_codex":0.0020124756,"about_ca_topic_score_gemma":0.005751686,"teacher_disagreement_score":0.0080401255,"about_ca_system_score_codex":0.0015042502,"about_ca_system_score_gemma":0.0012212528,"threshold_uncertainty_score":0.026896894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011980348,0.00006873478,0.9864226,0.000070349146,0.0000087063545,0.000027437818,0.000060216153,0.0005084711,0.0008531525],"genre_scores_gemma":[0.35059747,0.00018774059,0.6430043,0.00013688618,0.00004205406,0.00021916052,0.00065813545,0.00052032276,0.004633966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983766,0.00041260023,0.00006503229,0.0005429613,0.0004828452,0.000119942124],"domain_scores_gemma":[0.9983903,0.0007200172,0.00020204631,0.00045059607,0.00018368843,0.000053306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978733,0.0011227176,0.0016075164,0.0011862111,0.0006755035,0.0014672372,0.0020375252,0.0019089119,0.005211545],"category_scores_gemma":[0.00607021,0.0008237353,0.0010325914,0.0023578575,0.0011035601,0.004664545,0.002420937,0.0010971235,0.0012054208],"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.0002184249,0.000092232716,0.00084790436,0.00019943579,0.000070093054,0.00020771928,0.00013966081,0.7004783,0.008303048,0.030520115,0.0033293203,0.25559372],"study_design_scores_gemma":[0.00001740478,0.000058166017,0.00022780824,0.000007934441,0.000010493999,0.0001005895,0.000048150046,0.9641788,0.0038151846,0.029972335,0.0015507789,0.000012447227],"about_ca_topic_score_codex":0.004276919,"about_ca_topic_score_gemma":0.0040720846,"teacher_disagreement_score":0.005211545,"about_ca_system_score_codex":0.0010094441,"about_ca_system_score_gemma":0.0013187199,"threshold_uncertainty_score":0.017434299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012201626,0.00017563965,0.9834273,0.00040984375,0.00002990412,0.00012856728,0.000099880905,0.0003587165,0.0031685242],"genre_scores_gemma":[0.1290236,0.00024665133,0.86720777,0.00030352751,0.00006643445,0.00035597206,0.00048117494,0.00038190556,0.0019329784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916123,0.0036945443,0.00047939914,0.0012776493,0.0022370003,0.00069905363],"domain_scores_gemma":[0.9726015,0.020890038,0.0013673307,0.0029094152,0.0018339838,0.00039773912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077335294,0.001915651,0.0019493622,0.002685941,0.0016333557,0.0034797469,0.003248033,0.0027741997,0.0050142817],"category_scores_gemma":[0.04982541,0.0010950847,0.0022497408,0.0039293054,0.0022630426,0.0063125393,0.004058387,0.0041705454,0.0009493682],"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.00023701084,0.00033448666,0.0027245528,0.00046633166,0.00014273022,0.00023975,0.0005518677,0.4388511,0.00497769,0.3053537,0.008696307,0.23742448],"study_design_scores_gemma":[0.00007157849,0.00008196378,0.00021728504,0.00008407162,0.0000424647,0.00012411087,0.00018018838,0.7468912,0.004406851,0.2437399,0.0041321064,0.000028289182],"about_ca_topic_score_codex":0.002416467,"about_ca_topic_score_gemma":0.0029232693,"teacher_disagreement_score":0.0077335294,"about_ca_system_score_codex":0.0016047003,"about_ca_system_score_gemma":0.00331261,"threshold_uncertainty_score":0.040899277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026419642,0.00019450011,0.99298906,0.00012494512,0.000048745143,0.00009285186,0.00010117456,0.0015030873,0.002303613],"genre_scores_gemma":[0.031566586,0.00017621309,0.963824,0.00015057162,0.00007721193,0.00023737743,0.00058840524,0.00047091683,0.0029087353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962842,0.0005325363,0.00038382853,0.0008294876,0.0014157897,0.0005541059],"domain_scores_gemma":[0.9897878,0.005456122,0.0007288575,0.0019343916,0.0017581973,0.00033460255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028749574,0.0020469986,0.0014608073,0.0025640153,0.0013667184,0.0029782832,0.0039965142,0.0018362053,0.014649056],"category_scores_gemma":[0.012936561,0.00092057016,0.0018422017,0.0042427434,0.0012238293,0.006179598,0.0020866434,0.0031667617,0.0035704852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005137066,0.0005294948,0.0011553307,0.00046688798,0.00011145914,0.000083775085,0.00024097481,0.10719793,0.0067589986,0.07778569,0.022332307,0.7828234],"study_design_scores_gemma":[0.00020375305,0.00012025718,0.00038790444,0.000046021385,0.000054111555,0.00014656899,0.00007331829,0.8852973,0.009722007,0.09056565,0.013319772,0.00006345194],"about_ca_topic_score_codex":0.010066044,"about_ca_topic_score_gemma":0.012033546,"teacher_disagreement_score":0.014649056,"about_ca_system_score_codex":0.0032025808,"about_ca_system_score_gemma":0.0034677924,"threshold_uncertainty_score":0.049005985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927953,0.0062073055,0.75636953,0.027568417,0.00043137523,0.00042956483,0.003970062,0.0008934714,0.04485082],"genre_scores_gemma":[0.74015284,0.0062348032,0.23367132,0.002515401,0.0017347148,0.0007715113,0.00481464,0.0004048393,0.009699922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99440295,0.0015453157,0.00039088787,0.0012374002,0.0019036916,0.0005198877],"domain_scores_gemma":[0.97332305,0.02157284,0.001620994,0.0015865514,0.0012929989,0.00060345145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032094195,0.00085209444,0.0012073881,0.0014427541,0.0013188545,0.0050419397,0.0024589733,0.0018020296,0.005855499],"category_scores_gemma":[0.019637527,0.0007766019,0.0022660152,0.002659545,0.0037271848,0.0129140895,0.003424518,0.0052069915,0.00057894725],"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.00022813075,0.00023111461,0.0024273153,0.0008431751,0.00014348084,0.0002880521,0.0005999266,0.08701775,0.0017594141,0.8310104,0.011909333,0.06354192],"study_design_scores_gemma":[0.000037899146,0.000021151098,0.0004188271,0.000035070436,0.000021137264,0.000110976136,0.00013044459,0.12015573,0.00074025086,0.8734975,0.0048093377,0.000021650492],"about_ca_topic_score_codex":0.003577966,"about_ca_topic_score_gemma":0.0024436251,"teacher_disagreement_score":0.005855499,"about_ca_system_score_codex":0.0040631024,"about_ca_system_score_gemma":0.0026539152,"threshold_uncertainty_score":0.02947998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05936237,0.013081718,0.71021754,0.0038836307,0.00046592456,0.0001315822,0.00093779195,0.00073423394,0.21118517],"genre_scores_gemma":[0.8328684,0.004317309,0.13485855,0.0014474392,0.00062171614,0.00031670637,0.00087836763,0.00024593947,0.024445614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.0005051097,0.000090296686,0.00042415515,0.00040960108,0.00018727152],"domain_scores_gemma":[0.99888986,0.00046816637,0.00007324276,0.0002509377,0.00021604823,0.000101798694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015855415,0.00040628138,0.0004675836,0.0021594062,0.0015870051,0.0042295586,0.0010534031,0.0011677353,0.007881463],"category_scores_gemma":[0.0019070822,0.0003925708,0.0010566078,0.0019257455,0.00645817,0.0094077,0.0033561478,0.0020648215,0.00090661884],"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.0000025187053,0.0000020327477,0.00009452372,0.000036727473,0.000002896141,0.000015535988,0.00013818896,0.00017244174,0.0002086619,0.9957624,0.00051073614,0.00305341],"study_design_scores_gemma":[0.0000026062535,0.000014379634,0.00024999236,0.000032721357,0.000008046406,0.00013783223,0.00021378414,0.0015745192,0.00033029725,0.9733002,0.024126401,0.000009128743],"about_ca_topic_score_codex":0.0012869714,"about_ca_topic_score_gemma":0.0008348933,"teacher_disagreement_score":0.007881463,"about_ca_system_score_codex":0.0018270193,"about_ca_system_score_gemma":0.0006219918,"threshold_uncertainty_score":0.026366115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005550105,0.00088706467,0.9791845,0.0019713074,0.000053797514,0.00021396756,0.00027410252,0.00037838903,0.01148679],"genre_scores_gemma":[0.14479811,0.0026453177,0.8445519,0.000995576,0.00020639322,0.0007491729,0.001161452,0.00031241192,0.0045796777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99189866,0.0040386715,0.00050168525,0.0012271893,0.0019605972,0.0003731267],"domain_scores_gemma":[0.983566,0.013050153,0.00082777085,0.0014123867,0.0009552864,0.00018846097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049050935,0.001600523,0.0013956458,0.002088796,0.0015886417,0.005257926,0.002909871,0.002553238,0.007127699],"category_scores_gemma":[0.025689099,0.0010330225,0.002606447,0.004645547,0.006865478,0.007908511,0.0038902394,0.0043502566,0.00090029347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058041664,0.00008931517,0.000427105,0.00064639066,0.00009743249,0.00018082123,0.0007847545,0.1123256,0.0011418307,0.79307014,0.005318916,0.08585956],"study_design_scores_gemma":[0.00004585988,0.000038989354,0.00012446051,0.0001122637,0.000037641443,0.0001072352,0.00020246257,0.15590835,0.0013442568,0.8238555,0.0181891,0.000033912063],"about_ca_topic_score_codex":0.010308276,"about_ca_topic_score_gemma":0.008002582,"teacher_disagreement_score":0.010308276,"about_ca_system_score_codex":0.003140511,"about_ca_system_score_gemma":0.003808239,"threshold_uncertainty_score":0.025940895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01407071,0.0005660508,0.9166148,0.00034121968,0.00013693905,0.0005153492,0.0021660046,0.053194594,0.0123942755],"genre_scores_gemma":[0.10512686,0.00024249226,0.88021773,0.00033816634,0.000037957823,0.0005733035,0.0054348204,0.0035629964,0.004465652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991308,0.00028342588,0.00005498639,0.00018825376,0.0002622256,0.00008020403],"domain_scores_gemma":[0.9975056,0.0016921986,0.000077109034,0.00038026404,0.00029491505,0.00004996027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010123213,0.0023935863,0.001274815,0.0019067335,0.00081722543,0.0017097539,0.0035615882,0.0015779246,0.021488436],"category_scores_gemma":[0.0068288464,0.0016155104,0.002467274,0.002086691,0.001058154,0.002998892,0.0026405386,0.0027679196,0.0054880404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062723644,0.00046439917,0.002822308,0.0021171612,0.00045540382,0.0004010794,0.00028074038,0.27348053,0.013081553,0.04432954,0.08653526,0.5754048],"study_design_scores_gemma":[0.00016051094,0.00006548559,0.00023180153,0.000060617258,0.00008463174,0.00005348016,0.00005850552,0.9630673,0.005175594,0.02291726,0.008108315,0.000016555297],"about_ca_topic_score_codex":0.005399802,"about_ca_topic_score_gemma":0.019983644,"teacher_disagreement_score":0.021488436,"about_ca_system_score_codex":0.0010629633,"about_ca_system_score_gemma":0.0023693193,"threshold_uncertainty_score":0.07188594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016418071,0.0024251256,0.9569166,0.0009016525,0.0004146658,0.00019558027,0.0003581375,0.0029482844,0.019421833],"genre_scores_gemma":[0.24687931,0.0014538001,0.73049307,0.0012513659,0.00064239226,0.00056005415,0.0011564543,0.00087326684,0.016690278],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691284,0.00087161944,0.00017629485,0.0007958635,0.0010011309,0.00024226305],"domain_scores_gemma":[0.99644804,0.0016049294,0.00036370405,0.0009628902,0.00047092236,0.00014953177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025029927,0.00093338,0.000988717,0.00092477666,0.00060970755,0.002120181,0.0031584592,0.001797054,0.0071959747],"category_scores_gemma":[0.008283839,0.00047236672,0.001086263,0.0015040747,0.0015932423,0.0037664066,0.0035938006,0.0024180699,0.002559703],"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.00068304886,0.00020711185,0.0030964082,0.0009061319,0.00023116547,0.00029794587,0.0001706751,0.10085229,0.010017883,0.35783643,0.014602989,0.511098],"study_design_scores_gemma":[0.00021813327,0.00063024275,0.0015038898,0.0001089434,0.0001330801,0.0013951884,0.00007614119,0.5319579,0.018019026,0.35026798,0.09556216,0.00012722024],"about_ca_topic_score_codex":0.0005560226,"about_ca_topic_score_gemma":0.0008817968,"teacher_disagreement_score":0.0071959747,"about_ca_system_score_codex":0.0007978814,"about_ca_system_score_gemma":0.0009152815,"threshold_uncertainty_score":0.024072945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012650287,0.0014296742,0.9878248,0.00037602757,0.00008355734,0.000096498676,0.00020103095,0.00056108687,0.008162406],"genre_scores_gemma":[0.029155212,0.0027582452,0.96148604,0.00023146818,0.00020827935,0.00027971884,0.0006656354,0.0002965785,0.0049189404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977902,0.0006295801,0.00016051345,0.00022307072,0.0010989626,0.00009770252],"domain_scores_gemma":[0.996813,0.0023381002,0.000082886516,0.00036630113,0.00034886945,0.000050719726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016068721,0.0014544734,0.0013108704,0.0013130902,0.00088307826,0.0021275461,0.0031494128,0.0011198359,0.010225063],"category_scores_gemma":[0.006840942,0.0010250806,0.00215124,0.006486167,0.0014708296,0.004262501,0.0018023066,0.005449624,0.0025118734],"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.00009510518,0.00014126858,0.00021739543,0.0011427128,0.000124796,0.00014210092,0.00030111524,0.10044081,0.0033590314,0.5161163,0.037697446,0.3402219],"study_design_scores_gemma":[0.00005840485,0.000031380452,0.0001247743,0.00014461213,0.00005137603,0.00020360776,0.000100891826,0.44888118,0.0027480144,0.5124422,0.035185296,0.000028259203],"about_ca_topic_score_codex":0.006133233,"about_ca_topic_score_gemma":0.0078428285,"teacher_disagreement_score":0.010225063,"about_ca_system_score_codex":0.0012942053,"about_ca_system_score_gemma":0.0017593128,"threshold_uncertainty_score":0.03420621},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029707715,0.0012524012,0.82149523,0.00059322314,0.0008577618,0.00058377156,0.0038568997,0.01004709,0.13160601],"genre_scores_gemma":[0.17332816,0.0008090107,0.7513228,0.00038021567,0.00022088118,0.00032594008,0.007291618,0.0029779687,0.06334333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967788,0.0006075572,0.00024585298,0.00062080676,0.0014238767,0.00032317778],"domain_scores_gemma":[0.9973586,0.00076492113,0.00006757867,0.001217424,0.0005095741,0.000081872575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023445585,0.0008978033,0.0010880734,0.001751667,0.0020017084,0.002745907,0.0034270852,0.0009001906,0.040765405],"category_scores_gemma":[0.0063270717,0.0009238044,0.0027282618,0.0022954731,0.0018155193,0.0033739468,0.0028040945,0.0018073035,0.0121784285],"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.0004741391,0.00009701916,0.0006657396,0.0005253783,0.00008795581,0.00051713956,0.0006238854,0.024785543,0.0096733,0.6892562,0.025925286,0.24736838],"study_design_scores_gemma":[0.00015823994,0.00013213174,0.0006899582,0.00020259127,0.00023022237,0.0006085548,0.00032445666,0.07639491,0.037882257,0.5050188,0.37817615,0.00018183091],"about_ca_topic_score_codex":0.015173037,"about_ca_topic_score_gemma":0.015683623,"teacher_disagreement_score":0.040765405,"about_ca_system_score_codex":0.0018067318,"about_ca_system_score_gemma":0.0024643478,"threshold_uncertainty_score":0.13637388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042408276,0.00019672408,0.98869586,0.0003156129,0.000028817665,0.00011289569,0.00013219792,0.00030415104,0.005972939],"genre_scores_gemma":[0.09129641,0.00061001105,0.9050588,0.00019814256,0.00007235313,0.0002823276,0.0003211352,0.00012416141,0.0020367638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981206,0.00086281984,0.00009535983,0.00022953343,0.000504479,0.00018717989],"domain_scores_gemma":[0.99815243,0.0013099246,0.00017323522,0.00017699497,0.00014244056,0.00004498771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025128864,0.0012885457,0.00095260865,0.00065320794,0.00051194674,0.0020601107,0.0012803705,0.0010349428,0.0047906656],"category_scores_gemma":[0.004668485,0.0007060859,0.0010374122,0.0017873895,0.0009025863,0.0019771173,0.0012520255,0.0023648997,0.0007387058],"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.00007308605,0.00013556065,0.00035403247,0.00030870838,0.00008749007,0.000104091414,0.00005523684,0.82318133,0.0021070936,0.081883825,0.004008888,0.08770066],"study_design_scores_gemma":[0.00002469283,0.000026525517,0.000046450175,0.000020788706,0.000014968833,0.000025271342,0.000027683447,0.96268874,0.0012503285,0.03195953,0.0039078696,0.0000071492273],"about_ca_topic_score_codex":0.0044212947,"about_ca_topic_score_gemma":0.0051298942,"teacher_disagreement_score":0.0047906656,"about_ca_system_score_codex":0.0008249242,"about_ca_system_score_gemma":0.002660804,"threshold_uncertainty_score":0.016026378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09750143,0.00062219164,0.88725626,0.0029485733,0.000049225906,0.00027535617,0.0014340128,0.0021352672,0.0077777333],"genre_scores_gemma":[0.55364716,0.00046432356,0.43888795,0.00043827316,0.000100275,0.00032962952,0.0023466023,0.0003146811,0.003471112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943922,0.0026989137,0.00029324918,0.00083119713,0.0013281467,0.00045624922],"domain_scores_gemma":[0.96568996,0.030478243,0.0008021757,0.0019372308,0.0007665701,0.0003258423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00457793,0.0009897876,0.0019826,0.001515108,0.0013056346,0.0038285588,0.0023801597,0.0014949505,0.011566841],"category_scores_gemma":[0.033637304,0.0012937832,0.002223901,0.0028595114,0.0016155535,0.008540607,0.003738273,0.00346477,0.00091020745],"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.00079285854,0.00028706342,0.0043419595,0.0006490629,0.0002928072,0.00037075437,0.0005318363,0.6500892,0.0016809356,0.13196559,0.008973976,0.20002401],"study_design_scores_gemma":[0.00004006288,0.000013365525,0.00029435664,0.000015667289,0.000026310714,0.000025680376,0.000055893954,0.865862,0.00031266862,0.13287652,0.00046529414,0.000012195497],"about_ca_topic_score_codex":0.018735478,"about_ca_topic_score_gemma":0.032148343,"teacher_disagreement_score":0.018735478,"about_ca_system_score_codex":0.0042711375,"about_ca_system_score_gemma":0.0030941984,"threshold_uncertainty_score":0.038694978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014846669,0.0003170878,0.9648193,0.00076831214,0.000116564894,0.0009704926,0.000756291,0.001737101,0.015668165],"genre_scores_gemma":[0.07070306,0.0002386042,0.92097926,0.00016891147,0.000032874803,0.0008628311,0.0011519915,0.00033511838,0.005527314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963799,0.0015229656,0.00036203113,0.0006923419,0.0007012533,0.0003414559],"domain_scores_gemma":[0.98492336,0.012202226,0.00047997956,0.00086556317,0.0013558829,0.00017299363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040481216,0.0019374072,0.0013701518,0.0015411701,0.0015901959,0.002448506,0.0025398713,0.0017683071,0.030692637],"category_scores_gemma":[0.018856987,0.0010224096,0.0027963545,0.002599464,0.0018236309,0.0026941411,0.0040280735,0.002550353,0.0030223872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034355905,0.00046450653,0.0024660032,0.0019191558,0.0002175129,0.00091324386,0.0025762643,0.28866452,0.0023638234,0.08525805,0.018280217,0.59653306],"study_design_scores_gemma":[0.00025461672,0.00029834584,0.0006048436,0.0004119462,0.0001158795,0.00042028795,0.0026356312,0.70294136,0.0040053953,0.23776995,0.05045985,0.0000819383],"about_ca_topic_score_codex":0.011700875,"about_ca_topic_score_gemma":0.016794598,"teacher_disagreement_score":0.030692637,"about_ca_system_score_codex":0.0013285087,"about_ca_system_score_gemma":0.003471413,"threshold_uncertainty_score":0.10267711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006864265,0.000816166,0.94661623,0.0009794622,0.00026551186,0.00013863426,0.0005017939,0.00055082433,0.0432671],"genre_scores_gemma":[0.31932005,0.0043840376,0.6230083,0.0007009818,0.0004292575,0.000701367,0.0020579034,0.00070207036,0.04869604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989247,0.00030480194,0.00006824948,0.00018084874,0.00039072902,0.0001307613],"domain_scores_gemma":[0.99881893,0.00045145597,0.00009434097,0.00024968668,0.0002487842,0.00013683503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297767,0.00081597996,0.0006211018,0.00077442214,0.0010574678,0.0031839544,0.00238683,0.0014503725,0.0070054666],"category_scores_gemma":[0.0031873505,0.00066915946,0.001110424,0.0025826565,0.0019296895,0.006312848,0.0028145516,0.0034975256,0.0013437184],"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.000040108862,0.000036791254,0.0001935422,0.00012745694,0.000016390886,0.0001570264,0.00008021593,0.08008572,0.0008279063,0.88476,0.005313085,0.028361697],"study_design_scores_gemma":[0.00001805535,0.000022649292,0.00008976346,0.00007240394,0.000030303274,0.00016144576,0.00006195513,0.34042588,0.0013960999,0.61962056,0.038075935,0.00002486765],"about_ca_topic_score_codex":0.010130183,"about_ca_topic_score_gemma":0.0108515695,"teacher_disagreement_score":0.010130183,"about_ca_system_score_codex":0.0018579572,"about_ca_system_score_gemma":0.0035629459,"threshold_uncertainty_score":0.023435593},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021192099,0.00014220591,0.9929952,0.00012626014,0.00003218689,0.00007953109,0.00020973383,0.0016014219,0.0026942908],"genre_scores_gemma":[0.1315019,0.00030532584,0.86406845,0.00014231872,0.00004550498,0.00028650477,0.00088962266,0.00020355405,0.0025568681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870336,0.00039969903,0.00014324028,0.00023662862,0.00041941684,0.00009765745],"domain_scores_gemma":[0.9985719,0.00085349986,0.00011095119,0.00017992538,0.00023389678,0.000049853763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610851,0.0009919249,0.0007217698,0.0019850072,0.0007264785,0.0028981352,0.0018402465,0.00083956594,0.010728349],"category_scores_gemma":[0.006172533,0.0005558968,0.0033913206,0.0012161864,0.0016492741,0.0026278195,0.0022931122,0.0015293793,0.0021951902],"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.00025289995,0.00027199546,0.0020673783,0.00091907836,0.00023098115,0.00079095433,0.0014606771,0.20798111,0.010386951,0.43050617,0.009031822,0.33610007],"study_design_scores_gemma":[0.00004356109,0.000044395903,0.0003219091,0.00014243629,0.000071275055,0.00014412642,0.00027405153,0.7451562,0.0049876687,0.2297345,0.019043518,0.00003636633],"about_ca_topic_score_codex":0.009718586,"about_ca_topic_score_gemma":0.0077387956,"teacher_disagreement_score":0.010728349,"about_ca_system_score_codex":0.0014555494,"about_ca_system_score_gemma":0.0013275892,"threshold_uncertainty_score":0.035889924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005004511,0.00008838412,0.98906845,0.00011322401,0.000019677916,0.00006602774,0.00006241021,0.0008635907,0.004713748],"genre_scores_gemma":[0.12795174,0.00024097909,0.8682326,0.00014460586,0.000046705416,0.00033037463,0.0005594918,0.00063634384,0.001857124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997801,0.0008698679,0.00012433888,0.0002480519,0.0007855076,0.00017126754],"domain_scores_gemma":[0.9967348,0.0023627023,0.00015321623,0.00045789094,0.00024367041,0.00004771606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136211,0.0015060576,0.0011861298,0.0014726887,0.0007146118,0.0020861856,0.0015335914,0.001029748,0.010123591],"category_scores_gemma":[0.010404872,0.00051398564,0.0012143007,0.0021163307,0.0018254685,0.003074763,0.0020050376,0.0027349046,0.0021195393],"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.0002190513,0.00020980187,0.0006846333,0.00034188989,0.00006457747,0.00015372262,0.00016462764,0.445519,0.0061364397,0.24380875,0.0070132795,0.29568413],"study_design_scores_gemma":[0.00006348087,0.00006569747,0.00010296625,0.000029716222,0.000021856855,0.000053973636,0.000041679126,0.8298963,0.004293427,0.16017604,0.005242219,0.000012678798],"about_ca_topic_score_codex":0.00212466,"about_ca_topic_score_gemma":0.003097415,"teacher_disagreement_score":0.010123591,"about_ca_system_score_codex":0.0011945912,"about_ca_system_score_gemma":0.0019207946,"threshold_uncertainty_score":0.033866763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031780603,0.00022292077,0.97481865,0.00066426175,0.00038534895,0.00030919455,0.002345433,0.00619365,0.011882563],"genre_scores_gemma":[0.056318384,0.00036757675,0.9302328,0.0004918491,0.00012292546,0.0005267811,0.004829142,0.0011984176,0.0059121912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998251,0.0003792192,0.0002185564,0.00025298787,0.00071709737,0.00018102242],"domain_scores_gemma":[0.9974825,0.0011721608,0.00016831719,0.00054035656,0.0005653944,0.000071213595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989329,0.0012013271,0.0006370039,0.0016593887,0.00069687894,0.002156643,0.0020452996,0.0012126773,0.015826797],"category_scores_gemma":[0.0072545586,0.0007276554,0.0018104394,0.0024019936,0.0010227511,0.0036880684,0.0020186557,0.0030268894,0.0039346223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024647947,0.00032409152,0.0007079037,0.00093488744,0.00007119938,0.0006011703,0.00052632956,0.051951684,0.009577032,0.46881238,0.0571624,0.40908444],"study_design_scores_gemma":[0.00020245928,0.00014217306,0.00036175246,0.0003463949,0.000106618965,0.0007465679,0.00024486013,0.48010448,0.024739478,0.314988,0.17790788,0.00010938348],"about_ca_topic_score_codex":0.003981939,"about_ca_topic_score_gemma":0.00972398,"teacher_disagreement_score":0.015826797,"about_ca_system_score_codex":0.001578767,"about_ca_system_score_gemma":0.0023471285,"threshold_uncertainty_score":0.052945912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015278924,0.00033303772,0.97995317,0.00016723668,0.00005197968,0.00012357158,0.000040650142,0.0016008144,0.0024505379],"genre_scores_gemma":[0.43093222,0.00040541522,0.5640485,0.00034079465,0.000059718503,0.0004516318,0.0001985972,0.00032434205,0.0032386284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992428,0.0002911204,0.00004435656,0.00009720857,0.00023863153,0.00008598021],"domain_scores_gemma":[0.99802434,0.0012944549,0.00018587419,0.0001366163,0.00024930947,0.00010950932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106056,0.0010868774,0.0013137689,0.00092134316,0.00038324247,0.00078377704,0.0021451,0.0011334249,0.0032421274],"category_scores_gemma":[0.0041544167,0.0005110891,0.00076403783,0.0008765904,0.0010756344,0.0010323677,0.0011966844,0.0017153958,0.0006464562],"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.00013931633,0.00019990657,0.0011753711,0.00013378002,0.00007294403,0.00009395793,0.00009698532,0.820329,0.0035561726,0.010657648,0.0025488767,0.1609961],"study_design_scores_gemma":[0.000026189482,0.000040387666,0.00005253157,0.000008388153,0.0000070684528,0.0000117024,0.0000043828627,0.9964341,0.00045120236,0.002471963,0.00048751844,0.0000045730553],"about_ca_topic_score_codex":0.006897571,"about_ca_topic_score_gemma":0.0068670483,"teacher_disagreement_score":0.006897571,"about_ca_system_score_codex":0.0009823664,"about_ca_system_score_gemma":0.0016782344,"threshold_uncertainty_score":0.01371485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009658892,0.00007133691,0.98668087,0.0002282126,0.00001270247,0.00004451315,0.00018636313,0.00033902033,0.0027781536],"genre_scores_gemma":[0.17567044,0.00021699152,0.8206184,0.00010976812,0.000028188826,0.00020777418,0.00057589257,0.00014074198,0.0024318302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989641,0.00031864605,0.000074102725,0.0003115524,0.00021572372,0.0001160257],"domain_scores_gemma":[0.99765563,0.0016539926,0.00019780442,0.00017109145,0.0002472534,0.000074218966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016867571,0.0005827659,0.0007431489,0.001192969,0.00077371695,0.0014264862,0.0016488787,0.0013244149,0.009605686],"category_scores_gemma":[0.008674863,0.00053857383,0.0013281185,0.0015881797,0.00094440585,0.0034614985,0.0012662653,0.0012992456,0.0008600094],"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.00018742333,0.00007657978,0.0018751083,0.00036254458,0.000095829324,0.00022492731,0.00030686532,0.6807577,0.0039069103,0.1978499,0.003448956,0.11090723],"study_design_scores_gemma":[0.000026423928,0.000022151413,0.00015571166,0.0000176461,0.000023234194,0.00010042988,0.00010649941,0.87029797,0.002520223,0.123290904,0.0034223492,0.000016464342],"about_ca_topic_score_codex":0.0032749386,"about_ca_topic_score_gemma":0.0042860117,"teacher_disagreement_score":0.009605686,"about_ca_system_score_codex":0.0010876381,"about_ca_system_score_gemma":0.0017325578,"threshold_uncertainty_score":0.032134175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033111668,0.001264768,0.9897351,0.00017206372,0.00009322596,0.00012743863,0.00010882164,0.00077711896,0.004410212],"genre_scores_gemma":[0.06328458,0.0014824624,0.9286503,0.00029581308,0.0001010886,0.00042557166,0.000460956,0.0003313376,0.004967839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935824,0.00018601792,0.00004358309,0.00013468009,0.0002249405,0.000052596617],"domain_scores_gemma":[0.9993911,0.00031580921,0.000056642435,0.00009999248,0.00009823581,0.00003820656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330218,0.0013883574,0.0011192034,0.00093547226,0.000680879,0.0008950705,0.0017315906,0.0010751069,0.0062533403],"category_scores_gemma":[0.002411707,0.0005334548,0.0013384937,0.0012976311,0.00048363602,0.0014505687,0.0013603902,0.0021660805,0.0014842687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017732245,0.0002466428,0.0005770647,0.000603857,0.00020727795,0.0001142331,0.00012955422,0.29062784,0.0053556706,0.062339935,0.017771222,0.62184936],"study_design_scores_gemma":[0.000080407954,0.00012452414,0.00023022671,0.000077373166,0.000035731107,0.00017815686,0.000028999804,0.9365254,0.002328748,0.035222303,0.025145113,0.000023004442],"about_ca_topic_score_codex":0.0014161053,"about_ca_topic_score_gemma":0.0021256772,"teacher_disagreement_score":0.0062533403,"about_ca_system_score_codex":0.0006051011,"about_ca_system_score_gemma":0.0008819763,"threshold_uncertainty_score":0.020919502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042926013,0.00025707434,0.9470994,0.0009474836,0.00003324079,0.00009208587,0.00009742035,0.00013740553,0.00840978],"genre_scores_gemma":[0.6068449,0.0007703101,0.3852534,0.00028613015,0.0000586042,0.00027214526,0.0001885646,0.00010625986,0.0062196665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643975,0.0017914518,0.0001276699,0.00045900652,0.0007730415,0.00040903647],"domain_scores_gemma":[0.99383014,0.0040709563,0.0006582307,0.0004452945,0.0005314523,0.00046390202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035234552,0.0009360406,0.00097355444,0.00077098864,0.0013924403,0.0037563397,0.0020965491,0.0015727752,0.00271919],"category_scores_gemma":[0.009619368,0.0007194891,0.0008998758,0.0018930734,0.001978404,0.0052894712,0.0041161934,0.0022878707,0.0003462115],"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.00016741476,0.00015297023,0.0016374206,0.00029196704,0.00011392028,0.00067741453,0.0009078295,0.647276,0.0052497843,0.28220573,0.0017409335,0.05957865],"study_design_scores_gemma":[0.000040766176,0.000099136516,0.0004709995,0.000055825323,0.000045359964,0.0002843755,0.0011613861,0.70292836,0.0024680279,0.2830175,0.00936305,0.00006523014],"about_ca_topic_score_codex":0.0035932732,"about_ca_topic_score_gemma":0.00543029,"teacher_disagreement_score":0.0037563397,"about_ca_system_score_codex":0.0014626539,"about_ca_system_score_gemma":0.0021374922,"threshold_uncertainty_score":0.018634021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020431304,0.0006227407,0.9597046,0.00044918945,0.0002657251,0.000350611,0.0019110107,0.0027710933,0.013493664],"genre_scores_gemma":[0.11905991,0.00037685843,0.86632496,0.00016973757,0.00014887602,0.00017336918,0.003094338,0.00078126584,0.009870777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.000117390606,0.00007530559,0.00027723584,0.00029211264,0.00017645053],"domain_scores_gemma":[0.9973592,0.0013907679,0.00012635422,0.0006705873,0.00033479693,0.00011825918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008515035,0.0012971392,0.0016354596,0.0016004895,0.0010193329,0.0017248745,0.003910856,0.0012718721,0.026966546],"category_scores_gemma":[0.0056284717,0.0006863084,0.0017949211,0.003600685,0.0007423773,0.0041597444,0.0020591444,0.0021190483,0.0029646084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068536506,0.00037685302,0.0010973848,0.0011434669,0.00012874593,0.00041878925,0.00025607485,0.15403473,0.009342786,0.099460326,0.04979469,0.6832608],"study_design_scores_gemma":[0.00021329772,0.00024502585,0.00059060624,0.00010226302,0.00013696446,0.00055866764,0.00017624194,0.7763486,0.00864878,0.19292438,0.019976234,0.00007896217],"about_ca_topic_score_codex":0.0059376294,"about_ca_topic_score_gemma":0.009869599,"teacher_disagreement_score":0.026966546,"about_ca_system_score_codex":0.0010186926,"about_ca_system_score_gemma":0.0024300828,"threshold_uncertainty_score":0.09021205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031624972,0.0012382941,0.9782728,0.0013982925,0.00007860266,0.000053280815,0.00021361897,0.00030641118,0.015276184],"genre_scores_gemma":[0.19199228,0.004039382,0.790016,0.00088992604,0.00034149503,0.00045604486,0.00115309,0.0005423621,0.010569414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655044,0.0014950841,0.00020866719,0.00070626277,0.0007355564,0.00030404355],"domain_scores_gemma":[0.9978739,0.0008558648,0.00015856171,0.00076283,0.00023910891,0.00010974654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028769579,0.0011515438,0.00090542407,0.0012042085,0.0008718997,0.0044869767,0.0020375533,0.0014571644,0.006195673],"category_scores_gemma":[0.005759105,0.0008545426,0.0016023421,0.0025277475,0.004183811,0.007993332,0.0039478755,0.004573026,0.0010746993],"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.000012577401,0.0000098823075,0.00011562213,0.00009853619,0.00001711592,0.00004101172,0.0001675473,0.022829158,0.0003879849,0.9550521,0.0022719859,0.018996432],"study_design_scores_gemma":[0.000007398307,0.000009324648,0.00006185619,0.00006996195,0.000018645676,0.0000452733,0.00008073587,0.05199279,0.0006481299,0.9245219,0.022532552,0.000011388899],"about_ca_topic_score_codex":0.004140526,"about_ca_topic_score_gemma":0.004245706,"teacher_disagreement_score":0.006195673,"about_ca_system_score_codex":0.0018446284,"about_ca_system_score_gemma":0.0020153287,"threshold_uncertainty_score":0.020726562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058481325,0.00059805857,0.9874219,0.0007752546,0.00008357201,0.00020391615,0.00014753596,0.00092212524,0.003999611],"genre_scores_gemma":[0.11246336,0.00068687054,0.8770957,0.00034742343,0.000100200705,0.00061027065,0.0006476725,0.00025871675,0.007789816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994493,0.0020973145,0.00051401305,0.0012266401,0.0012266366,0.0004423453],"domain_scores_gemma":[0.98772895,0.008081629,0.0006585722,0.0010740967,0.0020220727,0.00043475858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008492673,0.0018899246,0.0021210255,0.0027830917,0.0023870673,0.006690943,0.0040945727,0.0034061135,0.013615609],"category_scores_gemma":[0.020035993,0.0013476728,0.0025050868,0.002995323,0.0022253236,0.0059064194,0.0038510496,0.004206542,0.0035460263],"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.0003571586,0.00031568107,0.0029482786,0.0006892998,0.00028926894,0.0002148629,0.0011878146,0.4325382,0.001776503,0.17062141,0.012473929,0.37658757],"study_design_scores_gemma":[0.000055928915,0.000063075,0.00023476187,0.000117437325,0.000043897347,0.00005923021,0.00021918806,0.9232754,0.00073350326,0.068120755,0.0070561212,0.000020735046],"about_ca_topic_score_codex":0.019843703,"about_ca_topic_score_gemma":0.02479458,"teacher_disagreement_score":0.019843703,"about_ca_system_score_codex":0.004312009,"about_ca_system_score_gemma":0.0081238905,"threshold_uncertainty_score":0.045548737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8347362,0.0102781225,0.12722325,0.003960146,0.00027656383,0.00017934572,0.0055419668,0.0030488945,0.014755573],"genre_scores_gemma":[0.95631385,0.0016872633,0.031108782,0.0004833915,0.00019706936,0.0002850509,0.007879261,0.000742244,0.0013029907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509335,0.0017142291,0.00026308204,0.0013283456,0.0009951808,0.00060579856],"domain_scores_gemma":[0.9176026,0.067239165,0.0032663345,0.007892534,0.00291402,0.0010853399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051260698,0.00091243855,0.00092737476,0.0016720464,0.00086504087,0.0018665858,0.0017578128,0.0013802561,0.0031139646],"category_scores_gemma":[0.06872711,0.0006321257,0.0008590729,0.002784123,0.0021522667,0.0043696226,0.0015937376,0.003454671,0.0008396363],"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.0024237507,0.0008651401,0.064884104,0.0014380859,0.00043207302,0.00052133115,0.0008792125,0.6988919,0.014150541,0.07243251,0.033428375,0.10965289],"study_design_scores_gemma":[0.00011971708,0.0003465635,0.017877184,0.00013882286,0.000078995145,0.0004950469,0.00027777164,0.9227089,0.007785523,0.044953223,0.0051504676,0.000067790876],"about_ca_topic_score_codex":0.003854351,"about_ca_topic_score_gemma":0.0028373783,"teacher_disagreement_score":0.0051260698,"about_ca_system_score_codex":0.0020276515,"about_ca_system_score_gemma":0.0017740314,"threshold_uncertainty_score":0.027109623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01760201,0.080459416,0.7005551,0.0831905,0.015726587,0.0012664868,0.0048700483,0.00565918,0.09067061],"genre_scores_gemma":[0.14242025,0.024366591,0.72822684,0.030211763,0.0137083335,0.0015421706,0.019621596,0.00578538,0.03411703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9495954,0.022539672,0.0033706438,0.0055959583,0.017194645,0.0017037112],"domain_scores_gemma":[0.8239064,0.13533758,0.0020349922,0.014380593,0.021021694,0.0033188683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033593066,0.002475172,0.003842356,0.0030906587,0.002333639,0.008981103,0.0057220533,0.008586942,0.015882919],"category_scores_gemma":[0.1175521,0.000755181,0.0028772657,0.0054157544,0.0036480296,0.008339768,0.0054989955,0.008593794,0.0069689085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000479004,0.00026102588,0.0011346268,0.0021745125,0.00025485025,0.00014746681,0.00015948659,0.037879117,0.0016265515,0.06559765,0.42615137,0.46413434],"study_design_scores_gemma":[0.00055077556,0.00049596536,0.0019909104,0.0011784575,0.00016489043,0.0006848181,0.00043253752,0.26295057,0.007035295,0.24673134,0.47757182,0.00021256777],"about_ca_topic_score_codex":0.0064868126,"about_ca_topic_score_gemma":0.007579468,"teacher_disagreement_score":0.033593066,"about_ca_system_score_codex":0.0042704116,"about_ca_system_score_gemma":0.008317454,"threshold_uncertainty_score":0.17765927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003355032,0.0002568846,0.9926859,0.00008921744,0.000045668352,0.00009480316,0.00008344103,0.0007171641,0.0026719382],"genre_scores_gemma":[0.039253447,0.00020747345,0.9575365,0.000118562886,0.000038908118,0.0003534325,0.0002792923,0.00028117746,0.0019310693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913496,0.00037929986,0.000034174478,0.00009922504,0.00027651104,0.0000757701],"domain_scores_gemma":[0.9991259,0.00046981935,0.00005963401,0.000103211125,0.00021814047,0.00002333427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397639,0.0010946613,0.0012439117,0.0016215435,0.0008016682,0.0010866397,0.0019467218,0.0013731368,0.0062810713],"category_scores_gemma":[0.004262412,0.0005682097,0.00089899154,0.0030742283,0.0006797642,0.0013559769,0.00093413226,0.0016091955,0.0015817244],"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.00011269066,0.00012039054,0.0004018119,0.00021080088,0.0000909097,0.00009261137,0.00013953832,0.6121513,0.0039308667,0.052385144,0.008269036,0.32209486],"study_design_scores_gemma":[0.000040746087,0.000031357013,0.00006449363,0.0000137367515,0.000012760395,0.000035738813,0.000013853154,0.9863392,0.0007146993,0.008646794,0.0040770774,0.000009592496],"about_ca_topic_score_codex":0.006321136,"about_ca_topic_score_gemma":0.0067876913,"teacher_disagreement_score":0.006321136,"about_ca_system_score_codex":0.0007808179,"about_ca_system_score_gemma":0.0017614965,"threshold_uncertainty_score":0.021012306},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061487323,0.027215637,0.111594975,0.06701175,0.24766114,0.0014240426,0.016698359,0.012328579,0.50991684],"genre_scores_gemma":[0.016429292,0.0097588645,0.023272587,0.005554566,0.061560236,0.00031393312,0.018712636,0.0029247361,0.8614732],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803835,0.0002869706,0.00011877478,0.0005005892,0.00086236495,0.00019303629],"domain_scores_gemma":[0.99225956,0.0017109523,0.0002534519,0.0009630079,0.003703399,0.0011095797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036567736,0.0016035609,0.0018712593,0.0032068472,0.0022485808,0.007215289,0.0024418323,0.0031910494,0.26881483],"category_scores_gemma":[0.0068163257,0.0006655992,0.0014520772,0.003184923,0.0007094341,0.005979681,0.0023153408,0.002801377,0.12732635],"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.00011474725,0.00004069386,0.000086369706,0.000095981486,0.000014580532,0.000026136731,0.000008768762,0.0003201257,0.00040232157,0.001864579,0.9359854,0.061040264],"study_design_scores_gemma":[0.000027483838,0.00007706284,0.0006070055,0.00013218148,0.00002812181,0.00007814647,0.000027106347,0.0030086043,0.0016949654,0.0053654867,0.9889255,0.000028331238],"about_ca_topic_score_codex":0.008526076,"about_ca_topic_score_gemma":0.016523108,"teacher_disagreement_score":0.26881483,"about_ca_system_score_codex":0.004090091,"about_ca_system_score_gemma":0.0029946163,"threshold_uncertainty_score":0.8992752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057284883,0.00014842217,0.9902412,0.00044724697,0.000048802183,0.00006246974,0.000115628456,0.00047023303,0.002737343],"genre_scores_gemma":[0.17281896,0.00049446797,0.81947064,0.0003291816,0.00008907644,0.00042399977,0.00039190368,0.0004336448,0.005548081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944511,0.002518497,0.000600718,0.00088844995,0.0011469055,0.0003943097],"domain_scores_gemma":[0.99133474,0.0037857555,0.0007646036,0.0031665352,0.00069171435,0.00025672832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071471087,0.0011624033,0.0008366167,0.0015574672,0.0014808944,0.005059264,0.0048056985,0.0022761782,0.0028474783],"category_scores_gemma":[0.01105215,0.00129911,0.0027330988,0.002474881,0.0050789453,0.010661832,0.0046399143,0.0035933706,0.0007172792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005410189,0.000035829522,0.0007834829,0.00009996735,0.000030780706,0.00021071256,0.0007814163,0.059551843,0.0010480846,0.92049307,0.0009346645,0.015976049],"study_design_scores_gemma":[0.00003900733,0.000056187593,0.00015573988,0.00009887682,0.00006823415,0.00019474357,0.00026484643,0.31648642,0.0048728907,0.6334403,0.04427437,0.000048397855],"about_ca_topic_score_codex":0.0062527386,"about_ca_topic_score_gemma":0.0071375463,"teacher_disagreement_score":0.0071471087,"about_ca_system_score_codex":0.0017383702,"about_ca_system_score_gemma":0.0030099426,"threshold_uncertainty_score":0.037797928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046572316,0.0005309105,0.9960556,0.00024341543,0.000088244946,0.000037797057,0.000055616336,0.00012607397,0.0023966439],"genre_scores_gemma":[0.038487438,0.0011595475,0.9557651,0.00022276626,0.0001455015,0.00028049145,0.00016465309,0.00018118197,0.0035933338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981705,0.0008759134,0.000113218564,0.00019163142,0.0005158401,0.00013291261],"domain_scores_gemma":[0.99728656,0.002040582,0.00018905237,0.00012635853,0.00028767996,0.000069759255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026377924,0.0016863237,0.001130277,0.0011807487,0.00074939325,0.0018549821,0.0021026284,0.0010590734,0.007942156],"category_scores_gemma":[0.0055323387,0.0011253736,0.0015368888,0.003215934,0.0007786861,0.002152145,0.0015469578,0.0037366322,0.0012530938],"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.00011036943,0.00010250113,0.0002377119,0.00053767534,0.00015941044,0.00015213866,0.00012555766,0.648377,0.0017469835,0.13104208,0.012359997,0.20504867],"study_design_scores_gemma":[0.000017968276,0.000023003331,0.000050243463,0.00004756184,0.00001665802,0.000026390733,0.000021774691,0.9403238,0.0005412022,0.05096663,0.007952525,0.000012212608],"about_ca_topic_score_codex":0.008828691,"about_ca_topic_score_gemma":0.015099779,"teacher_disagreement_score":0.008828691,"about_ca_system_score_codex":0.0011518702,"about_ca_system_score_gemma":0.0018871686,"threshold_uncertainty_score":0.026569188},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09651396,0.0009236098,0.81676406,0.0008338718,0.0002089516,0.0000875058,0.0004576497,0.00047606282,0.08373437],"genre_scores_gemma":[0.87978774,0.0008026061,0.08133963,0.00030639445,0.0002268118,0.00016486991,0.0006229502,0.00018805619,0.036560934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990933,0.00021505791,0.00005082315,0.00023519441,0.00026709033,0.00013848682],"domain_scores_gemma":[0.9994312,0.00013132198,0.00009121209,0.00010883311,0.00014538488,0.00009195624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071741175,0.0005089986,0.00035755034,0.0009434547,0.0010537073,0.0023026646,0.0009997012,0.0007539424,0.0131785525],"category_scores_gemma":[0.001447067,0.0002165482,0.00078972446,0.0009424431,0.001916054,0.005240872,0.0015185399,0.0011482008,0.0011478027],"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.0000036920171,0.000002415564,0.000037153874,0.000006810751,0.000002236901,0.000018577815,0.000044513567,0.000758451,0.00036829704,0.99695754,0.00018405038,0.0016163181],"study_design_scores_gemma":[0.000009533089,0.000030320316,0.00013798465,0.000010878598,0.000009067875,0.00010366724,0.00017779718,0.023678733,0.0014549796,0.96092755,0.013447535,0.000011907602],"about_ca_topic_score_codex":0.0012932455,"about_ca_topic_score_gemma":0.00083863124,"teacher_disagreement_score":0.0131785525,"about_ca_system_score_codex":0.0010647527,"about_ca_system_score_gemma":0.00058982125,"threshold_uncertainty_score":0.044086695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142675005,0.00017576331,0.9827635,0.00010878281,0.000017089791,0.000057362136,0.000030906624,0.0011612689,0.0014177053],"genre_scores_gemma":[0.20941319,0.00017926909,0.7871801,0.0001914091,0.000050833758,0.00021485945,0.00031414072,0.00044328117,0.002012795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985297,0.00051023375,0.00007448468,0.00028586845,0.0004357955,0.00016390576],"domain_scores_gemma":[0.9912443,0.007040345,0.00037190857,0.0007424114,0.00047750497,0.00012361883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027171515,0.00094768626,0.0015390634,0.0016286589,0.0009206995,0.0013364257,0.0016887118,0.0012852155,0.0057418966],"category_scores_gemma":[0.010231745,0.0006106284,0.00100321,0.0015123528,0.0009895684,0.0026242489,0.0011648501,0.0019077566,0.0012496321],"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.0004299423,0.0003672357,0.0024267198,0.00043399926,0.0001892996,0.0002169414,0.00030356698,0.5236052,0.012126248,0.042901516,0.0054609184,0.41153848],"study_design_scores_gemma":[0.000053224103,0.00008902062,0.00020310786,0.000019720059,0.000026571337,0.000065846274,0.000030857995,0.9814082,0.0032725942,0.013373969,0.0014439727,0.000012886512],"about_ca_topic_score_codex":0.004802899,"about_ca_topic_score_gemma":0.006503829,"teacher_disagreement_score":0.0057418966,"about_ca_system_score_codex":0.0009056238,"about_ca_system_score_gemma":0.0012981842,"threshold_uncertainty_score":0.01920855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24931858,0.0024690113,0.67627734,0.0037156818,0.00018309407,0.00012162951,0.0015594433,0.0005274877,0.06582784],"genre_scores_gemma":[0.88666993,0.0014193266,0.10014135,0.00047742488,0.00025471134,0.00015004213,0.0008658947,0.00016926981,0.009851971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878377,0.0005132374,0.000070785594,0.0003232755,0.00019041561,0.00011848277],"domain_scores_gemma":[0.9930566,0.004499711,0.0006633019,0.00067887525,0.0005693481,0.0005322867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013173623,0.00063166925,0.0007955832,0.002325074,0.0024521868,0.0038095268,0.0015631826,0.0012465044,0.0073837116],"category_scores_gemma":[0.007239546,0.0006737162,0.00091298204,0.0028760538,0.004521228,0.0113476105,0.0021337545,0.0021397076,0.00044384273],"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.000017497403,0.000009724719,0.000315146,0.000034839515,0.000008004084,0.000028583796,0.00015036603,0.001426919,0.0002178901,0.9925575,0.0006735873,0.004559874],"study_design_scores_gemma":[0.000005076911,0.000003652384,0.00011276156,0.000015065763,0.000010323311,0.00003695594,0.00008520469,0.0034366075,0.0002053802,0.994296,0.0017872244,0.0000057436732],"about_ca_topic_score_codex":0.0032331035,"about_ca_topic_score_gemma":0.0044147973,"teacher_disagreement_score":0.0073837116,"about_ca_system_score_codex":0.0011394781,"about_ca_system_score_gemma":0.00091129605,"threshold_uncertainty_score":0.02470094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6294574,0.001999548,0.3311412,0.004398322,0.00013633359,0.000121447294,0.0003549821,0.00053670135,0.031853933],"genre_scores_gemma":[0.9790285,0.00045855273,0.014026106,0.00033380534,0.00013279112,0.00009932553,0.00022344325,0.00013042083,0.0055670897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947304,0.00021140807,0.000014358046,0.00010328343,0.00009939114,0.00009854283],"domain_scores_gemma":[0.9958509,0.002823822,0.00062944443,0.0002400672,0.00017311539,0.00028262965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589272,0.0004997313,0.00079247076,0.00091403007,0.00096888706,0.0011919178,0.0011528252,0.0011348801,0.00460281],"category_scores_gemma":[0.008719587,0.0004954516,0.000780514,0.0006191116,0.0021940062,0.0024701133,0.0015235926,0.0018572862,0.0002591207],"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.00013178703,0.00004782045,0.0017058568,0.0001220969,0.000052757387,0.00021293489,0.0003311709,0.17620619,0.0027342387,0.810296,0.0033664922,0.0047926717],"study_design_scores_gemma":[0.0000351431,0.000028353474,0.0007961296,0.000021166945,0.000011383818,0.00007112458,0.00005969304,0.77763736,0.00068683375,0.21965322,0.0009788672,0.000020845957],"about_ca_topic_score_codex":0.0038180654,"about_ca_topic_score_gemma":0.0021789633,"teacher_disagreement_score":0.00460281,"about_ca_system_score_codex":0.0014205587,"about_ca_system_score_gemma":0.00064520235,"threshold_uncertainty_score":0.015397966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036053131,0.0018374712,0.97669256,0.00074531924,0.00007432658,0.000047480127,0.000113198614,0.00036692756,0.016517516],"genre_scores_gemma":[0.11608476,0.004626847,0.87165815,0.00021129873,0.000118970405,0.00021305587,0.0006755245,0.00013142364,0.00628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987602,0.000478672,0.00010590882,0.00016709327,0.0004155769,0.000072519906],"domain_scores_gemma":[0.9992526,0.0004388626,0.000079087484,0.00011572765,0.00008635011,0.000027288304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014799188,0.0007829932,0.0005226082,0.0015894951,0.0009993669,0.0037634287,0.001671358,0.0012027754,0.0056321104],"category_scores_gemma":[0.003248933,0.00057864736,0.0014127499,0.0022211326,0.0064519923,0.004043182,0.0018954282,0.0015699675,0.0014295445],"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.000019041936,0.00000639894,0.000096941534,0.00023831664,0.000016176438,0.00006998276,0.0003098427,0.020584678,0.0009896101,0.93684995,0.0013389966,0.039480086],"study_design_scores_gemma":[0.00001849575,0.000025707766,0.00016187289,0.000113135866,0.000024782166,0.00018629803,0.00022333773,0.04269976,0.0011984366,0.8873534,0.067968406,0.000026370468],"about_ca_topic_score_codex":0.004123984,"about_ca_topic_score_gemma":0.0052216784,"teacher_disagreement_score":0.0056321104,"about_ca_system_score_codex":0.0012121738,"about_ca_system_score_gemma":0.001526872,"threshold_uncertainty_score":0.018841267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33244398,0.0019271125,0.6219527,0.006993615,0.00017418723,0.0003837621,0.0005912585,0.00045138458,0.035081986],"genre_scores_gemma":[0.90049285,0.00087659876,0.09367292,0.00056144735,0.00029380576,0.000519903,0.0004443335,0.0001553424,0.0029827985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99427277,0.0021521826,0.0002875413,0.0011253909,0.0015264112,0.00063574873],"domain_scores_gemma":[0.9332548,0.056536306,0.0033620275,0.004184468,0.0013639743,0.0012984498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005466422,0.00074190105,0.0011604455,0.0015186107,0.0014740012,0.003986028,0.0021404936,0.002083754,0.006041669],"category_scores_gemma":[0.049158677,0.0008504462,0.0018155911,0.0011476534,0.005934441,0.008678907,0.003236903,0.0048484113,0.00036511198],"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.00015878558,0.00023515246,0.0030943977,0.00034451665,0.00010250482,0.00021520804,0.00049396773,0.099798776,0.0013636206,0.8716464,0.0032184578,0.019328294],"study_design_scores_gemma":[0.000046122874,0.000048701295,0.00072155055,0.00003960452,0.000017419901,0.00014986156,0.00013639792,0.14554228,0.0006838048,0.8509055,0.0016863068,0.00002253127],"about_ca_topic_score_codex":0.0006623533,"about_ca_topic_score_gemma":0.00066444004,"teacher_disagreement_score":0.006041669,"about_ca_system_score_codex":0.0019296547,"about_ca_system_score_gemma":0.001091294,"threshold_uncertainty_score":0.028909504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01814875,0.0005164022,0.963851,0.00045841542,0.00012217586,0.00013940578,0.0009655008,0.003933162,0.011865199],"genre_scores_gemma":[0.27662227,0.00062770187,0.7124869,0.00029554832,0.00013439274,0.00082587387,0.0039275573,0.002257437,0.002822306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925505,0.0016164848,0.00074962614,0.0012552852,0.0032344605,0.0005936538],"domain_scores_gemma":[0.97572756,0.015254534,0.0011133931,0.0054674814,0.0021508709,0.00028612136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035242322,0.0017917098,0.001319937,0.003293986,0.0010729014,0.005790886,0.0029853838,0.0017076608,0.009209113],"category_scores_gemma":[0.042100977,0.0014101698,0.0018203954,0.0031423788,0.0017981438,0.006823923,0.0036065762,0.0044780076,0.0033303734],"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.00029124762,0.00018173792,0.0023886515,0.0005415872,0.00008358764,0.00009666845,0.0002502259,0.52005696,0.008690426,0.29085225,0.010011924,0.16655478],"study_design_scores_gemma":[0.000030134386,0.000046122474,0.00022093335,0.00006197999,0.000018843899,0.00003940368,0.000026741694,0.8334787,0.0050510787,0.15502264,0.005983022,0.000020373325],"about_ca_topic_score_codex":0.0019226585,"about_ca_topic_score_gemma":0.0026781603,"teacher_disagreement_score":0.009209113,"about_ca_system_score_codex":0.0037909157,"about_ca_system_score_gemma":0.0031890476,"threshold_uncertainty_score":0.030807614},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030202301,0.0055998606,0.18094845,0.65196985,0.014754674,0.000072625044,0.001620895,0.0012098692,0.113621525],"genre_scores_gemma":[0.7304127,0.007721775,0.078660265,0.10981243,0.01457588,0.00034544047,0.0023120414,0.0018970781,0.054262433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99274534,0.002802123,0.0004360799,0.0018279424,0.001186957,0.0010014204],"domain_scores_gemma":[0.9755637,0.015123902,0.0015122704,0.0037752842,0.0032120026,0.00081278087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009933112,0.0006886044,0.0012135439,0.00088167837,0.0038187853,0.0044194316,0.0023699359,0.004889499,0.025882702],"category_scores_gemma":[0.06840419,0.00055998174,0.001679394,0.0010887515,0.007873231,0.016059455,0.0031112495,0.0104452735,0.005823092],"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.00016774941,0.00007764599,0.0021504099,0.0002997485,0.00009594723,0.0008277494,0.0009426169,0.001654753,0.00040972658,0.8403514,0.11655095,0.036471296],"study_design_scores_gemma":[0.000039630173,0.000023785939,0.00073341804,0.00018240347,0.000034232613,0.00038706954,0.0013897059,0.0036645697,0.00052875385,0.92342794,0.069522515,0.00006601228],"about_ca_topic_score_codex":0.0075636706,"about_ca_topic_score_gemma":0.0029308635,"teacher_disagreement_score":0.025882702,"about_ca_system_score_codex":0.0026168446,"about_ca_system_score_gemma":0.0016633945,"threshold_uncertainty_score":0.08658624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07694402,0.0003396153,0.9188699,0.00017473323,0.00004864449,0.000057118108,0.00006147434,0.00055946526,0.0029449714],"genre_scores_gemma":[0.6026296,0.00036135482,0.39118776,0.00005207575,0.000029798173,0.00014991488,0.00014969874,0.0001426683,0.0052971193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995307,0.00011712427,0.00003859263,0.0001182333,0.00015088415,0.000044567132],"domain_scores_gemma":[0.99827015,0.0010859369,0.00018473403,0.00020062062,0.00018016632,0.00007840145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011008196,0.0006838806,0.0005925176,0.00048376192,0.00061705656,0.0013669267,0.0010996216,0.00081131025,0.0031011987],"category_scores_gemma":[0.0034430595,0.00053202285,0.00067178276,0.0005278383,0.00072262564,0.0014923213,0.0011210558,0.00086782343,0.00032001533],"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.00036167484,0.00007873017,0.001835684,0.00026520825,0.00008340207,0.0002665432,0.00047418143,0.8212378,0.031705625,0.028490027,0.00084444357,0.11435666],"study_design_scores_gemma":[0.000019305784,0.000040121566,0.00024327825,0.000008967071,0.000014410247,0.00004814395,0.00004401502,0.98835784,0.004785237,0.0046310807,0.0017982499,0.000009436727],"about_ca_topic_score_codex":0.0045601423,"about_ca_topic_score_gemma":0.00569787,"teacher_disagreement_score":0.0045601423,"about_ca_system_score_codex":0.00071352225,"about_ca_system_score_gemma":0.00081129593,"threshold_uncertainty_score":0.010374546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010038407,0.000044791832,0.99682766,0.00003758106,0.000016068767,0.00004527671,0.000049376664,0.00018286773,0.0017925074],"genre_scores_gemma":[0.05454673,0.00009953628,0.94152296,0.00006352643,0.000020099087,0.00023473028,0.00014518868,0.00019212853,0.0031750419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784696,0.00076856575,0.00008716581,0.00034655884,0.0008421477,0.00010848964],"domain_scores_gemma":[0.99842864,0.0007619596,0.00014440525,0.00032827182,0.0002460254,0.000090671565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013014618,0.0012478818,0.0008111444,0.001097321,0.00085465616,0.0015659304,0.0018935809,0.0008722354,0.01020417],"category_scores_gemma":[0.004371058,0.00077233725,0.0011387038,0.0014111768,0.001160194,0.001705842,0.002485664,0.0016569438,0.0016216811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028942485,0.0001405778,0.00094674266,0.00055161346,0.0002181246,0.0002946175,0.00039561954,0.3364852,0.031666543,0.15614034,0.013815499,0.45905566],"study_design_scores_gemma":[0.000065280685,0.000078186655,0.0001939112,0.000041075535,0.000036014375,0.0002158988,0.00007304768,0.9233434,0.011729732,0.04189394,0.022278447,0.00005103944],"about_ca_topic_score_codex":0.0034305756,"about_ca_topic_score_gemma":0.004556782,"teacher_disagreement_score":0.01020417,"about_ca_system_score_codex":0.00070385437,"about_ca_system_score_gemma":0.0013612476,"threshold_uncertainty_score":0.034136355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07684311,0.012272585,0.83676696,0.007771255,0.0011152822,0.00036523992,0.0037140793,0.0026058946,0.058545552],"genre_scores_gemma":[0.5721142,0.008341974,0.38517275,0.0019914857,0.0013699178,0.00056787604,0.009055022,0.0013720425,0.020014778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604464,0.00125633,0.00014947237,0.00061890914,0.0009800071,0.0009505904],"domain_scores_gemma":[0.9723355,0.020664318,0.0013125257,0.003078978,0.0013262121,0.0012822843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540382,0.002957668,0.0024926993,0.003114086,0.0013314689,0.0047633876,0.0064900955,0.0025799347,0.020909177],"category_scores_gemma":[0.033959284,0.0011843798,0.0022846446,0.00713258,0.0016750938,0.010512924,0.0026288258,0.0065329424,0.0032307904],"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.0023274147,0.0015820692,0.0048768283,0.0012756769,0.0004955555,0.00036408537,0.0006508117,0.46823475,0.0027645982,0.23544459,0.08961281,0.19237083],"study_design_scores_gemma":[0.00017218154,0.00017352305,0.0009032566,0.00016740993,0.00018981812,0.000253579,0.0002447186,0.7674652,0.0010866813,0.22165234,0.0076561044,0.00003515306],"about_ca_topic_score_codex":0.010947876,"about_ca_topic_score_gemma":0.012627231,"teacher_disagreement_score":0.020909177,"about_ca_system_score_codex":0.004729278,"about_ca_system_score_gemma":0.003562179,"threshold_uncertainty_score":0.0699482},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726697,0.0026234742,0.41746265,0.001493667,0.0005273247,0.000168514,0.0021116245,0.00067452673,0.2022684],"genre_scores_gemma":[0.9488712,0.0008238523,0.027864147,0.00009738744,0.000085485204,0.0000946969,0.0005870227,0.00014034643,0.021435786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989712,0.00017159354,0.000075731456,0.0002767831,0.0003664861,0.00013829228],"domain_scores_gemma":[0.995465,0.0024192194,0.0006547912,0.00069600437,0.00038968722,0.0003752895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010570181,0.0005128295,0.00074244983,0.0015149097,0.0012189663,0.0029519254,0.0016610767,0.0012447188,0.016825726],"category_scores_gemma":[0.0108472565,0.00043617617,0.00047777372,0.0016434524,0.0016248124,0.005255046,0.0016171447,0.0017179578,0.0022585886],"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.0003603516,0.00020619831,0.011429813,0.0003924856,0.000118856275,0.0005957888,0.0002848291,0.097187735,0.011901951,0.79996055,0.005736568,0.07182489],"study_design_scores_gemma":[0.000053759595,0.00018170703,0.010446656,0.000085169086,0.00019328855,0.0015543384,0.0008124872,0.20399565,0.021575216,0.72139114,0.0395147,0.00019593046],"about_ca_topic_score_codex":0.00094105053,"about_ca_topic_score_gemma":0.0014809445,"teacher_disagreement_score":0.016825726,"about_ca_system_score_codex":0.00072935317,"about_ca_system_score_gemma":0.00054729613,"threshold_uncertainty_score":0.056287706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053614765,0.0005640286,0.9192846,0.0009594898,0.00017958987,0.0002761057,0.00064293033,0.006639011,0.017839432],"genre_scores_gemma":[0.2774155,0.00021141325,0.7118306,0.0005809306,0.000048958766,0.00020013952,0.00095101865,0.0006221733,0.0081392545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984276,0.00047646233,0.00010243195,0.00026232455,0.0004905234,0.00024066954],"domain_scores_gemma":[0.995654,0.0024155115,0.00018312229,0.00091652176,0.00066511956,0.00016567642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013959875,0.0008042499,0.0007739415,0.0012164621,0.0006848495,0.0014945576,0.0017107943,0.0012107048,0.009414186],"category_scores_gemma":[0.00590654,0.0005292716,0.0008498572,0.0020863723,0.0014411398,0.0022777696,0.002294913,0.0022222088,0.0012104788],"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.0005544418,0.00058747083,0.0023417813,0.00059445493,0.000084940904,0.00033307413,0.000292447,0.36792108,0.015237289,0.12387916,0.01974449,0.4684294],"study_design_scores_gemma":[0.0003396354,0.00015172713,0.0002528637,0.000055259567,0.000052062376,0.00012693027,0.0000921371,0.8548134,0.014006723,0.11470421,0.015364571,0.000040519622],"about_ca_topic_score_codex":0.0056033237,"about_ca_topic_score_gemma":0.018809492,"teacher_disagreement_score":0.009414186,"about_ca_system_score_codex":0.0012971052,"about_ca_system_score_gemma":0.0037189035,"threshold_uncertainty_score":0.031493604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05381424,0.00025930177,0.93136394,0.00023756549,0.00009537596,0.00028270716,0.00019410843,0.0036002991,0.010152458],"genre_scores_gemma":[0.37124547,0.00016641553,0.62314963,0.000111732596,0.000053967422,0.00046313155,0.0006602582,0.0006225125,0.0035269163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800175,0.0007242673,0.0001407075,0.00034371015,0.0005454688,0.00024403226],"domain_scores_gemma":[0.9963468,0.0015896001,0.00021933312,0.0010182823,0.00063822063,0.000187796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019108624,0.0011252091,0.0017250438,0.0016260837,0.0009571028,0.0020369163,0.0022111759,0.0011334842,0.011906536],"category_scores_gemma":[0.010719052,0.0010225154,0.0009988433,0.0021675744,0.0008226481,0.0025728226,0.0029303853,0.0014819433,0.002452356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046222607,0.00028524027,0.0032296658,0.0002529051,0.00013904828,0.00030977777,0.0001641002,0.3987751,0.0077814837,0.02351867,0.00890373,0.5561781],"study_design_scores_gemma":[0.00008666902,0.00011967192,0.00046127825,0.000024724375,0.000044577868,0.0001187592,0.00007219546,0.95819485,0.0049699633,0.03181692,0.0040714554,0.000018945973],"about_ca_topic_score_codex":0.0015239032,"about_ca_topic_score_gemma":0.0026236735,"teacher_disagreement_score":0.011906536,"about_ca_system_score_codex":0.00088660704,"about_ca_system_score_gemma":0.0021416212,"threshold_uncertainty_score":0.03983134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036303482,0.01247605,0.8889517,0.0035249633,0.0013751758,0.00006400283,0.00035597724,0.00027710927,0.08934462],"genre_scores_gemma":[0.23326415,0.022039313,0.70878786,0.0048253834,0.004196122,0.0005971583,0.0009926158,0.00060433056,0.024693059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712545,0.0011556299,0.0002407073,0.0005315347,0.0008116585,0.00013501038],"domain_scores_gemma":[0.99645907,0.0022283401,0.0003362452,0.00043905573,0.0003823212,0.00015492561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022349672,0.0011576633,0.0007481923,0.0022366769,0.0010268218,0.0046471586,0.0018511781,0.0014026292,0.012364251],"category_scores_gemma":[0.011832078,0.0005199545,0.001160219,0.0055590486,0.0060577346,0.012303979,0.0038613619,0.005752892,0.0025387804],"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.000010547739,0.0000059842755,0.000050016017,0.0000956919,0.000006792911,0.00003588655,0.0002323315,0.0012635518,0.00017190393,0.97535455,0.0029700594,0.019802738],"study_design_scores_gemma":[0.000006120195,0.000017608345,0.000100622005,0.00010588973,0.000010344739,0.00013516213,0.0001375442,0.00353249,0.00028898346,0.94553417,0.050115258,0.000015879878],"about_ca_topic_score_codex":0.0019425526,"about_ca_topic_score_gemma":0.0014787412,"teacher_disagreement_score":0.012364251,"about_ca_system_score_codex":0.0018274584,"about_ca_system_score_gemma":0.0016086256,"threshold_uncertainty_score":0.041362524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016648428,0.00050460146,0.84151685,0.00079696265,0.0004128825,0.0016610832,0.04791104,0.09279161,0.012740146],"genre_scores_gemma":[0.021560747,0.0011469633,0.83277535,0.0011265294,0.00017635904,0.0022001101,0.12375991,0.009127625,0.008126412],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948243,0.00075970433,0.0012038135,0.00072960585,0.0022925448,0.00019010856],"domain_scores_gemma":[0.98961735,0.004101444,0.0008238371,0.002729708,0.0022513187,0.00047639606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059952326,0.0017226944,0.0016527143,0.004365637,0.0013514232,0.008014522,0.0062387753,0.0022548693,0.021834698],"category_scores_gemma":[0.019440025,0.00251276,0.002955162,0.003800174,0.0016368452,0.007085014,0.0043178727,0.004783378,0.016162423],"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.00055990124,0.0009501569,0.0023787625,0.0031435224,0.0005412938,0.0021068023,0.0011774829,0.073801234,0.010644309,0.21488973,0.35683516,0.3329716],"study_design_scores_gemma":[0.00026032364,0.00006549752,0.00062028697,0.000588028,0.00015552212,0.0006749636,0.00019219954,0.15030278,0.0134409135,0.10460326,0.7288926,0.00020360074],"about_ca_topic_score_codex":0.013941048,"about_ca_topic_score_gemma":0.015617164,"teacher_disagreement_score":0.021834698,"about_ca_system_score_codex":0.001752446,"about_ca_system_score_gemma":0.00643067,"threshold_uncertainty_score":0.07304436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.871813,0.005025794,0.07237326,0.0019518464,0.00033341767,0.00082054734,0.00896764,0.0067392318,0.031975344],"genre_scores_gemma":[0.88164055,0.00081583095,0.096365474,0.0004934191,0.00008892537,0.00045642475,0.016435452,0.0008381144,0.002865881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99204516,0.003888077,0.0006240353,0.0011624852,0.0015840208,0.00069618557],"domain_scores_gemma":[0.9478939,0.037740786,0.0020486692,0.008613575,0.002842102,0.000860917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007541732,0.0013539064,0.0010475651,0.0015691358,0.0010134258,0.0011406412,0.0021108906,0.001425767,0.0065532136],"category_scores_gemma":[0.0413404,0.0004890441,0.0009183851,0.0028021287,0.001281817,0.0033420522,0.0017011961,0.0013738112,0.0010778495],"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.014491963,0.010077112,0.020002628,0.003798437,0.0010556568,0.0006331027,0.00063444424,0.47936293,0.038565297,0.035313305,0.08736373,0.30870146],"study_design_scores_gemma":[0.0018853145,0.0027165804,0.0081176665,0.00013087114,0.00025713947,0.00078957615,0.00042489218,0.88517743,0.036211062,0.050368756,0.013826722,0.000094027346],"about_ca_topic_score_codex":0.003021359,"about_ca_topic_score_gemma":0.004820281,"teacher_disagreement_score":0.007541732,"about_ca_system_score_codex":0.0017245961,"about_ca_system_score_gemma":0.0010694574,"threshold_uncertainty_score":0.039884984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076762345,0.00047506057,0.9790122,0.00052214623,0.00011398077,0.0000906889,0.00018228673,0.00052928674,0.0113980835],"genre_scores_gemma":[0.28486645,0.00079744915,0.70366836,0.0004245022,0.00029655726,0.0004996688,0.0007407,0.00036999537,0.008336293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960609,0.001318234,0.00042204032,0.00073504436,0.0011597202,0.00030405453],"domain_scores_gemma":[0.9948714,0.0026284757,0.0007250163,0.0007963605,0.0007400581,0.00023873868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047338163,0.00081907737,0.00049002736,0.0016242447,0.0015458829,0.0032709981,0.0023331083,0.001253957,0.00540286],"category_scores_gemma":[0.00647629,0.00092718925,0.001608876,0.0020726672,0.006588386,0.009622045,0.0032555165,0.0033479533,0.00072893285],"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.000009634957,0.0000057389702,0.0000815769,0.000034301866,0.0000059638865,0.000100766694,0.0004573552,0.002724315,0.0005694961,0.99137515,0.00038288347,0.0042526666],"study_design_scores_gemma":[0.000028450788,0.000054804197,0.00015748612,0.00014058388,0.00003711471,0.00037174564,0.00029728547,0.05026931,0.0030695498,0.8737599,0.071767986,0.000045752513],"about_ca_topic_score_codex":0.0043331147,"about_ca_topic_score_gemma":0.0034386853,"teacher_disagreement_score":0.00540286,"about_ca_system_score_codex":0.0022227175,"about_ca_system_score_gemma":0.0019542389,"threshold_uncertainty_score":0.025035083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10601095,0.0036254104,0.66095334,0.009406959,0.0011263031,0.00058729266,0.012281038,0.00132898,0.20467974],"genre_scores_gemma":[0.49601543,0.0032642102,0.4298465,0.0016404106,0.00058091665,0.0005438234,0.011651171,0.00057949236,0.05587812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852896,0.00045750584,0.000080139056,0.00033255515,0.00037781708,0.0002230771],"domain_scores_gemma":[0.99721587,0.0018130044,0.0001604486,0.00036416986,0.00021117498,0.00023534604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008684484,0.00077889353,0.001113968,0.0007734048,0.0011040468,0.0029655714,0.0014497794,0.0021953867,0.025276694],"category_scores_gemma":[0.0061428095,0.000502381,0.001384047,0.0025085136,0.0009380673,0.0038717978,0.0021310537,0.0023141892,0.0027275237],"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.00036611778,0.00031939437,0.0016482003,0.000960561,0.00024338515,0.0007746084,0.00034043004,0.105203964,0.0034869213,0.56381977,0.12572567,0.19711094],"study_design_scores_gemma":[0.00009458454,0.00009100601,0.0008999883,0.00016689631,0.00009131063,0.0009216802,0.00040662114,0.18889296,0.0030031097,0.7364342,0.068958975,0.000038605358],"about_ca_topic_score_codex":0.0032423737,"about_ca_topic_score_gemma":0.00397213,"teacher_disagreement_score":0.025276694,"about_ca_system_score_codex":0.0010881397,"about_ca_system_score_gemma":0.0015641736,"threshold_uncertainty_score":0.084558964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004074226,0.0063762777,0.6688164,0.030143138,0.0039041557,0.00013623672,0.00087585405,0.0010236929,0.28465006],"genre_scores_gemma":[0.25141028,0.012348837,0.46703625,0.029617487,0.006099232,0.0007215405,0.0023538966,0.0020192112,0.22839335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997855,0.00076432014,0.00013842418,0.00052351766,0.0005419763,0.00017676462],"domain_scores_gemma":[0.9964541,0.0013066046,0.00013039014,0.0014027476,0.00055036636,0.00015580704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027938865,0.001838297,0.0012613209,0.0025781929,0.003467203,0.004840124,0.0028094116,0.0025778299,0.034388043],"category_scores_gemma":[0.010408089,0.00092932605,0.002231956,0.0029370412,0.005243284,0.012108043,0.006966025,0.0066935075,0.011815125],"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.000023320681,0.000022088254,0.00014184903,0.00008314202,0.0000137370835,0.000040742336,0.00017002529,0.0008669602,0.00021316086,0.939519,0.022389317,0.03651676],"study_design_scores_gemma":[0.000013907162,0.000012142706,0.00013644477,0.00007309634,0.000020121115,0.00010646018,0.00007250204,0.0056743254,0.00032978176,0.8942877,0.09925765,0.000015903424],"about_ca_topic_score_codex":0.0056061596,"about_ca_topic_score_gemma":0.007477763,"teacher_disagreement_score":0.034388043,"about_ca_system_score_codex":0.00209453,"about_ca_system_score_gemma":0.0016284334,"threshold_uncertainty_score":0.11503947},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012585758,0.04138375,0.0065828795,0.04568118,0.7331341,0.0001142174,0.0019010399,0.00048822258,0.16945615],"genre_scores_gemma":[0.008056079,0.034137793,0.0038559604,0.01188758,0.6586729,0.00018924214,0.0030796288,0.00076843967,0.27935243],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840564,0.00030848637,0.00014479023,0.00029665144,0.0006823501,0.00016205767],"domain_scores_gemma":[0.9917923,0.003749957,0.00059203897,0.0008076701,0.0019443242,0.0011137876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018696657,0.0020830808,0.0031383275,0.005201037,0.0020758081,0.008299263,0.0018334865,0.0029526523,0.10032387],"category_scores_gemma":[0.0074479636,0.00067400874,0.0020447965,0.0052221394,0.0012323515,0.004195935,0.0012550659,0.0038864145,0.03153935],"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.000032268326,0.000030842144,0.00014914053,0.0002297262,0.000023071056,0.000052776086,0.00001106404,0.00016984742,0.00009071176,0.005176217,0.9787902,0.015244065],"study_design_scores_gemma":[0.00001728655,0.00004094777,0.0007599209,0.00019900655,0.00004150341,0.00017868562,0.000038211583,0.0010232554,0.00012775967,0.008707005,0.98885137,0.000014947997],"about_ca_topic_score_codex":0.0021353187,"about_ca_topic_score_gemma":0.0060338797,"teacher_disagreement_score":0.10032387,"about_ca_system_score_codex":0.0023413785,"about_ca_system_score_gemma":0.0020428398,"threshold_uncertainty_score":0.33561677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027838727,0.00045713756,0.9657399,0.0003730226,0.000024932611,0.00010825214,0.00020947173,0.00025573416,0.0049926657],"genre_scores_gemma":[0.22935686,0.00046929458,0.7673331,0.0001222612,0.00003556552,0.0003396747,0.0005298734,0.00022561668,0.0015877438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981577,0.00082259066,0.000100768186,0.000271123,0.00047280808,0.00017500542],"domain_scores_gemma":[0.9937709,0.0052178777,0.00031514934,0.0002644829,0.00031869032,0.00011294421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035065261,0.0015048397,0.0015466514,0.0019010765,0.0010454984,0.002495162,0.0012559587,0.0020342623,0.004968535],"category_scores_gemma":[0.014437984,0.001207854,0.0017069149,0.0022383258,0.0016113642,0.002859578,0.0018028805,0.0027235227,0.00065579853],"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.000100931255,0.000055943976,0.00053198775,0.00017690336,0.00006357889,0.00005546798,0.00009474879,0.9229588,0.0009975362,0.037131723,0.0012068093,0.03662564],"study_design_scores_gemma":[0.000021615795,0.000040093284,0.00013893083,0.00004155407,0.000013540501,0.000024695197,0.000041954456,0.92519665,0.00085187587,0.0726423,0.00097434997,0.000012531601],"about_ca_topic_score_codex":0.0023135473,"about_ca_topic_score_gemma":0.0033435838,"teacher_disagreement_score":0.004968535,"about_ca_system_score_codex":0.0014560138,"about_ca_system_score_gemma":0.0018167018,"threshold_uncertainty_score":0.018544495},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005016822,0.004308524,0.93866974,0.005534365,0.00038585853,0.000042730135,0.00028199042,0.002261648,0.043498352],"genre_scores_gemma":[0.23196258,0.00872538,0.69843733,0.00505645,0.0015308589,0.00036111497,0.0008311051,0.0029580349,0.05013721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937835,0.0028429918,0.00020382825,0.00080436055,0.002019418,0.00034586852],"domain_scores_gemma":[0.99536526,0.0032927953,0.00016933102,0.0006208875,0.00038535317,0.00016637797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005461968,0.0015026589,0.0011263115,0.0015390788,0.0014868362,0.0065628346,0.0019088219,0.002237802,0.011255838],"category_scores_gemma":[0.009109835,0.001037778,0.0015523303,0.002609337,0.0076734484,0.0080463495,0.004199489,0.0070577646,0.0032692295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096014286,0.00002084333,0.0003166286,0.00027968662,0.000042450134,0.0001719598,0.0005945155,0.007178072,0.0010305423,0.91424596,0.013176997,0.0628464],"study_design_scores_gemma":[0.00007440234,0.00006702526,0.0005876475,0.00025934292,0.00004856065,0.00042335867,0.00033658446,0.040020753,0.0031381622,0.57164115,0.38333294,0.00006998844],"about_ca_topic_score_codex":0.0058527123,"about_ca_topic_score_gemma":0.005174529,"teacher_disagreement_score":0.011255838,"about_ca_system_score_codex":0.0029489612,"about_ca_system_score_gemma":0.0017536426,"threshold_uncertainty_score":0.03765452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49375024,0.00020208147,0.500725,0.00004663745,0.000020913887,0.00010976795,0.00029473065,0.00055141107,0.004299206],"genre_scores_gemma":[0.9130845,0.00006811024,0.08584514,0.000008439275,0.000009858846,0.000052918494,0.00036698312,0.000090000394,0.0004740759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827063,0.00027305502,0.000097385644,0.00033813075,0.0008846679,0.00013618608],"domain_scores_gemma":[0.9970452,0.00092223595,0.0005356553,0.00039967734,0.00087838084,0.00021883893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496791,0.00051907176,0.00095245347,0.0043855333,0.0007945839,0.0022060648,0.0012596743,0.0009735623,0.0020184317],"category_scores_gemma":[0.005938389,0.00039366525,0.00067188655,0.0035391406,0.0009328484,0.0024199523,0.0013912614,0.00043887296,0.00046522348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029258924,0.00047500737,0.04928247,0.00074964913,0.0003179986,0.0009443029,0.0012094426,0.33735904,0.19733025,0.060122114,0.002042754,0.3472411],"study_design_scores_gemma":[0.00002182623,0.0001284215,0.009323375,0.000021579886,0.00006695394,0.00026314065,0.0003795325,0.9481191,0.031775232,0.008877293,0.0009839955,0.000039609014],"about_ca_topic_score_codex":0.0024269049,"about_ca_topic_score_gemma":0.0031447697,"teacher_disagreement_score":0.0043855333,"about_ca_system_score_codex":0.0007388375,"about_ca_system_score_gemma":0.000768375,"threshold_uncertainty_score":0.006752312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045263797,0.0019543415,0.94351447,0.0031012339,0.00008902058,0.0001217828,0.00021785981,0.00016515394,0.0055723516],"genre_scores_gemma":[0.77998656,0.0027392271,0.20886055,0.0011827571,0.0010790782,0.0005303315,0.00053248997,0.0003809343,0.004708022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98133415,0.00983005,0.0007323736,0.0027709296,0.004311186,0.0010213512],"domain_scores_gemma":[0.7592135,0.21593028,0.0075586485,0.009279155,0.0057854825,0.0022329306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021959469,0.0015775829,0.0025925904,0.005150724,0.0025302062,0.0058746906,0.0062833694,0.0035918872,0.007851372],"category_scores_gemma":[0.14525206,0.0022656724,0.004461513,0.006698373,0.012672804,0.020542827,0.006666575,0.009610184,0.00033581242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007731058,0.00005346146,0.0015191232,0.00019630053,0.00008441332,0.000071261384,0.00033082417,0.03617547,0.00036042582,0.9461891,0.0009885369,0.013953759],"study_design_scores_gemma":[0.000023162409,0.0000423891,0.0005274785,0.000057196776,0.00004293141,0.000106084124,0.00008250998,0.15321995,0.00020586805,0.8447835,0.000879741,0.000029236415],"about_ca_topic_score_codex":0.003622274,"about_ca_topic_score_gemma":0.002798101,"teacher_disagreement_score":0.021959469,"about_ca_system_score_codex":0.0040244176,"about_ca_system_score_gemma":0.0025096843,"threshold_uncertainty_score":0.11613417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018258975,0.00008491167,0.99498534,0.0001428557,0.000024078043,0.000048636848,0.000065994136,0.00012540852,0.0026968564],"genre_scores_gemma":[0.30680507,0.00045079758,0.68154544,0.00034232836,0.00018289994,0.00052956823,0.0004304903,0.00040773675,0.009305529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817884,0.00064766075,0.00006844768,0.00035842383,0.0005239762,0.00022277613],"domain_scores_gemma":[0.99801433,0.0011808429,0.0001557076,0.00021711037,0.00033193614,0.0000999766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021342705,0.0014623633,0.0022507943,0.0012316257,0.0010703166,0.0023953882,0.004286034,0.0018423522,0.0072331126],"category_scores_gemma":[0.005280467,0.001427625,0.0015397839,0.003562548,0.0011813376,0.002663441,0.0027396858,0.0017903262,0.00072261185],"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.000024672758,0.00003345066,0.00008545526,0.000045976725,0.000033956312,0.000033005945,0.000035247274,0.96663386,0.00052374165,0.015850509,0.0013047886,0.015395363],"study_design_scores_gemma":[0.000006902486,0.000008311161,0.000021798314,0.0000025569614,0.0000065435615,0.00000653662,0.000007936451,0.9946443,0.00015013207,0.0047674803,0.0003737213,0.0000038829376],"about_ca_topic_score_codex":0.011436045,"about_ca_topic_score_gemma":0.014681378,"teacher_disagreement_score":0.011436045,"about_ca_system_score_codex":0.0017332687,"about_ca_system_score_gemma":0.0027384106,"threshold_uncertainty_score":0.024197161},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018394194,0.00017843205,0.9937722,0.00021691635,0.000039126335,0.000051148607,0.00018704798,0.000282987,0.0034326832],"genre_scores_gemma":[0.1993467,0.001113204,0.7892796,0.0002438887,0.00017579734,0.00048800634,0.0010299127,0.00018795123,0.00813494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766314,0.0005732474,0.00018539485,0.00058178377,0.00082028704,0.00017619516],"domain_scores_gemma":[0.99814093,0.0008232243,0.00029550842,0.0002976546,0.0003219835,0.000120586636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002254524,0.0007632988,0.0007310508,0.0018178212,0.0009989091,0.0027711422,0.002778197,0.001053217,0.009028048],"category_scores_gemma":[0.0061407224,0.0005060695,0.0017989702,0.002419088,0.001550847,0.008142262,0.0023791285,0.002032036,0.0013592474],"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.00009840109,0.000041895906,0.00048227646,0.00016359668,0.0000509281,0.00026530251,0.00022397169,0.26779738,0.0018909341,0.66541594,0.0027873025,0.060782086],"study_design_scores_gemma":[0.000014028002,0.000029930998,0.00011282071,0.000034632005,0.000032219865,0.0001556142,0.000044664393,0.7800203,0.0011224478,0.2010331,0.017375125,0.000025137117],"about_ca_topic_score_codex":0.0074398676,"about_ca_topic_score_gemma":0.007499432,"teacher_disagreement_score":0.009028048,"about_ca_system_score_codex":0.0018792284,"about_ca_system_score_gemma":0.002188567,"threshold_uncertainty_score":0.030201852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005192474,0.00012583316,0.98863995,0.00012049629,0.00009375172,0.00010625184,0.00006211876,0.0007840641,0.00487507],"genre_scores_gemma":[0.050912615,0.00014185415,0.94320494,0.00013489182,0.00003883106,0.00030259357,0.00020055873,0.00020924315,0.004854494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995265,0.000112515736,0.00001938855,0.00010315123,0.00019146471,0.000046957917],"domain_scores_gemma":[0.9996886,0.00011548722,0.000024634255,0.000051226234,0.00009845502,0.000021551023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058916275,0.00093087956,0.00072755764,0.0009188123,0.0006031176,0.0007385827,0.0013915309,0.0008454319,0.004464678],"category_scores_gemma":[0.0012087385,0.00041521425,0.0009838049,0.0011075806,0.0005116187,0.000563743,0.00081517256,0.0012666858,0.0008590107],"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.00012802413,0.0001613967,0.00087018474,0.00021051524,0.00011444434,0.00024376149,0.000102401915,0.61994046,0.01954143,0.029787717,0.0077754348,0.32112426],"study_design_scores_gemma":[0.000041951338,0.00003429664,0.000128241,0.000010491365,0.000016893953,0.00007715208,0.000010365835,0.98641765,0.002164835,0.0042603663,0.0068287016,0.000009204593],"about_ca_topic_score_codex":0.0062466525,"about_ca_topic_score_gemma":0.007813127,"teacher_disagreement_score":0.0062466525,"about_ca_system_score_codex":0.0007364745,"about_ca_system_score_gemma":0.0018341893,"threshold_uncertainty_score":0.014935851},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0150561035,0.0034908121,0.95630217,0.0010774031,0.00031684304,0.000109149805,0.00022775342,0.0005029446,0.022916833],"genre_scores_gemma":[0.21571259,0.0048205256,0.74983233,0.000638393,0.0010001148,0.0005162939,0.0010228407,0.00058123324,0.025875688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985721,0.0005080819,0.00008969496,0.00028423397,0.00043311046,0.000112890666],"domain_scores_gemma":[0.99596465,0.002679207,0.00028819102,0.00045803923,0.00041106206,0.00019891621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929595,0.0015485198,0.0012746316,0.0033705106,0.001148513,0.0029605746,0.0018190017,0.0015067883,0.012835217],"category_scores_gemma":[0.0117368335,0.00064813107,0.0012905195,0.0039887247,0.002613689,0.0068015703,0.0023855541,0.0038578147,0.0031044655],"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.0000863761,0.00006777385,0.0006301306,0.00025973286,0.000029781913,0.00009246411,0.00021491518,0.03522278,0.00094155845,0.82482636,0.0072819544,0.13034616],"study_design_scores_gemma":[0.000023123623,0.000043136675,0.00013214938,0.000072605646,0.000012049613,0.0001923147,0.00006854506,0.11069835,0.00055811275,0.87643224,0.011740816,0.000026546557],"about_ca_topic_score_codex":0.00110219,"about_ca_topic_score_gemma":0.0015812282,"teacher_disagreement_score":0.012835217,"about_ca_system_score_codex":0.0018066114,"about_ca_system_score_gemma":0.0014030259,"threshold_uncertainty_score":0.042938054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67692304,0.0013328705,0.2904286,0.000550807,0.00014251465,0.0001349676,0.004626063,0.0010397049,0.024821421],"genre_scores_gemma":[0.9305138,0.00056042324,0.04329153,0.00004271597,0.00007387509,0.00016045864,0.0024203951,0.00054612075,0.022390733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977475,0.000049375936,0.0000064985848,0.000059276612,0.00007789134,0.000032132564],"domain_scores_gemma":[0.9989189,0.0007243852,0.00004506036,0.00005867212,0.00019576073,0.00005729435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030402257,0.0007638558,0.0008543855,0.0023871684,0.00072031753,0.0015625152,0.00063053996,0.00079282577,0.013734264],"category_scores_gemma":[0.0026273371,0.00031500356,0.001027336,0.0018070018,0.00065386354,0.0008318408,0.0003621558,0.0008558334,0.0011815446],"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.0012306933,0.00012425745,0.016058154,0.000989882,0.00030707254,0.0007530198,0.0011279474,0.60566694,0.053912155,0.12555575,0.0068427566,0.18743132],"study_design_scores_gemma":[0.000087746346,0.00012608894,0.019178834,0.00007239374,0.000056845583,0.00026469218,0.00049111893,0.9133624,0.012997469,0.037505034,0.015796376,0.00006102335],"about_ca_topic_score_codex":0.033550777,"about_ca_topic_score_gemma":0.025953325,"teacher_disagreement_score":0.033550777,"about_ca_system_score_codex":0.0015698958,"about_ca_system_score_gemma":0.00080334186,"threshold_uncertainty_score":0.06671095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044663794,0.0038128998,0.87676024,0.0033857767,0.00030300496,0.00022732904,0.0019910163,0.0011910633,0.06766477],"genre_scores_gemma":[0.61962056,0.003437097,0.3338012,0.0019281912,0.0005326423,0.00044934923,0.0034217874,0.00048217011,0.03632702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809915,0.00063977373,0.00013366234,0.00060988625,0.00036794864,0.00014965731],"domain_scores_gemma":[0.9971987,0.001291726,0.0003360657,0.0006398192,0.00035688616,0.00017686667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212149,0.00057633454,0.00071449636,0.0019555413,0.0017449836,0.003774323,0.0012058463,0.00094219175,0.013672864],"category_scores_gemma":[0.0037559401,0.0006970307,0.00124833,0.0032905985,0.0033757172,0.008325214,0.0027690057,0.002048578,0.0015504956],"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.00001674474,0.0000073607575,0.00014309,0.00006731002,0.000013122145,0.000065414235,0.00025682343,0.0013540902,0.0005154112,0.98741674,0.0010129223,0.009130926],"study_design_scores_gemma":[0.000009464615,0.000010673082,0.00016017407,0.00002637364,0.000016803031,0.00009637486,0.00011600253,0.0036202013,0.0005471715,0.9615996,0.033786,0.000011168836],"about_ca_topic_score_codex":0.0032923722,"about_ca_topic_score_gemma":0.0030712893,"teacher_disagreement_score":0.013672864,"about_ca_system_score_codex":0.0019298547,"about_ca_system_score_gemma":0.0008488565,"threshold_uncertainty_score":0.045740247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12715152,0.0031122107,0.825473,0.002633709,0.0005394121,0.0002581009,0.0015958037,0.005652352,0.03358387],"genre_scores_gemma":[0.596097,0.0010521319,0.37758106,0.0010758527,0.0004617299,0.0004817119,0.0037463363,0.001651358,0.017852755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554634,0.0018359656,0.00016968176,0.00066998857,0.0013130299,0.0004649154],"domain_scores_gemma":[0.9877101,0.009266169,0.00047463094,0.0017402157,0.00050687836,0.00030202453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476552,0.0021495598,0.0022928591,0.0015074938,0.0007055885,0.0024222867,0.004043347,0.0022717058,0.014919001],"category_scores_gemma":[0.019617978,0.0013125082,0.0019794134,0.002964535,0.001703393,0.0040776134,0.0038552298,0.0033086278,0.002179969],"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.0012114035,0.00032453853,0.0025142035,0.00066419074,0.00020123487,0.00020170909,0.00014660855,0.7553265,0.0036877305,0.088351645,0.022902062,0.12446812],"study_design_scores_gemma":[0.000079546284,0.00006323786,0.00022494899,0.00002870866,0.000023695116,0.00006979522,0.000022173122,0.94316125,0.0007074845,0.05419029,0.0014201121,0.000008899925],"about_ca_topic_score_codex":0.0030307553,"about_ca_topic_score_gemma":0.007551117,"teacher_disagreement_score":0.014919001,"about_ca_system_score_codex":0.0028807083,"about_ca_system_score_gemma":0.0018936627,"threshold_uncertainty_score":0.049909055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035716716,0.00045593976,0.946491,0.00034791086,0.00004736583,0.00003477362,0.00026758364,0.00009578432,0.016542781],"genre_scores_gemma":[0.8479627,0.0008713123,0.13921838,0.00012358838,0.000110959416,0.00015479237,0.00045427177,0.000045661942,0.0110583985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995995,0.00008659114,0.000026443182,0.00007413699,0.00016563613,0.000047645735],"domain_scores_gemma":[0.9993461,0.00024401887,0.00012585537,0.00008468794,0.00014408212,0.00005543134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094118546,0.000498238,0.00057329255,0.0013066609,0.0004622126,0.0017914352,0.0014842913,0.0007554153,0.003386151],"category_scores_gemma":[0.0017198765,0.00022422303,0.0008865251,0.0012386806,0.0013978786,0.0027051945,0.00077101693,0.0009974022,0.00047513456],"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.00003712117,0.000026176655,0.0004522621,0.00006377379,0.000023354049,0.00009620421,0.00020840166,0.27551356,0.0020374174,0.7027171,0.00096160464,0.01786308],"study_design_scores_gemma":[0.000009249043,0.000033775144,0.0002069008,0.000016633598,0.000008409343,0.000042064523,0.00006612897,0.8007867,0.0003681744,0.19655652,0.0018891625,0.000016255999],"about_ca_topic_score_codex":0.0040150727,"about_ca_topic_score_gemma":0.0031514617,"teacher_disagreement_score":0.0040150727,"about_ca_system_score_codex":0.0011415237,"about_ca_system_score_gemma":0.0005568991,"threshold_uncertainty_score":0.0113277435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017825154,0.0024153502,0.8894942,0.001745627,0.0003350611,0.000071160735,0.00011156137,0.0004952874,0.10354926],"genre_scores_gemma":[0.08844665,0.006350524,0.8023621,0.0011349418,0.00091313984,0.00038452083,0.0006020556,0.0008537966,0.098952375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981876,0.0004785016,0.00010096494,0.00036493936,0.00077799475,0.00009007738],"domain_scores_gemma":[0.99732286,0.0014196364,0.00009100779,0.0006548532,0.00043136242,0.000080373546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017303878,0.0011528976,0.0009124798,0.001954064,0.001542858,0.0039774273,0.0030883716,0.0012184967,0.03077623],"category_scores_gemma":[0.0059492188,0.0011594242,0.0014502069,0.0031893328,0.0047457605,0.009998932,0.0044050226,0.0055052545,0.00462529],"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.000010907827,0.000023352954,0.00004774177,0.00011357462,0.0000124311155,0.000032262316,0.00021316679,0.0018401775,0.0005491437,0.909425,0.0076010735,0.080131136],"study_design_scores_gemma":[0.000010456113,0.000010034318,0.0000705504,0.00007302722,0.000013498917,0.00012373494,0.00009940333,0.023973353,0.0012099156,0.8834139,0.09098467,0.0000174388],"about_ca_topic_score_codex":0.0018742416,"about_ca_topic_score_gemma":0.0031984036,"teacher_disagreement_score":0.03077623,"about_ca_system_score_codex":0.0016635259,"about_ca_system_score_gemma":0.0017254313,"threshold_uncertainty_score":0.10295677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017535405,0.0027372942,0.96251655,0.0011418245,0.00008160423,0.00015666286,0.00022302728,0.00020294204,0.0154046165],"genre_scores_gemma":[0.20461856,0.0049620294,0.7836758,0.0004199843,0.00019793205,0.00036335073,0.0006034857,0.00015499356,0.0050038807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895227,0.00049500744,0.000044545206,0.00008806814,0.000320727,0.0000994347],"domain_scores_gemma":[0.9962296,0.0030975803,0.00019889152,0.0001464914,0.0002639545,0.0000634117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028081054,0.0009360924,0.0007881915,0.0014101483,0.00046927654,0.0016384785,0.0009661839,0.00075820135,0.007457375],"category_scores_gemma":[0.005699802,0.00058552594,0.0013257212,0.00245427,0.000736538,0.0020227856,0.0008072578,0.0023078178,0.00068609294],"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.00009172718,0.00011538459,0.00073965674,0.00044821334,0.000071762974,0.000053878288,0.00006045648,0.7097368,0.0012029659,0.17260838,0.0051147193,0.10975603],"study_design_scores_gemma":[0.000030450927,0.000038732902,0.00021450472,0.00007048161,0.00002521884,0.000028503502,0.000030862982,0.90712416,0.00046445828,0.08842125,0.0035436933,0.000007750933],"about_ca_topic_score_codex":0.004081585,"about_ca_topic_score_gemma":0.0055704825,"teacher_disagreement_score":0.007457375,"about_ca_system_score_codex":0.001936256,"about_ca_system_score_gemma":0.0019410566,"threshold_uncertainty_score":0.024947405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017872488,0.0004988302,0.9754249,0.0002764999,0.00007225344,0.00015740748,0.000098975695,0.0016901342,0.0039085364],"genre_scores_gemma":[0.18236628,0.00041377565,0.81369495,0.00037505443,0.00007403358,0.00045510073,0.0004978397,0.0005200284,0.0016030504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728596,0.0012185748,0.00015813587,0.00030672664,0.0008357198,0.00019491228],"domain_scores_gemma":[0.9915657,0.0062403004,0.00041798173,0.0008425887,0.0007523535,0.00018104729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034746213,0.0013112207,0.0016993014,0.002305,0.0009985204,0.0014365934,0.0029704957,0.0015674,0.0038189504],"category_scores_gemma":[0.01868407,0.00082019734,0.0011451828,0.0043968847,0.0013995437,0.0025493212,0.0021664165,0.0026185354,0.00072139024],"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.00020346869,0.00027150512,0.0012252087,0.00029441545,0.00010901358,0.000104556675,0.0001309957,0.6606677,0.005072911,0.061682206,0.0060233837,0.2642147],"study_design_scores_gemma":[0.000044770346,0.000031830663,0.000104883795,0.000017935221,0.000015586313,0.000025869931,0.000010218216,0.976989,0.0011965723,0.020147331,0.0014043169,0.000011782301],"about_ca_topic_score_codex":0.006093601,"about_ca_topic_score_gemma":0.008268833,"teacher_disagreement_score":0.006093601,"about_ca_system_score_codex":0.0016495789,"about_ca_system_score_gemma":0.0019109669,"threshold_uncertainty_score":0.018375754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5174592,0.012614079,0.4264037,0.00433194,0.0011855725,0.0009747125,0.003434411,0.0066573094,0.026939139],"genre_scores_gemma":[0.9121903,0.0006467567,0.08055582,0.00082850055,0.0002593557,0.00046275475,0.0027749268,0.0010383116,0.001243263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.88347596,0.06706894,0.008451598,0.010624017,0.0276237,0.002755785],"domain_scores_gemma":[0.71935904,0.20843413,0.01463038,0.035753056,0.020080222,0.0017432036],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06784707,0.0018584782,0.002403643,0.003977875,0.0010797487,0.005443977,0.0026309432,0.0022650925,0.0025830495],"category_scores_gemma":[0.3010881,0.0007302806,0.001276846,0.0054004653,0.0024883328,0.0056064255,0.003376229,0.002448966,0.001256475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039065755,0.0007021968,0.1187666,0.001593141,0.002453315,0.0002500455,0.0009942913,0.3880457,0.0064596096,0.052447688,0.023828857,0.40055197],"study_design_scores_gemma":[0.00052945287,0.0020022287,0.028958485,0.0005539659,0.0005207946,0.0006445718,0.00060671486,0.83595693,0.024440223,0.084201425,0.02134246,0.0002427939],"about_ca_topic_score_codex":0.0018953534,"about_ca_topic_score_gemma":0.0017166489,"teacher_disagreement_score":0.9321529,"about_ca_system_score_codex":0.002971931,"about_ca_system_score_gemma":0.0026628294,"threshold_uncertainty_score":0.35881388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035067315,0.00013422543,0.99105483,0.00051675114,0.000048213624,0.00008610152,0.00028899775,0.00041601784,0.003948216],"genre_scores_gemma":[0.11603934,0.00043418683,0.8791179,0.00039822597,0.00009456288,0.00044310675,0.0007991198,0.00018225142,0.0024914062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967982,0.0013166239,0.00041710504,0.00038196382,0.00083688746,0.00024927166],"domain_scores_gemma":[0.99654835,0.0020963582,0.00037524028,0.00038544124,0.0004212086,0.0001732842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032089164,0.0011858935,0.00061750243,0.0012104443,0.0008435718,0.0024307014,0.0018981068,0.0012003793,0.003814222],"category_scores_gemma":[0.009225682,0.0006567699,0.0017501776,0.00200574,0.0020380917,0.0054559903,0.0024250054,0.002739132,0.0006524956],"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.000042162806,0.000041002575,0.0003015823,0.00015751176,0.000030218127,0.00028415868,0.0002835666,0.0922858,0.0020698807,0.8772606,0.0020664516,0.025177142],"study_design_scores_gemma":[0.00004985682,0.00004506173,0.0000833821,0.000049453593,0.000025117683,0.00014375075,0.00009709535,0.35188907,0.0023830007,0.62397456,0.021231536,0.000028104994],"about_ca_topic_score_codex":0.0061071874,"about_ca_topic_score_gemma":0.00911334,"teacher_disagreement_score":0.0061071874,"about_ca_system_score_codex":0.002263006,"about_ca_system_score_gemma":0.0026931546,"threshold_uncertainty_score":0.016970575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019987503,0.0032264946,0.96142215,0.00034286096,0.00015867897,0.00029390093,0.00011898205,0.00046144467,0.013987961],"genre_scores_gemma":[0.35972875,0.004061222,0.63137037,0.00027537788,0.00012034621,0.0004754917,0.00029953383,0.00015431536,0.0035145574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.00038475718,0.00003863933,0.00009822144,0.0002449872,0.00014970369],"domain_scores_gemma":[0.99869496,0.0008929242,0.00012733885,0.000096985685,0.00013873678,0.000049061535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001181206,0.0013598334,0.00082678173,0.0014695037,0.00079250964,0.0012358793,0.001770496,0.0010155564,0.0036229985],"category_scores_gemma":[0.0030192481,0.00048485762,0.000836753,0.0016627334,0.0007487693,0.0014335505,0.0007489092,0.0009941601,0.00042639763],"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.00011265761,0.00015533279,0.00040970233,0.00050402706,0.00007739929,0.00016933666,0.00010103708,0.8601674,0.0024763404,0.04507993,0.0031787183,0.0875682],"study_design_scores_gemma":[0.00008120528,0.00014276689,0.00016815186,0.000094388626,0.000050178976,0.00014995968,0.00016170682,0.9511824,0.0022088175,0.037137892,0.008591663,0.000030746836],"about_ca_topic_score_codex":0.0032163253,"about_ca_topic_score_gemma":0.003851787,"teacher_disagreement_score":0.0036229985,"about_ca_system_score_codex":0.0011683116,"about_ca_system_score_gemma":0.0019030981,"threshold_uncertainty_score":0.012120187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02090316,0.0064593,0.94877195,0.00086280156,0.00025700842,0.00028769035,0.00016803795,0.0011379904,0.021152025],"genre_scores_gemma":[0.17105457,0.0034129939,0.8190746,0.00047700116,0.00015326861,0.00056406716,0.00047133127,0.00026315224,0.004528996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793756,0.0007650032,0.00012671745,0.00038283682,0.00058309874,0.00020488963],"domain_scores_gemma":[0.9950206,0.0036866423,0.00032937244,0.00039344927,0.00046929528,0.0001006591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031348031,0.0012940328,0.0012199867,0.0018365994,0.0006811195,0.0024226487,0.0019022088,0.0022424944,0.008380077],"category_scores_gemma":[0.015199037,0.0008988853,0.0012352844,0.00191974,0.0012994262,0.0027258757,0.0011580791,0.0019469468,0.002034057],"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.0003507625,0.00033214217,0.001200192,0.001009198,0.00020976971,0.00019244119,0.00025966283,0.51028234,0.0029487617,0.1638366,0.010567407,0.30881077],"study_design_scores_gemma":[0.00016288593,0.0002552424,0.0001882113,0.0002487673,0.00008200353,0.00016684236,0.00014826012,0.9081061,0.0018618949,0.07052117,0.018223168,0.000035398036],"about_ca_topic_score_codex":0.00095036457,"about_ca_topic_score_gemma":0.0012475977,"teacher_disagreement_score":0.008380077,"about_ca_system_score_codex":0.0011339718,"about_ca_system_score_gemma":0.001777216,"threshold_uncertainty_score":0.02803415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03715936,0.0023605977,0.90996015,0.0069357343,0.00024438548,0.0035288397,0.0022652813,0.0006631856,0.036882486],"genre_scores_gemma":[0.6162268,0.001398932,0.37117797,0.0012307948,0.00016554836,0.0031635528,0.0020485693,0.00014979772,0.004438032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9710868,0.025178334,0.00053861574,0.0007490534,0.0020241055,0.00042304833],"domain_scores_gemma":[0.9340677,0.05977726,0.0017904345,0.0015290492,0.0020519143,0.0007836926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01712432,0.0013834283,0.0017011394,0.001358456,0.0005632221,0.0019431406,0.0015960019,0.0016524153,0.011998416],"category_scores_gemma":[0.06537531,0.00047512347,0.00089740223,0.0017304915,0.0009777038,0.0013792674,0.0018719835,0.0032320542,0.00094830414],"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.0044955513,0.0011691445,0.0026180402,0.0020582743,0.0005890458,0.00032796615,0.0006468215,0.46211296,0.0015343672,0.08143871,0.047660965,0.39534825],"study_design_scores_gemma":[0.001041906,0.00058544177,0.0009738561,0.0002940492,0.00010241507,0.00009555953,0.00016190646,0.8637533,0.0010638571,0.12490089,0.0069718966,0.00005486329],"about_ca_topic_score_codex":0.0032242765,"about_ca_topic_score_gemma":0.006984306,"teacher_disagreement_score":0.01712432,"about_ca_system_score_codex":0.0022891262,"about_ca_system_score_gemma":0.003805584,"threshold_uncertainty_score":0.09056318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76031786,0.00016140842,0.21994708,0.0006845542,0.00009995149,0.00059941,0.0008505873,0.0011145893,0.016224582],"genre_scores_gemma":[0.93580174,0.00008817642,0.06147754,0.000051147435,0.000012729771,0.0001299756,0.00042518892,0.00006380827,0.0019498357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.00006792565,0.000007591016,0.000041352112,0.00003944582,0.00007184334],"domain_scores_gemma":[0.9992623,0.00032821397,0.000115367424,0.00004415521,0.00012232606,0.00012775687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623843,0.00052898814,0.00033396418,0.00028914295,0.00051202846,0.0006938467,0.00048376192,0.00044188366,0.0032262912],"category_scores_gemma":[0.0015900333,0.00031884166,0.0003353354,0.00045242193,0.00031863077,0.00044265858,0.0002914398,0.0005082207,0.00024365414],"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.00040914258,0.00020319496,0.002706583,0.000076630175,0.000030028566,0.000092688315,0.00008376383,0.952453,0.008851047,0.0020738577,0.0022286922,0.030791368],"study_design_scores_gemma":[0.000050554587,0.00023051702,0.0015682476,0.000004093627,0.000012737932,0.00000964532,0.00010733213,0.9923535,0.0033169754,0.0009810493,0.0013567756,0.000008650405],"about_ca_topic_score_codex":0.028884921,"about_ca_topic_score_gemma":0.034858003,"teacher_disagreement_score":0.028884921,"about_ca_system_score_codex":0.0014335725,"about_ca_system_score_gemma":0.002713691,"threshold_uncertainty_score":0.057433605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21626168,0.00020147675,0.77801365,0.0006267318,0.000032340355,0.0001255877,0.0006811588,0.00024398878,0.0038132935],"genre_scores_gemma":[0.94939977,0.00014322455,0.04902382,0.00005573514,0.000023639164,0.000065841305,0.00030568882,0.000036482834,0.00094568875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858665,0.00068581954,0.000053519543,0.0002497389,0.00029227993,0.00013202679],"domain_scores_gemma":[0.986844,0.0092541985,0.0016417268,0.00075812015,0.0011529239,0.0003491427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029200632,0.00041085755,0.00043780787,0.0010175388,0.0003360462,0.00088376686,0.00068659044,0.0004288271,0.0035285067],"category_scores_gemma":[0.017735418,0.0003388006,0.0006020249,0.0014124372,0.00058505044,0.0016797626,0.0008199715,0.0009832025,0.000121903206],"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.00033453634,0.00019743123,0.017714286,0.00020505494,0.00016039386,0.00017039677,0.00032644699,0.8147148,0.0031070886,0.10855319,0.001326126,0.0531903],"study_design_scores_gemma":[0.000012086748,0.00004451742,0.0024060283,0.000010474862,0.000024844947,0.000012988524,0.00006469388,0.9696286,0.0007319205,0.026476175,0.0005754558,0.000012252312],"about_ca_topic_score_codex":0.008969884,"about_ca_topic_score_gemma":0.009043283,"teacher_disagreement_score":0.008969884,"about_ca_system_score_codex":0.0012897791,"about_ca_system_score_gemma":0.0014507662,"threshold_uncertainty_score":0.017835319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031466987,0.00081639,0.9537266,0.00035188257,0.00009478751,0.0000952314,0.00012152991,0.00048018727,0.01284638],"genre_scores_gemma":[0.45037746,0.0005082337,0.5417327,0.00019489462,0.00005851524,0.0003206834,0.00024283495,0.00019998428,0.006364624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920696,0.00026393513,0.000032244225,0.00013772861,0.0002445759,0.000114542796],"domain_scores_gemma":[0.99901307,0.0006277601,0.00012419205,0.000090603506,0.00009383211,0.000050514365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015357367,0.0010550789,0.00073190115,0.0009506127,0.00045038923,0.0014843004,0.0012697267,0.0017543413,0.006137426],"category_scores_gemma":[0.0027941016,0.000531362,0.00089255266,0.0010014824,0.0007819817,0.0014373235,0.0013195348,0.0013145505,0.0006116151],"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.00005365885,0.000047527777,0.00023024976,0.00009989672,0.00002563941,0.000047598038,0.000034837587,0.9531451,0.00085217727,0.01357048,0.0008551146,0.03103762],"study_design_scores_gemma":[0.000014834262,0.00004020298,0.00008454247,0.000015797783,0.000006992917,0.000026011141,0.00002197702,0.9918172,0.00043932482,0.0062085385,0.0013185396,0.000006026857],"about_ca_topic_score_codex":0.0025484434,"about_ca_topic_score_gemma":0.0034751098,"teacher_disagreement_score":0.006137426,"about_ca_system_score_codex":0.0009329408,"about_ca_system_score_gemma":0.0009889242,"threshold_uncertainty_score":0.020531774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029629234,0.008839564,0.88535833,0.00535783,0.00053697923,0.00026581433,0.0019253462,0.0017787184,0.06630824],"genre_scores_gemma":[0.3272972,0.01007888,0.62934077,0.0019267275,0.0018321846,0.0011804117,0.0049450146,0.0021274104,0.021271365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913755,0.0021256134,0.00038782385,0.0012249261,0.0027597582,0.0021262784],"domain_scores_gemma":[0.95988095,0.03058739,0.0018679722,0.0036852444,0.002328009,0.0016503294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056662452,0.003243553,0.0024061357,0.003960003,0.002024496,0.0081731,0.0065175416,0.003025908,0.024126565],"category_scores_gemma":[0.036145627,0.0013952857,0.0027011903,0.006913781,0.00263156,0.015497731,0.0048358794,0.010819571,0.004627095],"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.00087071327,0.00069184694,0.0021187118,0.0019095694,0.00021952322,0.00028827685,0.0007334383,0.35019338,0.006126584,0.4342231,0.036601197,0.16602361],"study_design_scores_gemma":[0.00007056692,0.00024108178,0.0010260051,0.00042411342,0.00012752782,0.0004192721,0.00033902968,0.5744355,0.003980474,0.39372665,0.025135025,0.00007479385],"about_ca_topic_score_codex":0.0029913823,"about_ca_topic_score_gemma":0.0035031887,"teacher_disagreement_score":0.024126565,"about_ca_system_score_codex":0.00476296,"about_ca_system_score_gemma":0.0024650148,"threshold_uncertainty_score":0.080711365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031134712,0.0008050096,0.9566367,0.00204566,0.00006770493,0.00041336237,0.0006811285,0.0010158651,0.0071997484],"genre_scores_gemma":[0.43432036,0.0010144748,0.55597204,0.0009872476,0.0002662332,0.00072010886,0.0018289145,0.000468496,0.004422141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912888,0.0037603318,0.0005454626,0.0019365695,0.0017801682,0.0006886785],"domain_scores_gemma":[0.97304475,0.021236164,0.0015431478,0.0029033723,0.0009886869,0.000283963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007894023,0.0012494421,0.0016984902,0.001647024,0.0011593583,0.0031845584,0.002371076,0.001856853,0.005115042],"category_scores_gemma":[0.041901473,0.0010565545,0.0029033637,0.0028677925,0.0035467749,0.007699526,0.0032507542,0.004030707,0.0008028751],"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.0006194717,0.00026897376,0.0019026196,0.0013055442,0.0004983306,0.00020147767,0.0006553204,0.3410033,0.0066361353,0.48417938,0.011568387,0.15116116],"study_design_scores_gemma":[0.00013355813,0.00009622548,0.00028545083,0.00008757845,0.00006240265,0.00017516366,0.0001300263,0.40765265,0.004924027,0.5801278,0.0062919734,0.000033149096],"about_ca_topic_score_codex":0.0022236481,"about_ca_topic_score_gemma":0.0018297475,"teacher_disagreement_score":0.007894023,"about_ca_system_score_codex":0.002577873,"about_ca_system_score_gemma":0.002563241,"threshold_uncertainty_score":0.041748106},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090788035,0.0040981616,0.932198,0.03847667,0.0005499592,0.0000616248,0.00042578002,0.00034560484,0.014765585],"genre_scores_gemma":[0.30027828,0.020831492,0.6471278,0.010324472,0.0047506113,0.00042466895,0.0014845369,0.0011733003,0.013604734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99152774,0.0039368547,0.00028655087,0.0011215593,0.0027946804,0.0003326766],"domain_scores_gemma":[0.9763059,0.014900748,0.00085240573,0.005742603,0.0015636303,0.00063464785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006501762,0.0015502195,0.0018496043,0.0018457297,0.0017755514,0.007829968,0.0029516825,0.003205727,0.011467376],"category_scores_gemma":[0.034690604,0.0016316086,0.0023043565,0.0037217988,0.008519189,0.029403841,0.0057142107,0.019019851,0.0023713964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034907487,0.000059143003,0.0004069212,0.00024524613,0.000060400722,0.00010092526,0.0005120912,0.015924728,0.0005851803,0.9480636,0.008000964,0.02600594],"study_design_scores_gemma":[0.000016783106,0.000016565285,0.00012564495,0.00010414425,0.000013026021,0.000055855988,0.000104356914,0.039086133,0.0002514969,0.94192713,0.018271744,0.000027087219],"about_ca_topic_score_codex":0.0050783795,"about_ca_topic_score_gemma":0.0057648937,"teacher_disagreement_score":0.011467376,"about_ca_system_score_codex":0.0030073423,"about_ca_system_score_gemma":0.0032554916,"threshold_uncertainty_score":0.038362145},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004467142,0.08279853,0.008426439,0.40623817,0.4254307,0.00018460478,0.0050937654,0.0016673596,0.06971371],"genre_scores_gemma":[0.009623852,0.12495404,0.010627614,0.19240358,0.40016508,0.00052515714,0.0073930416,0.004150389,0.25015724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99557376,0.00090390886,0.00030591807,0.0007212097,0.0019054223,0.00058969384],"domain_scores_gemma":[0.9801498,0.0023130262,0.0009355445,0.0011232719,0.011774933,0.003703377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073640025,0.00090668455,0.001571273,0.0035815157,0.0026796907,0.0110108545,0.0031844098,0.0056035044,0.25745833],"category_scores_gemma":[0.02366187,0.0005852166,0.0019819122,0.0066833827,0.0022000377,0.013899816,0.0036543508,0.0058458964,0.105027385],"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.0000274694,0.000015917198,0.00005550029,0.00053204346,0.000011420543,0.000030461028,0.00003677137,0.000054606553,0.00005296254,0.003423555,0.9603733,0.035386086],"study_design_scores_gemma":[0.000011311999,0.000012239379,0.0002030183,0.0007007883,0.000009815446,0.000056073084,0.000074647025,0.000045006476,0.00008062398,0.002670364,0.99611664,0.000019384717],"about_ca_topic_score_codex":0.021421876,"about_ca_topic_score_gemma":0.020221366,"teacher_disagreement_score":0.25745833,"about_ca_system_score_codex":0.0045345165,"about_ca_system_score_gemma":0.009685969,"threshold_uncertainty_score":0.8612839},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13720873,0.0027031777,0.7440042,0.017177425,0.00054867816,0.00023293192,0.0020162743,0.0011245698,0.094984084],"genre_scores_gemma":[0.89406586,0.0016228555,0.08298765,0.0035628248,0.0011299414,0.0007016776,0.0021000039,0.00037433938,0.013454792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523383,0.0012104809,0.00027521874,0.0012713963,0.0013491855,0.00065986096],"domain_scores_gemma":[0.9845599,0.01179312,0.00068316056,0.0011801388,0.0011508369,0.0006328725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035446738,0.000630256,0.0013365517,0.0014678339,0.0023998409,0.0040713344,0.0018855949,0.001776598,0.010420315],"category_scores_gemma":[0.016285388,0.0006387536,0.001596961,0.0018331646,0.005037019,0.010317897,0.0050081383,0.007433557,0.0010514787],"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.00006429393,0.000042417545,0.00036831867,0.000097901706,0.000019106947,0.000093075825,0.00020243885,0.0042291465,0.00070253265,0.9815592,0.005142992,0.0074785966],"study_design_scores_gemma":[0.000031855838,0.000016240558,0.00018456684,0.000024182627,0.000008544945,0.00006557134,0.000049833405,0.025137642,0.00040356632,0.97047925,0.0035884143,0.000010385545],"about_ca_topic_score_codex":0.0013596793,"about_ca_topic_score_gemma":0.00085734384,"teacher_disagreement_score":0.010420315,"about_ca_system_score_codex":0.003115814,"about_ca_system_score_gemma":0.0015507732,"threshold_uncertainty_score":0.03485948},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05292964,0.10508703,0.68975574,0.03979698,0.0069382554,0.00007887479,0.0013096192,0.0007933317,0.10331055],"genre_scores_gemma":[0.4237251,0.038343027,0.3601181,0.002962853,0.0051305974,0.00025995023,0.0016817295,0.0009990302,0.16677962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984854,0.00038831582,0.00007917757,0.0004478072,0.0004516742,0.00014763777],"domain_scores_gemma":[0.99584204,0.0021435367,0.00021964806,0.0004724063,0.0009833275,0.00033909015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042744605,0.0013155907,0.0013565458,0.0032519347,0.0036396405,0.0061353287,0.0014180804,0.0025293122,0.009614414],"category_scores_gemma":[0.017008048,0.000999198,0.0014236255,0.0023244373,0.0062319436,0.00547272,0.0016018067,0.006357028,0.0014799365],"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.00011858453,0.000016675378,0.0007567283,0.00017528866,0.00007888622,0.00020514673,0.0011226122,0.0046197698,0.0009969244,0.9074729,0.024664227,0.059772193],"study_design_scores_gemma":[0.000060861512,0.00006972559,0.004173541,0.0003579572,0.00007089679,0.000547208,0.0005721062,0.018967498,0.0025266316,0.6746298,0.2978816,0.00014215462],"about_ca_topic_score_codex":0.07245991,"about_ca_topic_score_gemma":0.08049495,"teacher_disagreement_score":0.07245991,"about_ca_system_score_codex":0.009460317,"about_ca_system_score_gemma":0.004136582,"threshold_uncertainty_score":0.14407629},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01210645,0.00019822858,0.9794133,0.00033033654,0.00017702013,0.00016284655,0.00014012208,0.002112892,0.005358763],"genre_scores_gemma":[0.06251441,0.00018655737,0.927675,0.0001723785,0.000076406905,0.00031057943,0.0004959965,0.0006248503,0.007943845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865216,0.00026087902,0.00008660847,0.00043072758,0.00040422077,0.00016546085],"domain_scores_gemma":[0.99638957,0.0024539994,0.00010032402,0.00052597874,0.0004311503,0.00009892201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017330749,0.002312458,0.0013854529,0.0022786842,0.001575113,0.0032330574,0.0023125317,0.0028514494,0.013599979],"category_scores_gemma":[0.006684526,0.0012949883,0.0024332579,0.0018144759,0.002182731,0.0028601193,0.0019469702,0.0042369696,0.00422018],"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.00084374694,0.00043408622,0.0022611849,0.00067020627,0.00022127281,0.00046377347,0.000768889,0.18265891,0.03632624,0.12391919,0.015998708,0.6354337],"study_design_scores_gemma":[0.00035506824,0.00031452262,0.0012321136,0.00012596078,0.00013320985,0.000442095,0.00028551044,0.8598658,0.027376818,0.07667165,0.033110294,0.000087002554],"about_ca_topic_score_codex":0.008354759,"about_ca_topic_score_gemma":0.014901834,"teacher_disagreement_score":0.013599979,"about_ca_system_score_codex":0.0017239404,"about_ca_system_score_gemma":0.0026934594,"threshold_uncertainty_score":0.045496523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1415798,0.0021047925,0.7792831,0.013508843,0.00034840475,0.00048254957,0.002787396,0.0036655148,0.0562396],"genre_scores_gemma":[0.635612,0.0018069423,0.3430706,0.0015655897,0.00035899933,0.00045996788,0.00314212,0.001306466,0.012677373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928093,0.0020257952,0.00040440354,0.001164761,0.002374333,0.001221335],"domain_scores_gemma":[0.9565377,0.03657946,0.0013404613,0.0036434268,0.0014695898,0.00042933805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004279196,0.0010255616,0.0016192943,0.0011074687,0.0018636732,0.006354688,0.0030220598,0.0018492206,0.013216067],"category_scores_gemma":[0.03373686,0.0009920738,0.0021673804,0.002904812,0.0026066753,0.011795882,0.0039044414,0.00455524,0.0023098476],"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.0014568503,0.00038497365,0.0041680136,0.0016131286,0.00023533593,0.0005175493,0.0012321952,0.27880412,0.008166364,0.38043946,0.035369378,0.28761256],"study_design_scores_gemma":[0.00014710239,0.00005190842,0.00070259284,0.00010154775,0.000100113364,0.00024366057,0.00026225238,0.49580616,0.004218779,0.49064028,0.0076770894,0.000048560552],"about_ca_topic_score_codex":0.0045410153,"about_ca_topic_score_gemma":0.0038731734,"teacher_disagreement_score":0.013216067,"about_ca_system_score_codex":0.0028984312,"about_ca_system_score_gemma":0.0029231135,"threshold_uncertainty_score":0.044212162},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05689776,0.0003718746,0.9330272,0.00045829004,0.00004335438,0.00012045617,0.00018050514,0.00017545986,0.008725101],"genre_scores_gemma":[0.37686524,0.0004894388,0.61627233,0.0002583901,0.00007996639,0.00027180678,0.00089520245,0.0001829273,0.004684736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891853,0.0005891025,0.000023823683,0.00020738,0.00015771869,0.000103569975],"domain_scores_gemma":[0.99912053,0.00054964673,0.000075492826,0.00012226509,0.000073716335,0.00005828195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012305205,0.000691108,0.000934094,0.00047385655,0.00068428315,0.0009586708,0.0011388058,0.0013874209,0.0039707306],"category_scores_gemma":[0.002804748,0.00034788664,0.00073300616,0.0012321485,0.00073384587,0.0016671227,0.0012481182,0.0011016395,0.00047002753],"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.0000973385,0.00013630006,0.0010438033,0.0002851048,0.00009919312,0.00032508577,0.00021214927,0.78144807,0.0054459698,0.113625534,0.007124545,0.090156905],"study_design_scores_gemma":[0.0000465822,0.00008811645,0.00051277067,0.000031265998,0.000025090205,0.0002151763,0.00017160717,0.86778235,0.0017525001,0.12176686,0.0075891875,0.000018505158],"about_ca_topic_score_codex":0.0021779588,"about_ca_topic_score_gemma":0.003290844,"teacher_disagreement_score":0.0039707306,"about_ca_system_score_codex":0.0005890468,"about_ca_system_score_gemma":0.0010719447,"threshold_uncertainty_score":0.0132834315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018415079,0.0057300488,0.88092035,0.015936844,0.00026016703,0.00007847599,0.0005302505,0.00037639603,0.077752374],"genre_scores_gemma":[0.6350581,0.0046033184,0.34279224,0.001211718,0.0005989687,0.0005716525,0.00090022286,0.00021500315,0.014048663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766964,0.0011822048,0.00015212671,0.00036417195,0.0004722404,0.00015962611],"domain_scores_gemma":[0.99697506,0.0018185652,0.00015786421,0.00067294424,0.00026750547,0.000108014174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032654966,0.0007982209,0.00095662795,0.0013705675,0.0011678865,0.005626617,0.001962856,0.0019652862,0.006011688],"category_scores_gemma":[0.0075431955,0.0004866215,0.0018984835,0.0020151467,0.0071999687,0.008610556,0.0031137797,0.003055884,0.00084528123],"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.000002547798,0.0000022210552,0.00003129316,0.000020069494,0.000005417283,0.000009817686,0.00008410396,0.0042892736,0.00002823647,0.9935411,0.00035497203,0.0016308512],"study_design_scores_gemma":[0.0000023427383,0.0000013778448,0.000015574102,0.00000882537,0.0000021750925,0.000006176892,0.000020340527,0.012162745,0.000021053602,0.9851966,0.0025603657,0.0000023816742],"about_ca_topic_score_codex":0.005413815,"about_ca_topic_score_gemma":0.004382601,"teacher_disagreement_score":0.006011688,"about_ca_system_score_codex":0.0032865098,"about_ca_system_score_gemma":0.0017843617,"threshold_uncertainty_score":0.023845434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2305324,0.0001972515,0.75660735,0.00058041554,0.00007072338,0.00034131334,0.00010651805,0.0013782285,0.0101858275],"genre_scores_gemma":[0.5780514,0.00018867601,0.41822076,0.000108997956,0.000015834572,0.00017784917,0.00011179419,0.00012808322,0.0029966936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992434,0.00032550583,0.000033514785,0.00014639746,0.00014242582,0.00010876068],"domain_scores_gemma":[0.9985273,0.0008964275,0.0001223239,0.000183524,0.00014644735,0.00012392715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011754155,0.0007346982,0.00040097232,0.0003303076,0.0007734207,0.0009143301,0.0013717376,0.0011161083,0.00275784],"category_scores_gemma":[0.003845531,0.00039473549,0.00060734205,0.0004370877,0.0010322335,0.001029879,0.001261664,0.0008844302,0.00036399497],"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.0002899397,0.000291285,0.0018855936,0.00018748143,0.000040555136,0.00038070753,0.0010636945,0.8899295,0.0057544718,0.014353064,0.001337676,0.08448612],"study_design_scores_gemma":[0.00006208935,0.00022535051,0.00040305755,0.000016890122,0.000023670296,0.000064563195,0.0005279893,0.9820578,0.004745679,0.007096956,0.0047577145,0.000018255543],"about_ca_topic_score_codex":0.019202046,"about_ca_topic_score_gemma":0.019533448,"teacher_disagreement_score":0.019202046,"about_ca_system_score_codex":0.0013735121,"about_ca_system_score_gemma":0.0022162695,"threshold_uncertainty_score":0.03818059},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043565724,0.098592214,0.6723908,0.03647937,0.04403886,0.000460196,0.0015523367,0.0026333523,0.13949624],"genre_scores_gemma":[0.08329999,0.08293954,0.5908257,0.012202553,0.033593938,0.0013144403,0.005064899,0.002687126,0.18807185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99181765,0.0024005633,0.0006956344,0.0012251042,0.0031249723,0.0007360661],"domain_scores_gemma":[0.9920814,0.0032949136,0.00025893774,0.0015695994,0.0021335266,0.00066161674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010085491,0.0020292145,0.0026840512,0.0024825542,0.00213802,0.011110796,0.0034858552,0.0031397436,0.033192337],"category_scores_gemma":[0.016401172,0.0016423677,0.0045584673,0.0042088474,0.0032749758,0.009981826,0.006170504,0.014763689,0.0110470485],"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.0002985142,0.0001521888,0.0003264994,0.00061527913,0.00017303802,0.000121392965,0.00057219475,0.006497481,0.0017058869,0.34619167,0.39386338,0.2494824],"study_design_scores_gemma":[0.000060561953,0.00010087611,0.0003890742,0.00052187534,0.00009368968,0.00023078773,0.00014421297,0.015938595,0.0013623667,0.18649091,0.7945915,0.00007560612],"about_ca_topic_score_codex":0.007207116,"about_ca_topic_score_gemma":0.007182647,"teacher_disagreement_score":0.033192337,"about_ca_system_score_codex":0.0074608447,"about_ca_system_score_gemma":0.005914738,"threshold_uncertainty_score":0.1110394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33009675,0.000198755,0.65727985,0.0009691993,0.000091433954,0.00045172774,0.0002290531,0.0005413521,0.010141919],"genre_scores_gemma":[0.6980012,0.00015718675,0.29779166,0.000106591935,0.000020354099,0.00025664584,0.00012816039,0.000057621706,0.0034805373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995491,0.00021866203,0.000018882274,0.000077111086,0.000060806593,0.0000755711],"domain_scores_gemma":[0.99871814,0.0008354873,0.0000933182,0.00010342641,0.00011451712,0.00013512163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010559467,0.0005058508,0.0003918953,0.00023432722,0.00076953456,0.0007596529,0.0008538581,0.0008804863,0.004082682],"category_scores_gemma":[0.003142201,0.00023028615,0.0005296188,0.00043021102,0.00079478,0.0005705655,0.0011280398,0.0007168808,0.00032020424],"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.000276077,0.00024852416,0.0014181772,0.00011290354,0.00003132549,0.0006046615,0.0004666247,0.93690807,0.003507459,0.009959769,0.001713231,0.04475322],"study_design_scores_gemma":[0.00005152649,0.0001384374,0.00041566428,0.000010653048,0.000014186174,0.00005241514,0.0004006381,0.9872829,0.0024266765,0.0068390723,0.0023538794,0.000013983323],"about_ca_topic_score_codex":0.027832959,"about_ca_topic_score_gemma":0.027842836,"teacher_disagreement_score":0.027832959,"about_ca_system_score_codex":0.00096618064,"about_ca_system_score_gemma":0.002001577,"threshold_uncertainty_score":0.0553419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015313688,0.0023014103,0.9300957,0.008114364,0.00044429454,0.00013276226,0.00052865484,0.0012524765,0.041816678],"genre_scores_gemma":[0.3421063,0.0030280002,0.6352209,0.0026740388,0.00088505814,0.00030226065,0.0018199511,0.0012263969,0.012737059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98573005,0.005991568,0.001217254,0.0019858081,0.0040657986,0.0010095442],"domain_scores_gemma":[0.96134466,0.03088425,0.0006873202,0.0047201985,0.0015731714,0.00079050177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012672005,0.0016211554,0.0021002295,0.0026443829,0.002794156,0.011309221,0.007443664,0.0041157496,0.012654311],"category_scores_gemma":[0.044975616,0.0035859155,0.004591119,0.0028726496,0.010704352,0.046900257,0.013758687,0.014882883,0.0020073308],"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.00007385359,0.00003063279,0.0001954673,0.00023021949,0.00004580599,0.00013901082,0.0008001111,0.0070305476,0.00062198547,0.9578042,0.004238245,0.028790064],"study_design_scores_gemma":[0.000014591736,0.0000070062074,0.000040729443,0.00009300054,0.000025493255,0.000046637568,0.00013821523,0.015680654,0.0006755404,0.97494704,0.008314386,0.000016870594],"about_ca_topic_score_codex":0.0047922777,"about_ca_topic_score_gemma":0.004607995,"teacher_disagreement_score":0.012672005,"about_ca_system_score_codex":0.0035113497,"about_ca_system_score_gemma":0.0024127054,"threshold_uncertainty_score":0.06701678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03923521,0.00009764187,0.9474414,0.00014763969,0.000021486947,0.00006887137,0.000053489908,0.0002022984,0.012731962],"genre_scores_gemma":[0.7082669,0.0001810906,0.2800206,0.0001697089,0.000058751997,0.00013697923,0.00016995978,0.00033010214,0.010665757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989982,0.00022016777,0.00004894654,0.00021513939,0.00036045222,0.00015704488],"domain_scores_gemma":[0.9978143,0.0007151409,0.00018782257,0.00077535765,0.00039742934,0.00010999921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016165167,0.00044956952,0.0005384635,0.00087305903,0.0010343608,0.0015396101,0.002083504,0.00076248933,0.0044988627],"category_scores_gemma":[0.0031298152,0.00035203097,0.001321644,0.0009995017,0.0019747843,0.0041142036,0.002217363,0.0018048907,0.000542233],"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.00004419254,0.000022314867,0.0008566168,0.000049767157,0.000013034146,0.0005093392,0.00034966719,0.024118464,0.0049446546,0.9521743,0.00045535163,0.016462335],"study_design_scores_gemma":[0.000021812255,0.00009182671,0.0010105588,0.000034516885,0.000074160846,0.0005562037,0.0002632965,0.38503575,0.014652501,0.58067036,0.01754276,0.000046201123],"about_ca_topic_score_codex":0.002332611,"about_ca_topic_score_gemma":0.0023372644,"teacher_disagreement_score":0.0044988627,"about_ca_system_score_codex":0.0013754645,"about_ca_system_score_gemma":0.001024623,"threshold_uncertainty_score":0.015050232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57733035,0.0037893995,0.35217834,0.015062788,0.00074039534,0.0007505344,0.01121327,0.004645352,0.034289643],"genre_scores_gemma":[0.90408987,0.0013337657,0.070106685,0.002632464,0.000708079,0.0007152392,0.007956339,0.0011285462,0.011329001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994395,0.0011548529,0.00038495037,0.0018403335,0.0011011,0.0011238205],"domain_scores_gemma":[0.93504685,0.055362795,0.0028739497,0.003995864,0.0014597793,0.0012608644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038917696,0.0018029013,0.0032548374,0.0014953968,0.0022381586,0.004323003,0.0047466503,0.0037757652,0.014995571],"category_scores_gemma":[0.051528923,0.0016388405,0.0027558554,0.003249098,0.003506553,0.01041736,0.0024879447,0.005251914,0.0016287077],"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.0027176347,0.0008748096,0.008922147,0.0016035346,0.00056710315,0.001418716,0.00042260968,0.49262068,0.004577401,0.35772148,0.052710734,0.07584325],"study_design_scores_gemma":[0.00045648718,0.00011094188,0.0017111462,0.00011670412,0.00008227291,0.0007878959,0.00017592542,0.41248304,0.0016915075,0.57907,0.003248647,0.000065435735],"about_ca_topic_score_codex":0.0073316405,"about_ca_topic_score_gemma":0.010629083,"teacher_disagreement_score":0.014995571,"about_ca_system_score_codex":0.0037802695,"about_ca_system_score_gemma":0.003089344,"threshold_uncertainty_score":0.050165176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022249602,0.00015141304,0.97337276,0.0003002336,0.000021108515,0.000093251205,0.00075736636,0.00033461774,0.0027196254],"genre_scores_gemma":[0.40318403,0.0004713513,0.59107995,0.00021615936,0.000049169073,0.000367014,0.0018270158,0.00011441882,0.002690818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981616,0.0008222198,0.00012640489,0.0003103349,0.00043210687,0.00014745397],"domain_scores_gemma":[0.9963864,0.0025304304,0.00032380904,0.0003720006,0.00027692312,0.00011052713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021357993,0.00091803266,0.00070721866,0.00089930504,0.00054409995,0.0019357372,0.001397611,0.0009842353,0.003903711],"category_scores_gemma":[0.007765124,0.00056304253,0.0011922534,0.0015447667,0.00094725617,0.003438014,0.001936975,0.0016430864,0.00031426415],"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.00016077927,0.00006839671,0.0008309198,0.00023006112,0.00006846001,0.00027046032,0.0001389327,0.80500394,0.0020510454,0.14676884,0.001985059,0.04242306],"study_design_scores_gemma":[0.000022997367,0.000018383056,0.00011280571,0.000018590705,0.000015625903,0.00006577822,0.000037546877,0.8935735,0.0010580984,0.103125855,0.0019405189,0.000010252858],"about_ca_topic_score_codex":0.006981215,"about_ca_topic_score_gemma":0.013207433,"teacher_disagreement_score":0.006981215,"about_ca_system_score_codex":0.0013908474,"about_ca_system_score_gemma":0.0018511246,"threshold_uncertainty_score":0.0138812065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0699889,0.00033441366,0.9235207,0.0007454835,0.000153273,0.000197792,0.00064197136,0.0010316612,0.0033858076],"genre_scores_gemma":[0.54569024,0.0001641807,0.45110297,0.00014597076,0.00017173825,0.00028583067,0.00079895,0.0003007498,0.0013393881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98431087,0.006694819,0.001473628,0.0014620771,0.0049746097,0.0010840101],"domain_scores_gemma":[0.9052797,0.07053052,0.0059092557,0.009676014,0.005751059,0.0028534392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01064006,0.0016364797,0.002034087,0.006262055,0.0017261229,0.0053279935,0.0032321664,0.001681234,0.0038355484],"category_scores_gemma":[0.076672696,0.0013075822,0.0015838457,0.0065808534,0.0032107576,0.014770572,0.004710489,0.0052866023,0.00049050705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015122974,0.000609283,0.013783894,0.0005638457,0.00028006776,0.0003231332,0.00077465596,0.2522391,0.0032618744,0.4560346,0.0057995846,0.26481766],"study_design_scores_gemma":[0.000060923827,0.0000872205,0.0005894793,0.000059377657,0.00005575143,0.00008177052,0.00016049852,0.6985572,0.002294211,0.29603305,0.0019702993,0.0000501833],"about_ca_topic_score_codex":0.004455815,"about_ca_topic_score_gemma":0.0070524737,"teacher_disagreement_score":0.01064006,"about_ca_system_score_codex":0.0016554884,"about_ca_system_score_gemma":0.0032982484,"threshold_uncertainty_score":0.05627066},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09873224,0.016674278,0.14893001,0.009447478,0.004256544,0.002557447,0.3667576,0.11717834,0.23546617],"genre_scores_gemma":[0.11844552,0.005023957,0.26469347,0.0028517826,0.0003843008,0.0021204555,0.5598631,0.020585801,0.026031654],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933756,0.0023830384,0.0006657663,0.00074012286,0.0021373655,0.00069808593],"domain_scores_gemma":[0.9890583,0.0049344082,0.0004137345,0.0019263779,0.0032494438,0.00041769983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055411076,0.003915476,0.0012931057,0.0038984704,0.0011490767,0.003359352,0.0047548185,0.0028567961,0.03848152],"category_scores_gemma":[0.026010737,0.0014413862,0.001883902,0.0070003746,0.00084484526,0.0037991127,0.0019548063,0.0033868882,0.013842257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009897418,0.00082467706,0.0010582098,0.002640121,0.00022016998,0.00014398345,0.00007281335,0.06487906,0.0015183265,0.010059025,0.8283129,0.08928095],"study_design_scores_gemma":[0.0037693423,0.0010069128,0.0033879578,0.0015571769,0.00042095492,0.0006133187,0.00041560215,0.4400514,0.024735859,0.039250094,0.48457238,0.00021898303],"about_ca_topic_score_codex":0.01330914,"about_ca_topic_score_gemma":0.02477744,"teacher_disagreement_score":0.03848152,"about_ca_system_score_codex":0.0030440136,"about_ca_system_score_gemma":0.0052116616,"threshold_uncertainty_score":0.12873346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004189086,0.00028499114,0.9744504,0.0002861535,0.000095257994,0.00014160572,0.00039067212,0.001836399,0.018325463],"genre_scores_gemma":[0.15133207,0.0005650685,0.82931006,0.00040102654,0.00009430854,0.0005666748,0.0014924682,0.00085907645,0.015379174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990006,0.00019941831,0.00006236495,0.00023853002,0.00035706302,0.00014205079],"domain_scores_gemma":[0.9989176,0.00053079176,0.00006607139,0.00016994668,0.00025220445,0.000063367406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085637416,0.0010598571,0.0011764157,0.0010214205,0.0005850075,0.0017581936,0.0031072104,0.0014492997,0.016374331],"category_scores_gemma":[0.0034478828,0.0005534025,0.00117019,0.001331026,0.0007777424,0.0019054236,0.0026439554,0.0019340401,0.0031057084],"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.00020701197,0.00015744542,0.00094845577,0.00065706414,0.000119906384,0.0005189209,0.00019520723,0.51970774,0.0067534465,0.24041755,0.020627733,0.20968948],"study_design_scores_gemma":[0.00004805206,0.000026494234,0.000056867226,0.000028515473,0.000026110183,0.000119488875,0.00003677171,0.9474145,0.0027120253,0.031849887,0.017667592,0.000013686336],"about_ca_topic_score_codex":0.0039824536,"about_ca_topic_score_gemma":0.0064142393,"teacher_disagreement_score":0.016374331,"about_ca_system_score_codex":0.0011234018,"about_ca_system_score_gemma":0.002650967,"threshold_uncertainty_score":0.054777563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019377867,0.00057469285,0.8203323,0.0012540583,0.0002706829,0.000096748576,0.00023105444,0.0012791734,0.17402346],"genre_scores_gemma":[0.12584405,0.001921215,0.76776606,0.00190519,0.00077968766,0.0005414224,0.0012151998,0.0019657703,0.09806143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.00045737703,0.000059399765,0.00034134515,0.0006649804,0.00011784147],"domain_scores_gemma":[0.99728835,0.0017250577,0.000071409995,0.0005010894,0.0003522524,0.00006184973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016889024,0.0008040595,0.00056786375,0.0010361879,0.0013798599,0.0027234217,0.0026381062,0.00068793964,0.032674685],"category_scores_gemma":[0.006977444,0.0007684749,0.00092388847,0.0014577438,0.0032038626,0.005030769,0.0031492542,0.0040546614,0.009449166],"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.000025373967,0.000030662417,0.000073331605,0.00011404775,0.000008582188,0.000035745375,0.00016931175,0.0016272794,0.00091191346,0.87526894,0.014599608,0.10713518],"study_design_scores_gemma":[0.0000130959415,0.0000084923395,0.000058638223,0.000063970314,0.000009864739,0.000053304175,0.00003403132,0.009132019,0.0030181569,0.8803264,0.10726804,0.00001399181],"about_ca_topic_score_codex":0.0015767727,"about_ca_topic_score_gemma":0.0017578839,"teacher_disagreement_score":0.032674685,"about_ca_system_score_codex":0.0016251536,"about_ca_system_score_gemma":0.0019361981,"threshold_uncertainty_score":0.109307766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035430916,0.0005322319,0.96066296,0.00027321672,0.000037645,0.00010120026,0.000037968195,0.00038608746,0.0025377586],"genre_scores_gemma":[0.36678937,0.00036910074,0.62973046,0.00011689041,0.000032871747,0.00015719263,0.00011557587,0.00016772225,0.002520742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726725,0.0012715046,0.0001674168,0.0003971845,0.00067306316,0.0002235994],"domain_scores_gemma":[0.99173987,0.006124486,0.0005762024,0.0007811193,0.0005436024,0.00023470235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038866762,0.00074431446,0.0011863715,0.00088547915,0.0012173644,0.001463046,0.0016591019,0.0008664024,0.0018315432],"category_scores_gemma":[0.012102061,0.00058800745,0.0007585359,0.001622542,0.0017947971,0.0029079197,0.0017138794,0.0019149939,0.00023330908],"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.00021463222,0.000121377474,0.0009990413,0.00015282654,0.00004647098,0.000084155465,0.00034687374,0.8130162,0.002183765,0.07246598,0.0010473032,0.10932143],"study_design_scores_gemma":[0.00006116939,0.00006425585,0.00013687562,0.000016197922,0.00002130298,0.00004024101,0.00009578816,0.94212323,0.002048026,0.05320066,0.0021771612,0.000015007341],"about_ca_topic_score_codex":0.009515198,"about_ca_topic_score_gemma":0.011870285,"teacher_disagreement_score":0.009515198,"about_ca_system_score_codex":0.0016647808,"about_ca_system_score_gemma":0.002757343,"threshold_uncertainty_score":0.0205549},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09343936,0.002526367,0.883769,0.0016409795,0.00020732758,0.0002456944,0.0002743074,0.0020166808,0.015880222],"genre_scores_gemma":[0.46560863,0.0009391895,0.5297212,0.00041770228,0.00007802027,0.00023924756,0.00036884073,0.0005928011,0.00203432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971252,0.0013643324,0.00013651872,0.00043447464,0.00067249325,0.00026690963],"domain_scores_gemma":[0.9852705,0.011815659,0.00043637835,0.0013273,0.0008173722,0.0003328006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014354,0.001117979,0.0007923367,0.0010710092,0.0006854163,0.0019972012,0.0018236797,0.0011189667,0.0031678365],"category_scores_gemma":[0.019111661,0.0005931284,0.00096324127,0.0021480566,0.0014566934,0.0032303021,0.0018865786,0.0031278415,0.00030636982],"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.00028965445,0.00018551077,0.0015401752,0.00038517086,0.000111212925,0.00007195822,0.00020963224,0.80845124,0.0020926143,0.03643868,0.0021849643,0.14803922],"study_design_scores_gemma":[0.000033268465,0.00009891077,0.00027781245,0.000031423,0.00003614138,0.000024852661,0.000078923316,0.97153676,0.001647159,0.023350775,0.0028669063,0.000016998547],"about_ca_topic_score_codex":0.015272856,"about_ca_topic_score_gemma":0.02539518,"teacher_disagreement_score":0.015272856,"about_ca_system_score_codex":0.0018641354,"about_ca_system_score_gemma":0.0041817874,"threshold_uncertainty_score":0.03036791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022875529,0.0012694005,0.9318381,0.0004985964,0.00047890094,0.00014992253,0.0003363402,0.0077237976,0.034829322],"genre_scores_gemma":[0.19292477,0.0005798972,0.77721447,0.00032460364,0.00019905133,0.0002632594,0.0013539065,0.00122403,0.02591599],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843043,0.00023991743,0.0000685653,0.00027591633,0.00074655586,0.00023864546],"domain_scores_gemma":[0.9976472,0.001151439,0.0001269199,0.000555905,0.00039031106,0.00012822899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094301754,0.0013326101,0.0017432692,0.0020995191,0.0010175344,0.0020457911,0.0038527423,0.001630818,0.020022225],"category_scores_gemma":[0.006318818,0.00083733647,0.0011696891,0.0038200154,0.0008724773,0.0032790408,0.0029815587,0.002447273,0.004486265],"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.00047066,0.0003075334,0.00056239613,0.00036263478,0.000077329474,0.000069903675,0.00010853122,0.12594534,0.010070754,0.10743195,0.038724996,0.71586806],"study_design_scores_gemma":[0.00006605833,0.00008420152,0.00022302492,0.000048879512,0.000038298702,0.00010447646,0.000026566966,0.91537297,0.0047014295,0.06887327,0.010437837,0.000022907965],"about_ca_topic_score_codex":0.004899662,"about_ca_topic_score_gemma":0.007325077,"teacher_disagreement_score":0.020022225,"about_ca_system_score_codex":0.0016573833,"about_ca_system_score_gemma":0.0019036008,"threshold_uncertainty_score":0.06698096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009648814,0.00019788404,0.91705227,0.00039512888,0.0005580339,0.00029371507,0.0018721496,0.0075909216,0.062391125],"genre_scores_gemma":[0.17083952,0.0005827271,0.7711291,0.0005372103,0.00016424131,0.00062315405,0.007896085,0.0044122734,0.043815788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933225,0.000071153634,0.000044150474,0.00015674063,0.00031050987,0.000085135216],"domain_scores_gemma":[0.9995547,0.00010447187,0.000021823253,0.00014154334,0.00014613545,0.000031338957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044992918,0.00054679665,0.00040009624,0.000961451,0.0006459398,0.001605566,0.0013285669,0.0004276832,0.012960695],"category_scores_gemma":[0.0015791203,0.00034087477,0.0011240585,0.0011395568,0.00064754265,0.0019636415,0.0018659311,0.0019101796,0.0037699614],"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.0002793259,0.0002812572,0.00069386704,0.000664253,0.000073676354,0.0006978249,0.0002672147,0.029937448,0.017207673,0.5030745,0.038429596,0.40839323],"study_design_scores_gemma":[0.00009480375,0.00008299426,0.00067675207,0.00013983373,0.000119119264,0.00084690476,0.00018382752,0.1395454,0.037673414,0.47138277,0.34919664,0.000057578363],"about_ca_topic_score_codex":0.003256623,"about_ca_topic_score_gemma":0.0035146633,"teacher_disagreement_score":0.012960695,"about_ca_system_score_codex":0.00085159973,"about_ca_system_score_gemma":0.0016772097,"threshold_uncertainty_score":0.04335785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003047994,0.00028346718,0.9454771,0.0012977911,0.00053991826,0.00032939643,0.0009999516,0.012463477,0.035560872],"genre_scores_gemma":[0.03590629,0.00023049384,0.9304308,0.0007934988,0.00025936234,0.0003623116,0.0022280049,0.0021007587,0.027688464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692947,0.00051516434,0.00018618698,0.00090861943,0.0011301661,0.00033036675],"domain_scores_gemma":[0.99512154,0.0021280104,0.00012052618,0.0018401821,0.00065278116,0.00013694158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024109993,0.0034780125,0.002242692,0.0028518927,0.003203715,0.0052078385,0.0073024146,0.0032101949,0.10326103],"category_scores_gemma":[0.009651046,0.001681859,0.005948962,0.0029358002,0.0021090263,0.009850261,0.005792805,0.006717998,0.030241145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006495136,0.00040999157,0.0005717061,0.00058796274,0.0001777237,0.00014680499,0.00012464503,0.016630186,0.009209064,0.21718104,0.10477993,0.6495314],"study_design_scores_gemma":[0.0003564529,0.00008125583,0.0006650816,0.0002050176,0.00021250082,0.00029027433,0.00014930988,0.39651614,0.011605526,0.5197875,0.07002865,0.00010224591],"about_ca_topic_score_codex":0.007836705,"about_ca_topic_score_gemma":0.015246116,"teacher_disagreement_score":0.10326103,"about_ca_system_score_codex":0.0034548268,"about_ca_system_score_gemma":0.0041960347,"threshold_uncertainty_score":0.34544253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117342,0.0059756194,0.82687443,0.0029030587,0.00020362792,0.0004110582,0.000459636,0.0023822759,0.029616863],"genre_scores_gemma":[0.59448344,0.0027773974,0.39531937,0.0010327193,0.00026039168,0.00027691416,0.001344102,0.00036957202,0.0041360864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954464,0.0025027483,0.0001755115,0.0005747736,0.001059311,0.00024119832],"domain_scores_gemma":[0.9697341,0.02627543,0.00038968833,0.001751657,0.0014959614,0.00035315566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055974736,0.00082564884,0.0009727942,0.00079325994,0.00056117354,0.0013180942,0.0019781797,0.0011179983,0.008249008],"category_scores_gemma":[0.03168604,0.00047108904,0.0010930242,0.0015447248,0.0015649393,0.0028065105,0.001994594,0.002767688,0.0006896523],"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.00058181485,0.000784582,0.0051078857,0.0010064476,0.00021686062,0.00007401526,0.0002603355,0.6125575,0.0054289014,0.05558055,0.006704089,0.31169713],"study_design_scores_gemma":[0.00011043206,0.00038238292,0.00063138874,0.000060472143,0.000043885848,0.00006293652,0.00006516362,0.9500695,0.0039802813,0.039145816,0.005434058,0.000013757688],"about_ca_topic_score_codex":0.0026951188,"about_ca_topic_score_gemma":0.005531549,"teacher_disagreement_score":0.008249008,"about_ca_system_score_codex":0.0011622172,"about_ca_system_score_gemma":0.0014626476,"threshold_uncertainty_score":0.029602587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03073608,0.0007229021,0.96054965,0.00053848635,0.00011980435,0.00009272925,0.000083833205,0.00076005654,0.0063965283],"genre_scores_gemma":[0.8940402,0.00043364326,0.10128073,0.00032391644,0.00010770306,0.00013796914,0.00011624461,0.00004884688,0.0035106952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00015994882,0.00003317608,0.00015561488,0.00016919631,0.0001730444],"domain_scores_gemma":[0.99873024,0.00066891254,0.00015101285,0.00007975916,0.0003038213,0.000066339184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011476311,0.0007824871,0.0010856283,0.0005490679,0.00057549006,0.0011217014,0.0017673974,0.00093657995,0.0020022506],"category_scores_gemma":[0.0024893617,0.00030595766,0.00040161327,0.0008212161,0.00068100105,0.0011770912,0.0007585088,0.0011229876,0.00036246964],"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.000066626824,0.00010885533,0.0003086004,0.00004826116,0.000027987653,0.000042078558,0.000024029823,0.9360965,0.0012049446,0.005341545,0.0015242818,0.05520627],"study_design_scores_gemma":[0.000004012826,0.000009607771,0.000033010354,0.00000159038,0.0000029603316,0.0000041086423,0.0000029938049,0.9975694,0.00023019452,0.0019771254,0.000162764,0.0000022608986],"about_ca_topic_score_codex":0.009710622,"about_ca_topic_score_gemma":0.009143777,"teacher_disagreement_score":0.009710622,"about_ca_system_score_codex":0.0014848496,"about_ca_system_score_gemma":0.0018668507,"threshold_uncertainty_score":0.01930815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016975457,0.0017189821,0.9138232,0.0012103458,0.0015647227,0.00025773386,0.00061335205,0.0033257033,0.06051054],"genre_scores_gemma":[0.22541587,0.001145341,0.7298866,0.0009067853,0.0008810066,0.00029847104,0.0014052811,0.0018956502,0.038164966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770916,0.0006297589,0.00009523429,0.00049845735,0.0007661049,0.00030128172],"domain_scores_gemma":[0.9906598,0.005117702,0.00027096109,0.002256753,0.0012444677,0.0004503582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001481932,0.0016360763,0.0017406027,0.0031093971,0.0018979089,0.0024936611,0.0045141233,0.0020160463,0.036958713],"category_scores_gemma":[0.015035939,0.00085252407,0.0012039887,0.005475142,0.0015718477,0.0035646153,0.004063982,0.0046178563,0.006516674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044927976,0.0005725862,0.0007147484,0.00066399184,0.00011118641,0.00013231949,0.00024079609,0.17613831,0.006239524,0.3011037,0.052743655,0.46088988],"study_design_scores_gemma":[0.00024394214,0.00011824739,0.00031758135,0.00011136954,0.0001037908,0.00014240103,0.00012520062,0.66861737,0.0036498893,0.28994745,0.03656951,0.000053227464],"about_ca_topic_score_codex":0.0059749186,"about_ca_topic_score_gemma":0.016396072,"teacher_disagreement_score":0.036958713,"about_ca_system_score_codex":0.0027185436,"about_ca_system_score_gemma":0.0036270632,"threshold_uncertainty_score":0.123639226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33329698,0.0014664476,0.6554737,0.0013261428,0.0000858162,0.00015354241,0.00019587218,0.0010007068,0.0070007485],"genre_scores_gemma":[0.9030861,0.00032095134,0.09383432,0.00020250256,0.000041024996,0.00021669382,0.00016283724,0.00022781223,0.0019077805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988998,0.00039037294,0.00004516516,0.00020351351,0.00025665082,0.00020453619],"domain_scores_gemma":[0.98536575,0.012025097,0.00082331116,0.0010428702,0.00036182776,0.0003811146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027835537,0.0007409143,0.0012873766,0.0009763202,0.0007144218,0.0011800161,0.0013012455,0.0012405809,0.0032396966],"category_scores_gemma":[0.026228702,0.00051328354,0.0007584452,0.0008148899,0.0018072159,0.0021873417,0.0012538986,0.0016699259,0.00029881502],"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.00033693077,0.0001487891,0.0041750493,0.00018841344,0.00007825142,0.00012612103,0.00014981227,0.91903716,0.002774697,0.0355513,0.0018945292,0.03553901],"study_design_scores_gemma":[0.000036618905,0.000073865216,0.00063677685,0.000023914934,0.000013045858,0.000045080917,0.000032896554,0.9709698,0.000670332,0.02709251,0.00039444273,0.0000107252645],"about_ca_topic_score_codex":0.0024748482,"about_ca_topic_score_gemma":0.0034326056,"teacher_disagreement_score":0.0032396966,"about_ca_system_score_codex":0.0012975297,"about_ca_system_score_gemma":0.0015475316,"threshold_uncertainty_score":0.014720976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007387542,0.0005546054,0.9686177,0.00070359535,0.00030108434,0.0005469386,0.0006773122,0.0038715194,0.017339638],"genre_scores_gemma":[0.026911916,0.00029656428,0.9623188,0.00019149091,0.00011404844,0.0005427405,0.0012975279,0.0009243013,0.0074025663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985532,0.00028611821,0.00009382935,0.00027635082,0.0005682873,0.0002222357],"domain_scores_gemma":[0.997113,0.0018801591,0.000105418796,0.00038573536,0.00036955663,0.00014609398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015405201,0.0021657848,0.0025541831,0.0026079104,0.0021327306,0.0030168635,0.0046879747,0.0029878588,0.03427707],"category_scores_gemma":[0.006869182,0.001187793,0.002760573,0.005606218,0.0012701735,0.0050791046,0.004523001,0.004941794,0.008674965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033164714,0.0005152224,0.0004611296,0.00062635174,0.000095560215,0.00015995861,0.00028859382,0.09749456,0.0045386166,0.064906776,0.09030762,0.74027395],"study_design_scores_gemma":[0.00036457728,0.00015307344,0.00036144635,0.000102182676,0.00006396105,0.00022947752,0.00021975012,0.8027505,0.0025751258,0.1687553,0.024377959,0.00004666709],"about_ca_topic_score_codex":0.0069687995,"about_ca_topic_score_gemma":0.013969556,"teacher_disagreement_score":0.03427707,"about_ca_system_score_codex":0.0020443478,"about_ca_system_score_gemma":0.0039970744,"threshold_uncertainty_score":0.11466825},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549278,0.0043240143,0.024254203,0.001319689,0.00029165685,0.000059164126,0.001021669,0.005800232,0.008001506],"genre_scores_gemma":[0.96460694,0.00058559084,0.031303972,0.00013060479,0.00010276316,0.000043913908,0.0011462207,0.0007596432,0.0013203176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99132735,0.0034369226,0.00086425565,0.0015277832,0.0018903327,0.0009534259],"domain_scores_gemma":[0.84626645,0.13425022,0.004715656,0.008434515,0.0044132587,0.0019199284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008217504,0.0012900069,0.0011161541,0.001528716,0.0010839216,0.0028252942,0.0023377968,0.0018286757,0.007048114],"category_scores_gemma":[0.079666615,0.0009878126,0.0007334596,0.0034233823,0.001076636,0.008217062,0.0021657217,0.0019369159,0.0014589833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.021896537,0.0023283141,0.029057663,0.0018558921,0.0008866163,0.00020417977,0.00080027105,0.28382275,0.05743322,0.011851492,0.012288558,0.5775745],"study_design_scores_gemma":[0.0011325823,0.008984727,0.019360494,0.00023259978,0.0012381653,0.0005332242,0.0017034371,0.81043786,0.13152026,0.018808676,0.005879069,0.00016892163],"about_ca_topic_score_codex":0.0014400306,"about_ca_topic_score_gemma":0.0026085095,"teacher_disagreement_score":0.008217504,"about_ca_system_score_codex":0.0010423026,"about_ca_system_score_gemma":0.0023235925,"threshold_uncertainty_score":0.04345882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033228457,0.0010005634,0.95802194,0.00076196704,0.00007400682,0.00029333276,0.00035291514,0.00075789844,0.0055088773],"genre_scores_gemma":[0.2651659,0.00047239632,0.72996163,0.0003451764,0.00009303233,0.00069556,0.00059441203,0.00030304838,0.0023688541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974464,0.001538943,0.000096667136,0.0003090099,0.0003879678,0.00022095023],"domain_scores_gemma":[0.9848392,0.013178797,0.0009990061,0.00026061723,0.0005094331,0.00021306814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005355061,0.0021270036,0.0019930473,0.0020379238,0.0007858269,0.0022624054,0.0018473178,0.0016590883,0.004072081],"category_scores_gemma":[0.014755874,0.0014236837,0.0013686676,0.0020860666,0.0014845068,0.0019169443,0.001602475,0.0025312894,0.0005077179],"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.00011468153,0.00010396144,0.001219121,0.0002791433,0.00006544996,0.00009015322,0.00007240437,0.9409475,0.0004371142,0.022194175,0.0014166621,0.033059746],"study_design_scores_gemma":[0.000015561764,0.000017223743,0.000053156637,0.000017881614,0.000005768362,0.000009655914,0.00001311387,0.98901105,0.00015691457,0.010351548,0.0003449624,0.0000030972315],"about_ca_topic_score_codex":0.0045709386,"about_ca_topic_score_gemma":0.00650717,"teacher_disagreement_score":0.005355061,"about_ca_system_score_codex":0.0015822306,"about_ca_system_score_gemma":0.002242471,"threshold_uncertainty_score":0.02832061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002769107,0.0013022885,0.96023244,0.0013986601,0.00017587737,0.000092945345,0.00030326494,0.0005293639,0.033196088],"genre_scores_gemma":[0.21116444,0.0017988763,0.76112413,0.0007853106,0.0006137102,0.00030566799,0.0006754671,0.00026777206,0.02326457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998483,0.0004928095,0.00013614623,0.0002581104,0.00053082354,0.000099046316],"domain_scores_gemma":[0.9986546,0.0007158162,0.000057614972,0.0002278347,0.00026599894,0.00007816834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024643207,0.0006455751,0.0007816982,0.0020073336,0.0015146984,0.0040526306,0.002336205,0.0014087228,0.011303464],"category_scores_gemma":[0.005039842,0.0008851084,0.0020087843,0.0024005852,0.0039810976,0.006933334,0.0033543825,0.0035006662,0.0018142194],"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.000019561885,0.00001899007,0.000037925864,0.00012474765,0.0000130948465,0.00004829932,0.00019427182,0.002499808,0.0008963334,0.968122,0.003429234,0.024595661],"study_design_scores_gemma":[0.000007894883,0.000007311866,0.000050791885,0.00003090415,0.000013827043,0.000045145476,0.00004078017,0.013016781,0.00049747084,0.9731609,0.013116038,0.000012281817],"about_ca_topic_score_codex":0.003111828,"about_ca_topic_score_gemma":0.0030835075,"teacher_disagreement_score":0.011303464,"about_ca_system_score_codex":0.0023069475,"about_ca_system_score_gemma":0.0012197637,"threshold_uncertainty_score":0.037813842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055602947,0.00066340895,0.99054,0.00022661599,0.00007716171,0.000070519476,0.00006928535,0.000305271,0.0024874173],"genre_scores_gemma":[0.109318376,0.0012561737,0.88417315,0.0002776225,0.00009140353,0.0002540055,0.0002405557,0.00012366449,0.004265056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996001,0.00010514672,0.000022406657,0.00005103909,0.00018210344,0.000039195325],"domain_scores_gemma":[0.99971384,0.00014753352,0.000038658167,0.000027612074,0.000051790317,0.000020576026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007546915,0.0007323292,0.0009896137,0.0010194193,0.00049780076,0.00077895884,0.0015199541,0.0011330654,0.0015236136],"category_scores_gemma":[0.0010219617,0.00033156932,0.0011366004,0.0011355479,0.0005682936,0.0009339819,0.000625395,0.0015202282,0.0003344233],"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.00013152449,0.0002223143,0.00095693726,0.00045268433,0.00022136353,0.0001803321,0.0001609561,0.65443903,0.022315376,0.057647143,0.0078687025,0.2554037],"study_design_scores_gemma":[0.00007483723,0.00007545534,0.00016257279,0.000021789576,0.000024066614,0.00009261528,0.000015578176,0.97783196,0.0038930885,0.008644013,0.009145862,0.000018187113],"about_ca_topic_score_codex":0.0030059703,"about_ca_topic_score_gemma":0.002920338,"teacher_disagreement_score":0.0030059703,"about_ca_system_score_codex":0.0008827329,"about_ca_system_score_gemma":0.0012506341,"threshold_uncertainty_score":0.006404698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826974,0.00070844404,0.009570971,0.00023763126,0.00005900889,0.00003069114,0.0018400578,0.0012087757,0.0036469768],"genre_scores_gemma":[0.9775262,0.00025717638,0.016181208,0.000055373934,0.000023361114,0.00003806408,0.0050249957,0.0001864708,0.0007072084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862933,0.0002955408,0.00007563201,0.00042593246,0.00035237335,0.00022123082],"domain_scores_gemma":[0.9951186,0.0029503934,0.00050011865,0.0006417769,0.0006237048,0.00016533516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171622,0.0007924088,0.00042147224,0.0010569849,0.00035962914,0.0009192637,0.0011736193,0.00064085115,0.0020057],"category_scores_gemma":[0.009021695,0.000508918,0.00063513435,0.002268468,0.0005224175,0.0011930651,0.00047432314,0.0010923237,0.00055617874],"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.00048335633,0.00016264383,0.035719022,0.00021810319,0.00015451752,0.00016281112,0.00007157895,0.9037925,0.0052859657,0.002126691,0.008378781,0.043444082],"study_design_scores_gemma":[0.00003999852,0.00020462618,0.014876895,0.000017333676,0.000033630393,0.000051032333,0.000060423787,0.97427183,0.006707371,0.0018870402,0.0018336319,0.000016223308],"about_ca_topic_score_codex":0.006401822,"about_ca_topic_score_gemma":0.009421757,"teacher_disagreement_score":0.006401822,"about_ca_system_score_codex":0.0012403246,"about_ca_system_score_gemma":0.00083140936,"threshold_uncertainty_score":0.012729168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03778025,0.00020249713,0.94670767,0.0003756875,0.000034039465,0.00012030499,0.00037259486,0.00012604932,0.014280938],"genre_scores_gemma":[0.6153621,0.00035401472,0.37185195,0.0002490781,0.000032907683,0.0006427344,0.00072979974,0.00015110766,0.010626278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987866,0.0006130516,0.000047284055,0.0002201711,0.00018106602,0.00015183992],"domain_scores_gemma":[0.9983925,0.0011728561,0.00011864798,0.00010718206,0.00014410618,0.00006463859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018129477,0.001218964,0.0010031449,0.0005704244,0.00045547023,0.0012195511,0.0009625124,0.00089266954,0.0068076933],"category_scores_gemma":[0.0042808643,0.000501833,0.00093960675,0.0011211091,0.0008993547,0.0016767124,0.0015445688,0.0013298508,0.00039440658],"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.00013485318,0.000067894754,0.00050556083,0.00016137934,0.000058880076,0.00016627548,0.000059880924,0.8439703,0.0012523805,0.12849295,0.0016570835,0.023472575],"study_design_scores_gemma":[0.000024708057,0.000032880154,0.00012294005,0.00001665251,0.000013371227,0.000023177801,0.00002863513,0.914668,0.0005005747,0.08358246,0.0009769734,0.000009585997],"about_ca_topic_score_codex":0.004538682,"about_ca_topic_score_gemma":0.0053530117,"teacher_disagreement_score":0.0068076933,"about_ca_system_score_codex":0.0015344057,"about_ca_system_score_gemma":0.0016978614,"threshold_uncertainty_score":0.022773981},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377085,0.001486265,0.2799203,0.008780298,0.00013813717,0.00026508665,0.0032163186,0.00086206023,0.067623034],"genre_scores_gemma":[0.94067866,0.0007895992,0.042047996,0.00065800746,0.00023038042,0.0002473569,0.0015685603,0.00028662724,0.013492793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987269,0.00032421172,0.00005312834,0.00027955463,0.0003184437,0.000297793],"domain_scores_gemma":[0.9923854,0.0063593504,0.0003336069,0.00044574085,0.00023017888,0.00024562498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008596117,0.00049312884,0.0011182596,0.0006328995,0.0008432207,0.0039516836,0.0016829697,0.0012482682,0.01746944],"category_scores_gemma":[0.008507618,0.0004858044,0.000978702,0.001282306,0.0012554444,0.004837736,0.0013911978,0.0023233315,0.0008834995],"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.0007977596,0.00034855626,0.0050799907,0.00071685243,0.00015775356,0.00052883395,0.00046906527,0.30857313,0.00847477,0.5667145,0.015858492,0.09228034],"study_design_scores_gemma":[0.00011301825,0.000043622935,0.00088476704,0.000022105405,0.000036286845,0.00018340597,0.00008609955,0.38034895,0.0016024447,0.6141727,0.0024911275,0.000015569138],"about_ca_topic_score_codex":0.0030555425,"about_ca_topic_score_gemma":0.0036879126,"teacher_disagreement_score":0.01746944,"about_ca_system_score_codex":0.0021029988,"about_ca_system_score_gemma":0.0013543533,"threshold_uncertainty_score":0.058441103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009646525,0.00023037096,0.9830035,0.00022375109,0.000031823787,0.00008880135,0.00031314886,0.00021438397,0.006247685],"genre_scores_gemma":[0.37272382,0.00057289517,0.6176059,0.0003139135,0.000050376762,0.00072852126,0.000980946,0.00017897299,0.006844627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987602,0.0006005283,0.00006264647,0.00018413208,0.00026785058,0.00012466416],"domain_scores_gemma":[0.99751854,0.0019395013,0.0001492229,0.00012912256,0.0001923495,0.00007120388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020816142,0.001189659,0.0009720206,0.00085375516,0.0004945422,0.0015787248,0.0011130436,0.00096467027,0.0052859806],"category_scores_gemma":[0.006060971,0.0006692701,0.001101749,0.0015588788,0.0012080829,0.0019351341,0.0017997614,0.0016722144,0.0004033012],"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.000063266176,0.000024285559,0.00031391467,0.0001081964,0.000041897623,0.000080758706,0.000024866455,0.88662106,0.00037226762,0.090754874,0.001080164,0.020514533],"study_design_scores_gemma":[0.000021659715,0.000019654872,0.000058987483,0.00001597651,0.000009027821,0.000017398677,0.000011973181,0.92324555,0.00032194096,0.07474648,0.001524253,0.00000714248],"about_ca_topic_score_codex":0.00638685,"about_ca_topic_score_gemma":0.008641996,"teacher_disagreement_score":0.00638685,"about_ca_system_score_codex":0.0013580576,"about_ca_system_score_gemma":0.0018969967,"threshold_uncertainty_score":0.017683387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.569032,0.00034185767,0.27658853,0.0041178004,0.00021395672,0.00013367909,0.0005090729,0.00025539746,0.14880764],"genre_scores_gemma":[0.8671004,0.0003061555,0.107494764,0.0004081918,0.00008766397,0.00015672912,0.00065242173,0.00013944137,0.023654127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946374,0.00016793089,0.000025395299,0.000083231935,0.00011276724,0.00014696445],"domain_scores_gemma":[0.99912506,0.00046867828,0.00009649482,0.00010332204,0.00009293393,0.00011360558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006027794,0.00058306474,0.00052015967,0.0004609518,0.0010061034,0.0014331103,0.0010289762,0.0012751258,0.00920876],"category_scores_gemma":[0.003670388,0.00034551695,0.0009568621,0.0004556359,0.0020582862,0.0016767245,0.0017116161,0.0018117324,0.00073882693],"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.00024015606,0.00010297903,0.0013442077,0.00013856642,0.00003240014,0.0004791444,0.0005385446,0.10753005,0.0045511657,0.84395236,0.011397702,0.029692588],"study_design_scores_gemma":[0.00016311616,0.00008924707,0.00062282843,0.000066910696,0.000022099215,0.00032861484,0.0007923757,0.24245514,0.0044869357,0.7395556,0.0113782585,0.000039052273],"about_ca_topic_score_codex":0.0020766803,"about_ca_topic_score_gemma":0.0017119371,"teacher_disagreement_score":0.00920876,"about_ca_system_score_codex":0.00083148386,"about_ca_system_score_gemma":0.0007786234,"threshold_uncertainty_score":0.030806422},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013619098,0.036358334,0.7545066,0.01060698,0.019268436,0.00055567565,0.00053648825,0.0015159465,0.1630324],"genre_scores_gemma":[0.089006014,0.038099013,0.64110696,0.0032011063,0.008639163,0.00055844046,0.0027010946,0.0014890317,0.21519913],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979851,0.00074078806,0.00015128865,0.00028400868,0.00065223733,0.000186531],"domain_scores_gemma":[0.99544144,0.002292178,0.0000995128,0.0005981066,0.0012407154,0.0003279652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052836915,0.0013249258,0.0021232197,0.0012039721,0.00085782836,0.005790831,0.0022125726,0.0014598018,0.036555383],"category_scores_gemma":[0.0063546193,0.000689083,0.0014788448,0.00191135,0.0014843832,0.003667754,0.0018546741,0.0037586547,0.005769755],"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.00092091004,0.00070554676,0.00081935094,0.0010738043,0.00042921054,0.00044220084,0.00052044576,0.0123521555,0.0073900907,0.09323256,0.22622074,0.65589297],"study_design_scores_gemma":[0.00021848321,0.000357565,0.0016239855,0.0005351476,0.00030930038,0.0007967826,0.0004399035,0.15652299,0.0072750547,0.09605149,0.7357685,0.00010086075],"about_ca_topic_score_codex":0.0065254876,"about_ca_topic_score_gemma":0.0091756815,"teacher_disagreement_score":0.036555383,"about_ca_system_score_codex":0.001567135,"about_ca_system_score_gemma":0.0029316172,"threshold_uncertainty_score":0.122289956},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034117326,0.062695704,0.6218385,0.0133085195,0.0228022,0.000607499,0.0016481518,0.0016893594,0.27199826],"genre_scores_gemma":[0.040415563,0.09226258,0.575684,0.0033208728,0.013838898,0.0009386124,0.005862139,0.0031933403,0.264484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99642736,0.0012135288,0.00025229173,0.0005230314,0.0014306767,0.0001531957],"domain_scores_gemma":[0.99010676,0.0052392897,0.00023086712,0.0015136327,0.0024634635,0.00044596646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054584225,0.0015809602,0.002487301,0.0022743975,0.0011402337,0.0068784268,0.0020786745,0.0015064527,0.06944087],"category_scores_gemma":[0.010195201,0.0011091321,0.001456742,0.004476305,0.002374895,0.0037982266,0.0022008722,0.005987821,0.019603785],"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.00018453423,0.00025744535,0.0006127908,0.0010753049,0.00019157569,0.0001831972,0.00032906575,0.008957602,0.0019945498,0.1452694,0.41824952,0.4226951],"study_design_scores_gemma":[0.000053192347,0.00006579563,0.0006479561,0.0008084446,0.000080528735,0.00036591198,0.000122047044,0.028564174,0.0014003089,0.08356568,0.8842785,0.00004743676],"about_ca_topic_score_codex":0.010383168,"about_ca_topic_score_gemma":0.010354383,"teacher_disagreement_score":0.06944087,"about_ca_system_score_codex":0.002471955,"about_ca_system_score_gemma":0.00498174,"threshold_uncertainty_score":0.23230284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021611985,0.001514364,0.8136466,0.0016577955,0.0004786444,0.00016911609,0.0016007499,0.00047832562,0.15884231],"genre_scores_gemma":[0.18895209,0.0034683866,0.70604235,0.0006940349,0.00043786512,0.00037965292,0.0029490096,0.0005001178,0.096576475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910957,0.00035929933,0.00006754628,0.000110591005,0.00027649399,0.00007656238],"domain_scores_gemma":[0.9983475,0.0010684552,0.00007905565,0.00022996623,0.00019891046,0.00007620187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929916,0.0005190864,0.0006006741,0.00095963816,0.0008636453,0.0025373201,0.0008190703,0.00075102394,0.02595492],"category_scores_gemma":[0.004175537,0.00073327514,0.0005994079,0.004061987,0.0008091415,0.00531412,0.0012813812,0.0026468239,0.006372701],"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.00008805959,0.00006382804,0.00016168365,0.00031148165,0.000014444732,0.00013921609,0.00023403014,0.007639369,0.0020226664,0.8094904,0.019616624,0.16021821],"study_design_scores_gemma":[0.000019688447,0.00002621425,0.000100127225,0.000060410905,0.0000087089775,0.0002533155,0.00012207575,0.018999713,0.0011516087,0.9382164,0.04102513,0.000016560753],"about_ca_topic_score_codex":0.0006088077,"about_ca_topic_score_gemma":0.0014964532,"teacher_disagreement_score":0.02595492,"about_ca_system_score_codex":0.0007034933,"about_ca_system_score_gemma":0.00081244984,"threshold_uncertainty_score":0.086827874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02709734,0.0003589226,0.9440346,0.000512867,0.00011462397,0.000091812224,0.00026813496,0.0002454877,0.027276238],"genre_scores_gemma":[0.4211689,0.00072266534,0.55239666,0.00043901088,0.00017129011,0.00034940164,0.00093213236,0.0008237599,0.022996247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975253,0.00071154704,0.0001281065,0.0004986284,0.00073248777,0.00040396609],"domain_scores_gemma":[0.9949157,0.0022184034,0.00056057074,0.00097036286,0.0009409171,0.00039412355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002737347,0.0010318765,0.0008932154,0.0013782012,0.0010413765,0.0029718224,0.0015441813,0.0010931846,0.008113994],"category_scores_gemma":[0.010422567,0.0006497725,0.0012395739,0.0017355103,0.002473076,0.0041769412,0.0033464339,0.003142007,0.0011719788],"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.000100658224,0.000056277815,0.0009024937,0.00019060122,0.000052616368,0.00035969334,0.00040401684,0.07759615,0.0043642125,0.86946374,0.004831805,0.041677814],"study_design_scores_gemma":[0.0000261125,0.000041893414,0.00024117928,0.000093316376,0.000031460317,0.00020829376,0.00019204152,0.16943046,0.0028677606,0.80870986,0.018131409,0.000026151054],"about_ca_topic_score_codex":0.002572764,"about_ca_topic_score_gemma":0.0026398646,"teacher_disagreement_score":0.008113994,"about_ca_system_score_codex":0.001417306,"about_ca_system_score_gemma":0.0013458515,"threshold_uncertainty_score":0.027143955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027051374,0.0019592803,0.9145121,0.0044342256,0.00024418306,0.0001419706,0.0014277813,0.0038139673,0.046415094],"genre_scores_gemma":[0.6661153,0.002319636,0.29443103,0.0075239046,0.0010208614,0.0010735851,0.0041608405,0.0029686415,0.020386253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921672,0.0014858716,0.00041673428,0.002349753,0.0020263991,0.001554063],"domain_scores_gemma":[0.96882075,0.020737622,0.001217977,0.006364554,0.0022423002,0.00061685464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052124625,0.0015122656,0.0029660156,0.002653713,0.0027777874,0.0056002773,0.0049791103,0.0020591582,0.024537874],"category_scores_gemma":[0.029546397,0.0015725902,0.0034053994,0.0037462157,0.004157965,0.015502288,0.0073250495,0.011468467,0.005907066],"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.00062400324,0.0002612016,0.0037000724,0.0011768772,0.00025590952,0.0005021585,0.000621615,0.04913633,0.008360963,0.82035,0.02888215,0.08612869],"study_design_scores_gemma":[0.00009287066,0.00017633369,0.0017994101,0.0002531263,0.00018107361,0.0006548231,0.00018635565,0.14040324,0.00979422,0.8202525,0.026125068,0.000081000675],"about_ca_topic_score_codex":0.004301762,"about_ca_topic_score_gemma":0.005988116,"teacher_disagreement_score":0.024537874,"about_ca_system_score_codex":0.0041449284,"about_ca_system_score_gemma":0.0022382268,"threshold_uncertainty_score":0.08208734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002754046,0.0006288222,0.9824567,0.0012552545,0.00008412793,0.00007894561,0.000104780614,0.0001556361,0.012481668],"genre_scores_gemma":[0.2487486,0.0032655743,0.7261565,0.0011984295,0.0006592415,0.00083198637,0.000564499,0.0003567452,0.018218454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952211,0.0017775407,0.00024398253,0.0007295848,0.001769166,0.000258561],"domain_scores_gemma":[0.988247,0.009077225,0.000517474,0.0009846236,0.0010155728,0.00015799746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053064763,0.0013347822,0.0013020955,0.0022405335,0.001334798,0.003765276,0.0029124583,0.0019430353,0.006696504],"category_scores_gemma":[0.019764287,0.0008909663,0.0013876879,0.0039656986,0.0042578327,0.0058775237,0.0042392556,0.0036755984,0.0011445039],"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.000036308447,0.000022575496,0.00012831415,0.00017024415,0.00003922309,0.00007699874,0.00016632963,0.09045121,0.0008032394,0.85951823,0.003379456,0.04520803],"study_design_scores_gemma":[0.00002255357,0.000016120894,0.000058130576,0.000047328922,0.000016508273,0.000047491463,0.000028328663,0.29062036,0.0012722819,0.6982579,0.009594144,0.000018807983],"about_ca_topic_score_codex":0.0033264884,"about_ca_topic_score_gemma":0.00256508,"teacher_disagreement_score":0.006696504,"about_ca_system_score_codex":0.0032488809,"about_ca_system_score_gemma":0.0023260298,"threshold_uncertainty_score":0.028063715},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013021415,0.00068704964,0.842916,0.010284042,0.0016275038,0.00021279704,0.0019215079,0.003295235,0.12603435],"genre_scores_gemma":[0.44931608,0.0025490054,0.42499205,0.007665138,0.0027768733,0.00079865975,0.0067150593,0.002515562,0.10267164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99601775,0.00078522513,0.00024820643,0.0016456844,0.0009081881,0.00039498098],"domain_scores_gemma":[0.99524456,0.0018973398,0.00023813001,0.0013271633,0.0011060053,0.00018682217],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017864694,0.0008348329,0.0012801272,0.0009640496,0.0016193613,0.0047668316,0.001675423,0.0021007813,0.034815997],"category_scores_gemma":[0.011136974,0.00063367834,0.0014868567,0.0018077287,0.002016144,0.0054641156,0.002690634,0.003891936,0.009923766],"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.00019596017,0.000113391725,0.0014040421,0.0004266905,0.00016879084,0.00014571704,0.00022097687,0.014778359,0.0021632132,0.67153436,0.058467645,0.25038093],"study_design_scores_gemma":[0.000037038033,0.00003847422,0.0004084394,0.000043445714,0.00006107389,0.00021252497,0.00010758456,0.07286134,0.0019954517,0.87784034,0.04636737,0.000026845248],"about_ca_topic_score_codex":0.0042904727,"about_ca_topic_score_gemma":0.0033776362,"teacher_disagreement_score":0.965184,"about_ca_system_score_codex":0.0011858207,"about_ca_system_score_gemma":0.0029893222,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002245158,0.00016209629,0.93354607,0.0001436788,0.000044084383,0.00030865255,0.00055876415,0.060364284,0.0026271646],"genre_scores_gemma":[0.06390143,0.00016399584,0.9239173,0.00021559212,0.000060636703,0.0012175811,0.001818835,0.0071221134,0.0015825408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99385417,0.0021205787,0.000562782,0.00095255335,0.00203448,0.00047552734],"domain_scores_gemma":[0.99212074,0.003754105,0.0005655599,0.0021690116,0.0011412689,0.0002492581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006468293,0.002075024,0.0016195856,0.0025352754,0.0010001765,0.003973432,0.006449062,0.0015739549,0.013778768],"category_scores_gemma":[0.021535153,0.0018218949,0.0018240112,0.0015717931,0.0014480388,0.004779598,0.0044563375,0.004476169,0.005830805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010825511,0.00052252365,0.002177864,0.0011267916,0.00021858427,0.00043992515,0.0004207735,0.21227483,0.01805091,0.076521054,0.0643884,0.6227758],"study_design_scores_gemma":[0.00028195122,0.00015994105,0.00041292532,0.00012424425,0.00005136942,0.000249839,0.0000691782,0.88800496,0.021242192,0.045840893,0.04343589,0.00012667192],"about_ca_topic_score_codex":0.0018041106,"about_ca_topic_score_gemma":0.0027227974,"teacher_disagreement_score":0.013778768,"about_ca_system_score_codex":0.0017065526,"about_ca_system_score_gemma":0.0037474853,"threshold_uncertainty_score":0.046094596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13483201,0.0007206918,0.8570251,0.0015455068,0.000059411104,0.000094343435,0.00013198552,0.0008656673,0.004725252],"genre_scores_gemma":[0.74071383,0.0003484168,0.2555236,0.00062215637,0.00007313151,0.00019198327,0.0003932192,0.00023936927,0.001894275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789375,0.0011106216,0.00010192272,0.000324483,0.0003696503,0.00019967533],"domain_scores_gemma":[0.98477757,0.012362376,0.00077304686,0.0006971582,0.0009299251,0.0004600095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043766103,0.00066050474,0.00074387406,0.0011426084,0.00066350825,0.0019872144,0.0020060693,0.0013838086,0.002844953],"category_scores_gemma":[0.027194778,0.0007747155,0.000651933,0.0012005566,0.0017855504,0.004020068,0.002283847,0.0031007063,0.00039746292],"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.00027492718,0.0001859712,0.009467568,0.00023363048,0.00009103256,0.000116269744,0.00060589344,0.590695,0.0032887456,0.2589047,0.0035560585,0.1325801],"study_design_scores_gemma":[0.00002626541,0.00003586904,0.00031888654,0.000018365736,0.000012909419,0.000027463848,0.00005175358,0.8807832,0.00096198195,0.117094636,0.0006593402,0.000009306325],"about_ca_topic_score_codex":0.0024119928,"about_ca_topic_score_gemma":0.004257515,"teacher_disagreement_score":0.0043766103,"about_ca_system_score_codex":0.0018733649,"about_ca_system_score_gemma":0.0015817207,"threshold_uncertainty_score":0.023145974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020317244,0.00009316619,0.99061954,0.00031139026,0.0000287457,0.0000579135,0.0008022288,0.00037776018,0.0056776083],"genre_scores_gemma":[0.17395684,0.00076357246,0.8132402,0.00038882188,0.00008626517,0.00088324916,0.0026472698,0.0003646389,0.0076691415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807334,0.0011055868,0.000092497714,0.0003372676,0.0002962997,0.000095042175],"domain_scores_gemma":[0.9971564,0.001629749,0.00028292942,0.00040163056,0.0003834817,0.00014578996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019246478,0.0011446734,0.00068045774,0.0019196403,0.0007527375,0.0027915281,0.0020082146,0.0011615538,0.01286583],"category_scores_gemma":[0.008365421,0.0005897737,0.0010632966,0.0030119037,0.001181256,0.0045114434,0.0018538657,0.0021651583,0.0016878479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005477197,0.00003610232,0.0004056614,0.00016662639,0.00003552095,0.00012563689,0.00020068389,0.11839493,0.0009826851,0.8251721,0.0071889674,0.047236323],"study_design_scores_gemma":[0.00001626871,0.00001501124,0.00011220358,0.00004694802,0.000019814974,0.000068829024,0.000044090626,0.37195176,0.00080926187,0.6055223,0.021373263,0.00002028903],"about_ca_topic_score_codex":0.004984213,"about_ca_topic_score_gemma":0.0067698536,"teacher_disagreement_score":0.01286583,"about_ca_system_score_codex":0.0017143299,"about_ca_system_score_gemma":0.0014663384,"threshold_uncertainty_score":0.043040514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010432615,0.00031432416,0.97034657,0.0010070448,0.00032414636,0.00017131462,0.00054271385,0.00045476944,0.016406443],"genre_scores_gemma":[0.20046452,0.00065230904,0.7809974,0.0009903468,0.0003581449,0.0004721167,0.0015704832,0.0008093291,0.0136854565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995001,0.0013185743,0.00034635997,0.0010064297,0.001749362,0.00057828956],"domain_scores_gemma":[0.9925276,0.0030704814,0.00056554744,0.0020872094,0.0013415584,0.00040753974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038401245,0.0013649857,0.0010757006,0.0014458817,0.0016995223,0.0030734772,0.0026124674,0.0012800669,0.009603251],"category_scores_gemma":[0.011189564,0.00082521193,0.0018193991,0.002134242,0.0026751475,0.0070076794,0.0050715436,0.0060392525,0.0013387761],"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.00016059309,0.00012716408,0.0012678561,0.00032772927,0.00008339203,0.00040237492,0.0002894088,0.05539947,0.0056602163,0.80390006,0.013486828,0.11889491],"study_design_scores_gemma":[0.000093892486,0.00009785664,0.00039594463,0.00013613714,0.000082260805,0.0003109157,0.00014736917,0.18028569,0.014453171,0.7394855,0.06444032,0.000070933806],"about_ca_topic_score_codex":0.0050618397,"about_ca_topic_score_gemma":0.006229679,"teacher_disagreement_score":0.009603251,"about_ca_system_score_codex":0.0012197434,"about_ca_system_score_gemma":0.0031663026,"threshold_uncertainty_score":0.03212613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26350945,0.0007748969,0.7285491,0.002699238,0.00009883228,0.00017770006,0.0013777553,0.00074345694,0.002069552],"genre_scores_gemma":[0.760539,0.00037470914,0.23317571,0.0007493375,0.00016928576,0.00023027472,0.003423716,0.00016206811,0.0011758799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906115,0.002473441,0.0008062485,0.0028171125,0.0027648848,0.00052687916],"domain_scores_gemma":[0.9502779,0.036541823,0.0050395043,0.0053054527,0.0021870192,0.0006482559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077691143,0.001222493,0.0018148093,0.0023250377,0.0013543842,0.004017104,0.0036960824,0.0032668808,0.0020195702],"category_scores_gemma":[0.048662417,0.0014715483,0.0022737407,0.0036195044,0.0023547322,0.0058633815,0.0032725951,0.0045666425,0.00046671394],"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.0014740736,0.0010095551,0.15989897,0.0013672905,0.0018621103,0.0020881554,0.002090413,0.3779593,0.016440826,0.07995954,0.012553449,0.34329638],"study_design_scores_gemma":[0.000046811485,0.00011785713,0.009387094,0.000085361135,0.00010535659,0.00061199686,0.00041822135,0.8817216,0.004117504,0.100683995,0.0026235734,0.00008059924],"about_ca_topic_score_codex":0.005631691,"about_ca_topic_score_gemma":0.008537019,"teacher_disagreement_score":0.0077691143,"about_ca_system_score_codex":0.0014526484,"about_ca_system_score_gemma":0.002240561,"threshold_uncertainty_score":0.04108745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029673697,0.0005845549,0.96324414,0.00032173173,0.00011961293,0.00007755384,0.000091127244,0.0003831299,0.005504313],"genre_scores_gemma":[0.51813227,0.00040426996,0.47482142,0.00016672623,0.000062321305,0.00028717107,0.00024513804,0.00013545068,0.005745125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998116,0.000056978894,0.000009453082,0.000020008016,0.0000738787,0.00002808128],"domain_scores_gemma":[0.99960524,0.0002364106,0.000027363565,0.00002458632,0.000078577614,0.000027850941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046860537,0.00043894467,0.00079031807,0.0005529238,0.00042134186,0.00042007436,0.0009886044,0.0007261287,0.0020429883],"category_scores_gemma":[0.0012233725,0.0002773299,0.000498101,0.0006234682,0.00036019922,0.0006019897,0.00069494563,0.0008841568,0.00028077763],"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.00020317138,0.00011307166,0.00096303405,0.00015491749,0.00009878693,0.00007316053,0.0001188784,0.846871,0.0074030696,0.027559865,0.005563632,0.11087741],"study_design_scores_gemma":[0.00002499603,0.000025542055,0.000074073585,0.000003248736,0.0000058133614,0.000010195112,0.000005725854,0.9969298,0.00046652352,0.0017779939,0.00067253236,0.0000035171427],"about_ca_topic_score_codex":0.0050448277,"about_ca_topic_score_gemma":0.004650102,"teacher_disagreement_score":0.0050448277,"about_ca_system_score_codex":0.0005592454,"about_ca_system_score_gemma":0.00092737033,"threshold_uncertainty_score":0.010030925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026306165,0.0005016085,0.9025429,0.00093799253,0.00009743451,0.00010208906,0.00037268165,0.00010981173,0.06902931],"genre_scores_gemma":[0.6804238,0.001957627,0.25026038,0.0006056464,0.00038828928,0.00086666935,0.0009099246,0.00032564977,0.06426205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975961,0.001156986,0.00010308415,0.0002948383,0.00053061434,0.00031834902],"domain_scores_gemma":[0.9944364,0.004178185,0.00025983894,0.000395709,0.000427359,0.00030247265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038496214,0.0014485774,0.0016012287,0.0015394686,0.0014061508,0.0034410427,0.0020244939,0.0015503716,0.016990174],"category_scores_gemma":[0.0117028495,0.00095079065,0.0018852224,0.0026432676,0.0026850814,0.005480727,0.0029667122,0.004377966,0.0011937898],"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.000050295243,0.000030177593,0.0001146451,0.000066867935,0.000023888222,0.000020759158,0.000082045044,0.0583006,0.00026046077,0.9252098,0.0020492512,0.013791224],"study_design_scores_gemma":[0.000012081467,0.00001855551,0.00010381224,0.000027906175,0.000011408978,0.000021509359,0.000036180594,0.11983258,0.00014367176,0.87796915,0.0018123005,0.000010850484],"about_ca_topic_score_codex":0.0033130962,"about_ca_topic_score_gemma":0.003649531,"teacher_disagreement_score":0.016990174,"about_ca_system_score_codex":0.003891618,"about_ca_system_score_gemma":0.0018017001,"threshold_uncertainty_score":0.056837857},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092185184,0.28363854,0.56570846,0.012018735,0.0004652611,0.00017074606,0.001021757,0.00050864246,0.044282746],"genre_scores_gemma":[0.5202232,0.27944395,0.18590738,0.0015290098,0.0032812,0.00033629424,0.002055068,0.00031381578,0.0069100633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967558,0.0006622322,0.00028423805,0.00095190207,0.0011255221,0.00022035044],"domain_scores_gemma":[0.9905806,0.0075010955,0.00038166848,0.0007630273,0.0005656187,0.00020796996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027266755,0.0010154983,0.0019433625,0.0028132282,0.00082089053,0.004185544,0.0017971873,0.0016205605,0.0030146758],"category_scores_gemma":[0.008596719,0.00089088565,0.0014395351,0.0049735545,0.0031841327,0.010411109,0.0020241675,0.0035016395,0.00058888516],"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.000094745985,0.00020224834,0.0046368744,0.0027181888,0.00016617261,0.00021099043,0.00045084368,0.052739456,0.0018455491,0.6343311,0.007199424,0.29540437],"study_design_scores_gemma":[0.00002276657,0.00011869231,0.0029297173,0.0004232666,0.00007646954,0.0007058191,0.0002398698,0.08660118,0.0014380054,0.85798967,0.049373772,0.00008079235],"about_ca_topic_score_codex":0.0014567779,"about_ca_topic_score_gemma":0.0008708817,"teacher_disagreement_score":0.004185544,"about_ca_system_score_codex":0.0023170842,"about_ca_system_score_gemma":0.0016299458,"threshold_uncertainty_score":0.016811728},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5555959,0.0014879366,0.41404918,0.0024908853,0.00010827251,0.00009237152,0.00021551232,0.00038344515,0.025576528],"genre_scores_gemma":[0.9761662,0.00035849222,0.0176468,0.00021003802,0.00008739387,0.00008352346,0.00015050145,0.0001036547,0.0051933527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995839,0.00015695064,0.000012096895,0.00008034906,0.00008695996,0.00007963329],"domain_scores_gemma":[0.9969131,0.0021032684,0.0004538203,0.00019288264,0.00014273079,0.00019418754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010337116,0.00038592872,0.0006489494,0.00069618225,0.0007450819,0.0009601374,0.00096979627,0.0008895327,0.0036597385],"category_scores_gemma":[0.006727589,0.00040255106,0.00058968633,0.0004992256,0.0018637575,0.0022339073,0.0012936674,0.0015022233,0.00024373127],"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.00011874387,0.000037396785,0.0011522723,0.00009451931,0.000037110465,0.00020136235,0.00030078535,0.2051687,0.003419548,0.7813362,0.0023804295,0.005752885],"study_design_scores_gemma":[0.000024859719,0.00002625419,0.0005545147,0.000016250344,0.000008724186,0.00006257252,0.000047240286,0.8164961,0.00075981923,0.18107975,0.0009061252,0.000017787463],"about_ca_topic_score_codex":0.0023386343,"about_ca_topic_score_gemma":0.0014135056,"teacher_disagreement_score":0.0036597385,"about_ca_system_score_codex":0.0009863498,"about_ca_system_score_gemma":0.0004984249,"threshold_uncertainty_score":0.012242973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12757477,0.011587968,0.59550345,0.20063779,0.0011154475,0.00031578122,0.0030131203,0.0012632994,0.058988415],"genre_scores_gemma":[0.718387,0.007552267,0.23854244,0.011930314,0.0062673404,0.001001848,0.0034063696,0.0010476414,0.011864802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866326,0.0072119785,0.0006119235,0.0028283887,0.002031483,0.00068355293],"domain_scores_gemma":[0.8068678,0.17956623,0.0037919001,0.006083912,0.0025649732,0.001125182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010139591,0.0013554998,0.0020450659,0.002073341,0.0028290087,0.0071351677,0.0034473683,0.004941555,0.011945217],"category_scores_gemma":[0.094850525,0.0013763773,0.0036794199,0.004021193,0.007833669,0.028410533,0.0038793779,0.014212875,0.0016086753],"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.00024617414,0.0002220931,0.0029169796,0.0008575752,0.00016229227,0.0002448816,0.00059898646,0.03377462,0.0007331523,0.9041322,0.0193633,0.036747716],"study_design_scores_gemma":[0.00003772126,0.000023509385,0.00034024462,0.00006531848,0.000019661531,0.00007108582,0.00011662227,0.02521169,0.0003142331,0.9693468,0.004434942,0.000018295024],"about_ca_topic_score_codex":0.0024328353,"about_ca_topic_score_gemma":0.0023298154,"teacher_disagreement_score":0.011945217,"about_ca_system_score_codex":0.0046782466,"about_ca_system_score_gemma":0.002569983,"threshold_uncertainty_score":0.053623915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11352702,0.00052401214,0.84649193,0.002142844,0.00011727295,0.000072280025,0.00017689627,0.0007473567,0.036200363],"genre_scores_gemma":[0.9059767,0.0002407276,0.08800281,0.00015875624,0.000102658836,0.00009415025,0.00011254551,0.000850472,0.004461089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966684,0.0015665407,0.00019310619,0.00067124085,0.0006270538,0.000273713],"domain_scores_gemma":[0.9874866,0.0077920216,0.0009837468,0.0019480045,0.0011854669,0.0006041178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003942889,0.00093542103,0.0009869556,0.0015500874,0.0014925401,0.006295961,0.0020978814,0.0018932807,0.012227065],"category_scores_gemma":[0.03163641,0.0013398424,0.0007792395,0.002176224,0.00550525,0.018209942,0.004327315,0.0030859283,0.0009066456],"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.00034770157,0.00010810574,0.003302664,0.0001606696,0.000048185066,0.00020338198,0.0018228844,0.02176302,0.0073542153,0.8807916,0.0014927493,0.08260474],"study_design_scores_gemma":[0.000033619202,0.00006032989,0.0015493975,0.00002656968,0.000040206003,0.00009225364,0.0003535555,0.057981174,0.0035394887,0.93376285,0.0025112513,0.000049373786],"about_ca_topic_score_codex":0.0021664412,"about_ca_topic_score_gemma":0.001907998,"teacher_disagreement_score":0.012227065,"about_ca_system_score_codex":0.0014947036,"about_ca_system_score_gemma":0.0011177511,"threshold_uncertainty_score":0.04090357},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017676074,0.00027855812,0.97441757,0.00022411588,0.000058908332,0.00009506747,0.00014828534,0.0008111283,0.006290151],"genre_scores_gemma":[0.3170036,0.00032269518,0.67423654,0.00025380054,0.00006666375,0.000323024,0.00067189196,0.00043644334,0.006685354],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679285,0.0013064356,0.00016444366,0.00042568427,0.0009951128,0.0003155318],"domain_scores_gemma":[0.9939516,0.0031245528,0.00036556867,0.0015541892,0.0007938238,0.00021022775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032670426,0.00095209695,0.0011971799,0.0013003288,0.0006533138,0.0017183487,0.0026269248,0.0011128585,0.0069245603],"category_scores_gemma":[0.013407798,0.0005980925,0.0010604297,0.0019348633,0.0016613378,0.002985523,0.004637915,0.0022737202,0.0015149328],"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.00051285664,0.00031873788,0.00186969,0.0004532162,0.000076886114,0.00012584316,0.00024278241,0.3147699,0.009032735,0.28480244,0.0070829247,0.38071194],"study_design_scores_gemma":[0.00004889372,0.000092161536,0.00015600248,0.000052577154,0.000014848904,0.00006550882,0.000042711552,0.87442577,0.0033154117,0.114211686,0.0075576967,0.000016681177],"about_ca_topic_score_codex":0.0036069653,"about_ca_topic_score_gemma":0.00409773,"teacher_disagreement_score":0.0069245603,"about_ca_system_score_codex":0.0010355603,"about_ca_system_score_gemma":0.0021610525,"threshold_uncertainty_score":0.023164988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01964789,0.00022999612,0.9716822,0.00061857176,0.000031760523,0.00006744253,0.00052417564,0.00015372373,0.0070443074],"genre_scores_gemma":[0.6470679,0.0008049176,0.33986434,0.00031083522,0.00010102483,0.00037480047,0.0011954162,0.00008532446,0.010195433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647766,0.0016642871,0.00019925322,0.0006667111,0.0007763191,0.00021587907],"domain_scores_gemma":[0.99417996,0.004099103,0.00046616115,0.00046611135,0.0005724458,0.00021628161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037904799,0.0008535636,0.0008792145,0.0015345468,0.00077221513,0.0022807568,0.0018488625,0.0012893319,0.0072670975],"category_scores_gemma":[0.012135662,0.0006199394,0.0013512914,0.002999709,0.0018017234,0.0067097815,0.0018259665,0.0021718226,0.0005622221],"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.0001790245,0.000039728868,0.0008861041,0.0001559747,0.00007851992,0.000272355,0.00016918595,0.32953763,0.0006845271,0.63812286,0.0016209324,0.02825326],"study_design_scores_gemma":[0.000016206497,0.000021268588,0.00017833788,0.000020774894,0.000022348122,0.0000876966,0.00003230229,0.6545761,0.00031369377,0.342184,0.0025290316,0.000018273067],"about_ca_topic_score_codex":0.008113312,"about_ca_topic_score_gemma":0.007824624,"teacher_disagreement_score":0.008113312,"about_ca_system_score_codex":0.0027747392,"about_ca_system_score_gemma":0.0012548078,"threshold_uncertainty_score":0.024310827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016846101,0.0008296937,0.992058,0.00018712768,0.000038969916,0.000046781384,0.000024970397,0.000074949465,0.005055024],"genre_scores_gemma":[0.05790675,0.0031331673,0.933517,0.00020305256,0.00011878453,0.00032845064,0.00014374916,0.00009920399,0.0045498926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887127,0.00040033355,0.00006616695,0.00016231193,0.00043486743,0.00006501576],"domain_scores_gemma":[0.9989311,0.0007346258,0.00007762977,0.00010447741,0.00013357092,0.000018515866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001437967,0.0012049616,0.0012310387,0.0012712544,0.00058451283,0.001681386,0.0013424896,0.0015751265,0.00387326],"category_scores_gemma":[0.0031782116,0.000584456,0.0015049514,0.0021990582,0.0015093754,0.0015696558,0.0019643584,0.0018660413,0.00073167594],"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.000025876243,0.000055637258,0.00037984797,0.00052812335,0.000155649,0.00017766844,0.00018010799,0.5652712,0.0047121136,0.27538642,0.0033648366,0.1497626],"study_design_scores_gemma":[0.000033549117,0.00004341798,0.00020441142,0.00010998885,0.000028764332,0.00013801942,0.000051354462,0.8411805,0.002201544,0.13401477,0.02196449,0.000029166831],"about_ca_topic_score_codex":0.0023987247,"about_ca_topic_score_gemma":0.0013265768,"teacher_disagreement_score":0.00387326,"about_ca_system_score_codex":0.0006111644,"about_ca_system_score_gemma":0.00095729297,"threshold_uncertainty_score":0.0129573345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06856298,0.00051573495,0.90490764,0.00029372735,0.00009072422,0.00019873127,0.0003406504,0.004162221,0.02092755],"genre_scores_gemma":[0.21789026,0.00017665075,0.776966,0.00015684562,0.000018260194,0.0002309863,0.0004119813,0.0006109287,0.0035380917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995055,0.00014630774,0.00002932082,0.0000856445,0.000121568286,0.000111699876],"domain_scores_gemma":[0.9991918,0.00047895696,0.000054669945,0.00012450223,0.000115073504,0.000034965113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447825,0.00066802936,0.0007248538,0.00067318475,0.0003923231,0.00082178006,0.0008884781,0.000694939,0.0058523295],"category_scores_gemma":[0.0024133632,0.0004388968,0.0007374778,0.0010157257,0.00055273704,0.0011530613,0.001081894,0.0009581225,0.0012082793],"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.00038110127,0.0002897259,0.0018001255,0.00044494277,0.00009037561,0.00021108262,0.00022028618,0.5601942,0.01301044,0.061600544,0.012466865,0.34929025],"study_design_scores_gemma":[0.000114028764,0.00010810801,0.00020187396,0.000030969448,0.000031133262,0.00006999963,0.00006992823,0.9555124,0.006404229,0.03174407,0.0056942306,0.00001898409],"about_ca_topic_score_codex":0.003236254,"about_ca_topic_score_gemma":0.0050846497,"teacher_disagreement_score":0.0058523295,"about_ca_system_score_codex":0.00067571923,"about_ca_system_score_gemma":0.0012379527,"threshold_uncertainty_score":0.01957804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17397213,0.0009881498,0.7237665,0.0065901633,0.00017131279,0.00031822163,0.0024202561,0.0011209123,0.09065243],"genre_scores_gemma":[0.90203387,0.0005132893,0.06739002,0.0010976718,0.00021753312,0.00043436993,0.0016881444,0.0001743042,0.026450839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762696,0.0008012744,0.00009801024,0.00060889585,0.00051817804,0.00034668206],"domain_scores_gemma":[0.9949451,0.002900179,0.0005428701,0.00067258195,0.00045994905,0.00047933345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016272848,0.0006879938,0.0010242142,0.001187116,0.0010712066,0.0023207222,0.0030691815,0.00276778,0.013422053],"category_scores_gemma":[0.00804705,0.0004875696,0.0012668051,0.0016243344,0.0021227086,0.0037768323,0.0023723398,0.002427474,0.0012059388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095707655,0.00006732385,0.00070774247,0.00008758172,0.00003475865,0.0002393754,0.00019431037,0.06099108,0.0011957417,0.9279739,0.004036237,0.0043761847],"study_design_scores_gemma":[0.00010256986,0.000054426047,0.00040979806,0.000019437246,0.000020054098,0.00022211068,0.00006916675,0.487848,0.000432184,0.5059644,0.004837029,0.00002079079],"about_ca_topic_score_codex":0.003963012,"about_ca_topic_score_gemma":0.0036040586,"teacher_disagreement_score":0.013422053,"about_ca_system_score_codex":0.0020065333,"about_ca_system_score_gemma":0.001153343,"threshold_uncertainty_score":0.044901192},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023982497,0.00052830164,0.9649355,0.0002431647,0.00006426512,0.00011402183,0.00009635697,0.00148827,0.008547643],"genre_scores_gemma":[0.33525604,0.00047989702,0.6585632,0.00034538703,0.00008623186,0.00043528588,0.00048892415,0.00057602476,0.003769046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698347,0.001172642,0.00013663621,0.00034872617,0.0009804979,0.00037796458],"domain_scores_gemma":[0.99172884,0.005301049,0.0005411983,0.0012555044,0.0009803621,0.00019305835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035744233,0.0017739395,0.0014711076,0.0026141093,0.0009929494,0.001819324,0.0024925463,0.0018881316,0.005498886],"category_scores_gemma":[0.017108852,0.0008973564,0.0012435225,0.0024144333,0.0013105009,0.0035506426,0.0043511633,0.002156767,0.0015496351],"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.00032511953,0.00034661114,0.0018333937,0.00031241582,0.00010560089,0.00013283092,0.00027189506,0.5834518,0.0069857636,0.061050765,0.005458013,0.3397258],"study_design_scores_gemma":[0.000043880947,0.000059977232,0.00013791415,0.000035979523,0.000029363868,0.00003667548,0.00004092893,0.9691405,0.002375351,0.026184086,0.001901315,0.0000139670365],"about_ca_topic_score_codex":0.005036448,"about_ca_topic_score_gemma":0.005785132,"teacher_disagreement_score":0.005498886,"about_ca_system_score_codex":0.001193168,"about_ca_system_score_gemma":0.0023189401,"threshold_uncertainty_score":0.018903553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015851599,0.000033717282,0.99691844,0.000033514196,0.000020165156,0.000021244487,0.000024009145,0.00093969353,0.0004239944],"genre_scores_gemma":[0.19609539,0.00012886524,0.8000702,0.00016226569,0.00004759256,0.0001530266,0.00023852536,0.00031495665,0.0027892105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990656,0.00013639973,0.00006374133,0.00028398013,0.00034507897,0.000105278275],"domain_scores_gemma":[0.99861026,0.0007187432,0.00012469682,0.0002755663,0.0002045278,0.00006619681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008309326,0.0010870234,0.0013409122,0.000776516,0.00067056937,0.0015461921,0.002027691,0.001130711,0.003660344],"category_scores_gemma":[0.0024877682,0.000626279,0.0012762328,0.0007077492,0.00084310694,0.0014469589,0.0012508114,0.0019482123,0.0008351205],"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.00023241215,0.0001319419,0.0008224322,0.00014041243,0.00011321863,0.00021283409,0.00018839697,0.68017894,0.014597347,0.03254317,0.0028645734,0.26797438],"study_design_scores_gemma":[0.000008369571,0.000016560596,0.00006910832,0.0000030758877,0.000009009655,0.000013090407,0.0000056844215,0.9918968,0.002063653,0.005184076,0.00072402216,0.000006656481],"about_ca_topic_score_codex":0.016121099,"about_ca_topic_score_gemma":0.014437759,"teacher_disagreement_score":0.016121099,"about_ca_system_score_codex":0.0012372249,"about_ca_system_score_gemma":0.0023813897,"threshold_uncertainty_score":0.032054484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15424353,0.00034079142,0.8367048,0.00036827856,0.000044680753,0.00008393428,0.0001256203,0.00056185666,0.007526551],"genre_scores_gemma":[0.86020225,0.00017343233,0.1369547,0.00008290458,0.00001785341,0.00011562685,0.00010713824,0.000034966684,0.0023111126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995647,0.00014119918,0.00002008826,0.000109525114,0.0000916472,0.00007279737],"domain_scores_gemma":[0.99931407,0.00039225313,0.000091351125,0.000068307345,0.000071207454,0.000062721454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207937,0.000540499,0.0007144453,0.00040878347,0.00053192145,0.0008471964,0.0009809168,0.00081616506,0.0014083273],"category_scores_gemma":[0.0015936102,0.00035144298,0.00046800566,0.0008623937,0.0005830453,0.00089465355,0.000998333,0.00061084697,0.0002191884],"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.00009024136,0.000033219603,0.0005155345,0.000031681382,0.000033980217,0.00012937456,0.000045878613,0.9696456,0.0027756006,0.007030921,0.0005853005,0.019082688],"study_design_scores_gemma":[0.00001546707,0.000036927526,0.0000915352,0.0000022479196,0.0000052644887,0.000021009471,0.000024710156,0.995981,0.0006373547,0.002678308,0.000502752,0.0000034298132],"about_ca_topic_score_codex":0.009322102,"about_ca_topic_score_gemma":0.0060397163,"teacher_disagreement_score":0.009322102,"about_ca_system_score_codex":0.00068269344,"about_ca_system_score_gemma":0.0010770578,"threshold_uncertainty_score":0.018535674},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001579808,0.027193952,0.8137474,0.0026777375,0.00065287354,0.0000759507,0.00080661464,0.0012196063,0.15204608],"genre_scores_gemma":[0.060781796,0.048890967,0.7385352,0.000965746,0.0011645172,0.0002627279,0.0034838023,0.000859224,0.14505595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999383,0.000115756644,0.000054931235,0.00011667389,0.0003009732,0.000028660388],"domain_scores_gemma":[0.99935883,0.00041432102,0.000024057224,0.000097571705,0.00008741785,0.00001775976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007414586,0.0014137009,0.00082587864,0.0017013475,0.00043739864,0.0042752195,0.0019936953,0.0010140549,0.017470554],"category_scores_gemma":[0.0022899385,0.0007109502,0.0011123922,0.003916321,0.0016694171,0.00512518,0.0016303282,0.0019859115,0.005658087],"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.000017087916,0.000030535277,0.0000840622,0.00053249573,0.000031749514,0.0000669893,0.00016255882,0.011815077,0.00080116274,0.642968,0.051956173,0.2915341],"study_design_scores_gemma":[0.0000062300333,0.000006500768,0.00009767863,0.00026494174,0.0000159733,0.000102210455,0.00006717498,0.028477011,0.0009377592,0.7171133,0.25289285,0.000018295184],"about_ca_topic_score_codex":0.003556642,"about_ca_topic_score_gemma":0.0036982906,"teacher_disagreement_score":0.017470554,"about_ca_system_score_codex":0.0015428704,"about_ca_system_score_gemma":0.0010964167,"threshold_uncertainty_score":0.058444858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025644574,0.00031982292,0.9709697,0.00025326535,0.000060368493,0.00009608497,0.00004191793,0.00035928393,0.0022550272],"genre_scores_gemma":[0.35242558,0.00029440224,0.6439841,0.00023842297,0.000056033598,0.0003463913,0.00017801988,0.00013011936,0.0023469287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994715,0.00018273601,0.000024153458,0.000081770435,0.00015164394,0.0000881757],"domain_scores_gemma":[0.99932134,0.0004362269,0.00006875757,0.00004071246,0.000079126505,0.000053871507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014174295,0.00085900084,0.0013894876,0.0007225809,0.0005277628,0.00065462897,0.0015585144,0.0011753148,0.0014168135],"category_scores_gemma":[0.002080237,0.0003811162,0.00079698773,0.00072045624,0.0006422719,0.00085048715,0.0009174158,0.001306325,0.00020895021],"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.00011253415,0.00010165169,0.0005487838,0.00007883364,0.00006030756,0.000064303495,0.00009243318,0.94278675,0.0039542834,0.008667543,0.0014371687,0.042095393],"study_design_scores_gemma":[0.000021864638,0.00002199615,0.000044112894,0.0000036793133,0.000004557971,0.000010862705,0.0000066096904,0.9980361,0.0003882029,0.0011316835,0.0003268457,0.000003522241],"about_ca_topic_score_codex":0.0044865566,"about_ca_topic_score_gemma":0.004003296,"teacher_disagreement_score":0.0044865566,"about_ca_system_score_codex":0.0009707078,"about_ca_system_score_gemma":0.0014423701,"threshold_uncertainty_score":0.008920908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11245846,0.0018775873,0.8273733,0.013262036,0.00066105917,0.0003632708,0.0017253766,0.0039072875,0.03837159],"genre_scores_gemma":[0.741498,0.0008451564,0.22933917,0.002887934,0.00070459116,0.00047807678,0.0023496859,0.00096592953,0.020931484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913769,0.002345773,0.0004023691,0.0020883216,0.0027700828,0.0010165996],"domain_scores_gemma":[0.9811725,0.012301589,0.00093608716,0.00380671,0.0011514134,0.0006316778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029278982,0.0011627959,0.0023776046,0.00092898915,0.0016343863,0.0058556926,0.0031052937,0.0029825142,0.0223284],"category_scores_gemma":[0.024231285,0.00074878143,0.0023933346,0.0026904177,0.0032684417,0.016691472,0.004547426,0.0073787784,0.0021416927],"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.0010487578,0.00029068138,0.0018909425,0.00073815504,0.00016714241,0.00051237625,0.0005701497,0.100389086,0.006364927,0.76805973,0.020084875,0.09988317],"study_design_scores_gemma":[0.00008742447,0.00007118813,0.00025091605,0.000038288472,0.000064059815,0.00029297694,0.00016502907,0.38230613,0.0029668414,0.6062432,0.007476589,0.00003735489],"about_ca_topic_score_codex":0.0050182324,"about_ca_topic_score_gemma":0.005682848,"teacher_disagreement_score":0.0223284,"about_ca_system_score_codex":0.002850838,"about_ca_system_score_gemma":0.0031761636,"threshold_uncertainty_score":0.074695945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004046077,0.0004696686,0.992261,0.0006796714,0.000047924423,0.00004722802,0.000061250576,0.0002548097,0.0021324144],"genre_scores_gemma":[0.30112502,0.0013487568,0.6926191,0.0004856641,0.0003095149,0.000350815,0.00032092325,0.00029545103,0.003144829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943262,0.0030316296,0.00019553213,0.0005732517,0.0016122159,0.00026121808],"domain_scores_gemma":[0.9694298,0.026529701,0.00079111033,0.0013087912,0.0015799733,0.00036056034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006280714,0.0017211739,0.0012379816,0.002290575,0.0010185393,0.00392913,0.0029306405,0.0026253897,0.0037777475],"category_scores_gemma":[0.038549434,0.0011212011,0.0011962348,0.0036838148,0.003038205,0.005180322,0.0040992675,0.005923419,0.0007205204],"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.00021835085,0.00012191699,0.0011277721,0.00036988207,0.00014450855,0.000100754376,0.00042529643,0.59430647,0.0007556979,0.21761663,0.0048176963,0.17999499],"study_design_scores_gemma":[0.000017759514,0.000018095876,0.000057489764,0.000031321037,0.000011736543,0.000012934215,0.000020673688,0.8867447,0.00039059407,0.111320674,0.0013623312,0.000011707891],"about_ca_topic_score_codex":0.011245817,"about_ca_topic_score_gemma":0.010557983,"teacher_disagreement_score":0.011245817,"about_ca_system_score_codex":0.0024070125,"about_ca_system_score_gemma":0.002253026,"threshold_uncertainty_score":0.033216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005422434,0.00038685478,0.97835827,0.00049792015,0.000064389205,0.00014351982,0.0006650925,0.00022251139,0.014238937],"genre_scores_gemma":[0.19592415,0.0015498069,0.78108996,0.00093467766,0.00018973397,0.0010497625,0.002957318,0.00049429375,0.01581032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982158,0.000760384,0.000105317005,0.00029122725,0.00041850188,0.0002088288],"domain_scores_gemma":[0.9958204,0.0031686889,0.00021983337,0.00017043017,0.00050565216,0.00011495581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022386431,0.0013855181,0.001004459,0.0009667556,0.00091508613,0.002143392,0.0012227689,0.0013223926,0.0181985],"category_scores_gemma":[0.009640306,0.0006630199,0.0014026024,0.0019409262,0.0010470713,0.0030663465,0.002016405,0.0031381352,0.0023135166],"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.00015045496,0.00013417189,0.0008131826,0.00060949486,0.0000792182,0.00033773071,0.00023056287,0.35064822,0.0014113185,0.5257546,0.01754474,0.10228627],"study_design_scores_gemma":[0.000033618257,0.00004871461,0.00009248024,0.00007387857,0.000022672206,0.00010324416,0.000075419724,0.5107391,0.0006524292,0.47601825,0.01212193,0.000018266514],"about_ca_topic_score_codex":0.0027251318,"about_ca_topic_score_gemma":0.0044013956,"teacher_disagreement_score":0.0181985,"about_ca_system_score_codex":0.0011316582,"about_ca_system_score_gemma":0.001971586,"threshold_uncertainty_score":0.060880005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003845114,0.00013481197,0.99370015,0.00011365457,0.00004022495,0.000061096136,0.000032337906,0.00022939288,0.001843127],"genre_scores_gemma":[0.20000799,0.00027198443,0.7952631,0.00015638591,0.000060706287,0.0005693147,0.00028727407,0.000098660144,0.0032846613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995826,0.00013371477,0.000023716455,0.000071792965,0.00014261283,0.00004558945],"domain_scores_gemma":[0.99942636,0.00036113773,0.000054431523,0.000037180227,0.000092662245,0.000028186723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088468264,0.0010600343,0.001363841,0.0007170509,0.00056302483,0.0007354813,0.0011961636,0.0010650484,0.002189915],"category_scores_gemma":[0.0017681271,0.000452585,0.0006919849,0.0009199068,0.0006044138,0.0006825501,0.0010080367,0.0015440799,0.00036147927],"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.000054666743,0.00005354823,0.00031562243,0.00006952214,0.00004202904,0.00006185586,0.000058061345,0.9405469,0.0013319806,0.010497993,0.002097307,0.044870492],"study_design_scores_gemma":[0.000012996113,0.000011807776,0.000028907501,0.0000027808917,0.0000028688817,0.0000071861823,0.0000050316557,0.99776614,0.00017780588,0.0014574708,0.00052455964,0.0000024657077],"about_ca_topic_score_codex":0.0063739717,"about_ca_topic_score_gemma":0.005226481,"teacher_disagreement_score":0.0063739717,"about_ca_system_score_codex":0.00074538944,"about_ca_system_score_gemma":0.001490813,"threshold_uncertainty_score":0.012673736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009835118,0.00010362837,0.9876708,0.000126107,0.000055103996,0.00006989887,0.000030143918,0.0002537391,0.0018554144],"genre_scores_gemma":[0.13134532,0.00016327814,0.865032,0.00017607916,0.000056047218,0.00027864962,0.00017366734,0.00009868823,0.002676251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995616,0.00009118225,0.000021793723,0.0000634206,0.00020685102,0.00005514367],"domain_scores_gemma":[0.99960166,0.00016807376,0.000052518393,0.000044173623,0.00008903435,0.00004451163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132983,0.0007143346,0.0010868008,0.00071143237,0.0003609434,0.00070101436,0.0017319699,0.0012361064,0.0017353443],"category_scores_gemma":[0.0013743018,0.00039891902,0.0009555803,0.00069251,0.00040055398,0.0007849094,0.0011820225,0.0011205166,0.00030838276],"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.00010132691,0.00020684491,0.00085345557,0.00011228805,0.00011242403,0.00010117897,0.000096911775,0.8335705,0.013272237,0.017047446,0.0031998707,0.13132551],"study_design_scores_gemma":[0.000020650863,0.000018779456,0.00004121003,0.0000029405244,0.0000053999793,0.000014593188,0.0000036733395,0.99786866,0.00047384851,0.00083944085,0.000706499,0.000004284301],"about_ca_topic_score_codex":0.0031801672,"about_ca_topic_score_gemma":0.002792149,"teacher_disagreement_score":0.0031801672,"about_ca_system_score_codex":0.0006258765,"about_ca_system_score_gemma":0.0010345816,"threshold_uncertainty_score":0.0063233376},"labels":[],"label_agreement":null},{"id":"W3000553024","doi":"10.1007/s10601-019-09306-w","title":"Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem","year":2020,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"","keywords":"Integer programming; Solver; Exploit; Computer science; Set (abstract data type); Mathematical optimization; Integer (computer science); Inductive logic programming; Tree (set theory); Linear programming; Space (punctuation); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Combinatorics; Programming language","score_opus":0.022001028728399662,"score_gpt":0.26294755684758375,"score_spread":0.2409465281191841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000553024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005419442,0.00017183984,0.9915469,0.000102152044,0.000019654139,0.000033452623,0.000069931484,0.00024908115,0.0023875511],"genre_scores_gemma":[0.1029598,0.00024763966,0.8945732,0.00006225277,0.000023935165,0.00014405088,0.00016358962,0.00014460723,0.0016808794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881136,0.00062975765,0.00005490191,0.00011242784,0.00032333654,0.00006824473],"domain_scores_gemma":[0.99563074,0.0036952284,0.00013881206,0.00013185723,0.00033288452,0.0000704301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021402969,0.00069244957,0.0011709895,0.0015871957,0.00054810924,0.0012051304,0.0011113388,0.001323877,0.0064275363],"category_scores_gemma":[0.008893582,0.0006722647,0.00088746584,0.004029396,0.0004623199,0.0020898697,0.001185238,0.0017865747,0.0006224153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015980974,0.0002449583,0.00050676684,0.00015086106,0.000045220735,0.00011218612,0.000092088034,0.7651438,0.0012018988,0.0909402,0.0026048596,0.13879733],"study_design_scores_gemma":[0.000017376597,0.000020553769,0.000056348083,0.000009248508,0.000007820833,0.000015825857,0.0000073922124,0.9813834,0.0002696657,0.017282534,0.0009245524,0.000005314169],"about_ca_topic_score_codex":0.004577728,"about_ca_topic_score_gemma":0.006497223,"teacher_disagreement_score":0.0064275363,"about_ca_system_score_codex":0.0008368634,"about_ca_system_score_gemma":0.0014234722,"threshold_uncertainty_score":0.021502197},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13656756,0.005562385,0.79857224,0.008945878,0.0002891325,0.00020757085,0.0008929389,0.0010266867,0.04793564],"genre_scores_gemma":[0.8582605,0.0036607813,0.12838452,0.00085671357,0.0010139446,0.00037906738,0.00089903106,0.0003744904,0.0061710323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98441136,0.0043862066,0.0011423994,0.0026825848,0.0058544083,0.0015230225],"domain_scores_gemma":[0.8887868,0.093912974,0.0037364273,0.00757627,0.0039251084,0.0020624665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00700694,0.00078299624,0.0022160627,0.0028079038,0.0016377837,0.008595724,0.0034641458,0.002611373,0.009760234],"category_scores_gemma":[0.07611279,0.0010157155,0.0025576537,0.0045204065,0.0054055126,0.017387083,0.003779783,0.005777082,0.0008508818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013770242,0.00008879906,0.0021971997,0.00038350053,0.00010056649,0.00022439344,0.00032548138,0.024083985,0.0010072099,0.94461966,0.0047081895,0.022123322],"study_design_scores_gemma":[0.000015619207,0.000015853786,0.00035180256,0.000023428433,0.000022249536,0.00024305964,0.000052399355,0.049711492,0.0004576091,0.9471376,0.0019527817,0.000016121561],"about_ca_topic_score_codex":0.0010810673,"about_ca_topic_score_gemma":0.0008265411,"teacher_disagreement_score":0.009760234,"about_ca_system_score_codex":0.0033403025,"about_ca_system_score_gemma":0.0015367072,"threshold_uncertainty_score":0.037056684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008599394,0.00013484019,0.9870955,0.00018939625,0.000023220688,0.00022680522,0.00014851996,0.0011309115,0.0024513588],"genre_scores_gemma":[0.07748967,0.00008137072,0.91956264,0.00010002796,0.00002449148,0.00024922463,0.0004986889,0.00016358115,0.0018302628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985253,0.00032834057,0.000116301584,0.00034990674,0.0004230379,0.00025709567],"domain_scores_gemma":[0.99777776,0.0013168736,0.00015913116,0.00018299594,0.00045021228,0.000112958245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575945,0.0014083345,0.0011222813,0.0016700346,0.001193056,0.001379063,0.0018647761,0.0011429802,0.0073955334],"category_scores_gemma":[0.004809869,0.0006452737,0.00091359636,0.0019253185,0.00091461756,0.0022842663,0.0019399528,0.002009178,0.0009097323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041878564,0.00036051212,0.0013672402,0.00031754878,0.00008427971,0.00018756278,0.00019881004,0.20260315,0.0065423963,0.040999744,0.00955838,0.73736167],"study_design_scores_gemma":[0.00013179834,0.000078840705,0.0001572109,0.000021257443,0.000024241504,0.000075409975,0.000075556825,0.9628827,0.0027955323,0.0310544,0.0026853776,0.000017674476],"about_ca_topic_score_codex":0.011844673,"about_ca_topic_score_gemma":0.01451573,"teacher_disagreement_score":0.011844673,"about_ca_system_score_codex":0.0015935428,"about_ca_system_score_gemma":0.0038938017,"threshold_uncertainty_score":0.024740517},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024175242,0.00022837374,0.96676683,0.0005412795,0.000027898375,0.00023827326,0.0003039087,0.00023241875,0.007485767],"genre_scores_gemma":[0.20173307,0.00035217023,0.7927986,0.00019560257,0.00005923725,0.0006406519,0.00094535056,0.00036433668,0.0029109267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974827,0.0012124933,0.0001443696,0.0003515536,0.0005447517,0.00026420338],"domain_scores_gemma":[0.99201536,0.005596097,0.0007683466,0.00043398154,0.0009147417,0.00027155888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038864918,0.0020537074,0.0023003344,0.0032336877,0.0014221626,0.0040934645,0.0017099296,0.0019674336,0.007850053],"category_scores_gemma":[0.01764038,0.0011368499,0.0017372592,0.0030706294,0.002059942,0.003402184,0.0023743494,0.0032943725,0.00129169],"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.00020209842,0.00016082462,0.0010964406,0.00040828701,0.00008530066,0.00019096868,0.00027770572,0.82896996,0.0015940288,0.11111355,0.0051196283,0.050781235],"study_design_scores_gemma":[0.00003678634,0.000101504294,0.00033338554,0.00009984269,0.000026156265,0.00007968805,0.00022447816,0.86041814,0.0017127527,0.1344104,0.0025158424,0.000040964143],"about_ca_topic_score_codex":0.0034754334,"about_ca_topic_score_gemma":0.0033751829,"teacher_disagreement_score":0.007850053,"about_ca_system_score_codex":0.0022341243,"about_ca_system_score_gemma":0.0033301692,"threshold_uncertainty_score":0.026261032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24148974,0.0013590107,0.7398196,0.002895364,0.0000993203,0.0003031958,0.0003505366,0.00067800004,0.013005173],"genre_scores_gemma":[0.87519914,0.0007387729,0.12027109,0.0004634304,0.00014326218,0.0003510046,0.0003402329,0.00020492963,0.0022882582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812764,0.00094554585,0.000059567952,0.00029124905,0.00032268808,0.00025325545],"domain_scores_gemma":[0.96140075,0.033999804,0.0019919304,0.0012505321,0.0007166909,0.0006404183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043102633,0.00054488255,0.0008590982,0.001714507,0.0012001342,0.002457466,0.001444533,0.0015903314,0.004065123],"category_scores_gemma":[0.04500169,0.00081544294,0.0010631877,0.0016161343,0.0026151787,0.004864305,0.001519423,0.002774193,0.00031328655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038204124,0.00026469558,0.006034265,0.00023230816,0.00008938875,0.00029047206,0.000572378,0.3381151,0.0030329458,0.61037886,0.004867972,0.035739616],"study_design_scores_gemma":[0.00007539867,0.00006448999,0.00080842647,0.000030556577,0.000018611006,0.00009937932,0.000095626776,0.5840801,0.0011341966,0.412316,0.0012560149,0.000021171716],"about_ca_topic_score_codex":0.0020070835,"about_ca_topic_score_gemma":0.0018359178,"teacher_disagreement_score":0.0043102633,"about_ca_system_score_codex":0.001740416,"about_ca_system_score_gemma":0.0012353708,"threshold_uncertainty_score":0.02279514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5952061,0.00048082863,0.38718805,0.0012507478,0.000083817504,0.0004133172,0.000651139,0.0005587487,0.014167362],"genre_scores_gemma":[0.88948524,0.00027328054,0.10663988,0.0003242799,0.00010701105,0.00019040886,0.0006775767,0.0001490676,0.0021532725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899478,0.0036475873,0.00056766724,0.0019705717,0.0028589559,0.001007413],"domain_scores_gemma":[0.9648524,0.027343456,0.002691252,0.003418417,0.0007630539,0.0009314779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061600413,0.00084012054,0.0010468758,0.0011545698,0.0009610563,0.0032497859,0.0023655456,0.0014976534,0.0037969565],"category_scores_gemma":[0.032862924,0.00083015184,0.0021902702,0.0016653681,0.0023219085,0.005972305,0.0032044963,0.004197492,0.00021300919],"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.00055824826,0.0005152367,0.007351698,0.00039744927,0.0004216657,0.00093647477,0.00077540363,0.4307278,0.008441122,0.50318694,0.0017000763,0.04498794],"study_design_scores_gemma":[0.00010621108,0.00028360906,0.0013773453,0.00003183529,0.00011930808,0.0003939178,0.00023914617,0.5390053,0.009460973,0.44597146,0.0029618216,0.00004904212],"about_ca_topic_score_codex":0.0013481907,"about_ca_topic_score_gemma":0.0011193692,"teacher_disagreement_score":0.0061600413,"about_ca_system_score_codex":0.0015281774,"about_ca_system_score_gemma":0.0012131099,"threshold_uncertainty_score":0.032577753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023860387,0.0006039744,0.9926373,0.00035797714,0.000046385252,0.00004632822,0.000037717236,0.00026248727,0.0036217994],"genre_scores_gemma":[0.31498,0.002035091,0.6761071,0.00069519767,0.00031965185,0.0005744931,0.00032798565,0.00033527752,0.004625275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987225,0.00054982136,0.000069945425,0.00019902694,0.00033650477,0.00012229239],"domain_scores_gemma":[0.99659663,0.0026762984,0.00017427142,0.00018694668,0.00026787637,0.00009799347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020615454,0.0017241177,0.0016913869,0.00088186533,0.0003844722,0.002001118,0.0018783093,0.0016262184,0.0042278017],"category_scores_gemma":[0.0056525255,0.00067905034,0.0010912743,0.0014917993,0.0014516258,0.0016251033,0.001766273,0.0033842914,0.00069767266],"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.000025301237,0.00005626595,0.00032993607,0.00019286267,0.00005277844,0.00006433334,0.000027842301,0.89977,0.00048550215,0.039077234,0.0018399565,0.058077946],"study_design_scores_gemma":[0.000006893112,0.000011969498,0.000026656044,0.000013587414,0.0000055687756,0.000010614828,0.0000039716956,0.9835111,0.00016828609,0.015079818,0.0011573334,0.0000041868407],"about_ca_topic_score_codex":0.0064968294,"about_ca_topic_score_gemma":0.0073797563,"teacher_disagreement_score":0.0064968294,"about_ca_system_score_codex":0.0013514155,"about_ca_system_score_gemma":0.0023399543,"threshold_uncertainty_score":0.014143348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02588618,0.0030416993,0.94924444,0.0029499244,0.000039498336,0.000065568,0.00016025426,0.00016792741,0.018444544],"genre_scores_gemma":[0.7127567,0.004572073,0.2757699,0.00079635205,0.0004479651,0.00054462865,0.00041471308,0.00053667964,0.00416107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909243,0.0057922485,0.00024838123,0.0011331029,0.001497922,0.00040403358],"domain_scores_gemma":[0.95197743,0.03990419,0.0020680104,0.004053697,0.0012202753,0.0007763572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010266471,0.0013205683,0.0025563766,0.0043701786,0.0019625458,0.0073993215,0.0037589872,0.0030150984,0.004877067],"category_scores_gemma":[0.047307596,0.0012765926,0.0025322612,0.0044903047,0.010162695,0.013587991,0.0050001894,0.0069146324,0.00047625182],"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.000017488816,0.000030908526,0.0006642721,0.00011655693,0.000047265672,0.00006114312,0.00018258505,0.06232522,0.00022984968,0.9284979,0.00056672876,0.007260135],"study_design_scores_gemma":[0.000007705259,0.000018668781,0.00012586037,0.00004466444,0.000009660182,0.00003922648,0.000047258087,0.08150909,0.00010451171,0.9161142,0.00196944,0.000009639743],"about_ca_topic_score_codex":0.0014205369,"about_ca_topic_score_gemma":0.0011959159,"teacher_disagreement_score":0.010266471,"about_ca_system_score_codex":0.004692086,"about_ca_system_score_gemma":0.0017668584,"threshold_uncertainty_score":0.054294944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6004061,0.00057721185,0.38104126,0.0014344,0.00010311019,0.0004876039,0.0008682827,0.0006724424,0.01440961],"genre_scores_gemma":[0.89476097,0.00028605212,0.10054006,0.00029926363,0.00010829693,0.00021393079,0.0009052268,0.00014769763,0.0027384798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98982877,0.003220647,0.0005129994,0.0019200125,0.003312524,0.0012050292],"domain_scores_gemma":[0.9749062,0.018574655,0.0019696152,0.0032732915,0.0006180342,0.0006581372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005315373,0.00093525654,0.0009868066,0.0010917848,0.0009044644,0.0030108555,0.002301579,0.0015732537,0.0045498637],"category_scores_gemma":[0.02663281,0.00083015027,0.0019272802,0.0015665838,0.0018180955,0.0051631927,0.003341965,0.0036565964,0.00022417556],"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.00072941603,0.0006817956,0.008902053,0.0004941627,0.00043917468,0.00082563853,0.00065698277,0.6003955,0.009356555,0.30133465,0.0027610592,0.07342307],"study_design_scores_gemma":[0.00011206056,0.00028793764,0.0017022816,0.000033178185,0.00010652505,0.00038985242,0.00022538754,0.7501311,0.010982757,0.23258604,0.0034026632,0.000040210627],"about_ca_topic_score_codex":0.0015653311,"about_ca_topic_score_gemma":0.0014433387,"teacher_disagreement_score":0.005315373,"about_ca_system_score_codex":0.0015570103,"about_ca_system_score_gemma":0.0013538342,"threshold_uncertainty_score":0.028110743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039733876,0.00042181084,0.6894791,0.0009873905,0.00049656554,0.00035726727,0.014927822,0.25861603,0.030740563],"genre_scores_gemma":[0.07440862,0.0012021194,0.77615047,0.0011254564,0.00027199733,0.0019375393,0.038048003,0.06871971,0.03813598],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990086,0.00025056288,0.00006762898,0.0001485006,0.00041946143,0.00010528793],"domain_scores_gemma":[0.9967789,0.0019022422,0.00009204008,0.00038926332,0.00053492654,0.0003026213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388743,0.0020222198,0.0009627486,0.0023644902,0.0006954624,0.002476551,0.0029608265,0.0013950114,0.11750969],"category_scores_gemma":[0.0066686156,0.00074064854,0.0016982842,0.0018217518,0.00061391963,0.003619157,0.0035658097,0.0030167315,0.020498797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005925007,0.00030655583,0.0011764156,0.0014058477,0.00013614987,0.00036616068,0.00087131717,0.017460963,0.009900473,0.031748943,0.6478858,0.28814885],"study_design_scores_gemma":[0.0004188196,0.00015993434,0.002012831,0.00032442174,0.000049157716,0.00050555,0.00020405467,0.13734365,0.021801522,0.075552605,0.7614264,0.00020110351],"about_ca_topic_score_codex":0.0025960268,"about_ca_topic_score_gemma":0.0037321015,"teacher_disagreement_score":0.11750969,"about_ca_system_score_codex":0.000769253,"about_ca_system_score_gemma":0.0016677728,"threshold_uncertainty_score":0.39310908},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01075597,0.0007440346,0.9676729,0.00078170793,0.00006538928,0.00038916979,0.0007558159,0.0015607574,0.017274272],"genre_scores_gemma":[0.16012932,0.0010364727,0.8328385,0.00028672276,0.000047343943,0.0007405913,0.001389493,0.0003291487,0.0032025184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974618,0.0009342637,0.00014768487,0.0005078402,0.00075202325,0.00019646889],"domain_scores_gemma":[0.9935057,0.004272672,0.00045039214,0.0011329436,0.000467063,0.00017111497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025913613,0.001373223,0.00079507387,0.0013692707,0.0008758732,0.002900648,0.0031412633,0.0012350578,0.008166887],"category_scores_gemma":[0.011116844,0.0007669923,0.0018205175,0.003676299,0.0013639221,0.003987367,0.0023343284,0.0035391722,0.0015130572],"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.00014842182,0.00025992238,0.0010391244,0.00070977013,0.00014693361,0.00010384721,0.00023451752,0.64728075,0.0017452609,0.15490738,0.010904335,0.18251973],"study_design_scores_gemma":[0.00004942202,0.000051612868,0.00016250137,0.000054667064,0.00003635511,0.000045086545,0.00005840768,0.9266542,0.0011446924,0.06283765,0.008890815,0.000014570356],"about_ca_topic_score_codex":0.019758359,"about_ca_topic_score_gemma":0.03148992,"teacher_disagreement_score":0.019758359,"about_ca_system_score_codex":0.0024658146,"about_ca_system_score_gemma":0.008546104,"threshold_uncertainty_score":0.039286673},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054024596,0.027230604,0.8306168,0.00645619,0.0012063563,0.00034209178,0.0039796736,0.0056334557,0.1239946],"genre_scores_gemma":[0.008257482,0.022585701,0.88901496,0.0035961126,0.00069262326,0.00072519906,0.004581114,0.0028730335,0.06767373],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870586,0.00035253546,0.00013334394,0.00020527787,0.0005164087,0.00008655021],"domain_scores_gemma":[0.99741346,0.0015272077,0.00007873516,0.00023328324,0.00065634574,0.00009104097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015583631,0.0017541784,0.001084104,0.0023621314,0.00089245103,0.002961139,0.0026188428,0.0024520608,0.058063883],"category_scores_gemma":[0.008774044,0.0016232413,0.0010249809,0.0045540943,0.0013119258,0.004127973,0.0015677827,0.0050226245,0.03950607],"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.000048741967,0.00010574623,0.00025558725,0.0007103594,0.000035814643,0.00020863509,0.00017628894,0.018584002,0.0009620663,0.22379649,0.42401835,0.3310979],"study_design_scores_gemma":[0.00003469193,0.000025899832,0.0001321837,0.00039393353,0.000008573426,0.00024307412,0.00004693522,0.019008953,0.0004181999,0.18702424,0.79262036,0.000042931122],"about_ca_topic_score_codex":0.007905586,"about_ca_topic_score_gemma":0.012970735,"teacher_disagreement_score":0.058063883,"about_ca_system_score_codex":0.0021356165,"about_ca_system_score_gemma":0.0029585427,"threshold_uncertainty_score":0.19424301},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01717663,0.0013264947,0.5574289,0.0014991857,0.0030309507,0.00038413575,0.00512223,0.030064741,0.38396674],"genre_scores_gemma":[0.14808649,0.0012803592,0.40486437,0.0010120274,0.000422729,0.00038681537,0.008475676,0.013510856,0.42196074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999097,0.00008093232,0.000048173348,0.00019547826,0.00035006186,0.000228476],"domain_scores_gemma":[0.9983058,0.00035802834,0.000039099094,0.00087346433,0.0003384198,0.0000850963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005872303,0.0013704377,0.0012902073,0.0018686232,0.002202232,0.0033664575,0.0024387168,0.0011545292,0.14765133],"category_scores_gemma":[0.0029722108,0.0008626645,0.0013505279,0.003098785,0.0011345245,0.005478152,0.004109832,0.0024438147,0.039635535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072732934,0.0002161011,0.0002672696,0.00036241187,0.000039865594,0.0002494731,0.00025101862,0.009582203,0.0056794737,0.14841439,0.210208,0.6240024],"study_design_scores_gemma":[0.00016568745,0.00013771385,0.0003667372,0.00031053778,0.0001004514,0.00037807028,0.00033026736,0.06675567,0.01791362,0.56772214,0.34572458,0.0000945364],"about_ca_topic_score_codex":0.005681299,"about_ca_topic_score_gemma":0.010460771,"teacher_disagreement_score":0.14765133,"about_ca_system_score_codex":0.0009462743,"about_ca_system_score_gemma":0.0023207709,"threshold_uncertainty_score":0.49394292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063765394,0.00052765873,0.9864309,0.0013815402,0.000090297515,0.000043935997,0.00010605477,0.00020706536,0.004836049],"genre_scores_gemma":[0.38374338,0.0014073467,0.6063702,0.000940013,0.0005623599,0.00039990022,0.00043389716,0.00035669192,0.0057862396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958702,0.0023885032,0.000154216,0.00045567646,0.00093261985,0.00019875323],"domain_scores_gemma":[0.9678174,0.027875783,0.00091835717,0.0013944445,0.0016223176,0.00037156296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049407557,0.0010896205,0.0008796708,0.0015022963,0.0009196071,0.0035292862,0.0021127318,0.0019222421,0.006487098],"category_scores_gemma":[0.037506167,0.00078757136,0.001160008,0.0034580445,0.0029064338,0.0052956343,0.0033444928,0.005274855,0.0008331537],"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.0001613522,0.00013804609,0.0009264313,0.00032620196,0.000118643155,0.00009689034,0.00035021504,0.33596483,0.0007490069,0.50256664,0.008791844,0.1498099],"study_design_scores_gemma":[0.000016952277,0.000021934256,0.00007796122,0.000041605374,0.000013468158,0.000015104724,0.000016943937,0.6857815,0.00041963995,0.31187314,0.0017094568,0.000012245812],"about_ca_topic_score_codex":0.010440705,"about_ca_topic_score_gemma":0.008171747,"teacher_disagreement_score":0.010440705,"about_ca_system_score_codex":0.0020213346,"about_ca_system_score_gemma":0.0018216644,"threshold_uncertainty_score":0.026129544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022043005,0.0005026722,0.9653628,0.00045412435,0.000072002586,0.00015552808,0.00010767642,0.0006903206,0.010611898],"genre_scores_gemma":[0.23448822,0.00042891153,0.7582687,0.00043821274,0.00007246429,0.0004519073,0.00035005985,0.0004111907,0.00509034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808323,0.00073321693,0.000064993335,0.0002244261,0.0006235134,0.00027076015],"domain_scores_gemma":[0.9957579,0.002911528,0.00023173795,0.00046543567,0.0004585975,0.00017489695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024733124,0.0011988385,0.0012839522,0.0017690202,0.00079885055,0.001660257,0.0022025818,0.0018278813,0.006437843],"category_scores_gemma":[0.0113371825,0.00077852805,0.0008588024,0.0017680228,0.0013904228,0.0026706909,0.0028436938,0.0022886666,0.0010979981],"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.00042189087,0.00036774468,0.0017727964,0.00043602678,0.00009630519,0.00016998383,0.00035416524,0.50048566,0.009388986,0.17420489,0.010446152,0.30185536],"study_design_scores_gemma":[0.000064740205,0.00008544428,0.00016989431,0.00008086454,0.000036058722,0.000054386743,0.000060830906,0.9368045,0.0029384051,0.05338587,0.0062996023,0.000019528781],"about_ca_topic_score_codex":0.0044922302,"about_ca_topic_score_gemma":0.0056252535,"teacher_disagreement_score":0.006437843,"about_ca_system_score_codex":0.0013109023,"about_ca_system_score_gemma":0.0022473563,"threshold_uncertainty_score":0.021536708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017699411,0.00044737506,0.9772424,0.00016617998,0.00004594872,0.00006640245,0.000048659804,0.00047260444,0.0038108872],"genre_scores_gemma":[0.24539427,0.00043044882,0.7500067,0.00023579992,0.0000400092,0.00021161191,0.0002108993,0.00018378973,0.0032864737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.00004394657,0.0000150538535,0.000048862294,0.00008014658,0.000026054198],"domain_scores_gemma":[0.99966216,0.0001661997,0.00004083318,0.000059811355,0.000043726548,0.000027174443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003268375,0.0007095896,0.000763648,0.0006219127,0.00044759206,0.0006439077,0.0014390629,0.00097622664,0.0023156218],"category_scores_gemma":[0.0008914392,0.00035537424,0.0009295762,0.0006649157,0.0006273513,0.0009208982,0.001230524,0.00084761746,0.00044102417],"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.0001354863,0.0001543329,0.0018525204,0.00036425504,0.00015217352,0.00034537938,0.00017322734,0.64271027,0.05458138,0.03943533,0.0049229637,0.25517264],"study_design_scores_gemma":[0.00002191836,0.000058919795,0.00018087166,0.000014641198,0.000016468968,0.000106464126,0.000018872008,0.98731506,0.0052888226,0.0037396385,0.0032244432,0.00001384931],"about_ca_topic_score_codex":0.0015887341,"about_ca_topic_score_gemma":0.0017261336,"teacher_disagreement_score":0.0023156218,"about_ca_system_score_codex":0.0003189286,"about_ca_system_score_gemma":0.000587625,"threshold_uncertainty_score":0.0077465177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008320411,0.00042193802,0.97929263,0.00030423707,0.00006592578,0.000042653544,0.00006153807,0.00024630493,0.0112442905],"genre_scores_gemma":[0.45569247,0.00074452645,0.52846724,0.0003189003,0.00023559306,0.000495696,0.00030549258,0.00040981654,0.01333028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981458,0.0009729007,0.000082182225,0.0002058811,0.00043888137,0.0001543548],"domain_scores_gemma":[0.98916143,0.00940881,0.00025370508,0.00046092158,0.000544102,0.00017103224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388598,0.00096994644,0.0019266026,0.0012126704,0.0008130969,0.0031159413,0.0036835978,0.0027619149,0.007150158],"category_scores_gemma":[0.016635325,0.0012097809,0.0014246744,0.002472194,0.0022818171,0.0038434984,0.0026718916,0.0035055317,0.00090396206],"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.00010488907,0.000058897953,0.00018533567,0.00012994533,0.000054872864,0.00005006686,0.000063678046,0.74600846,0.0004358623,0.2115971,0.002540705,0.038770147],"study_design_scores_gemma":[0.000007975676,0.000006277512,0.000016350581,0.000007649022,0.0000050514495,0.000006302316,0.0000034675486,0.96109176,0.00008274932,0.038531132,0.00023744271,0.000003772304],"about_ca_topic_score_codex":0.0076908967,"about_ca_topic_score_gemma":0.006087837,"teacher_disagreement_score":0.0076908967,"about_ca_system_score_codex":0.0022858016,"about_ca_system_score_gemma":0.0016605646,"threshold_uncertainty_score":0.023919642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000308875,0.00009144426,0.99665725,0.00026576812,0.000059326674,0.000020788138,0.000082087376,0.00023166915,0.0022828518],"genre_scores_gemma":[0.039161764,0.00049044326,0.9519373,0.000698721,0.00035273796,0.00031497606,0.0005635071,0.00092298357,0.0055575427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951624,0.0018746434,0.00029112137,0.00063575315,0.0018588754,0.00017723098],"domain_scores_gemma":[0.9833588,0.011877286,0.0006042386,0.0018757583,0.0019079464,0.00037604908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050444715,0.0015314419,0.0016145401,0.0009867849,0.0008081383,0.0040771854,0.0048452304,0.0026307742,0.016602011],"category_scores_gemma":[0.036597893,0.001528689,0.0016654783,0.002714669,0.0016038036,0.0051835645,0.005137517,0.00863712,0.0035365347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013332375,0.00010111435,0.0003186589,0.0003724029,0.000115972514,0.00009931543,0.00010239733,0.31478846,0.001234806,0.47660714,0.024389317,0.18173714],"study_design_scores_gemma":[0.000022309281,0.000016921018,0.000036360027,0.000045807068,0.000016643562,0.000029138217,0.000008537227,0.80555403,0.0006097826,0.18527785,0.008369472,0.0000131357665],"about_ca_topic_score_codex":0.003519217,"about_ca_topic_score_gemma":0.0039321766,"teacher_disagreement_score":0.016602011,"about_ca_system_score_codex":0.0012721143,"about_ca_system_score_gemma":0.00350974,"threshold_uncertainty_score":0.05553925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085968984,0.00013015323,0.9934784,0.00050080125,0.00004970886,0.0000797144,0.00032905865,0.0005898558,0.003982655],"genre_scores_gemma":[0.034741174,0.00043696203,0.95892733,0.0005038795,0.00008071334,0.00026086785,0.0009932069,0.00022627141,0.0038296175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943873,0.0016328583,0.00049081235,0.000987101,0.002162177,0.0003397834],"domain_scores_gemma":[0.99458015,0.0021949532,0.0003699135,0.0011460069,0.001494151,0.00021483317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005743857,0.00074016233,0.000708961,0.0012175622,0.0010963044,0.004991779,0.0047322013,0.0010352451,0.0067479163],"category_scores_gemma":[0.008404787,0.000685346,0.0020457571,0.0022294715,0.0020767841,0.0052935677,0.003531967,0.003254808,0.0022453824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003655348,0.0000487208,0.00029117876,0.00019308522,0.000043890956,0.00016349669,0.00029407468,0.025701012,0.001664102,0.91793853,0.0068955934,0.046729684],"study_design_scores_gemma":[0.000060646595,0.000051934665,0.000102588994,0.00008858951,0.00005601858,0.00026785722,0.00017614233,0.25573143,0.0068372576,0.6098299,0.12673831,0.00005927133],"about_ca_topic_score_codex":0.004800556,"about_ca_topic_score_gemma":0.006995099,"teacher_disagreement_score":0.0067479163,"about_ca_system_score_codex":0.001583688,"about_ca_system_score_gemma":0.003443709,"threshold_uncertainty_score":0.030376792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030606689,0.00031453517,0.96447575,0.00026500286,0.00004018263,0.000107592656,0.000043907054,0.00028599612,0.003860252],"genre_scores_gemma":[0.50764346,0.0004362261,0.48558357,0.0003439274,0.0000383477,0.00057089736,0.00029235377,0.00013036247,0.0049608606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992914,0.00023704562,0.000035413137,0.00013041968,0.00020182061,0.000103895974],"domain_scores_gemma":[0.9988248,0.0007304125,0.00007973552,0.00007360496,0.00023118602,0.00006016056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013438738,0.0010557711,0.0012125982,0.0012632783,0.00074532616,0.00083295204,0.0016844519,0.001229246,0.0023401983],"category_scores_gemma":[0.0036853764,0.0005213023,0.0009313484,0.001493566,0.0010986463,0.0009811078,0.0012054576,0.0016978185,0.00026673437],"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.000027403024,0.00004851911,0.00080066535,0.000037516304,0.000048751437,0.00007440558,0.000094492796,0.9345538,0.0012770344,0.024187965,0.0010073129,0.037842106],"study_design_scores_gemma":[0.000009159862,0.000013621731,0.00005691994,0.0000038571866,0.000005655155,0.000013368165,0.000007744275,0.9941691,0.00017660366,0.005092232,0.0004481707,0.0000036616548],"about_ca_topic_score_codex":0.011833717,"about_ca_topic_score_gemma":0.008526378,"teacher_disagreement_score":0.011833717,"about_ca_system_score_codex":0.0014293371,"about_ca_system_score_gemma":0.001937306,"threshold_uncertainty_score":0.023529708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049457927,0.00044142487,0.9293309,0.0012878311,0.00037016967,0.00015900678,0.00074957294,0.0008270058,0.06188837],"genre_scores_gemma":[0.16937515,0.0017599885,0.7605519,0.0011608287,0.00060159864,0.0004995721,0.0027398514,0.00087553455,0.062435526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923146,0.00024543083,0.000036402256,0.00015357805,0.00024220551,0.00009090575],"domain_scores_gemma":[0.99922466,0.00045356315,0.000034558332,0.00013432602,0.00012713586,0.00002583227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007199267,0.0008498921,0.00077159057,0.0004985107,0.00052439363,0.0019310649,0.0015063437,0.0007525298,0.023230508],"category_scores_gemma":[0.0024918707,0.0005052735,0.0013658721,0.001180006,0.0011397093,0.0027069873,0.0015761934,0.0031013093,0.004895602],"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.00010702932,0.00012436048,0.00011500104,0.00036037373,0.000044797707,0.00014048292,0.0001316851,0.08532396,0.0038849998,0.74195766,0.03692018,0.13088953],"study_design_scores_gemma":[0.000099919154,0.000084498366,0.00020174966,0.00014276714,0.000050749593,0.00012770205,0.000085845066,0.30324903,0.004506532,0.59411114,0.097312614,0.000027500497],"about_ca_topic_score_codex":0.0036163004,"about_ca_topic_score_gemma":0.005269941,"teacher_disagreement_score":0.023230508,"about_ca_system_score_codex":0.0010414614,"about_ca_system_score_gemma":0.0019381599,"threshold_uncertainty_score":0.07771385},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07995174,0.004001862,0.7478414,0.004175599,0.0008180059,0.00013244653,0.000661508,0.0011790636,0.16123837],"genre_scores_gemma":[0.63095474,0.003047564,0.3239664,0.0010516858,0.0007726582,0.00022046099,0.0010482128,0.00037083263,0.03856747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679,0.0011445784,0.00019293351,0.00069426565,0.0008118111,0.000366376],"domain_scores_gemma":[0.99633646,0.0014867292,0.0002332588,0.0010389105,0.00068711117,0.00021755967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004553554,0.0008704632,0.0008446214,0.0037031583,0.0019844188,0.0045839925,0.0010723221,0.0011368894,0.005868348],"category_scores_gemma":[0.006575235,0.0005824832,0.0017851202,0.0024289086,0.0060738507,0.013698211,0.007867679,0.0030492884,0.0013759028],"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.000007318003,0.0000053745716,0.0000842389,0.000021199066,0.0000038629346,0.000037348535,0.00039246355,0.00039662182,0.00039507065,0.99246913,0.0004583704,0.005729092],"study_design_scores_gemma":[0.0000063662364,0.000017424292,0.000100012316,0.000021279722,0.000010995591,0.00008858792,0.00011811717,0.0027703496,0.0005479614,0.95436895,0.041939553,0.000010376953],"about_ca_topic_score_codex":0.0014263034,"about_ca_topic_score_gemma":0.0015695997,"teacher_disagreement_score":0.005868348,"about_ca_system_score_codex":0.0026413163,"about_ca_system_score_gemma":0.0010698538,"threshold_uncertainty_score":0.024081767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021428077,0.0014858766,0.9659615,0.0011745013,0.00020366763,0.000109360095,0.0007631235,0.003786769,0.0050870655],"genre_scores_gemma":[0.6456522,0.0011817695,0.3295605,0.0012702323,0.00035858253,0.0005597501,0.0032998484,0.0006587717,0.017458454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987344,0.00033920727,0.00006430123,0.00037711358,0.00035612375,0.00012885603],"domain_scores_gemma":[0.99722964,0.001622267,0.00025869938,0.00027649826,0.00051288423,0.00010007496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025493843,0.0012461209,0.0013893507,0.0012121606,0.00054693344,0.0016571956,0.0030986804,0.0018580244,0.004582461],"category_scores_gemma":[0.010757091,0.0009634385,0.000735041,0.0012573651,0.0009622267,0.0025429162,0.0016825973,0.002958014,0.0014080415],"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.00026185828,0.00012687892,0.0018137677,0.00009841483,0.000104913015,0.000052551768,0.00004320009,0.7626496,0.0009786815,0.01803026,0.007628375,0.20821145],"study_design_scores_gemma":[0.0000040046148,0.000008487793,0.00005349089,0.00000765975,0.000003430608,0.0000044138355,0.000001743183,0.99450135,0.00019756543,0.0048433784,0.00037141846,0.0000030230983],"about_ca_topic_score_codex":0.023256332,"about_ca_topic_score_gemma":0.03125307,"teacher_disagreement_score":0.023256332,"about_ca_system_score_codex":0.0024030851,"about_ca_system_score_gemma":0.0025622537,"threshold_uncertainty_score":0.04624194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007415936,0.00015814861,0.9821583,0.00023428997,0.000039370054,0.00027280557,0.00012640176,0.0010228307,0.008571926],"genre_scores_gemma":[0.177479,0.0003831049,0.8156682,0.00025468913,0.000056391586,0.000551925,0.00080788,0.0002637598,0.0045349067],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924976,0.00012684644,0.00006138691,0.00016550082,0.00029853257,0.000098066186],"domain_scores_gemma":[0.9997416,0.000069343776,0.000019426616,0.000054297077,0.000100853424,0.000014513886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895605,0.00053302944,0.00088604796,0.0012493797,0.0010548864,0.0008210037,0.0013512045,0.0005856759,0.00677833],"category_scores_gemma":[0.0011339772,0.00035544572,0.0007617246,0.0015331979,0.0005874114,0.0010984318,0.0013485813,0.0011147498,0.0011535563],"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.00021693413,0.00031709578,0.0023467864,0.0007981448,0.000093483104,0.0002708646,0.00031775056,0.1468138,0.026163897,0.110018365,0.01832539,0.69431746],"study_design_scores_gemma":[0.00022083324,0.000118213655,0.0007120343,0.000054544093,0.00006409574,0.0003159901,0.00012225335,0.9010848,0.025208779,0.052695125,0.019353805,0.000049556606],"about_ca_topic_score_codex":0.006115262,"about_ca_topic_score_gemma":0.004762334,"teacher_disagreement_score":0.00677833,"about_ca_system_score_codex":0.0008722778,"about_ca_system_score_gemma":0.002320685,"threshold_uncertainty_score":0.022675753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19540781,0.002467152,0.77595204,0.0055505945,0.000063838655,0.00029412474,0.0012087139,0.0008897491,0.018166041],"genre_scores_gemma":[0.7885288,0.0012471118,0.20402233,0.00036470412,0.00018393963,0.00039919492,0.0012555609,0.000243962,0.003754491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98538244,0.0052555525,0.0011812804,0.0023762097,0.0046748244,0.0011296746],"domain_scores_gemma":[0.93537366,0.05225349,0.0025583813,0.006532725,0.0023749121,0.00090675807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009313096,0.0009769645,0.001842889,0.002541602,0.0014523565,0.0068213018,0.003155539,0.0022341763,0.0061220527],"category_scores_gemma":[0.05084435,0.001138076,0.004052565,0.0035832722,0.0048358426,0.014769871,0.00537475,0.004614362,0.00038840494],"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.00022149214,0.00009602238,0.0022140366,0.00027125856,0.00016074281,0.00030922264,0.0008329134,0.1623798,0.0015081739,0.7959473,0.0020985329,0.033960495],"study_design_scores_gemma":[0.000039999442,0.000024618139,0.0005413889,0.00003917136,0.00005826549,0.00009649031,0.00010880984,0.20634575,0.0007312076,0.7896053,0.0023734004,0.000035607674],"about_ca_topic_score_codex":0.0076673,"about_ca_topic_score_gemma":0.0054773446,"teacher_disagreement_score":0.009313096,"about_ca_system_score_codex":0.008173858,"about_ca_system_score_gemma":0.0034134407,"threshold_uncertainty_score":0.059305727},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123601116,0.1571845,0.6672142,0.01345633,0.00067030505,0.00021185949,0.0018820948,0.0009049227,0.034874674],"genre_scores_gemma":[0.60437256,0.11179263,0.2656937,0.0019417779,0.0038472475,0.00036453624,0.0035408991,0.00085389556,0.0075927963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948655,0.0012278036,0.0003530368,0.0012337763,0.0019335275,0.00038636083],"domain_scores_gemma":[0.97997093,0.016223447,0.0008073063,0.0018512041,0.00080304465,0.00034398254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035681773,0.0011457262,0.0024003636,0.0025964368,0.00083986676,0.0045031505,0.0026290594,0.0016736287,0.0053605977],"category_scores_gemma":[0.017262489,0.0012806376,0.0021247156,0.0050184564,0.00295993,0.0114342505,0.002582013,0.0041089966,0.0007493268],"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.00021303039,0.0003315378,0.0067815683,0.0037757822,0.00031449698,0.00020926056,0.00042132923,0.16275148,0.002531925,0.46807668,0.015939986,0.3386529],"study_design_scores_gemma":[0.00005082612,0.0001302836,0.0028318258,0.0003330156,0.00008684771,0.00040280807,0.00016973286,0.16906966,0.0011644888,0.79930234,0.026393771,0.000064458414],"about_ca_topic_score_codex":0.0015361301,"about_ca_topic_score_gemma":0.0015165168,"teacher_disagreement_score":0.0053605977,"about_ca_system_score_codex":0.0023731987,"about_ca_system_score_gemma":0.0018847524,"threshold_uncertainty_score":0.018870533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09939904,0.000587917,0.890594,0.00034279094,0.0000725163,0.00018834678,0.00059429544,0.00042400704,0.0077970554],"genre_scores_gemma":[0.2760747,0.00072375213,0.7123321,0.00016402763,0.000038011403,0.0002157884,0.0013698181,0.0004813446,0.008600406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994803,0.00017477335,0.000024006975,0.000113776754,0.000121244855,0.00008594219],"domain_scores_gemma":[0.997232,0.0019514853,0.00021060139,0.00013312862,0.00026305323,0.00020958038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011045471,0.0012534286,0.0013054494,0.0033640969,0.0011347001,0.0018215072,0.0012645327,0.0014130642,0.0072321985],"category_scores_gemma":[0.0069827945,0.0015843674,0.0012468748,0.0029130562,0.0012904548,0.0033657663,0.0017462932,0.00212905,0.000726348],"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.00026221422,0.00020896929,0.002654051,0.00036508657,0.00011284471,0.00016162702,0.00039950648,0.76289785,0.0029112375,0.10501377,0.0065479954,0.11846484],"study_design_scores_gemma":[0.000029415001,0.000041197156,0.00040895102,0.000069219364,0.000022661,0.000036934987,0.00016221865,0.88857996,0.0009671104,0.10769201,0.001972592,0.000017730172],"about_ca_topic_score_codex":0.010447832,"about_ca_topic_score_gemma":0.015344996,"teacher_disagreement_score":0.010447832,"about_ca_system_score_codex":0.0019427543,"about_ca_system_score_gemma":0.0014801472,"threshold_uncertainty_score":0.024194062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020746479,0.004661869,0.96137494,0.0008445866,0.00015930706,0.00006742798,0.00009098494,0.00032070314,0.0117337145],"genre_scores_gemma":[0.56266963,0.0034536275,0.41214636,0.000465945,0.00043373025,0.0006078709,0.0003710288,0.00033641033,0.019515494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984549,0.0009340218,0.000045938355,0.000117997515,0.00036894187,0.00007818067],"domain_scores_gemma":[0.99404114,0.004924775,0.00020698002,0.00037338267,0.0003404209,0.0001131796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030512214,0.00072136754,0.0024964677,0.0014141337,0.0006933295,0.0019745955,0.0020519872,0.0019215342,0.005320092],"category_scores_gemma":[0.015099765,0.0008321445,0.00063047267,0.0033882179,0.0018917089,0.0029563508,0.0016401487,0.002208146,0.00063298846],"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.00021607056,0.000103326616,0.00038700673,0.0002954716,0.00007234786,0.00004555305,0.00007506812,0.7929736,0.00042820175,0.12978876,0.0053749965,0.070239626],"study_design_scores_gemma":[0.00002419413,0.00002431949,0.000052704523,0.000012922292,0.0000124123,0.000010714825,0.000010544574,0.94710237,0.00011437631,0.05164608,0.000984968,0.000004483795],"about_ca_topic_score_codex":0.005125939,"about_ca_topic_score_gemma":0.0056293067,"teacher_disagreement_score":0.005320092,"about_ca_system_score_codex":0.0016521567,"about_ca_system_score_gemma":0.0011096732,"threshold_uncertainty_score":0.01779753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069058673,0.011824499,0.9542544,0.0046818615,0.0003278371,0.000091736656,0.0005384548,0.00031226728,0.021063076],"genre_scores_gemma":[0.36482224,0.02901499,0.58082217,0.0024656844,0.0021978167,0.00061816187,0.0028175833,0.00041298842,0.0168284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761766,0.0011615666,0.00013976294,0.00040062753,0.0005514232,0.00012891821],"domain_scores_gemma":[0.9964774,0.0027524761,0.00021680993,0.00024728544,0.00022294087,0.00008311757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020784372,0.0014165902,0.0011644008,0.0017435214,0.00070887886,0.003375693,0.0022413265,0.0023011665,0.0071532936],"category_scores_gemma":[0.009838896,0.0008162545,0.0019559527,0.003366942,0.0029496006,0.0051791626,0.0021147844,0.0035111632,0.00097323867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028004995,0.00003746096,0.0003703807,0.00045242923,0.00011369011,0.00011218675,0.000086633605,0.1569796,0.00026978244,0.7902719,0.008210136,0.043067813],"study_design_scores_gemma":[0.00000936048,0.0000048055504,0.0000913679,0.00005204195,0.00001103131,0.000032494732,0.000016695729,0.17878565,0.00012554777,0.81534386,0.005517502,0.000009749813],"about_ca_topic_score_codex":0.0058881375,"about_ca_topic_score_gemma":0.006994592,"teacher_disagreement_score":0.0071532936,"about_ca_system_score_codex":0.0022789012,"about_ca_system_score_gemma":0.0014025511,"threshold_uncertainty_score":0.023930192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09575736,0.0026403146,0.60270613,0.011849379,0.0020511146,0.0002485571,0.0014290888,0.0060693454,0.27724877],"genre_scores_gemma":[0.764044,0.0015705895,0.078305624,0.0035319782,0.0005698965,0.0005493665,0.0019389318,0.006516642,0.14297302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980882,0.00052723225,0.00007332872,0.0005241595,0.000338499,0.0004485769],"domain_scores_gemma":[0.987483,0.0074261366,0.0004630539,0.0016396245,0.0021988968,0.00078927126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027559614,0.001286113,0.0019750022,0.001455144,0.0018595301,0.0042098733,0.0014350004,0.0018609697,0.040310096],"category_scores_gemma":[0.041161846,0.00057861075,0.0009880211,0.00073444867,0.0024991874,0.004391219,0.0031469886,0.0036898542,0.01129614],"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.00044920153,0.00018570836,0.0043017617,0.0006996506,0.00012955326,0.00047618456,0.00068754156,0.07644161,0.004166946,0.7102882,0.08977945,0.11239414],"study_design_scores_gemma":[0.00006453305,0.0001495778,0.0012911499,0.00039902134,0.000055787485,0.00059699966,0.0006228107,0.33365202,0.004448248,0.62160355,0.03705918,0.000057032616],"about_ca_topic_score_codex":0.003915164,"about_ca_topic_score_gemma":0.0043332935,"teacher_disagreement_score":0.040310096,"about_ca_system_score_codex":0.0017842591,"about_ca_system_score_gemma":0.002559518,"threshold_uncertainty_score":0.13485068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008102901,0.0014847472,0.87804186,0.0005085284,0.0006521292,0.00031156722,0.00060493714,0.0031513935,0.107141964],"genre_scores_gemma":[0.07179209,0.0013712128,0.87947524,0.00047832806,0.00046206638,0.0007126297,0.002502292,0.0042665396,0.038939647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568886,0.0013034686,0.000335857,0.0008263974,0.0014761729,0.00036913544],"domain_scores_gemma":[0.9948755,0.0018420868,0.00010721096,0.0019569492,0.0010018792,0.0002163838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029774492,0.0017841359,0.0021462445,0.0032234662,0.0020572373,0.004309101,0.0027613621,0.0022378871,0.041017253],"category_scores_gemma":[0.01292203,0.001191309,0.0028089255,0.0045511853,0.0012490067,0.0048512626,0.0044163694,0.0031528417,0.022421595],"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.00036875223,0.00017924265,0.00075665565,0.00069214875,0.00012545739,0.00021582,0.00019624339,0.011308052,0.009615909,0.3545036,0.03574059,0.5862975],"study_design_scores_gemma":[0.000085955246,0.0002565812,0.0010387388,0.00041181728,0.0002342128,0.0007855721,0.00016260621,0.13291042,0.019110233,0.64981395,0.1951145,0.00007547812],"about_ca_topic_score_codex":0.00030332746,"about_ca_topic_score_gemma":0.00058065064,"teacher_disagreement_score":0.041017253,"about_ca_system_score_codex":0.00089101,"about_ca_system_score_gemma":0.0013440595,"threshold_uncertainty_score":0.13721639},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069091644,0.00010542976,0.99649423,0.00013516757,0.000043870517,0.000049670914,0.00010230831,0.0006661028,0.0017122679],"genre_scores_gemma":[0.051064793,0.00025860558,0.9404204,0.00044779872,0.000122667,0.00053030543,0.00079047546,0.0015182232,0.004846786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987941,0.00037751303,0.000059482456,0.00019770651,0.00047551238,0.00009564848],"domain_scores_gemma":[0.99681276,0.0019714015,0.00018197758,0.0004216865,0.00045034854,0.00016191564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019685389,0.0020276487,0.001328708,0.0013051517,0.0007304839,0.001365474,0.002350068,0.0020420484,0.0118753305],"category_scores_gemma":[0.009438452,0.0010125784,0.0013835239,0.0015289088,0.0017587368,0.0014646734,0.0034190952,0.005325399,0.002559478],"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.0001141584,0.00011225869,0.00058942277,0.0003506467,0.00009280684,0.00013002803,0.00008008014,0.69009584,0.0020317347,0.10563093,0.030493187,0.17027892],"study_design_scores_gemma":[0.000026548774,0.000012553509,0.000027227885,0.000020991978,0.000004216882,0.00001800024,0.0000074312984,0.9670679,0.0005518574,0.027414015,0.004841741,0.000007469325],"about_ca_topic_score_codex":0.0077717947,"about_ca_topic_score_gemma":0.012752642,"teacher_disagreement_score":0.0118753305,"about_ca_system_score_codex":0.0013439916,"about_ca_system_score_gemma":0.0041972185,"threshold_uncertainty_score":0.039726913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019097164,0.0012316298,0.924454,0.0034053202,0.00014042754,0.00014360216,0.00017626464,0.00027023393,0.051081534],"genre_scores_gemma":[0.55514544,0.0020851789,0.4232661,0.0018804914,0.00077724707,0.0006698142,0.00037589332,0.00023387966,0.015565903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971148,0.0009214805,0.000183824,0.000366002,0.001178674,0.00023529392],"domain_scores_gemma":[0.99662244,0.0015690804,0.00033186257,0.00056987314,0.000596608,0.0003101807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033471258,0.00053614756,0.00078773353,0.0025573825,0.0023708944,0.003813952,0.0021638977,0.0015396659,0.0060630743],"category_scores_gemma":[0.0055702208,0.00045556162,0.0015646822,0.0017738458,0.0072366716,0.0107653905,0.0037053954,0.004400282,0.0009236535],"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.0000018392484,0.0000036252213,0.000019378273,0.000008500009,9.62199e-7,0.0000085820975,0.00005345402,0.00017424619,0.0000840472,0.9987595,0.00010492222,0.00078099995],"study_design_scores_gemma":[0.0000050734793,0.000011145534,0.000041625524,0.000017029468,0.0000038497406,0.000043673044,0.00006485049,0.0046598576,0.00031302441,0.98979926,0.0050319405,0.000008748855],"about_ca_topic_score_codex":0.0012603182,"about_ca_topic_score_gemma":0.0012998241,"teacher_disagreement_score":0.0060630743,"about_ca_system_score_codex":0.0026088383,"about_ca_system_score_gemma":0.0022315397,"threshold_uncertainty_score":0.020282984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002706045,0.0060283425,0.9408316,0.0025147863,0.000542212,0.00011873437,0.0014177404,0.0021878104,0.04365275],"genre_scores_gemma":[0.026757985,0.008196294,0.897201,0.0008698942,0.00042113062,0.00042621794,0.0026949262,0.00165194,0.061780613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976833,0.00052017375,0.00012229978,0.00050417456,0.0010658976,0.00010424028],"domain_scores_gemma":[0.998173,0.000753265,0.000057643014,0.00036316612,0.0005717766,0.000081170765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192347,0.0018126166,0.0020022658,0.0033492995,0.0016089657,0.007607986,0.0025417688,0.003425091,0.031033808],"category_scores_gemma":[0.0050635333,0.0014594404,0.0024701743,0.0026119668,0.0032371432,0.00459958,0.002251979,0.010066448,0.014818961],"study_design_candidate":"not_applicable","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.00007852078,0.00005795759,0.0004679651,0.00071724167,0.000082639905,0.00025634083,0.00086145697,0.019292576,0.004551309,0.79095227,0.037105843,0.14557587],"study_design_scores_gemma":[0.000030236257,0.000036407946,0.0007733307,0.00027198947,0.000022638786,0.0005803313,0.00027725915,0.029986138,0.0030857988,0.18953115,0.77530944,0.0000953785],"about_ca_topic_score_codex":0.03679353,"about_ca_topic_score_gemma":0.03780608,"teacher_disagreement_score":0.96320647,"about_ca_system_score_codex":0.0042576427,"about_ca_system_score_gemma":0.0037279162,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11011715,0.0053381645,0.8235773,0.0027085312,0.00035076562,0.0001406887,0.00093058846,0.00040000968,0.05643678],"genre_scores_gemma":[0.86693496,0.0022487328,0.116825886,0.00042185138,0.0006114532,0.00042688308,0.0008672139,0.0002800788,0.01138294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946122,0.0026075193,0.00024141993,0.00054161507,0.0016558713,0.00034139043],"domain_scores_gemma":[0.98208606,0.012580593,0.001715645,0.0013045206,0.001476677,0.00083653425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008477011,0.0016305107,0.0017017891,0.00770422,0.0013294176,0.00470772,0.001618639,0.0016059116,0.0077322703],"category_scores_gemma":[0.039226048,0.00073018874,0.00084690744,0.0075173024,0.0038943843,0.011209645,0.0026509142,0.0025162485,0.00061813695],"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.00016298305,0.00007169991,0.0017245586,0.00014469148,0.00009391194,0.000029008836,0.00013777515,0.04427546,0.00072205125,0.9038051,0.0027941915,0.04603876],"study_design_scores_gemma":[0.00001741564,0.00008280566,0.001052262,0.000067641144,0.00002829011,0.000041200045,0.00009213532,0.10317641,0.00047360305,0.8917128,0.0032340644,0.00002133642],"about_ca_topic_score_codex":0.0012466849,"about_ca_topic_score_gemma":0.00094546005,"teacher_disagreement_score":0.008477011,"about_ca_system_score_codex":0.002894337,"about_ca_system_score_gemma":0.0008682118,"threshold_uncertainty_score":0.044831276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022385696,0.001587421,0.9647163,0.0011434713,0.00020801155,0.000109861576,0.00073096895,0.0039007692,0.0052174567],"genre_scores_gemma":[0.6624199,0.0011867611,0.31354797,0.0012648955,0.00034556747,0.0005434389,0.0031620534,0.00062661193,0.016902778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988136,0.00030853678,0.000060238883,0.00035826783,0.00032978688,0.00012955027],"domain_scores_gemma":[0.99735475,0.0015442006,0.0002583137,0.00024370436,0.0005005415,0.00009844113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023811813,0.0012635425,0.0013932886,0.0011882444,0.00054108095,0.0015799708,0.0031305235,0.0018022654,0.0045949146],"category_scores_gemma":[0.010140774,0.0009154773,0.00071984774,0.001172479,0.00092718046,0.002376226,0.0016109814,0.0028607477,0.0013930988],"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.00026549835,0.00012976195,0.0018996141,0.0001027526,0.00010507421,0.00005485984,0.00004205809,0.75879425,0.0010322941,0.016713595,0.0074437326,0.21341647],"study_design_scores_gemma":[0.0000040381005,0.000009342866,0.000055294844,0.000008223259,0.000003680704,0.0000046819746,0.000001848587,0.99498004,0.00020887211,0.0043485113,0.00037232033,0.0000031826266],"about_ca_topic_score_codex":0.022931978,"about_ca_topic_score_gemma":0.032571282,"teacher_disagreement_score":0.022931978,"about_ca_system_score_codex":0.00235416,"about_ca_system_score_gemma":0.0026075707,"threshold_uncertainty_score":0.045597017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023086658,0.000087672204,0.9732309,0.000054891338,0.00004125212,0.000049208782,0.00020394061,0.0010093526,0.0022361411],"genre_scores_gemma":[0.41045114,0.00025815397,0.5830741,0.000053563363,0.000036087786,0.00012869245,0.0016653755,0.0004177931,0.0039150254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953437,0.000033407065,0.000031165728,0.000084170664,0.00025160902,0.00006520974],"domain_scores_gemma":[0.9993574,0.00019014723,0.00006879612,0.00012634794,0.00021495254,0.00004239708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046615637,0.00047267982,0.0009210211,0.0014327597,0.0004373292,0.0020118926,0.0013926008,0.0004487992,0.004073015],"category_scores_gemma":[0.0022957264,0.00031644927,0.000674971,0.001642073,0.0005277256,0.0015331082,0.0015729599,0.000584172,0.0007954589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034921686,0.000109285036,0.004298719,0.00038335723,0.00006383617,0.00042648453,0.00029770052,0.39303362,0.02540975,0.094918974,0.011571524,0.46913755],"study_design_scores_gemma":[0.000013036682,0.000042909418,0.00057465216,0.000010798413,0.000007690777,0.000113884045,0.00009538737,0.97291,0.0077409875,0.014372054,0.0040994682,0.000019213316],"about_ca_topic_score_codex":0.0049875486,"about_ca_topic_score_gemma":0.0044475878,"teacher_disagreement_score":0.0049875486,"about_ca_system_score_codex":0.000958289,"about_ca_system_score_gemma":0.000920115,"threshold_uncertainty_score":0.013625622},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015948832,0.30591154,0.05831883,0.17096381,0.06762655,0.00009840564,0.0020070777,0.0011108078,0.37801412],"genre_scores_gemma":[0.29085344,0.20676427,0.034820963,0.029160544,0.13741511,0.00041428773,0.0035580387,0.0013142377,0.29569903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943525,0.00015344465,0.000020484276,0.00014374993,0.00017043478,0.00007654527],"domain_scores_gemma":[0.9991248,0.00055806316,0.000031740048,0.000047476093,0.0001286696,0.00010934856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009428936,0.00084225583,0.00077514467,0.001203796,0.0009992346,0.002820308,0.0005321296,0.0014527426,0.03487827],"category_scores_gemma":[0.0028229766,0.0003927456,0.00080613774,0.0012308095,0.0013423715,0.004325838,0.0016034395,0.003648645,0.0088153705],"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.00006707337,0.00005721244,0.00030900718,0.00041602165,0.000048135822,0.00011785031,0.00034211477,0.0018173037,0.0009016052,0.4257568,0.49698702,0.07317981],"study_design_scores_gemma":[0.000028258843,0.000035808036,0.00064182153,0.0002162215,0.000027387478,0.00022187148,0.00015933126,0.0013766366,0.0005454232,0.47140795,0.5253071,0.000032209304],"about_ca_topic_score_codex":0.0010015774,"about_ca_topic_score_gemma":0.00089952094,"teacher_disagreement_score":0.03487827,"about_ca_system_score_codex":0.0018729334,"about_ca_system_score_gemma":0.0005926111,"threshold_uncertainty_score":0.11667949},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022225475,0.0001458059,0.9949286,0.00014435811,0.00003853298,0.000037594375,0.00007059918,0.00025172805,0.0021602656],"genre_scores_gemma":[0.07646523,0.00031928514,0.91906965,0.00018229066,0.000097613745,0.00020675593,0.0003387261,0.00026349703,0.0030568903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.00027140937,0.00005352733,0.00014109701,0.00025093244,0.00011116237],"domain_scores_gemma":[0.9985721,0.00074548245,0.00010547102,0.0001452656,0.00037064136,0.00006097788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014811751,0.0010398375,0.0012263305,0.0009860566,0.000584358,0.0012396578,0.0017106836,0.0011561331,0.0067595216],"category_scores_gemma":[0.0038392053,0.00058203563,0.0013391842,0.0018455312,0.00055050454,0.0015251248,0.0011899853,0.002806497,0.0010590248],"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.000109202236,0.000101968886,0.00028067088,0.0002071818,0.00007015447,0.00013767408,0.000073757146,0.81543,0.0035251034,0.04300129,0.0070386683,0.1300244],"study_design_scores_gemma":[0.000017408756,0.000020426283,0.000037076286,0.000008328298,0.000007599247,0.000024604822,0.000006158819,0.9929932,0.00053421076,0.004208639,0.0021364863,0.0000058813107],"about_ca_topic_score_codex":0.010398565,"about_ca_topic_score_gemma":0.007575226,"teacher_disagreement_score":0.010398565,"about_ca_system_score_codex":0.00095769035,"about_ca_system_score_gemma":0.0023697116,"threshold_uncertainty_score":0.02261287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12330357,0.00042503676,0.8634489,0.00027490058,0.00005848664,0.00015028012,0.00014542647,0.0030427459,0.009150612],"genre_scores_gemma":[0.70396334,0.00013220399,0.29238215,0.00022462934,0.000027392794,0.00020326693,0.0004865464,0.0003358486,0.00224468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914956,0.00039263855,0.000032838998,0.00015096867,0.00016561162,0.00010837495],"domain_scores_gemma":[0.9984902,0.0009064634,0.00013274602,0.00017756266,0.00020988603,0.00008319766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012395374,0.0006298741,0.00081757864,0.0007503483,0.0003440654,0.0006742021,0.0013817061,0.0005781174,0.0028403304],"category_scores_gemma":[0.0031569116,0.0003147481,0.0006394699,0.0010206496,0.0008071601,0.00064613,0.0012122269,0.0008438886,0.0006564632],"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.00016291352,0.00016901613,0.00078589754,0.00010970424,0.000043898373,0.00006006717,0.000051204577,0.9199789,0.003007436,0.013460152,0.0033886405,0.058782123],"study_design_scores_gemma":[0.000022196813,0.000032212258,0.00005759793,0.0000047738636,0.000005369513,0.0000071704444,0.0000066247253,0.99712604,0.00085234584,0.0015960579,0.00028677526,0.0000028327856],"about_ca_topic_score_codex":0.0042635617,"about_ca_topic_score_gemma":0.0049080644,"teacher_disagreement_score":0.0042635617,"about_ca_system_score_codex":0.000900168,"about_ca_system_score_gemma":0.0014509789,"threshold_uncertainty_score":0.009501874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12881185,0.0013747712,0.84472317,0.0010371901,0.00015895347,0.00042016874,0.00020797044,0.0026923479,0.020573635],"genre_scores_gemma":[0.505591,0.00048941455,0.48610047,0.00046869385,0.00006797464,0.0007295893,0.0005095604,0.00069846737,0.005344835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978116,0.0009746883,0.00013907619,0.0003474979,0.00044975293,0.0002774721],"domain_scores_gemma":[0.9946004,0.0036351087,0.00026661748,0.00082756544,0.00046308112,0.00020716008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048542,0.0014866684,0.0019296252,0.0011022241,0.00094270933,0.0021463896,0.0019287053,0.0020459702,0.009537645],"category_scores_gemma":[0.013835397,0.0011550451,0.0014303896,0.0013282779,0.0020196913,0.00392949,0.003914221,0.0026548493,0.001951471],"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.00036222112,0.0003305588,0.0014703529,0.00043457595,0.00009073102,0.0003427943,0.00041749168,0.78069574,0.004070191,0.06384833,0.004526663,0.1434103],"study_design_scores_gemma":[0.00008730914,0.00027182366,0.00016954012,0.0000784863,0.000036278838,0.000086702275,0.00010217281,0.93013453,0.002035512,0.063252814,0.0037167962,0.000028023103],"about_ca_topic_score_codex":0.00160171,"about_ca_topic_score_gemma":0.0026903872,"teacher_disagreement_score":0.009537645,"about_ca_system_score_codex":0.0010278946,"about_ca_system_score_gemma":0.001606775,"threshold_uncertainty_score":0.031906605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048070133,0.00034228512,0.9458182,0.0008197204,0.000032107862,0.00025061742,0.0009861446,0.0011728444,0.002507934],"genre_scores_gemma":[0.5305026,0.00034450126,0.46023256,0.00063209515,0.00007897622,0.00054121367,0.0044768965,0.00027771355,0.0029132862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979109,0.00078760495,0.00011985508,0.00053280307,0.00045665097,0.0001921019],"domain_scores_gemma":[0.9784111,0.01792976,0.0009187083,0.0010007353,0.0013737992,0.0003658836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027821802,0.0016693749,0.0013438348,0.0013068053,0.00076588977,0.0017758724,0.0028474187,0.0020752056,0.004941016],"category_scores_gemma":[0.02540443,0.0008606558,0.0011084254,0.0019930038,0.0011973326,0.0048319316,0.0021643692,0.0031689284,0.00054336037],"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.00015607062,0.00013298259,0.0014665297,0.00018268147,0.00004507119,0.000103104554,0.00012809463,0.9077089,0.0006841673,0.008496605,0.0032977995,0.07759801],"study_design_scores_gemma":[0.000014906099,0.000010803499,0.00008084571,0.000006885746,0.0000035051926,0.000010817624,0.000023555933,0.9919303,0.0003000101,0.007334766,0.000279998,0.0000035206067],"about_ca_topic_score_codex":0.020946553,"about_ca_topic_score_gemma":0.029493764,"teacher_disagreement_score":0.020946553,"about_ca_system_score_codex":0.0029843552,"about_ca_system_score_gemma":0.003141853,"threshold_uncertainty_score":0.041649282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008560285,0.0006177578,0.97290957,0.0012623367,0.00010102195,0.000042449345,0.0002589318,0.000046798643,0.016200874],"genre_scores_gemma":[0.54233366,0.0023352532,0.4171537,0.0009041181,0.00036783563,0.00066869095,0.0010001393,0.00037677807,0.034859803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973443,0.0016824695,0.000073244104,0.00030758412,0.00048246238,0.000109991655],"domain_scores_gemma":[0.9926649,0.005956945,0.0003123753,0.00046540255,0.00041655582,0.00018384273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038763355,0.0013685608,0.0014180358,0.0010701362,0.0007055293,0.0026134416,0.0015216129,0.0014729685,0.008441535],"category_scores_gemma":[0.018120788,0.001179179,0.0012302352,0.002328902,0.0022587015,0.0038703764,0.0025681516,0.0027892138,0.00060401065],"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.000052280455,0.00004589011,0.00020579548,0.0001906538,0.00006929332,0.000046396166,0.00007519961,0.16035286,0.0004511665,0.81770855,0.004071251,0.016730633],"study_design_scores_gemma":[0.000021420463,0.000013243818,0.00009205261,0.000038618364,0.000013012417,0.000016084381,0.00003238171,0.3431626,0.00027485058,0.65352887,0.002795877,0.000011027982],"about_ca_topic_score_codex":0.003955693,"about_ca_topic_score_gemma":0.002850045,"teacher_disagreement_score":0.008441535,"about_ca_system_score_codex":0.0023651742,"about_ca_system_score_gemma":0.0016207295,"threshold_uncertainty_score":0.028239727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008990228,0.000060329963,0.98986316,0.000057640264,0.00001058143,0.000032162483,0.00006741182,0.00011936622,0.00079913554],"genre_scores_gemma":[0.4781301,0.00017663796,0.51985836,0.00006779298,0.00003076368,0.00018363117,0.00031120598,0.000036303518,0.0012050793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991567,0.000157462,0.000069361915,0.00027062674,0.00028737928,0.00005844035],"domain_scores_gemma":[0.99906176,0.00039999446,0.00013477681,0.000116089956,0.00023995491,0.000047327718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000818164,0.0005208046,0.0010703625,0.00092539773,0.0005887622,0.0014745003,0.0018113693,0.00086574175,0.0013605795],"category_scores_gemma":[0.0027858326,0.0004649484,0.0011152549,0.0012300917,0.00075880456,0.0014256149,0.0009095039,0.00088423473,0.0001975047],"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.000057875655,0.000043666347,0.0007268025,0.00007373747,0.00004224585,0.00017222282,0.00012143557,0.9208549,0.0038929805,0.019517586,0.0006374728,0.053859044],"study_design_scores_gemma":[0.000004980983,0.000009556335,0.00007864249,0.0000035424357,0.000006607515,0.000016686168,0.00000979146,0.99474144,0.00044950965,0.0043852828,0.0002892286,0.0000047014314],"about_ca_topic_score_codex":0.0108426735,"about_ca_topic_score_gemma":0.010601223,"teacher_disagreement_score":0.0108426735,"about_ca_system_score_codex":0.0011284819,"about_ca_system_score_gemma":0.0015104976,"threshold_uncertainty_score":0.02155912},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009297681,0.00056969567,0.9856574,0.0004959896,0.00005011295,0.00010911375,0.00015263741,0.0006339921,0.003033358],"genre_scores_gemma":[0.28611684,0.00077157776,0.7077187,0.00054028543,0.00016162201,0.0006080391,0.0007453244,0.00046530936,0.0028722992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786645,0.0010630015,0.00007043822,0.00024790803,0.0005340462,0.00021830351],"domain_scores_gemma":[0.99210405,0.006302189,0.00043778308,0.00044553037,0.0004761122,0.00023422808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035736896,0.0011238444,0.001689828,0.0019315521,0.0008755324,0.002258711,0.0021712822,0.002180073,0.004369562],"category_scores_gemma":[0.015019883,0.0010776289,0.0020661603,0.0023950327,0.0020576809,0.0026007276,0.0019159748,0.0035477018,0.0007582858],"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.00008766163,0.00008161157,0.0008639908,0.00009445762,0.00006287124,0.00007107673,0.00007059412,0.88414174,0.0004988604,0.07928481,0.002482503,0.032259848],"study_design_scores_gemma":[0.000010266414,0.000013059373,0.00002917381,0.000012004933,0.000005687475,0.000011073383,0.000006113454,0.97790295,0.00009919809,0.021277657,0.0006287403,0.0000041269004],"about_ca_topic_score_codex":0.006026135,"about_ca_topic_score_gemma":0.008624146,"teacher_disagreement_score":0.006026135,"about_ca_system_score_codex":0.0019360044,"about_ca_system_score_gemma":0.0032623378,"threshold_uncertainty_score":0.01889968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020885812,0.00017252762,0.9725175,0.00014217934,0.00003655255,0.00005476726,0.00029925202,0.00025011695,0.00564135],"genre_scores_gemma":[0.42760706,0.00071474875,0.5614707,0.00014784401,0.00009179957,0.00026974,0.0016984487,0.00014826789,0.007851311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973475,0.0012768187,0.00018062674,0.00037551578,0.0006555179,0.00016402629],"domain_scores_gemma":[0.9942517,0.003957761,0.00027207116,0.0008327565,0.00053927244,0.00014643319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027451094,0.0007591622,0.0007181403,0.0010285886,0.00039117716,0.0021216099,0.0011425322,0.0005051348,0.0051216343],"category_scores_gemma":[0.010465727,0.0006086993,0.0012593894,0.0025917077,0.0005599548,0.005167724,0.0017659772,0.0016565922,0.00083083636],"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.00036221574,0.00016870079,0.0018166861,0.00035227084,0.00031124786,0.00028846372,0.00057583774,0.24668795,0.0056023416,0.50993955,0.00616446,0.22773027],"study_design_scores_gemma":[0.00001837626,0.000051254043,0.00047066045,0.000044367724,0.00007598313,0.000084859865,0.0000902359,0.67835027,0.0020228883,0.31306586,0.0057007815,0.00002447864],"about_ca_topic_score_codex":0.0016181236,"about_ca_topic_score_gemma":0.0033353013,"teacher_disagreement_score":0.0051216343,"about_ca_system_score_codex":0.00082105445,"about_ca_system_score_gemma":0.0005615031,"threshold_uncertainty_score":0.017133594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035436573,0.00030770156,0.99175805,0.00034693745,0.00003884254,0.00009543119,0.00004088115,0.000116625386,0.0037518607],"genre_scores_gemma":[0.09834407,0.00056779647,0.8968866,0.00024249095,0.00013213397,0.00048814394,0.00020967779,0.0001328699,0.002996189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810314,0.00072666013,0.0001015273,0.00021973212,0.0007164068,0.00013249728],"domain_scores_gemma":[0.99735665,0.0019380929,0.0002146409,0.00019972131,0.00022661583,0.00006430457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020962658,0.0009543329,0.0007405557,0.0015828845,0.00077257794,0.0014864235,0.0022357767,0.001506888,0.004235978],"category_scores_gemma":[0.0046801004,0.0006841505,0.0020058288,0.0018323411,0.0015740966,0.0013033939,0.0026485175,0.002831237,0.00057803385],"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.00004907451,0.00016496364,0.00064359605,0.0005095701,0.000119977325,0.0002602643,0.00042943328,0.5610776,0.005695885,0.3060455,0.004371525,0.1206326],"study_design_scores_gemma":[0.000026725436,0.000041828887,0.00010172726,0.000056441782,0.00001528884,0.000099506164,0.000049415947,0.89257866,0.0010954598,0.09603642,0.00988589,0.000012644324],"about_ca_topic_score_codex":0.0018736066,"about_ca_topic_score_gemma":0.0026329723,"teacher_disagreement_score":0.004235978,"about_ca_system_score_codex":0.0012397215,"about_ca_system_score_gemma":0.0011248115,"threshold_uncertainty_score":0.014170766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21082751,0.0039295875,0.7370796,0.0013713816,0.0007500775,0.0004750024,0.00067281735,0.0047616716,0.04013233],"genre_scores_gemma":[0.6227394,0.0007898998,0.36680108,0.00022301383,0.00025376922,0.00025825147,0.0011391871,0.0012025412,0.0065928614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99127614,0.004272644,0.00037832363,0.0005923482,0.0029119677,0.00056851003],"domain_scores_gemma":[0.9551264,0.03504111,0.0010344068,0.002734638,0.005139799,0.0009237082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010499802,0.0019010729,0.0015783025,0.0024497514,0.0007250931,0.0035802159,0.0021184352,0.0022095565,0.010256954],"category_scores_gemma":[0.064404465,0.00086461357,0.0010465024,0.002329741,0.0009233451,0.00331736,0.002495791,0.0020196808,0.0013796305],"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.0024162196,0.00039161948,0.0056556314,0.0004359853,0.00028033313,0.00012651377,0.00012069218,0.59181136,0.0023162782,0.022481605,0.010214379,0.36374938],"study_design_scores_gemma":[0.00006146583,0.00011767055,0.00038860497,0.0000342087,0.000067935325,0.000023760618,0.000025380637,0.99022245,0.0015791762,0.0065457723,0.0009266011,0.000006992561],"about_ca_topic_score_codex":0.0022710478,"about_ca_topic_score_gemma":0.004838574,"teacher_disagreement_score":0.010499802,"about_ca_system_score_codex":0.0018195646,"about_ca_system_score_gemma":0.002639901,"threshold_uncertainty_score":0.05552894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014773893,0.00022952497,0.9813719,0.0004917127,0.000057103207,0.00011091113,0.00011256998,0.00018593384,0.0026665335],"genre_scores_gemma":[0.56406665,0.00067572243,0.42858186,0.0004019955,0.00018495222,0.00081461837,0.00043359553,0.00012619192,0.004714375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974759,0.0010691789,0.00011884729,0.0005124759,0.00044664767,0.00037705494],"domain_scores_gemma":[0.9929121,0.005859941,0.00039790632,0.00014725202,0.00044737768,0.00023536148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039833332,0.0015943805,0.0018606536,0.00065271667,0.0007823257,0.0025292255,0.0016307147,0.002375556,0.0031152926],"category_scores_gemma":[0.0070230854,0.001163986,0.0014856162,0.0013413547,0.0014661227,0.0011381231,0.0014145911,0.0022390299,0.0002839191],"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.000056020355,0.000035309502,0.00014190469,0.000065345506,0.00003441267,0.00004925783,0.000024786279,0.9827663,0.00040043375,0.009025778,0.0003802076,0.0070202984],"study_design_scores_gemma":[0.000027879178,0.000024050343,0.000031426935,0.0000043788787,0.000007748852,0.0000061083188,0.0000072451453,0.99538773,0.0001747436,0.00405654,0.00026714426,0.0000049601495],"about_ca_topic_score_codex":0.015686985,"about_ca_topic_score_gemma":0.008065145,"teacher_disagreement_score":0.015686985,"about_ca_system_score_codex":0.002183989,"about_ca_system_score_gemma":0.0043187873,"threshold_uncertainty_score":0.031191349},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009299874,0.09021591,0.6768634,0.0019634096,0.0008704691,0.00015779982,0.0012332621,0.0031224783,0.22464329],"genre_scores_gemma":[0.013919966,0.119942725,0.7453672,0.0008077934,0.0007942844,0.00026924035,0.0028519782,0.00080815406,0.115238704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956256,0.000049359525,0.00003483776,0.000092000955,0.00023076226,0.000030433283],"domain_scores_gemma":[0.9996226,0.00016598386,0.000013374071,0.00006710469,0.00011355196,0.000017392016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000499747,0.001440713,0.0011066293,0.0022472132,0.0008243184,0.0034342343,0.002284448,0.0011747014,0.031911653],"category_scores_gemma":[0.0009373508,0.001118069,0.0013462577,0.006625535,0.001284822,0.0038621542,0.0010243523,0.0023137499,0.013609579],"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.000023379585,0.00006468313,0.00009664663,0.0015309104,0.000038412658,0.00006345558,0.00014031967,0.010321619,0.0016895916,0.294835,0.09022936,0.60096663],"study_design_scores_gemma":[0.000010227923,0.000015807436,0.0001801093,0.00038699314,0.000032271688,0.00025165585,0.0000618908,0.011544103,0.001101318,0.30735126,0.6790398,0.000024675457],"about_ca_topic_score_codex":0.0068124887,"about_ca_topic_score_gemma":0.010731548,"teacher_disagreement_score":0.031911653,"about_ca_system_score_codex":0.0015174551,"about_ca_system_score_gemma":0.0023516235,"threshold_uncertainty_score":0.10675508},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036147837,0.05940299,0.06314438,0.10391481,0.058539353,0.00071899564,0.0136219915,0.0065414617,0.65796816],"genre_scores_gemma":[0.143062,0.040258136,0.038839553,0.012167639,0.02548511,0.0014208659,0.009048325,0.0028421315,0.72687626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991577,0.0020280522,0.00059925474,0.0016749799,0.003398717,0.0007218682],"domain_scores_gemma":[0.9889141,0.0039630337,0.0010949301,0.0013679059,0.0033029327,0.0013570251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006745459,0.002021832,0.0017263028,0.002557706,0.002753301,0.010204348,0.0018143946,0.0033312046,0.19173442],"category_scores_gemma":[0.02010723,0.0006080038,0.0017339612,0.0023587584,0.0025917152,0.0045698322,0.0029579042,0.008342865,0.08045487],"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.0010382325,0.00022594242,0.004919138,0.0009450096,0.00019787576,0.0018322704,0.0013621212,0.0022999162,0.0019000449,0.15237734,0.31137466,0.52152747],"study_design_scores_gemma":[0.00007042037,0.0000641665,0.0022207806,0.00027520515,0.000015006796,0.0007933842,0.00027688107,0.00060275313,0.00052831764,0.0046607195,0.99045825,0.000034037617],"about_ca_topic_score_codex":0.01857212,"about_ca_topic_score_gemma":0.009718756,"teacher_disagreement_score":0.19173442,"about_ca_system_score_codex":0.004698883,"about_ca_system_score_gemma":0.007550113,"threshold_uncertainty_score":0.64141554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024051907,0.0006098929,0.9569409,0.0012152193,0.00008531719,0.00006199657,0.000359221,0.0004544571,0.016221168],"genre_scores_gemma":[0.48062986,0.0014390665,0.50829333,0.00038066463,0.000099196346,0.00016230364,0.0011454822,0.00015655966,0.00769354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986625,0.00033560133,0.000102200946,0.00032564346,0.0004670975,0.00010697787],"domain_scores_gemma":[0.99860495,0.0007730449,0.00011377852,0.00021763411,0.00020843299,0.00008215599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020178228,0.00067431515,0.000558038,0.0011972699,0.0011301845,0.0030144379,0.0018261985,0.0012944734,0.003084302],"category_scores_gemma":[0.006179487,0.0006734809,0.0015194534,0.0010534663,0.0022105533,0.009083196,0.0030494812,0.0023684686,0.00045807505],"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.00004547523,0.000016520155,0.00043826812,0.00013144985,0.000025733083,0.00018983809,0.00058647455,0.024919156,0.0034604,0.92876065,0.0024521989,0.03897377],"study_design_scores_gemma":[0.000015131513,0.000016373646,0.0002770814,0.000041638952,0.000021145752,0.00014852654,0.0002536543,0.071419746,0.0023812547,0.91209996,0.013301853,0.000023601087],"about_ca_topic_score_codex":0.0029987409,"about_ca_topic_score_gemma":0.0028522778,"teacher_disagreement_score":0.003084302,"about_ca_system_score_codex":0.0018705709,"about_ca_system_score_gemma":0.0011022157,"threshold_uncertainty_score":0.013572037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011823599,0.0009066873,0.95378417,0.0004897186,0.00029251966,0.00009962062,0.0002747077,0.0024686141,0.029860448],"genre_scores_gemma":[0.2515677,0.00055841694,0.7163939,0.00036446308,0.00024861074,0.00032858146,0.0013110553,0.0013568904,0.027870396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986091,0.00032685502,0.00006489142,0.0002634582,0.0005993665,0.0001363538],"domain_scores_gemma":[0.9981787,0.000747429,0.00008218109,0.00059189094,0.0003077775,0.000091946866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566885,0.0012764747,0.0019456382,0.0012703357,0.00083772,0.0016229401,0.0028779225,0.001565305,0.018388186],"category_scores_gemma":[0.005425093,0.0008527783,0.001045338,0.0024886783,0.0011229145,0.0025599198,0.003727755,0.002855054,0.0041187294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086254533,0.00028237142,0.0005264804,0.00034124823,0.00010086581,0.0000893446,0.00011818009,0.33142078,0.0042823046,0.18771756,0.03148801,0.44277033],"study_design_scores_gemma":[0.00010640508,0.00006098122,0.00011837922,0.000026795256,0.000020744195,0.00007827896,0.000020971274,0.86409605,0.0018739908,0.12334709,0.010235205,0.000015164421],"about_ca_topic_score_codex":0.0020502605,"about_ca_topic_score_gemma":0.002794616,"teacher_disagreement_score":0.018388186,"about_ca_system_score_codex":0.0012307181,"about_ca_system_score_gemma":0.001602919,"threshold_uncertainty_score":0.061514616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031765217,0.00089335203,0.93977726,0.00024250404,0.0003027574,0.00018022007,0.0009552599,0.04940084,0.005071173],"genre_scores_gemma":[0.026207298,0.00037177606,0.9512496,0.00048578787,0.00013982994,0.0006639746,0.0052257986,0.0049072504,0.010748663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801576,0.00047074788,0.00014994953,0.0004397458,0.0007266955,0.00019708596],"domain_scores_gemma":[0.99821043,0.00065828906,0.00009166567,0.00039910857,0.0005490816,0.00009156563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022504712,0.0023360148,0.001564981,0.0025303818,0.0008949434,0.0025852616,0.0045209555,0.0022012324,0.03209336],"category_scores_gemma":[0.0066528567,0.0011489864,0.0017405205,0.002105465,0.0006055604,0.004447366,0.002482847,0.0032869736,0.020585027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011178672,0.000257042,0.0011857855,0.00037380672,0.0002333494,0.00010471004,0.00006338133,0.03488122,0.0076105273,0.018655408,0.08768485,0.847832],"study_design_scores_gemma":[0.00019866598,0.00015923439,0.00032285164,0.00004854624,0.000037949274,0.00014589222,0.000025186058,0.91882783,0.0071447976,0.016354112,0.056693964,0.00004091412],"about_ca_topic_score_codex":0.006100644,"about_ca_topic_score_gemma":0.009389068,"teacher_disagreement_score":0.03209336,"about_ca_system_score_codex":0.0014420013,"about_ca_system_score_gemma":0.0031048553,"threshold_uncertainty_score":0.107363045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002624521,0.00025327635,0.9927181,0.000056670917,0.00002728717,0.000020120528,0.00025156743,0.0008701341,0.0031782258],"genre_scores_gemma":[0.083476454,0.0011628666,0.90603507,0.00009799264,0.000040004605,0.00007427197,0.00094576046,0.00062184606,0.0075457417],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998148,0.000024279883,0.000010438385,0.00005543048,0.00007121604,0.000023723887],"domain_scores_gemma":[0.99968505,0.00013086408,0.000024111943,0.00008129,0.0000633791,0.000015388758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034237112,0.00076479686,0.00086662365,0.0012462408,0.0003801881,0.0020680754,0.0015853703,0.0008854813,0.010640015],"category_scores_gemma":[0.0014155458,0.0004983409,0.0008706022,0.0022001863,0.00067023135,0.0031622234,0.001003079,0.000804693,0.0021329874],"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.00007366592,0.0000380268,0.00037516005,0.00034445766,0.000038212347,0.000109744215,0.0002120285,0.1608137,0.018505849,0.16505367,0.015386871,0.6390486],"study_design_scores_gemma":[0.000018308923,0.000032372183,0.0003990288,0.00007055425,0.000035390865,0.00028570546,0.00011235809,0.7211398,0.014319947,0.22105135,0.04247668,0.000058577265],"about_ca_topic_score_codex":0.005450766,"about_ca_topic_score_gemma":0.005763888,"teacher_disagreement_score":0.010640015,"about_ca_system_score_codex":0.00068602076,"about_ca_system_score_gemma":0.00040970393,"threshold_uncertainty_score":0.035594404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050651744,0.00015055622,0.9363204,0.00027678246,0.000080545986,0.0001254268,0.0006051657,0.0009197452,0.010869619],"genre_scores_gemma":[0.32448238,0.00020238607,0.671158,0.00006719008,0.000029730376,0.00016856132,0.0014208189,0.00023278083,0.002238131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846846,0.00043214054,0.00011616173,0.00025523346,0.00063309184,0.00009488605],"domain_scores_gemma":[0.9967746,0.0014370446,0.00030744507,0.0009517644,0.00046970174,0.000059429025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011229407,0.0007428957,0.00051011035,0.0020486289,0.00069847534,0.0022888659,0.0010439795,0.0004311376,0.0063956524],"category_scores_gemma":[0.007880449,0.0003886394,0.0009159348,0.0018286088,0.0013306253,0.004425568,0.0024940965,0.0012863501,0.001148906],"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.00016036011,0.00013414725,0.0018118777,0.0003922801,0.000057792164,0.0003079491,0.0005473628,0.053834494,0.027053393,0.6044612,0.0041205394,0.3071185],"study_design_scores_gemma":[0.00004237523,0.00010115824,0.0010906653,0.00009246215,0.000058132246,0.00039822218,0.0006558133,0.43241864,0.027070267,0.49848214,0.039523058,0.0000671362],"about_ca_topic_score_codex":0.0018923277,"about_ca_topic_score_gemma":0.0050945976,"teacher_disagreement_score":0.0063956524,"about_ca_system_score_codex":0.0006002471,"about_ca_system_score_gemma":0.0015445967,"threshold_uncertainty_score":0.021395564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003368293,0.00036153104,0.9879027,0.00035514717,0.00010141936,0.00023893348,0.0008971066,0.0003059879,0.006468732],"genre_scores_gemma":[0.15140145,0.0020169073,0.8301084,0.0007087607,0.00023382939,0.0012590664,0.0030510265,0.00043136496,0.010789108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614704,0.001500779,0.00029380672,0.0008372282,0.00093395804,0.00028719046],"domain_scores_gemma":[0.99601233,0.0022056797,0.00050739024,0.00047207004,0.00059951155,0.00020304312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032227754,0.002124284,0.0013362208,0.0017586523,0.0008758861,0.0032084007,0.0031059212,0.0014957736,0.009717062],"category_scores_gemma":[0.008226763,0.0009970783,0.0028995518,0.0046580937,0.0015016606,0.0058637313,0.0030918575,0.0035463027,0.00129533],"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.00016682078,0.00012102894,0.00085944205,0.00060595473,0.00018666107,0.0005169028,0.00015821683,0.5782745,0.0016510142,0.32306415,0.0070925956,0.08730262],"study_design_scores_gemma":[0.00004193753,0.00006478251,0.00015084897,0.00008471412,0.00005765135,0.00015187672,0.000046196925,0.7521651,0.0007463806,0.22685567,0.01959609,0.000038829876],"about_ca_topic_score_codex":0.013671701,"about_ca_topic_score_gemma":0.015574009,"teacher_disagreement_score":0.013671701,"about_ca_system_score_codex":0.0022936282,"about_ca_system_score_gemma":0.0039608967,"threshold_uncertainty_score":0.032506883},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039915037,0.00325403,0.26156938,0.0015035883,0.001344461,0.00006860394,0.0006414511,0.0011206325,0.72650635],"genre_scores_gemma":[0.16570534,0.0072567705,0.15129122,0.0011759287,0.0014150643,0.0001956794,0.0024691285,0.0023411552,0.6681497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993309,0.000114464056,0.000030405226,0.00016987065,0.00028415688,0.000070310896],"domain_scores_gemma":[0.9996444,0.00006866661,0.000015269867,0.00012304184,0.00012989751,0.000018771154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004839381,0.0010210542,0.00084771396,0.0015818946,0.0012566204,0.0029394552,0.00092383,0.00056905625,0.07067583],"category_scores_gemma":[0.0016584906,0.0004514324,0.0010744915,0.0021028235,0.0020555123,0.0039699217,0.0023477606,0.002804056,0.027094329],"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.00001704067,0.0000131509405,0.000035643898,0.0000948538,0.000009252622,0.000024523872,0.00013528645,0.00090623664,0.0006651309,0.86440533,0.040576845,0.09311667],"study_design_scores_gemma":[0.0000066857187,0.0000114473505,0.00007112823,0.000044256984,0.000010035285,0.000115629475,0.00005604973,0.001924729,0.0009748932,0.6800458,0.31672737,0.000012037484],"about_ca_topic_score_codex":0.0015369904,"about_ca_topic_score_gemma":0.0015439087,"teacher_disagreement_score":0.07067583,"about_ca_system_score_codex":0.0014300137,"about_ca_system_score_gemma":0.0007325955,"threshold_uncertainty_score":0.23643416},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00419068,0.0018970727,0.7754217,0.003082561,0.0006480351,0.00057256076,0.0021978344,0.0033251552,0.20866443],"genre_scores_gemma":[0.11775194,0.0062399036,0.73143977,0.0028510536,0.00073398487,0.0022571725,0.010904142,0.005062876,0.12275904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948978,0.00104961,0.0003557304,0.00121709,0.0019741692,0.0005057255],"domain_scores_gemma":[0.99657476,0.0017400288,0.000108464636,0.0010799115,0.00040387956,0.000092902475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019401681,0.002346578,0.001153453,0.0013094303,0.0020138514,0.0052523776,0.004101908,0.0015038735,0.045374233],"category_scores_gemma":[0.0087166075,0.0013403619,0.0039825384,0.0027485406,0.0026755317,0.009447171,0.005538678,0.009031061,0.011440947],"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.00004557929,0.00009833633,0.00011704454,0.0004507065,0.000044089753,0.00009321455,0.00025090235,0.013135071,0.0015760761,0.8786529,0.03465046,0.070885584],"study_design_scores_gemma":[0.000026582009,0.000020414163,0.000105049796,0.00012904487,0.000036436424,0.00016917054,0.00011514984,0.014392854,0.002130376,0.7536618,0.22918549,0.000027662565],"about_ca_topic_score_codex":0.0031446605,"about_ca_topic_score_gemma":0.0042446614,"teacher_disagreement_score":0.045374233,"about_ca_system_score_codex":0.0046757427,"about_ca_system_score_gemma":0.003082461,"threshold_uncertainty_score":0.15179199},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017121717,0.49415556,0.48246244,0.0034695345,0.0009069909,0.00009295356,0.0003587562,0.0004834688,0.016358042],"genre_scores_gemma":[0.056768034,0.6249936,0.30888817,0.0012172664,0.0029181177,0.00023585276,0.0010038565,0.00039194155,0.0035830783],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943203,0.0022676832,0.00057327154,0.00075081416,0.001942402,0.0001456398],"domain_scores_gemma":[0.98506135,0.012161406,0.0005360629,0.00069770374,0.0012729641,0.00027055608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006138889,0.0018327973,0.0024985871,0.004805749,0.00064454135,0.004621029,0.0023347805,0.0015518189,0.0078629125],"category_scores_gemma":[0.014133678,0.0011353553,0.0016642364,0.010343921,0.0019948692,0.005920895,0.0021896223,0.0036852856,0.0023601041],"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.00008546146,0.00012004646,0.00079702126,0.00536881,0.00010884927,0.00009005816,0.00023428047,0.021442035,0.0006211821,0.35422164,0.014141244,0.6027693],"study_design_scores_gemma":[0.000043341108,0.000131225,0.0006567241,0.002908819,0.0000981263,0.0005111744,0.00024087165,0.061427765,0.00093277206,0.3878085,0.5451197,0.00012090316],"about_ca_topic_score_codex":0.0027961738,"about_ca_topic_score_gemma":0.0020927496,"teacher_disagreement_score":0.0078629125,"about_ca_system_score_codex":0.0025071786,"about_ca_system_score_gemma":0.002538078,"threshold_uncertainty_score":0.032465935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09302332,0.024586735,0.6824544,0.012902542,0.0018670692,0.00010772697,0.00077594974,0.00022763429,0.18405463],"genre_scores_gemma":[0.8097449,0.013921219,0.14888577,0.001812869,0.0021497104,0.0003230534,0.00077754847,0.00015708379,0.022227908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870574,0.000391428,0.000080400685,0.00032894468,0.00040413224,0.00008935262],"domain_scores_gemma":[0.9979386,0.0010443325,0.00026481407,0.0002312915,0.00035658616,0.00016445818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012257496,0.0005832879,0.00058958796,0.0022013434,0.0012306038,0.003717964,0.00085843017,0.0010724585,0.004936493],"category_scores_gemma":[0.0042324476,0.0002674795,0.00059194723,0.0019064369,0.005251625,0.0079032825,0.0022993553,0.0022994669,0.0010162571],"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.000003516817,0.000002450699,0.000081460734,0.00002359172,0.0000029729288,0.000033911547,0.00006141326,0.00029268351,0.00029319446,0.99482614,0.0006591732,0.0037194712],"study_design_scores_gemma":[0.0000043572513,0.000013625433,0.0002588805,0.000020414285,0.000004291969,0.00019717649,0.000067630455,0.0024654737,0.00043857904,0.9719925,0.024525529,0.000011524495],"about_ca_topic_score_codex":0.0004991041,"about_ca_topic_score_gemma":0.0002765099,"teacher_disagreement_score":0.004936493,"about_ca_system_score_codex":0.001101353,"about_ca_system_score_gemma":0.0005811185,"threshold_uncertainty_score":0.016514182},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041404795,0.00096443814,0.9857245,0.00044103264,0.000115270544,0.00005422391,0.000055120905,0.00009004116,0.008414912],"genre_scores_gemma":[0.17889693,0.00261503,0.8051443,0.0004381613,0.00030912462,0.000405557,0.00031049142,0.00022470666,0.011655638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991937,0.0002569946,0.000031936477,0.000099866,0.00035826032,0.00005923211],"domain_scores_gemma":[0.99895966,0.00072587567,0.000073613075,0.00009249127,0.00011323548,0.000035143745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011017428,0.0009221731,0.0010741057,0.0011131603,0.0007023769,0.0011975322,0.0017806946,0.0013326743,0.0037934664],"category_scores_gemma":[0.0027699552,0.000641813,0.0013590195,0.0020279507,0.0011093889,0.0013266457,0.0017361838,0.0027845984,0.00044287593],"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.00004608939,0.000102137914,0.00035337947,0.0003226046,0.000118481024,0.000102982776,0.0001554786,0.59931034,0.0030114397,0.26537046,0.0067530163,0.124353625],"study_design_scores_gemma":[0.00001498203,0.000020622721,0.00007290084,0.000025407031,0.000012372447,0.000034997793,0.00001753305,0.90509844,0.00043377109,0.0881948,0.006066462,0.000007711882],"about_ca_topic_score_codex":0.003157869,"about_ca_topic_score_gemma":0.004257515,"teacher_disagreement_score":0.0037934664,"about_ca_system_score_codex":0.0010830407,"about_ca_system_score_gemma":0.0011044419,"threshold_uncertainty_score":0.012690425},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015836848,0.36799467,0.6063375,0.002859037,0.0007963017,0.00009525153,0.00027770648,0.00054795545,0.019507863],"genre_scores_gemma":[0.058872662,0.5088641,0.41923884,0.0014856458,0.0028546671,0.00033169176,0.0010639416,0.0007333325,0.006555108],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99536926,0.0016974149,0.00037535795,0.00061219337,0.0017847456,0.0001610662],"domain_scores_gemma":[0.98897636,0.008907197,0.00033920843,0.0006136188,0.00093182607,0.00023185497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056415396,0.0021869338,0.00239174,0.0037042848,0.00073001167,0.004286687,0.0030764313,0.0018255512,0.010185327],"category_scores_gemma":[0.013393335,0.0015860837,0.0022898873,0.008921383,0.002244641,0.0058084466,0.0025370354,0.0054601864,0.002941628],"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.000089971596,0.00012756702,0.00051687466,0.004888766,0.00013796994,0.00008026744,0.0001973118,0.041648638,0.0006067008,0.4160461,0.016589183,0.5190707],"study_design_scores_gemma":[0.00006847086,0.000112268484,0.00038540785,0.0022505783,0.00009880918,0.00031755376,0.00014208074,0.10661746,0.0011061011,0.45482907,0.43398166,0.00009052534],"about_ca_topic_score_codex":0.0037278594,"about_ca_topic_score_gemma":0.0025548816,"teacher_disagreement_score":0.010185327,"about_ca_system_score_codex":0.0029287348,"about_ca_system_score_gemma":0.003034058,"threshold_uncertainty_score":0.034073353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071395054,0.0033840942,0.5348034,0.0014168877,0.0008601672,0.00015779225,0.0008816272,0.0021188827,0.44923764],"genre_scores_gemma":[0.15548648,0.006739211,0.38227323,0.0012816221,0.00045902122,0.0003628164,0.004827087,0.003098024,0.4454725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998171,0.00003335195,0.000004901285,0.000055140936,0.00007273704,0.000016845897],"domain_scores_gemma":[0.9998393,0.000045356453,0.0000064980313,0.000059580376,0.000033642984,0.000015618949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018712517,0.0006400205,0.0004531021,0.00069870095,0.00047254717,0.00078194414,0.0010585953,0.00061392493,0.039196625],"category_scores_gemma":[0.0007509656,0.00027642027,0.00059617567,0.0010597006,0.0005987458,0.0011474747,0.001206087,0.0013330182,0.0098470105],"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.000028309549,0.000057899375,0.0002095837,0.00030297754,0.000037714562,0.00007749108,0.00010278352,0.03737397,0.0063828537,0.3736739,0.101747885,0.48000464],"study_design_scores_gemma":[0.000016588363,0.000037724792,0.00036252587,0.000120331635,0.00003655391,0.00028711185,0.000058945563,0.09986815,0.006534044,0.4205601,0.4720919,0.000025995216],"about_ca_topic_score_codex":0.0014444586,"about_ca_topic_score_gemma":0.0032177074,"teacher_disagreement_score":0.039196625,"about_ca_system_score_codex":0.0007692578,"about_ca_system_score_gemma":0.00053497707,"threshold_uncertainty_score":0.13112581},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026515021,0.0040458813,0.38284957,0.0017868706,0.0011622433,0.000120806995,0.0023060553,0.0021184108,0.60295856],"genre_scores_gemma":[0.08864992,0.012073947,0.22039576,0.0014253692,0.0010601631,0.00030695007,0.008055679,0.002443924,0.6655882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976355,0.00003711705,0.000012889369,0.00008565288,0.000079863916,0.000020968453],"domain_scores_gemma":[0.9997161,0.00009981897,0.000016517926,0.00007638212,0.00006783286,0.000023306986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024946814,0.0008920519,0.00031135793,0.0010812485,0.00074955035,0.0019068498,0.0008692141,0.0004955414,0.06657648],"category_scores_gemma":[0.0010687612,0.0004489761,0.00062014355,0.001930271,0.00078753685,0.0035773355,0.00087235594,0.0013635922,0.018553058],"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.000021364396,0.000017432954,0.000046677575,0.00015592332,0.000008739288,0.00004326821,0.000104998304,0.0028870285,0.0011799622,0.7837582,0.07238506,0.13939136],"study_design_scores_gemma":[0.000005144252,0.000008105766,0.00005793198,0.00007471659,0.000011727356,0.00009901834,0.000045916073,0.004299703,0.00094830926,0.51392394,0.48051634,0.000009206505],"about_ca_topic_score_codex":0.0029799603,"about_ca_topic_score_gemma":0.0037975751,"teacher_disagreement_score":0.06657648,"about_ca_system_score_codex":0.0012804022,"about_ca_system_score_gemma":0.00082816003,"threshold_uncertainty_score":0.2227205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013657119,0.0038252259,0.10646469,0.0016134462,0.00097108586,0.00006473973,0.0004378027,0.00064902415,0.88460815],"genre_scores_gemma":[0.091311194,0.009845991,0.14329833,0.0013257273,0.0014250615,0.00040856074,0.002363957,0.001727258,0.7482939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992592,0.0001832888,0.000031121155,0.00013329623,0.00033572005,0.00005750434],"domain_scores_gemma":[0.99970335,0.00009584079,0.000012788501,0.00008378354,0.0000712761,0.000033001626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004910462,0.0011636346,0.00084559387,0.0017701322,0.0023084888,0.004356124,0.0015738553,0.0008129102,0.0681924],"category_scores_gemma":[0.001251312,0.0008263289,0.00092674413,0.0026467608,0.0035170338,0.005349052,0.0020211076,0.0040013823,0.028476331],"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.000007193627,0.000011111231,0.000012005241,0.000055799672,0.000002656973,0.000011769637,0.00009612893,0.00031862914,0.00019891841,0.93599397,0.033778578,0.02951324],"study_design_scores_gemma":[0.000007913675,0.000005868103,0.000024775665,0.000054456043,0.0000044038547,0.00006823482,0.00006856221,0.0008067865,0.0004351104,0.6365568,0.36195758,0.000009490009],"about_ca_topic_score_codex":0.0014877894,"about_ca_topic_score_gemma":0.0025887745,"teacher_disagreement_score":0.0681924,"about_ca_system_score_codex":0.002492276,"about_ca_system_score_gemma":0.0012178388,"threshold_uncertainty_score":0.22812629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008834533,0.00015158413,0.9838695,0.00024244198,0.00005357465,0.00013574574,0.00013983855,0.0013971785,0.005175663],"genre_scores_gemma":[0.41095012,0.00038179563,0.5802608,0.00022908887,0.000089552545,0.0004980074,0.0004368274,0.00014897928,0.007004843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898094,0.00021054002,0.000103878745,0.0002904081,0.0003123231,0.00010185896],"domain_scores_gemma":[0.99922216,0.00028885112,0.00011211575,0.00008858494,0.00017414379,0.00011418809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010262477,0.0005809338,0.001042732,0.00060448865,0.001270582,0.0021171789,0.001963094,0.000835503,0.005800986],"category_scores_gemma":[0.002058193,0.0004987695,0.00092835526,0.0010710403,0.00091154134,0.0029910551,0.0019113753,0.0012618605,0.0009426434],"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.0004754764,0.00021505936,0.0010718767,0.00027014056,0.0001322902,0.0007857574,0.00060333184,0.57856023,0.01447583,0.2604683,0.0063901367,0.13655157],"study_design_scores_gemma":[0.000052226093,0.000045507553,0.00007548401,0.000011277657,0.000021926682,0.000073153315,0.000031992462,0.9690261,0.0015765456,0.02344229,0.00562458,0.000018856286],"about_ca_topic_score_codex":0.0122250905,"about_ca_topic_score_gemma":0.0110310465,"teacher_disagreement_score":0.0122250905,"about_ca_system_score_codex":0.0012219847,"about_ca_system_score_gemma":0.0027827516,"threshold_uncertainty_score":0.024307847},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004480197,0.0005782775,0.97818404,0.00056043314,0.00019649342,0.00039319153,0.00051206705,0.0030021435,0.012093142],"genre_scores_gemma":[0.015570637,0.00035248933,0.975339,0.00016609656,0.00006988283,0.0003113634,0.0012972571,0.0005468296,0.006346518],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984189,0.00023054332,0.000106136074,0.0004619072,0.0005870501,0.00019548088],"domain_scores_gemma":[0.99846184,0.0008297514,0.00007462958,0.00028919257,0.00028305734,0.00006159374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000999455,0.0019972296,0.0015777518,0.0015607956,0.0017544391,0.002483369,0.0031606173,0.00207094,0.02006988],"category_scores_gemma":[0.0041184183,0.0010363488,0.0027551083,0.004263404,0.0009284384,0.0049677906,0.0032046302,0.0036128773,0.0077958386],"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.00016251417,0.00032559017,0.00038540378,0.00064165547,0.00006644865,0.00012292579,0.00024489439,0.037307195,0.0058097388,0.079608664,0.08211471,0.7932102],"study_design_scores_gemma":[0.00029361705,0.00021041195,0.00052867504,0.00015812513,0.000084572835,0.00068180956,0.00032324853,0.6160662,0.00911914,0.28481427,0.08763918,0.000080774735],"about_ca_topic_score_codex":0.0039278013,"about_ca_topic_score_gemma":0.0053274124,"teacher_disagreement_score":0.02006988,"about_ca_system_score_codex":0.0017278173,"about_ca_system_score_gemma":0.0032175912,"threshold_uncertainty_score":0.0671404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5836156,0.0012429329,0.393767,0.0024960414,0.00007339702,0.00015250409,0.00039617895,0.0006706482,0.017585756],"genre_scores_gemma":[0.977126,0.00021677284,0.020711446,0.0002504046,0.000062063176,0.00011718266,0.00023747701,0.00006459873,0.0012141552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942266,0.0020380416,0.00042819377,0.00083414826,0.0016194214,0.00085348013],"domain_scores_gemma":[0.9473813,0.04079875,0.003965092,0.0032109316,0.001913236,0.0027306625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063080247,0.0007220395,0.0015544166,0.0025366792,0.0009365246,0.0046481756,0.0016773279,0.0017874101,0.004222754],"category_scores_gemma":[0.03989351,0.00085407903,0.0017594175,0.0014580778,0.0045647486,0.0074868603,0.0037458334,0.004558026,0.00030723913],"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.00026116995,0.000109275854,0.0026138762,0.00016685683,0.00007514367,0.000305683,0.0005790889,0.0493832,0.004507758,0.93430644,0.0012602276,0.0064311926],"study_design_scores_gemma":[0.000051297407,0.00009072825,0.00097106013,0.000031595882,0.00002226001,0.0002597444,0.0001782455,0.15486212,0.002028523,0.8407093,0.0007593896,0.000035636247],"about_ca_topic_score_codex":0.0009824767,"about_ca_topic_score_gemma":0.00072525523,"teacher_disagreement_score":0.0063080247,"about_ca_system_score_codex":0.0027726935,"about_ca_system_score_gemma":0.0008836817,"threshold_uncertainty_score":0.03336042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013662149,0.0015886778,0.9464606,0.002692521,0.00022831078,0.00022847894,0.0007594895,0.00046599965,0.03391381],"genre_scores_gemma":[0.269917,0.0051233554,0.6907431,0.0018399385,0.0007683325,0.0010194251,0.0038236089,0.00054238655,0.02622278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703157,0.0009048552,0.00020718457,0.0006429438,0.0009706948,0.0002427399],"domain_scores_gemma":[0.996563,0.0024050102,0.00023013476,0.0003115395,0.00035843125,0.00013194256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015265608,0.00086810713,0.00074357144,0.0016172379,0.0012111714,0.0032089895,0.0018594719,0.0011232541,0.0066826516],"category_scores_gemma":[0.007661091,0.000717433,0.002086567,0.0034623095,0.003013307,0.0044819997,0.0033087286,0.0053266925,0.0010282716],"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.00001619823,0.000042439384,0.00014030872,0.0001571019,0.000028379749,0.000113203634,0.0002801547,0.017663779,0.00049081777,0.9520966,0.004609169,0.024361823],"study_design_scores_gemma":[0.000016277021,0.0000048010734,0.00005639484,0.000018297902,0.000008917525,0.00004896852,0.000058411897,0.023366872,0.00030609613,0.9652398,0.010867431,0.000007604669],"about_ca_topic_score_codex":0.005986456,"about_ca_topic_score_gemma":0.0036601073,"teacher_disagreement_score":0.0066826516,"about_ca_system_score_codex":0.002522775,"about_ca_system_score_gemma":0.0017220704,"threshold_uncertainty_score":0.022355735},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011381854,0.2619332,0.0057434514,0.02586698,0.026034992,0.00011142781,0.0034038315,0.0005481903,0.6752198],"genre_scores_gemma":[0.01753997,0.22267376,0.006024168,0.01614126,0.016184306,0.00018688156,0.0053985436,0.000779218,0.7150719],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989911,0.00016288036,0.00007840376,0.00026428612,0.00038603428,0.000117356365],"domain_scores_gemma":[0.99845123,0.00039753932,0.00008496385,0.00017553434,0.0006903058,0.00020036903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013792121,0.0008139438,0.00077284744,0.0048979814,0.0019780518,0.0054220245,0.0017525312,0.0018778703,0.13121957],"category_scores_gemma":[0.005247768,0.00039215595,0.00053068803,0.006398138,0.0017781021,0.005612293,0.0021872043,0.0027112232,0.08549513],"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.00004660556,0.000026025411,0.00031226163,0.0005913169,0.0000082288725,0.00008376904,0.00037252775,0.00011911217,0.00009160517,0.09380142,0.64112735,0.26341975],"study_design_scores_gemma":[0.0000010200802,0.0000034273182,0.00011628104,0.0001979545,0.0000016593561,0.00007689395,0.000036572674,0.0000077571385,0.000019997005,0.0026927115,0.99684286,0.0000027157555],"about_ca_topic_score_codex":0.00634128,"about_ca_topic_score_gemma":0.0076178573,"teacher_disagreement_score":0.13121957,"about_ca_system_score_codex":0.003024184,"about_ca_system_score_gemma":0.0037273227,"threshold_uncertainty_score":0.4389732},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004286616,0.002931455,0.4322462,0.0010587547,0.0010404722,0.000105936626,0.00054689933,0.00090651,0.5568772],"genre_scores_gemma":[0.13137986,0.010547151,0.24717914,0.0009988518,0.000765441,0.0002292204,0.0015740384,0.0015136232,0.60581267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965334,0.000045111512,0.000019063402,0.00008277392,0.0001720251,0.000027618698],"domain_scores_gemma":[0.99981374,0.00004346188,0.0000074293275,0.0000830777,0.00004170912,0.000010590992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030952587,0.0007682607,0.00044964583,0.0009815487,0.0007097614,0.0016097019,0.0006827159,0.00040389178,0.024011534],"category_scores_gemma":[0.0008323967,0.0003427942,0.0005695804,0.0014575024,0.0014056888,0.002748082,0.0013538555,0.0019426303,0.009378182],"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.000012324655,0.000018212626,0.000031176038,0.000104358915,0.000005987552,0.000034698052,0.00011698661,0.001561076,0.0016335296,0.8079144,0.022671107,0.16589613],"study_design_scores_gemma":[0.000005028524,0.000016469867,0.00007315618,0.00005195224,0.000007785263,0.0001693464,0.000041903946,0.0034083526,0.0032473837,0.6747864,0.3181813,0.000010894061],"about_ca_topic_score_codex":0.0009392868,"about_ca_topic_score_gemma":0.0009938631,"teacher_disagreement_score":0.024011534,"about_ca_system_score_codex":0.00082754035,"about_ca_system_score_gemma":0.0008873825,"threshold_uncertainty_score":0.08032656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00805724,0.00013820123,0.9851248,0.00021633333,0.000050523347,0.00011934067,0.0001264363,0.001168784,0.0049981717],"genre_scores_gemma":[0.378072,0.0003694316,0.61352783,0.00021000573,0.00008468031,0.00044338685,0.000390013,0.00013383129,0.006768803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912375,0.00017901353,0.00008340351,0.0002538028,0.00027267865,0.000087429304],"domain_scores_gemma":[0.99936205,0.00024078913,0.00009099189,0.000074367184,0.00013942293,0.0000923959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948449,0.00053893385,0.0009389638,0.00053187634,0.001102691,0.0019245921,0.0018479307,0.0007966369,0.0054788487],"category_scores_gemma":[0.0017869278,0.0004486326,0.0008642294,0.0009512596,0.0008237204,0.0025898768,0.0017164391,0.0011728727,0.0008901262],"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.0003943154,0.00019532337,0.0009800157,0.00024360184,0.00012002991,0.0006626459,0.0004863224,0.600612,0.013374389,0.25037408,0.0057285517,0.12682883],"study_design_scores_gemma":[0.00004501543,0.00004472483,0.00007648296,0.0000111700165,0.000019704512,0.00006944063,0.00002717872,0.9701512,0.001485192,0.022649102,0.0054041753,0.000016664384],"about_ca_topic_score_codex":0.012100505,"about_ca_topic_score_gemma":0.011136534,"teacher_disagreement_score":0.012100505,"about_ca_system_score_codex":0.0011462327,"about_ca_system_score_gemma":0.0026958876,"threshold_uncertainty_score":0.02406019},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000726654,0.006135112,0.004894525,0.011265048,0.042007267,0.00030543495,0.009438106,0.0017457724,0.92348206],"genre_scores_gemma":[0.0027806123,0.0027226103,0.0019107241,0.003901006,0.0037726108,0.00018249155,0.0038156814,0.0007178539,0.9801964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954104,0.000091793816,0.000020127018,0.00007136723,0.00021760246,0.000058115846],"domain_scores_gemma":[0.9987343,0.0002448438,0.000038933624,0.00012777,0.0006039582,0.00025022164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204083,0.0008459371,0.00052769086,0.0018244105,0.0009254779,0.0034951847,0.0010487085,0.0011899513,0.6160814],"category_scores_gemma":[0.0040533254,0.00026325314,0.0004907739,0.00118204,0.00043156915,0.0026317516,0.0017839355,0.0016246212,0.3749077],"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.000051419116,0.000018387369,0.000070023154,0.00017295696,0.0000020601628,0.00008002579,0.000036216843,0.000032615044,0.0002314923,0.009020614,0.9006876,0.089596696],"study_design_scores_gemma":[0.0000033406961,0.000007269912,0.000051374984,0.000043017735,0.0000011335976,0.000050852,0.000017352912,0.000011783836,0.000062779705,0.0019285914,0.99782026,0.0000023171397],"about_ca_topic_score_codex":0.0019694506,"about_ca_topic_score_gemma":0.003773264,"teacher_disagreement_score":0.6160814,"about_ca_system_score_codex":0.0010898224,"about_ca_system_score_gemma":0.0015673297,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0447372,0.000034627392,0.95020473,0.00043339285,0.000026250715,0.00018888155,0.00010311727,0.0006858889,0.0035859647],"genre_scores_gemma":[0.46233466,0.000027690714,0.535905,0.00010034102,0.000023206021,0.0003998792,0.00013417231,0.00010707171,0.00096808944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915452,0.0052770306,0.0004267387,0.00060551934,0.0018795351,0.0002660686],"domain_scores_gemma":[0.96629167,0.026462618,0.001310355,0.0014695623,0.0036504292,0.00081532134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012202447,0.0010630342,0.0015094767,0.0022348429,0.0015957869,0.0030979381,0.003091393,0.0021453071,0.0057809697],"category_scores_gemma":[0.028638473,0.00062568084,0.000816863,0.0022832213,0.0011796706,0.0031160999,0.0034439187,0.001412863,0.00075080787],"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.001262048,0.0006008507,0.0033734848,0.00047343998,0.00030495983,0.00057646964,0.0019850314,0.6914837,0.00850824,0.050311808,0.0042849616,0.23683496],"study_design_scores_gemma":[0.00009855784,0.00011552881,0.00021791235,0.000022608347,0.000046931975,0.000048082336,0.00022359523,0.98035336,0.0021443402,0.0152405,0.0014622377,0.000026353782],"about_ca_topic_score_codex":0.002619776,"about_ca_topic_score_gemma":0.0045186426,"teacher_disagreement_score":0.012202447,"about_ca_system_score_codex":0.0011385432,"about_ca_system_score_gemma":0.0024004036,"threshold_uncertainty_score":0.06453347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13996091,0.003655597,0.7093042,0.010725331,0.00022311763,0.0002260913,0.0026332804,0.0013955223,0.13187587],"genre_scores_gemma":[0.78671896,0.0021455567,0.18073604,0.0016526087,0.00044409168,0.00024999393,0.0025810576,0.00024955755,0.025222128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977901,0.00054833665,0.00014239157,0.00046189682,0.00075403054,0.00030325665],"domain_scores_gemma":[0.99844295,0.0010186621,0.00016730739,0.00010741803,0.00019821175,0.0000654087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204271,0.00055032066,0.00066809275,0.0009724684,0.0012677218,0.004628879,0.0011933311,0.0009797852,0.0065811835],"category_scores_gemma":[0.004049131,0.00040372857,0.0013617313,0.0022986138,0.0026307693,0.00512144,0.0019514656,0.0032947797,0.00096628466],"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.00006127279,0.000052908068,0.00039676038,0.00020009157,0.000033836888,0.0002816334,0.00028343953,0.016703464,0.0012240962,0.94682765,0.006300837,0.027633937],"study_design_scores_gemma":[0.000037498638,0.000021007309,0.00022245588,0.000028022287,0.000021888936,0.00022512472,0.0001235298,0.04248182,0.001150898,0.94387734,0.011786612,0.000023828381],"about_ca_topic_score_codex":0.008048637,"about_ca_topic_score_gemma":0.005268161,"teacher_disagreement_score":0.008048637,"about_ca_system_score_codex":0.0032355972,"about_ca_system_score_gemma":0.0016771492,"threshold_uncertainty_score":0.023476005},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060169655,0.0020604155,0.104146205,0.0017611235,0.0009636379,0.00009978619,0.00091780483,0.0011020709,0.882932],"genre_scores_gemma":[0.15470593,0.0029195196,0.045035556,0.0006852668,0.0006041896,0.00018787873,0.0016995384,0.00043101376,0.7937312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993973,0.00013245505,0.00003457693,0.00016908605,0.00019457677,0.00007207235],"domain_scores_gemma":[0.9996106,0.000094001385,0.000024475909,0.0001388898,0.00009915268,0.00003291396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048467558,0.0007885401,0.00041815185,0.00096725,0.001427761,0.004239727,0.0009294221,0.0010607591,0.11447625],"category_scores_gemma":[0.0016332305,0.0003094849,0.00050207536,0.0011665868,0.0014667958,0.004821343,0.0027285407,0.0012131314,0.026634378],"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.000031313608,0.000018256724,0.00010164145,0.00009873597,0.0000072906755,0.00007707971,0.00018393098,0.0008863534,0.0008387912,0.90521544,0.021342183,0.071198985],"study_design_scores_gemma":[0.000012673989,0.00002121601,0.00013691472,0.000049686823,0.0000076019096,0.00021159968,0.0001665757,0.002889103,0.0012978696,0.29469046,0.70050424,0.000011983207],"about_ca_topic_score_codex":0.0013081447,"about_ca_topic_score_gemma":0.0012182188,"teacher_disagreement_score":0.11447625,"about_ca_system_score_codex":0.00095651904,"about_ca_system_score_gemma":0.00046410642,"threshold_uncertainty_score":0.3829612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044832285,0.002078314,0.715044,0.0014077713,0.00071539317,0.00042272147,0.0016648059,0.0035333026,0.27065045],"genre_scores_gemma":[0.1126006,0.004054579,0.44701254,0.0012434438,0.00061181374,0.0010656883,0.0055702315,0.0019484701,0.42589253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988205,0.00029596832,0.000054465803,0.0002500033,0.00045049025,0.00012865104],"domain_scores_gemma":[0.99925107,0.0002266601,0.000041870124,0.0002838038,0.0001437248,0.000052810457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133644,0.0012259369,0.0009882555,0.0012870928,0.00063144445,0.003266353,0.0017059589,0.0017470929,0.11590484],"category_scores_gemma":[0.004707644,0.0004945054,0.00076694804,0.0017042584,0.00046721468,0.002604026,0.002255335,0.0016541068,0.044156224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014612352,0.00015992491,0.00030277643,0.0002386301,0.000072575756,0.000064904416,0.00003311666,0.054712616,0.0011961092,0.22222541,0.107404865,0.61344296],"study_design_scores_gemma":[0.00012807944,0.00019661231,0.00026295788,0.00015684907,0.00005210542,0.00033756442,0.000048868198,0.24857914,0.0032668388,0.42429465,0.32265255,0.000023766428],"about_ca_topic_score_codex":0.0003934004,"about_ca_topic_score_gemma":0.0006431843,"teacher_disagreement_score":0.11590484,"about_ca_system_score_codex":0.00074889674,"about_ca_system_score_gemma":0.0012529226,"threshold_uncertainty_score":0.3877403},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008707087,0.0013165277,0.008108958,0.0063808695,0.003924753,0.00018560111,0.002775691,0.00042822014,0.9760088],"genre_scores_gemma":[0.02125019,0.0027498112,0.007557348,0.0024665373,0.0031825334,0.0005387484,0.006158542,0.00054815545,0.9555481],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990515,0.00012595081,0.00006457419,0.00022284525,0.00041031867,0.00012482176],"domain_scores_gemma":[0.997232,0.0006154983,0.00010868605,0.00039917015,0.0011307539,0.00051391264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001078715,0.0009939029,0.0009064552,0.0014924848,0.002039977,0.0029718082,0.0014587854,0.0017188143,0.4914041],"category_scores_gemma":[0.006722365,0.0003808173,0.00064913684,0.0015111932,0.0010989901,0.0040918686,0.003187043,0.0031107187,0.31258562],"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.00004771812,0.000086018365,0.00014203132,0.00032499354,0.0000034351376,0.00012304804,0.00025625454,0.00028828913,0.000488063,0.2716704,0.62379974,0.10277001],"study_design_scores_gemma":[0.000007746777,0.000023536884,0.00017312188,0.00013319531,0.0000025921097,0.00008086412,0.00008762913,0.0001022895,0.00020160495,0.08712637,0.9120544,0.0000066711623],"about_ca_topic_score_codex":0.001812928,"about_ca_topic_score_gemma":0.002956113,"teacher_disagreement_score":0.4914041,"about_ca_system_score_codex":0.0018064212,"about_ca_system_score_gemma":0.003001107,"threshold_uncertainty_score":0.72545034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022884416,0.0019838214,0.009070261,0.02086941,0.0051908162,0.00012194998,0.0024020479,0.00065578154,0.95741755],"genre_scores_gemma":[0.06009663,0.0035721147,0.008690548,0.026552971,0.0022426078,0.00024736533,0.0048618256,0.001250557,0.89248526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979796,0.0002805966,0.000063957836,0.00052009086,0.00087613007,0.0002796314],"domain_scores_gemma":[0.9964323,0.00062671606,0.00013842498,0.000562043,0.0017617198,0.00047885015],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022524097,0.0008396823,0.00046444184,0.0012893486,0.0017072968,0.0054020816,0.0019697936,0.0018956753,0.3767738],"category_scores_gemma":[0.009485516,0.00024239134,0.0009089819,0.0009489825,0.0012527681,0.0038119112,0.0021770792,0.0024167555,0.13207386],"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.00029725506,0.00009466906,0.0015216757,0.0006610006,0.000034943576,0.00017218427,0.0005765482,0.0005792003,0.0015911842,0.22303337,0.5573382,0.21409984],"study_design_scores_gemma":[0.000025993797,0.000020068146,0.0010964007,0.0003344516,0.000021002534,0.00010306506,0.0006659685,0.00021869015,0.0013025532,0.04873263,0.94746834,0.000010857508],"about_ca_topic_score_codex":0.006269742,"about_ca_topic_score_gemma":0.006282863,"teacher_disagreement_score":0.62322617,"about_ca_system_score_codex":0.0028909636,"about_ca_system_score_gemma":0.0034973393,"threshold_uncertainty_score":0.88895655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13996091,0.003655597,0.7093042,0.010725331,0.00022311763,0.0002260913,0.0026332804,0.0013955223,0.13187587],"genre_scores_gemma":[0.78671896,0.0021455567,0.18073604,0.0016526087,0.00044409168,0.00024999393,0.0025810576,0.00024955755,0.025222128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977901,0.00054833665,0.00014239157,0.00046189682,0.00075403054,0.00030325665],"domain_scores_gemma":[0.99844295,0.0010186621,0.00016730739,0.00010741803,0.00019821175,0.0000654087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204271,0.00055032066,0.00066809275,0.0009724684,0.0012677218,0.004628879,0.0011933311,0.0009797852,0.0065811835],"category_scores_gemma":[0.004049131,0.00040372857,0.0013617313,0.0022986138,0.0026307693,0.00512144,0.0019514656,0.0032947797,0.00096628466],"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.00006127279,0.000052908068,0.00039676038,0.00020009157,0.000033836888,0.0002816334,0.00028343953,0.016703464,0.0012240962,0.94682765,0.006300837,0.027633937],"study_design_scores_gemma":[0.000037498638,0.000021007309,0.00022245588,0.000028022287,0.000021888936,0.00022512472,0.0001235298,0.04248182,0.001150898,0.94387734,0.011786612,0.000023828381],"about_ca_topic_score_codex":0.008048637,"about_ca_topic_score_gemma":0.005268161,"teacher_disagreement_score":0.008048637,"about_ca_system_score_codex":0.0032355972,"about_ca_system_score_gemma":0.0016771492,"threshold_uncertainty_score":0.023476005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00762433,0.0032025753,0.53852105,0.0012678637,0.0007099077,0.00015180434,0.0008130172,0.0020052714,0.4457042],"genre_scores_gemma":[0.15878947,0.0062771584,0.3830536,0.0011253342,0.00036434847,0.0003427581,0.0044351905,0.0028598693,0.4427523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982834,0.000031185868,0.000004491987,0.000050390776,0.00006946596,0.0000160081],"domain_scores_gemma":[0.99986124,0.000039158556,0.0000057014686,0.00005058889,0.000029833245,0.000013459509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017302648,0.0006027966,0.00043816757,0.0006935853,0.00046442595,0.00071864825,0.0010274554,0.0005666774,0.035983186],"category_scores_gemma":[0.0006521434,0.00027112334,0.00055484177,0.0010278147,0.0005913343,0.0010736459,0.0011442722,0.001226358,0.008406075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002643609,0.000053644828,0.00021843975,0.000273045,0.00003544574,0.00007422788,0.00010569667,0.038668036,0.0066299657,0.36409765,0.095356375,0.49446106],"study_design_scores_gemma":[0.000016488018,0.00003580012,0.0003832788,0.00011318047,0.000035173096,0.00029004872,0.00006499513,0.107272126,0.0071852235,0.41929257,0.46528453,0.000026585087],"about_ca_topic_score_codex":0.0016390294,"about_ca_topic_score_gemma":0.0036951818,"teacher_disagreement_score":0.035983186,"about_ca_system_score_codex":0.0007670036,"about_ca_system_score_gemma":0.0005118989,"threshold_uncertainty_score":0.12037569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01805449,0.00022496154,0.9721594,0.00041310518,0.000044919205,0.000045782584,0.00003865662,0.0007142523,0.00830441],"genre_scores_gemma":[0.72345614,0.00051112386,0.26323158,0.00027868676,0.00010448022,0.0002719318,0.00020636996,0.00028707893,0.011652618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990927,0.0003138178,0.000058964168,0.00022334594,0.0002026933,0.000108472595],"domain_scores_gemma":[0.9935887,0.005132277,0.00031410565,0.0004940152,0.00031907676,0.0001518629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015738306,0.0006718148,0.0008482602,0.00071460084,0.00041820187,0.0013022318,0.0019139688,0.0009138449,0.0046666837],"category_scores_gemma":[0.008439273,0.00053732167,0.0009326311,0.0006055889,0.0017063771,0.0023265912,0.002015931,0.0016694409,0.00069430546],"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.00013597177,0.00013217716,0.0016787373,0.00020631657,0.00013873001,0.00018322007,0.00024221031,0.71489656,0.0034148127,0.13490883,0.0023116171,0.14175075],"study_design_scores_gemma":[0.000012237673,0.000018288729,0.000056470144,0.000009710857,0.000008075158,0.000017138858,0.0000095352825,0.957365,0.0007278442,0.041057065,0.00071274914,0.000005906825],"about_ca_topic_score_codex":0.0020319878,"about_ca_topic_score_gemma":0.0024072474,"teacher_disagreement_score":0.0046666837,"about_ca_system_score_codex":0.0010287792,"about_ca_system_score_gemma":0.00087650184,"threshold_uncertainty_score":0.015611649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031465653,0.0049552396,0.4851809,0.0016849949,0.00085854536,0.00015723676,0.004294056,0.0024164836,0.49730593],"genre_scores_gemma":[0.12295474,0.011952409,0.40777722,0.0014036542,0.0010920275,0.00041227177,0.012886627,0.0015161822,0.44000494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996649,0.000046813726,0.000031284122,0.00012545002,0.000100033605,0.0000314843],"domain_scores_gemma":[0.9996257,0.00011934447,0.00002525449,0.00010376019,0.000097549004,0.000028386617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000421275,0.0008835214,0.00047942606,0.0011130723,0.00071143714,0.0033524877,0.001031968,0.0006400241,0.07111098],"category_scores_gemma":[0.0013700161,0.00041965774,0.0007870631,0.0018590497,0.0009970085,0.004555145,0.0011198865,0.0017415888,0.027159093],"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.00004101489,0.000022805223,0.00007097992,0.00022281754,0.000009255978,0.00007796616,0.00012974504,0.0015659353,0.0014789099,0.8425572,0.040077116,0.11374631],"study_design_scores_gemma":[0.00001393748,0.000014837983,0.00008503816,0.0001100507,0.000014977167,0.00032493053,0.00007798384,0.0051641157,0.001982574,0.3849143,0.6072833,0.000014013637],"about_ca_topic_score_codex":0.0021400657,"about_ca_topic_score_gemma":0.0018292023,"teacher_disagreement_score":0.07111098,"about_ca_system_score_codex":0.0009950498,"about_ca_system_score_gemma":0.000885124,"threshold_uncertainty_score":0.23788995},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00805724,0.00013820123,0.9851248,0.00021633333,0.000050523347,0.00011934067,0.0001264363,0.001168784,0.0049981717],"genre_scores_gemma":[0.378072,0.0003694316,0.61352783,0.00021000573,0.00008468031,0.00044338685,0.000390013,0.00013383129,0.006768803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912375,0.00017901353,0.00008340351,0.0002538028,0.00027267865,0.000087429304],"domain_scores_gemma":[0.99936205,0.00024078913,0.00009099189,0.000074367184,0.00013942293,0.0000923959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948449,0.00053893385,0.0009389638,0.00053187634,0.001102691,0.0019245921,0.0018479307,0.0007966369,0.0054788487],"category_scores_gemma":[0.0017869278,0.0004486326,0.0008642294,0.0009512596,0.0008237204,0.0025898768,0.0017164391,0.0011728727,0.0008901262],"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.0003943154,0.00019532337,0.0009800157,0.00024360184,0.00012002991,0.0006626459,0.0004863224,0.600612,0.013374389,0.25037408,0.0057285517,0.12682883],"study_design_scores_gemma":[0.00004501543,0.00004472483,0.00007648296,0.0000111700165,0.000019704512,0.00006944063,0.00002717872,0.9701512,0.001485192,0.022649102,0.0054041753,0.000016664384],"about_ca_topic_score_codex":0.012100505,"about_ca_topic_score_gemma":0.011136534,"teacher_disagreement_score":0.012100505,"about_ca_system_score_codex":0.0011462327,"about_ca_system_score_gemma":0.0026958876,"threshold_uncertainty_score":0.02406019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014331385,0.008271903,0.1726448,0.0021775407,0.0010656283,0.00014009676,0.001314604,0.00049558113,0.81245667],"genre_scores_gemma":[0.09361304,0.029565185,0.27341267,0.0036892227,0.0027332436,0.0007381929,0.0062872544,0.0013625517,0.5885986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990023,0.0001830211,0.00006985428,0.00024097782,0.00044165645,0.00006207596],"domain_scores_gemma":[0.9990582,0.0004337058,0.00004838852,0.00016378026,0.0002544616,0.00004150356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007579622,0.0012193606,0.00069754897,0.0013997876,0.0010282001,0.0035627172,0.0015529756,0.0008998343,0.08681071],"category_scores_gemma":[0.003821502,0.00069538224,0.00078951946,0.0025027927,0.0015070797,0.0046277717,0.001698521,0.002807282,0.022378063],"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.000018991592,0.000027801936,0.000044122975,0.00041447303,0.000013047926,0.00005260777,0.00012207085,0.0010396525,0.00082122115,0.77313095,0.09239514,0.13191977],"study_design_scores_gemma":[0.000012048852,0.000015633394,0.000076439734,0.00021100946,0.000011377192,0.0002508421,0.00003979215,0.0026505366,0.0010149388,0.45899746,0.5367054,0.000014544089],"about_ca_topic_score_codex":0.00092455687,"about_ca_topic_score_gemma":0.0012786466,"teacher_disagreement_score":0.08681071,"about_ca_system_score_codex":0.0012518574,"about_ca_system_score_gemma":0.0012962297,"threshold_uncertainty_score":0.29041076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004891372,0.0002383879,0.9877236,0.00023178486,0.00009443888,0.00014419215,0.0002530678,0.0021198262,0.004303367],"genre_scores_gemma":[0.06962407,0.00023322094,0.92216635,0.00018212422,0.00011280227,0.00030259482,0.0012110731,0.0011308793,0.0050368253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638015,0.00072353194,0.00023279167,0.00086222595,0.0014176663,0.00038371672],"domain_scores_gemma":[0.99352586,0.0030879201,0.00031941186,0.001884868,0.001015759,0.0001662434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273827,0.0016250474,0.0023261395,0.0022786083,0.0016769918,0.00440951,0.0048864996,0.002194833,0.014350027],"category_scores_gemma":[0.012665802,0.0015550525,0.0018865266,0.0041403905,0.001285715,0.007883525,0.0051355627,0.0047272625,0.003371964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069378153,0.00033718345,0.00075102,0.00037308442,0.00012482466,0.00013612885,0.00031852588,0.11996327,0.011137613,0.11542237,0.029780446,0.72096175],"study_design_scores_gemma":[0.00029782183,0.00010412396,0.00043092459,0.000078551326,0.000104129416,0.00017756426,0.00013006858,0.8098611,0.0151371015,0.15689765,0.01672273,0.00005815058],"about_ca_topic_score_codex":0.00406077,"about_ca_topic_score_gemma":0.0047986316,"teacher_disagreement_score":0.014350027,"about_ca_system_score_codex":0.0017878074,"about_ca_system_score_gemma":0.0032060805,"threshold_uncertainty_score":0.04800564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235186,0.0028230748,0.41278172,0.012871381,0.0006642513,0.0007279521,0.008265945,0.004905469,0.033441566],"genre_scores_gemma":[0.8899928,0.0010525385,0.08313656,0.0024527686,0.0005661776,0.0006395754,0.0062552076,0.0013216858,0.014582833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957417,0.00086527,0.0002779877,0.0013713158,0.000835629,0.00090810185],"domain_scores_gemma":[0.9441872,0.0473438,0.0023517092,0.0035714575,0.0014317888,0.0011139049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037044536,0.0013933185,0.0023517767,0.0012805144,0.0019512762,0.0037782122,0.003943408,0.0031540752,0.014348624],"category_scores_gemma":[0.04271818,0.0013274446,0.0028538923,0.0023812775,0.003369287,0.009816206,0.0023848156,0.0055566845,0.0017274414],"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.002270144,0.0007710591,0.006965221,0.0012249171,0.00036721816,0.0011792255,0.00040648857,0.4319607,0.005559067,0.42295337,0.04893082,0.077411726],"study_design_scores_gemma":[0.0003347788,0.00010936488,0.0013176143,0.000100857214,0.000062192405,0.0005400957,0.00013691565,0.41701385,0.002192932,0.57484806,0.0032821123,0.00006130667],"about_ca_topic_score_codex":0.0086994795,"about_ca_topic_score_gemma":0.012238987,"teacher_disagreement_score":0.014348624,"about_ca_system_score_codex":0.0037926373,"about_ca_system_score_gemma":0.0033142604,"threshold_uncertainty_score":0.04800093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033155885,0.000888794,0.931929,0.0025573208,0.0002729141,0.00014456533,0.00030383232,0.0003181182,0.030429566],"genre_scores_gemma":[0.16283157,0.00039604388,0.8294893,0.0005632946,0.00014876694,0.0002038006,0.00022583576,0.00024158729,0.005899768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791354,0.0010037082,0.00008954182,0.0002623566,0.0005235677,0.00020730475],"domain_scores_gemma":[0.9932875,0.005384711,0.0003851202,0.00033598344,0.00045551467,0.00015118562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002909304,0.00063376536,0.00072169653,0.0007958566,0.00095124874,0.0023605847,0.0011100825,0.0010166242,0.009268994],"category_scores_gemma":[0.012030428,0.0006255875,0.0010703364,0.0020580315,0.0018943849,0.002160809,0.0019117657,0.0029810015,0.00091090583],"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.00013294816,0.00014603797,0.00073399744,0.00024373308,0.0000545421,0.0003264675,0.00022867449,0.23893318,0.0017385435,0.65527976,0.01002281,0.09215927],"study_design_scores_gemma":[0.000054621072,0.000046139525,0.00014434363,0.00006893513,0.0000174531,0.00011783085,0.00013821616,0.69691414,0.0029533496,0.28463924,0.014876866,0.000028828637],"about_ca_topic_score_codex":0.004857581,"about_ca_topic_score_gemma":0.0055588353,"teacher_disagreement_score":0.009268994,"about_ca_system_score_codex":0.0012342581,"about_ca_system_score_gemma":0.001910817,"threshold_uncertainty_score":0.031007886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014258874,0.0001568975,0.97352284,0.00050906034,0.00017355215,0.000083659994,0.0000873043,0.0006359296,0.010571868],"genre_scores_gemma":[0.26723596,0.00025413185,0.71536076,0.0006624316,0.00015619326,0.00018957275,0.000364688,0.00070019654,0.015076033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997801,0.0004235696,0.00010788593,0.00044079358,0.00095379265,0.0002729026],"domain_scores_gemma":[0.9950368,0.0022926342,0.00041562194,0.0010571245,0.0008935597,0.0003042864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023877532,0.0011087086,0.00095626153,0.0012273559,0.0015388444,0.0026254372,0.0023241176,0.0015377472,0.0103369495],"category_scores_gemma":[0.012082751,0.0005358094,0.0010694503,0.0017441284,0.002292414,0.0035324185,0.0029453447,0.0031149194,0.0014040826],"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.0002938298,0.00015227843,0.0014170168,0.00026065475,0.00006401682,0.0002647701,0.00018503817,0.21888687,0.006204836,0.5122241,0.015516205,0.24453044],"study_design_scores_gemma":[0.00003833881,0.000048826096,0.00024199372,0.00005186647,0.000018224877,0.00013406288,0.000041288586,0.83012927,0.0056415065,0.1497671,0.013849539,0.00003801449],"about_ca_topic_score_codex":0.004961327,"about_ca_topic_score_gemma":0.0057080262,"teacher_disagreement_score":0.0103369495,"about_ca_system_score_codex":0.0013479488,"about_ca_system_score_gemma":0.0027477397,"threshold_uncertainty_score":0.03458047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377085,0.001486265,0.2799203,0.008780298,0.00013813717,0.00026508665,0.0032163186,0.00086206023,0.067623034],"genre_scores_gemma":[0.94067866,0.0007895992,0.042047996,0.00065800746,0.00023038042,0.0002473569,0.0015685603,0.00028662724,0.013492793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987269,0.00032421172,0.00005312834,0.00027955463,0.0003184437,0.000297793],"domain_scores_gemma":[0.9923854,0.0063593504,0.0003336069,0.00044574085,0.00023017888,0.00024562498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008596117,0.00049312884,0.0011182596,0.0006328995,0.0008432207,0.0039516836,0.0016829697,0.0012482682,0.01746944],"category_scores_gemma":[0.008507618,0.0004858044,0.000978702,0.001282306,0.0012554444,0.004837736,0.0013911978,0.0023233315,0.0008834995],"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.0007977596,0.00034855626,0.0050799907,0.00071685243,0.00015775356,0.00052883395,0.00046906527,0.30857313,0.00847477,0.5667145,0.015858492,0.09228034],"study_design_scores_gemma":[0.00011301825,0.000043622935,0.00088476704,0.000022105405,0.000036286845,0.00018340597,0.00008609955,0.38034895,0.0016024447,0.6141727,0.0024911275,0.000015569138],"about_ca_topic_score_codex":0.0030555425,"about_ca_topic_score_gemma":0.0036879126,"teacher_disagreement_score":0.01746944,"about_ca_system_score_codex":0.0021029988,"about_ca_system_score_gemma":0.0013543533,"threshold_uncertainty_score":0.058441103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026436195,0.0005155325,0.95974874,0.0004513809,0.00005365997,0.00016251249,0.00028988585,0.0016478784,0.010694167],"genre_scores_gemma":[0.3655484,0.00045265563,0.6272655,0.0002467698,0.000033147844,0.00029576785,0.0009949206,0.0004587113,0.004704217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979626,0.0008096438,0.00009847004,0.00034968308,0.00048277574,0.00029681574],"domain_scores_gemma":[0.9978364,0.0010852378,0.0001452505,0.0005330044,0.0002729896,0.00012707648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576146,0.0010154383,0.0009853082,0.0010590793,0.0006978153,0.001393075,0.001978708,0.0011113664,0.0063316994],"category_scores_gemma":[0.007175866,0.00053482054,0.00076403643,0.0016843003,0.0008389949,0.0028871188,0.0021784927,0.0013608088,0.0008746814],"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.00028728598,0.00019322263,0.0014319847,0.0002936897,0.00008963519,0.000109542794,0.00019385481,0.6331864,0.0045841145,0.103961825,0.011971049,0.24369738],"study_design_scores_gemma":[0.000043118405,0.000041794225,0.0001446063,0.000021460934,0.000016738595,0.000044111344,0.00004590342,0.934707,0.0014258688,0.0594798,0.004019612,0.000010093101],"about_ca_topic_score_codex":0.005783511,"about_ca_topic_score_gemma":0.008397546,"teacher_disagreement_score":0.0063316994,"about_ca_system_score_codex":0.0014147492,"about_ca_system_score_gemma":0.002927915,"threshold_uncertainty_score":0.021181703},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029517084,0.07307435,0.8648201,0.005475015,0.0006302656,0.00025928285,0.0015763969,0.0007654551,0.023882061],"genre_scores_gemma":[0.31620982,0.096028455,0.5630709,0.0023027335,0.0040939003,0.0008317299,0.0048555476,0.0010677988,0.011539153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99281174,0.0016007572,0.00063513883,0.0014327749,0.0030430297,0.00047640956],"domain_scores_gemma":[0.98356116,0.012758102,0.0006589737,0.0018895818,0.00079525163,0.000336922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004196575,0.0018010691,0.0037005064,0.0035895684,0.0012980236,0.0068227174,0.0042699836,0.0021865894,0.009407122],"category_scores_gemma":[0.018802447,0.0016046169,0.0033318251,0.009861248,0.0034328832,0.0135962125,0.004185838,0.005986178,0.0013473822],"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.00015465199,0.0002247948,0.0025207053,0.003452734,0.00022834807,0.0001899953,0.0003878474,0.094848745,0.0017388084,0.62638044,0.0138420835,0.2560309],"study_design_scores_gemma":[0.000036523124,0.0000692289,0.0010186307,0.00032278177,0.00006969267,0.00027479653,0.000092690745,0.11035807,0.0006638285,0.8631518,0.023887841,0.00005410389],"about_ca_topic_score_codex":0.00258651,"about_ca_topic_score_gemma":0.0022583469,"teacher_disagreement_score":0.009407122,"about_ca_system_score_codex":0.003658501,"about_ca_system_score_gemma":0.0026060939,"threshold_uncertainty_score":0.03147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009424573,0.00018338105,0.9732064,0.00046149327,0.000104021376,0.00015277005,0.0003712335,0.0046992875,0.011396868],"genre_scores_gemma":[0.13953416,0.00023687039,0.84912235,0.00047708565,0.00005018902,0.0003718239,0.0007242157,0.0010585268,0.008424697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.00016744986,0.00003141639,0.00012196291,0.00019083532,0.00009300065],"domain_scores_gemma":[0.9986847,0.00087469886,0.00009758785,0.00009846314,0.00016427066,0.00008024939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000929172,0.0009992141,0.0007219837,0.0004935302,0.0004435122,0.0013237213,0.0019905185,0.0014777622,0.01053321],"category_scores_gemma":[0.0048802365,0.0005494632,0.0007550263,0.0005852735,0.00095160765,0.001206045,0.0018037047,0.002382508,0.001543736],"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.00013196704,0.00014938458,0.0010439446,0.00025681453,0.000056315002,0.00022954696,0.00011771603,0.7868383,0.002423208,0.056911338,0.018359521,0.13348195],"study_design_scores_gemma":[0.000034661527,0.000017515675,0.00002742915,0.000011478255,0.0000036432466,0.000022263956,0.000011497833,0.9877685,0.0008334454,0.006720723,0.004543749,0.0000051780976],"about_ca_topic_score_codex":0.0070599276,"about_ca_topic_score_gemma":0.013532098,"teacher_disagreement_score":0.01053321,"about_ca_system_score_codex":0.0008994152,"about_ca_system_score_gemma":0.0033271885,"threshold_uncertainty_score":0.035237134},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090575626,0.01941457,0.014995227,0.09404953,0.10185154,0.0002116106,0.00829558,0.0026402043,0.75763595],"genre_scores_gemma":[0.011809223,0.021420771,0.007940191,0.03210264,0.053788003,0.0003594409,0.014309815,0.002814081,0.8554558],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965947,0.00032087122,0.00019961309,0.0005917438,0.0019907916,0.0003022329],"domain_scores_gemma":[0.9918588,0.0018536932,0.00032742182,0.0013190886,0.003291373,0.0013496322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014974623,0.0016537516,0.0014072466,0.0022675293,0.0019424935,0.007744129,0.0021723104,0.002423382,0.5108592],"category_scores_gemma":[0.011422414,0.00071253866,0.001393487,0.003477558,0.0012745885,0.0065108887,0.0027606294,0.005488423,0.34338823],"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.000020716934,0.00002391619,0.00006289849,0.00013703044,0.0000067681026,0.000018389646,0.000009346673,0.0001764429,0.0002595312,0.012157093,0.9306122,0.056515753],"study_design_scores_gemma":[0.000007142283,0.000014195202,0.00015058386,0.000090974696,0.000004289358,0.00007529304,0.000015032308,0.00026449066,0.00014237198,0.0107862195,0.9884399,0.000009435064],"about_ca_topic_score_codex":0.0032842737,"about_ca_topic_score_gemma":0.00417051,"teacher_disagreement_score":0.5108592,"about_ca_system_score_codex":0.004500879,"about_ca_system_score_gemma":0.003660728,"threshold_uncertainty_score":0.6977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17589407,0.0050047804,0.7719834,0.0028999373,0.00035666383,0.00033168515,0.00043247527,0.0037354748,0.039361496],"genre_scores_gemma":[0.55002594,0.0014845903,0.4429615,0.0005179213,0.000097715056,0.00020435802,0.00054363033,0.0008259468,0.0033383844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974952,0.0011584588,0.000114123235,0.00034936547,0.0006299644,0.0002529092],"domain_scores_gemma":[0.9903796,0.0076802354,0.00025156312,0.00091004046,0.00052532257,0.00025317442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003027396,0.00090718304,0.0006414766,0.0010750489,0.00072670705,0.0019275573,0.0017319584,0.0010306952,0.0045363856],"category_scores_gemma":[0.013994018,0.00047332366,0.0008033679,0.0021654447,0.0012655129,0.0029770841,0.0020179255,0.0024708032,0.00035317353],"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.00038023302,0.00027404583,0.0022563117,0.00051881117,0.0001241657,0.00007428385,0.00023541643,0.67555326,0.0019314466,0.0439626,0.0050744633,0.269615],"study_design_scores_gemma":[0.000034073986,0.00010731435,0.00036956303,0.000040125116,0.00003382462,0.000024363471,0.00010469274,0.9784662,0.0015372079,0.015186521,0.004081505,0.000014668755],"about_ca_topic_score_codex":0.019531617,"about_ca_topic_score_gemma":0.035237215,"teacher_disagreement_score":0.019531617,"about_ca_system_score_codex":0.002156203,"about_ca_system_score_gemma":0.0042034034,"threshold_uncertainty_score":0.038835824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833905,0.00054084713,0.0005765417,0.000060193815,0.000011139589,0.00008786216,0.008849522,0.00023146806,0.0062519605],"genre_scores_gemma":[0.9610712,0.00029019036,0.001955802,0.00011251542,0.000045353034,0.000093907736,0.033220936,0.0001353528,0.0030748188],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993237,0.000030939478,0.00005104308,0.00021679523,0.00017503834,0.00020262305],"domain_scores_gemma":[0.9987465,0.00010096118,0.00044870542,0.0002956037,0.00015275959,0.00025546577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004986518,0.0007121253,0.0004368919,0.0029384186,0.0010046479,0.0009742095,0.00061023945,0.00028973044,0.004240381],"category_scores_gemma":[0.0007647994,0.00031204234,0.00045482488,0.0029018056,0.00030013552,0.00082044164,0.002472629,0.00036571184,0.0017348405],"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.00055597816,0.00008773259,0.9382456,0.00028421648,0.00017544453,0.0008750431,0.0019204757,0.00046585253,0.016872576,0.0004170912,0.004661352,0.03543864],"study_design_scores_gemma":[0.000022048658,0.00008790752,0.97784334,0.000017480974,0.00006161018,0.0007551608,0.00036667023,0.00026983002,0.0027188421,0.00008468881,0.017757066,0.000015285847],"about_ca_topic_score_codex":0.0056216894,"about_ca_topic_score_gemma":0.012064641,"teacher_disagreement_score":0.0056216894,"about_ca_system_score_codex":0.00060485664,"about_ca_system_score_gemma":0.00046427833,"threshold_uncertainty_score":0.014185548},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049457788,0.000841892,0.97845274,0.002013589,0.000053911182,0.00020988571,0.00028028764,0.00043530908,0.012766681],"genre_scores_gemma":[0.1385948,0.002551449,0.84989136,0.0010241907,0.00020621547,0.0007502227,0.001218582,0.00036927097,0.0053938283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920838,0.003946211,0.00046961562,0.0011624151,0.0019648126,0.00037315206],"domain_scores_gemma":[0.98559237,0.011286618,0.00076406955,0.0012416096,0.0009438096,0.00017153137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046715923,0.0015410447,0.0012854541,0.0020103946,0.0015150157,0.0050801747,0.002790059,0.0023415734,0.008050042],"category_scores_gemma":[0.023752745,0.0009458051,0.0024433485,0.0043129385,0.0065334314,0.007898905,0.0037964368,0.0039766454,0.0010094974],"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.00005192173,0.00008111053,0.00037233194,0.0005728825,0.00007930735,0.00015128274,0.0007214691,0.09895514,0.0009773149,0.80779225,0.0056836847,0.084561385],"study_design_scores_gemma":[0.00004178238,0.000036376292,0.00011579197,0.00011107751,0.000032806878,0.00009333108,0.0002058899,0.15203162,0.001356912,0.8244976,0.021444626,0.000032261927],"about_ca_topic_score_codex":0.011213985,"about_ca_topic_score_gemma":0.008486041,"teacher_disagreement_score":0.011213985,"about_ca_system_score_codex":0.0032798545,"about_ca_system_score_gemma":0.003956433,"threshold_uncertainty_score":0.026930094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09558157,0.00067996926,0.8799705,0.0005903789,0.00008875277,0.00029650438,0.00058089674,0.0021014833,0.02010989],"genre_scores_gemma":[0.6179031,0.00039652796,0.36982924,0.00046683665,0.000044915127,0.00038951237,0.0010804384,0.00052040664,0.00936904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989109,0.00038035898,0.00006003369,0.00022139664,0.00021637423,0.00021100545],"domain_scores_gemma":[0.9979588,0.0012023898,0.00014414966,0.0003126129,0.00028584237,0.00009615523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011311145,0.0007860127,0.00086981535,0.00071493495,0.00062126404,0.0012734921,0.0012347432,0.0008801038,0.009182763],"category_scores_gemma":[0.005166319,0.0005032188,0.0011301495,0.0011359368,0.0013931413,0.0025575843,0.0024413525,0.0015719121,0.0008738788],"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.00021677025,0.00021287636,0.0010052448,0.00023480515,0.00004431559,0.00022520236,0.00024442244,0.7795764,0.0058099646,0.099377066,0.00425689,0.10879604],"study_design_scores_gemma":[0.0000310956,0.000097789314,0.00022511467,0.000023270477,0.000016374293,0.000050087037,0.000057087345,0.9371317,0.002179425,0.05668623,0.0034810659,0.000020695139],"about_ca_topic_score_codex":0.006224017,"about_ca_topic_score_gemma":0.009604226,"teacher_disagreement_score":0.009182763,"about_ca_system_score_codex":0.0011699259,"about_ca_system_score_gemma":0.0017361267,"threshold_uncertainty_score":0.03071934},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005617531,0.00772025,0.41249904,0.5027385,0.0045273113,0.00009115526,0.00020095789,0.000200104,0.06640511],"genre_scores_gemma":[0.4769476,0.0093978075,0.33459023,0.13591813,0.014352015,0.0011443661,0.00026445245,0.00034332165,0.027042083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709964,0.0014740286,0.00014513552,0.0004148205,0.00073312334,0.00013327543],"domain_scores_gemma":[0.9907302,0.006371395,0.0004046384,0.0014131689,0.00085152156,0.00022901328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054189963,0.0005282326,0.0007446851,0.00079174765,0.0016287,0.003989693,0.002279452,0.0063761016,0.0048294878],"category_scores_gemma":[0.017687593,0.00046563387,0.0006044227,0.00064899825,0.010956698,0.012068666,0.0018333636,0.009340457,0.0013503253],"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.000015357104,0.000005487899,0.000043394128,0.00003072633,0.000008622446,0.000040482126,0.00007140407,0.00070591265,0.000063841035,0.98148227,0.008435834,0.0090966895],"study_design_scores_gemma":[0.000010722377,0.000004679553,0.000025971834,0.000012076493,0.0000018713778,0.000036904232,0.000027831577,0.0021214196,0.000049135375,0.9851018,0.012601878,0.0000056703657],"about_ca_topic_score_codex":0.0017465275,"about_ca_topic_score_gemma":0.002499393,"teacher_disagreement_score":0.0063761016,"about_ca_system_score_codex":0.0040855333,"about_ca_system_score_gemma":0.0016179766,"threshold_uncertainty_score":0.029642701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031579565,0.0026887313,0.944536,0.0015546002,0.000245079,0.000616051,0.001069203,0.0021589382,0.015551905],"genre_scores_gemma":[0.40207094,0.0017705571,0.5787535,0.0011538992,0.00050748215,0.0014120804,0.0044886502,0.0007453862,0.009097443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600935,0.0019703228,0.00018145949,0.0006805796,0.0007822811,0.00037592344],"domain_scores_gemma":[0.9909745,0.0068089217,0.00050292193,0.0006568412,0.00073787104,0.00031893697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044966014,0.0023205876,0.0025778115,0.0029033981,0.00091992004,0.0030810237,0.0026732907,0.002515757,0.014497011],"category_scores_gemma":[0.018012675,0.001131807,0.002240883,0.0036275906,0.0010519976,0.0029988305,0.0020607333,0.0028800964,0.0024009484],"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.00028116553,0.00029534736,0.0036258933,0.0005131541,0.00023343942,0.0001941668,0.00013446361,0.6174015,0.001365774,0.066452354,0.024571486,0.2849313],"study_design_scores_gemma":[0.000055629134,0.00008971732,0.00031009573,0.00005629416,0.000034755696,0.000056917284,0.00003652944,0.9487478,0.0005458213,0.046312395,0.0037429642,0.000011075678],"about_ca_topic_score_codex":0.0017530976,"about_ca_topic_score_gemma":0.003096913,"teacher_disagreement_score":0.014497011,"about_ca_system_score_codex":0.0020606255,"about_ca_system_score_gemma":0.0025595836,"threshold_uncertainty_score":0.04849732},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04978616,0.00050398416,0.93896383,0.00060560805,0.0001336345,0.00024016478,0.00016529,0.0009321182,0.008669208],"genre_scores_gemma":[0.38716385,0.00025093125,0.60789174,0.00033092898,0.00005208163,0.0004327986,0.00029870894,0.00020245553,0.0033765673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.0003029448,0.000032043292,0.00014196368,0.00013775137,0.00011326452],"domain_scores_gemma":[0.9978174,0.0015008646,0.00019553125,0.0001846492,0.00017575799,0.00012567674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015671932,0.00073423516,0.0011133527,0.00035221825,0.00066533795,0.0010212264,0.0016676029,0.0010223084,0.0050349385],"category_scores_gemma":[0.003625816,0.00063838845,0.0007748304,0.00061170605,0.0007564058,0.0010383491,0.0010630352,0.0012548323,0.0005898153],"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.00018764162,0.00015885211,0.00060692045,0.00022771534,0.00004787926,0.00005528356,0.00006497727,0.945084,0.0019021105,0.014810219,0.0022797391,0.034574594],"study_design_scores_gemma":[0.00002442753,0.00003156169,0.00006407229,0.0000066267908,0.000004132695,0.000005689977,0.000014080279,0.99559516,0.00030018468,0.003186352,0.00076468766,0.0000030882663],"about_ca_topic_score_codex":0.007285293,"about_ca_topic_score_gemma":0.009796454,"teacher_disagreement_score":0.007285293,"about_ca_system_score_codex":0.0009478209,"about_ca_system_score_gemma":0.0022404075,"threshold_uncertainty_score":0.016843617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016824925,0.00486882,0.9593359,0.001789429,0.00016503654,0.00011811583,0.00032673872,0.000072949224,0.016497998],"genre_scores_gemma":[0.53601515,0.016958958,0.43016508,0.0011176137,0.0013708218,0.00054311473,0.0016175814,0.00019852664,0.012013229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997479,0.00094295316,0.00022561195,0.00044599635,0.00071611593,0.00019041185],"domain_scores_gemma":[0.99411243,0.0037597225,0.0007031572,0.00033899452,0.0008731672,0.0002125606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036413372,0.00091604696,0.00097278296,0.0018945002,0.000989026,0.002120853,0.001134041,0.0014678326,0.005094141],"category_scores_gemma":[0.009823718,0.00039573884,0.0010382328,0.002673653,0.0033118166,0.0058690766,0.0012960292,0.0029441423,0.0006209038],"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.000017258562,0.00004269336,0.0011579108,0.00037350968,0.000021592983,0.00015783496,0.00020917394,0.031408,0.000796778,0.9231579,0.0036181263,0.039039344],"study_design_scores_gemma":[0.000014238098,0.00006571785,0.001197904,0.00020843327,0.000020051839,0.00019344715,0.00022341975,0.23296164,0.00091962435,0.74737895,0.016767964,0.000048608566],"about_ca_topic_score_codex":0.002669034,"about_ca_topic_score_gemma":0.002288302,"teacher_disagreement_score":0.005094141,"about_ca_system_score_codex":0.0014925458,"about_ca_system_score_gemma":0.001233782,"threshold_uncertainty_score":0.019257486},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013544301,0.01635029,0.008233387,0.04293891,0.2245679,0.0008672338,0.015274896,0.0021443374,0.6882686],"genre_scores_gemma":[0.006181322,0.011741863,0.0041640364,0.0075878603,0.043941785,0.0004693599,0.016942246,0.0011515989,0.90782],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853027,0.00016923592,0.00011997294,0.00020534397,0.00086333905,0.00011175885],"domain_scores_gemma":[0.9927367,0.0010717072,0.00026371147,0.0006259992,0.0044094804,0.00089245377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019368237,0.00095814123,0.00088577654,0.003669518,0.0019709545,0.00555994,0.0015087985,0.0013843271,0.4611507],"category_scores_gemma":[0.013261084,0.0003108309,0.00066444674,0.0027611665,0.0006011534,0.0035847826,0.0020370192,0.0025147316,0.31895965],"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.000023874876,0.000016458172,0.00007729877,0.00012509373,0.000002365455,0.000033748987,0.00006436713,0.00006501951,0.00013439234,0.0031007775,0.9464273,0.04992927],"study_design_scores_gemma":[0.0000028243746,0.000011203585,0.00018756508,0.00010647095,0.0000014586326,0.000040428047,0.000051986688,0.000024639556,0.000057790283,0.0013222495,0.99818975,0.0000036085255],"about_ca_topic_score_codex":0.0021610672,"about_ca_topic_score_gemma":0.0021735707,"teacher_disagreement_score":0.4611507,"about_ca_system_score_codex":0.0017952167,"about_ca_system_score_gemma":0.0022489394,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012358547,0.015517023,0.0073471023,0.04195236,0.25424644,0.00072767603,0.016238611,0.0022396573,0.6604953],"genre_scores_gemma":[0.006337216,0.011910332,0.0037492786,0.0079121925,0.05242668,0.000449136,0.018467028,0.0013203283,0.89742786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985172,0.00016930135,0.00011718777,0.000214127,0.00087381096,0.000108313594],"domain_scores_gemma":[0.9923993,0.0011980821,0.0002616724,0.0006533178,0.0045659435,0.0009217651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019151571,0.00094731664,0.0009233913,0.0038153366,0.00200593,0.005897257,0.0016013042,0.0013382942,0.45630312],"category_scores_gemma":[0.013976067,0.0003125288,0.0006424265,0.0030027393,0.0006156171,0.0037785552,0.0021010232,0.0025760613,0.3227144],"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.000019638917,0.000013963607,0.00007492061,0.000106754946,0.000002107697,0.000027558572,0.00005954701,0.00006127533,0.00010772992,0.0028443723,0.95311725,0.043564893],"study_design_scores_gemma":[0.0000025479783,0.00001007597,0.00018358509,0.000104748084,0.0000014236814,0.00003672339,0.00005173635,0.000024838007,0.00005043648,0.0012123645,0.99831784,0.000003633068],"about_ca_topic_score_codex":0.002458053,"about_ca_topic_score_gemma":0.0023687694,"teacher_disagreement_score":0.45630312,"about_ca_system_score_codex":0.0018923528,"about_ca_system_score_gemma":0.0023473776,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005877286,0.000100148485,0.99086857,0.00022088745,0.000028335297,0.00006945318,0.000051182706,0.0005401624,0.0022439482],"genre_scores_gemma":[0.2037424,0.00019238555,0.7922129,0.0003943056,0.00007032827,0.00030190247,0.00025442432,0.00032819054,0.0025030933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985398,0.00056597125,0.000075583914,0.00035891743,0.0002693084,0.00019045734],"domain_scores_gemma":[0.99726224,0.0018455087,0.00023115061,0.0002742867,0.00027472177,0.000112093425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023225094,0.0012449624,0.0011756618,0.0006897361,0.000449646,0.0015507872,0.0020001507,0.0022610528,0.0058737914],"category_scores_gemma":[0.007782215,0.00058948965,0.0009912986,0.0010628803,0.001393148,0.0017453517,0.0017834065,0.0026527706,0.0010840343],"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.000121138975,0.00015072554,0.0010326384,0.00028977398,0.00006618443,0.00016396029,0.00010842591,0.76075757,0.0032980514,0.06898252,0.0059554176,0.15907368],"study_design_scores_gemma":[0.000018291406,0.00002065777,0.000046111283,0.000016636544,0.000006728827,0.000021572778,0.000010619197,0.98102254,0.0009070426,0.016858203,0.0010656994,0.0000057787024],"about_ca_topic_score_codex":0.0019817876,"about_ca_topic_score_gemma":0.0033578211,"teacher_disagreement_score":0.0058737914,"about_ca_system_score_codex":0.0012167287,"about_ca_system_score_gemma":0.0023225127,"threshold_uncertainty_score":0.019649804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028243488,0.00022796278,0.9655776,0.00037499532,0.000044833687,0.00007163869,0.00037859156,0.0002667166,0.00481411],"genre_scores_gemma":[0.48733684,0.0004747814,0.5041144,0.00035434403,0.000053466934,0.00033776453,0.0012732957,0.00032400046,0.005731061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897623,0.00041863378,0.00004014699,0.00019748947,0.00022854056,0.00013895464],"domain_scores_gemma":[0.99725336,0.0020801476,0.00016786436,0.00015357601,0.00022176086,0.00012331425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570398,0.0009869166,0.0009673601,0.0006475077,0.0004971275,0.00095962296,0.0011473502,0.00093751197,0.005789285],"category_scores_gemma":[0.004863968,0.00046336467,0.0012953564,0.0012768272,0.00080256216,0.001956406,0.0013339003,0.0019300055,0.0003888258],"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.000074882606,0.00006353362,0.00052842614,0.00013657146,0.00003364849,0.00014680694,0.00006892262,0.90521264,0.001511854,0.062023897,0.0027730863,0.02742579],"study_design_scores_gemma":[0.000011108965,0.000018372284,0.000063980864,0.000006357138,0.0000060226416,0.000019917989,0.000019765039,0.97737986,0.00035960897,0.021142263,0.0009684635,0.000004404263],"about_ca_topic_score_codex":0.004988597,"about_ca_topic_score_gemma":0.0069072163,"teacher_disagreement_score":0.005789285,"about_ca_system_score_codex":0.0012379297,"about_ca_system_score_gemma":0.0021397492,"threshold_uncertainty_score":0.019367099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011015165,0.00028231254,0.9849117,0.00017757613,0.000061340404,0.00006136258,0.000059394675,0.00015971086,0.003271446],"genre_scores_gemma":[0.17867711,0.00044893636,0.81546223,0.00022428492,0.00008361954,0.00030256022,0.00030183597,0.00017725804,0.0043221763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907136,0.0002838629,0.000047806756,0.00013937347,0.00037520108,0.000082492385],"domain_scores_gemma":[0.99846137,0.0010416679,0.00011287061,0.00010149026,0.00023407394,0.00004858256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012862479,0.000879098,0.0010802,0.0010463778,0.0005776352,0.0010067751,0.0018722827,0.0013240466,0.0029712345],"category_scores_gemma":[0.0040843966,0.00061671465,0.0009161788,0.002128033,0.0007566444,0.001264552,0.0012941924,0.0018017542,0.00032915774],"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.00006690751,0.00010638027,0.0005507505,0.0001799515,0.000107704065,0.000056830475,0.00007411038,0.8165519,0.0022042904,0.05472983,0.0035162985,0.12185493],"study_design_scores_gemma":[0.000014754529,0.000014234099,0.000053277712,0.000006924931,0.000009216055,0.000012999261,0.0000088241895,0.9780488,0.00031139408,0.020544527,0.00097118865,0.0000038518383],"about_ca_topic_score_codex":0.0036846763,"about_ca_topic_score_gemma":0.006233022,"teacher_disagreement_score":0.0036846763,"about_ca_system_score_codex":0.0009156905,"about_ca_system_score_gemma":0.0010733191,"threshold_uncertainty_score":0.00993979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016072054,0.12767379,0.4900174,0.004514374,0.003175544,0.00010684676,0.001159382,0.0023996877,0.36934575],"genre_scores_gemma":[0.05214894,0.11607044,0.44470066,0.0030588873,0.0058892975,0.0006901686,0.0041114646,0.0021623755,0.3711678],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996107,0.00010751935,0.000017198372,0.00007493866,0.00017045316,0.000019275118],"domain_scores_gemma":[0.99943966,0.00034445262,0.000022744121,0.000100423575,0.00007200766,0.000020717585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046435467,0.0014128098,0.0014295937,0.0011171886,0.00037540766,0.0020961084,0.0012673772,0.0009923489,0.0334908],"category_scores_gemma":[0.0017708534,0.00051487365,0.0006531118,0.0028718957,0.0008692991,0.0017838563,0.0011571407,0.0031119462,0.017101277],"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.000020020892,0.000067777226,0.00017384317,0.0007075371,0.00005949915,0.0000578846,0.00007213376,0.011621452,0.0006926191,0.24014913,0.2778722,0.46850598],"study_design_scores_gemma":[0.000014754127,0.00002763335,0.00046155395,0.00040410928,0.000023110975,0.00025023942,0.000035059817,0.036878675,0.0006456888,0.48165813,0.47957194,0.000029133713],"about_ca_topic_score_codex":0.0010004968,"about_ca_topic_score_gemma":0.0019262936,"teacher_disagreement_score":0.0334908,"about_ca_system_score_codex":0.0008052606,"about_ca_system_score_gemma":0.0007466232,"threshold_uncertainty_score":0.1120379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00405018,0.002352875,0.67830217,0.0011305001,0.00056358817,0.000375843,0.0017313428,0.00371923,0.3077742],"genre_scores_gemma":[0.107292,0.004326056,0.44907793,0.0010387963,0.0005073445,0.0008784002,0.0058931317,0.0019706874,0.42901552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908984,0.00020713625,0.000043777556,0.00018390252,0.00037487163,0.00010038449],"domain_scores_gemma":[0.999358,0.0001925879,0.0000358277,0.00023934511,0.00013050911,0.000043801167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000876349,0.0011300435,0.00094191526,0.001162153,0.00057232316,0.0030462025,0.0016859167,0.0013802665,0.111967325],"category_scores_gemma":[0.0036214013,0.00046689747,0.0006815682,0.0016388125,0.0003846597,0.0023448116,0.0019498708,0.0014673049,0.047500238],"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.00012679338,0.0001507052,0.00033667163,0.0002460684,0.00006919753,0.000065318694,0.000031210002,0.04817974,0.0013510163,0.18755047,0.119651824,0.642241],"study_design_scores_gemma":[0.00011627023,0.00016982427,0.0003100235,0.00016112969,0.000048678256,0.00039716574,0.000048962545,0.23813058,0.004264519,0.38023135,0.3760955,0.000025892652],"about_ca_topic_score_codex":0.00045434383,"about_ca_topic_score_gemma":0.0009409488,"teacher_disagreement_score":0.111967325,"about_ca_system_score_codex":0.0007008463,"about_ca_system_score_gemma":0.0012047333,"threshold_uncertainty_score":0.37456805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016054109,0.0009900563,0.965592,0.0022169738,0.00019978642,0.00017669753,0.0010850241,0.0017713199,0.011913983],"genre_scores_gemma":[0.39095396,0.0012607807,0.5904815,0.0009316903,0.00047326257,0.0004644363,0.0037409726,0.0009781305,0.010715179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917514,0.0023381326,0.0005705735,0.0019231943,0.0027746302,0.00064210285],"domain_scores_gemma":[0.9760656,0.015501692,0.0010491931,0.003921332,0.0029373476,0.0005249411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006775695,0.0010884005,0.0020790019,0.0031024078,0.0024059492,0.006042285,0.0054108044,0.0023452567,0.012934522],"category_scores_gemma":[0.029273573,0.0017566511,0.0034907695,0.0055050147,0.0041704304,0.014832087,0.006708844,0.0073774094,0.0013642047],"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.00035248895,0.00014836284,0.0008471041,0.00061910716,0.00015648658,0.0002126641,0.00059743633,0.061925128,0.0019138457,0.8493835,0.009680665,0.07416333],"study_design_scores_gemma":[0.000062133106,0.00002453788,0.00017613675,0.000068854555,0.00007100576,0.00006714251,0.00011596209,0.11283298,0.0017505053,0.87796646,0.006837726,0.000026485965],"about_ca_topic_score_codex":0.0139970705,"about_ca_topic_score_gemma":0.011677997,"teacher_disagreement_score":0.0139970705,"about_ca_system_score_codex":0.0047068642,"about_ca_system_score_gemma":0.0053001624,"threshold_uncertainty_score":0.04327035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002885806,0.00017498306,0.98825955,0.00015031952,0.00009705034,0.00014741826,0.00019437529,0.0012209929,0.006869405],"genre_scores_gemma":[0.022642104,0.0001934535,0.96507883,0.00013337543,0.00008365117,0.0002656173,0.00081867166,0.000810094,0.009974171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.0003484673,0.0001234229,0.0004676655,0.0007797756,0.00021062144],"domain_scores_gemma":[0.99727196,0.001239528,0.000117673524,0.0006211171,0.00064076844,0.00010888649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012782327,0.001995571,0.0018653541,0.0028351466,0.0015670798,0.003023027,0.0051815063,0.0017732844,0.029730218],"category_scores_gemma":[0.0068777925,0.0011048281,0.0017431107,0.005956702,0.0009233526,0.0054031317,0.00284483,0.0030742732,0.0059878156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000187587,0.00020719442,0.0002570709,0.0002909239,0.00006698452,0.0000653591,0.00007008852,0.048446953,0.006624286,0.09590382,0.021284934,0.8265949],"study_design_scores_gemma":[0.00012743201,0.000082780396,0.0002563257,0.00007175307,0.00007679151,0.00017388248,0.000052557985,0.7941631,0.006762605,0.17386608,0.024319489,0.00004722446],"about_ca_topic_score_codex":0.0066429344,"about_ca_topic_score_gemma":0.009589251,"teacher_disagreement_score":0.029730218,"about_ca_system_score_codex":0.0019545048,"about_ca_system_score_gemma":0.003068041,"threshold_uncertainty_score":0.0994575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044090697,0.0015718713,0.9595838,0.0007161849,0.00014505899,0.000026903552,0.00011039222,0.00020059706,0.03323606],"genre_scores_gemma":[0.34528932,0.0050916257,0.6124087,0.00069628365,0.0010354767,0.00022697833,0.00055605423,0.0006834962,0.034011997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.0005488935,0.000051304516,0.000116053525,0.0004890234,0.000058953843],"domain_scores_gemma":[0.99680567,0.0025705758,0.00009038753,0.00031184964,0.00016191666,0.000059499725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357327,0.0008339687,0.00083769194,0.0010360556,0.0005691162,0.0014912175,0.0009663086,0.0005098026,0.0074743135],"category_scores_gemma":[0.0059249103,0.00071147876,0.0009731891,0.0022968354,0.0017233544,0.0031796242,0.0022523648,0.0028215111,0.0009426483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037714453,0.000028657818,0.00016771391,0.00016697212,0.000053631218,0.000054032014,0.00009578769,0.06392916,0.0011335268,0.82242125,0.006088744,0.10582279],"study_design_scores_gemma":[0.000005180423,0.000010467058,0.000079354795,0.000029280965,0.000012029669,0.000024655352,0.000012979256,0.15516318,0.00074622396,0.83474445,0.009161305,0.000010914609],"about_ca_topic_score_codex":0.0011740542,"about_ca_topic_score_gemma":0.0017525969,"teacher_disagreement_score":0.0074743135,"about_ca_system_score_codex":0.0009928425,"about_ca_system_score_gemma":0.00070446,"threshold_uncertainty_score":0.02500403},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021476657,0.07079376,0.74442273,0.008787543,0.001332739,0.00015743953,0.0004516452,0.0005591855,0.17134729],"genre_scores_gemma":[0.062456664,0.09152367,0.8085194,0.0017160785,0.0026708494,0.00034763024,0.0010840221,0.00041262864,0.031268973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967722,0.00096575083,0.00024843236,0.00028540695,0.0016119336,0.00011613815],"domain_scores_gemma":[0.99230665,0.0056195427,0.00028417926,0.0006920305,0.00087889965,0.00021871638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003169376,0.0015310344,0.0022476525,0.004657145,0.00074679573,0.0064393585,0.0021311864,0.0011186971,0.013567892],"category_scores_gemma":[0.006916116,0.00090415595,0.0012118507,0.013779389,0.0030271772,0.0073853824,0.0025557738,0.0044296356,0.002484118],"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.000027789212,0.00008549613,0.00031572362,0.0009864816,0.0001180817,0.00009192766,0.00008612314,0.009484128,0.0005392431,0.61910796,0.025836674,0.34332046],"study_design_scores_gemma":[0.0000122656875,0.000028891365,0.00039606608,0.0004390646,0.000045601773,0.00015972693,0.00010412997,0.031701565,0.0005522403,0.8502392,0.116289645,0.000031637228],"about_ca_topic_score_codex":0.0050063683,"about_ca_topic_score_gemma":0.008668496,"teacher_disagreement_score":0.013567892,"about_ca_system_score_codex":0.0020479173,"about_ca_system_score_gemma":0.0043083197,"threshold_uncertainty_score":0.045389116},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037811146,0.0014928374,0.0018324567,0.002593832,0.0077109,0.00015040029,0.0059760236,0.0039487863,0.97591656],"genre_scores_gemma":[0.0010505191,0.0007016259,0.00052530004,0.000793912,0.00079452404,0.000038002236,0.002933961,0.00069289375,0.99246925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931157,0.000047827463,0.000046273988,0.00014694083,0.00038289293,0.00006457099],"domain_scores_gemma":[0.9984091,0.0002174433,0.00007995036,0.00028007533,0.0006702626,0.000343162],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00058038067,0.0011185565,0.0011872737,0.002394479,0.0011431124,0.006230193,0.001530117,0.0021252858,0.94376063],"category_scores_gemma":[0.0028794212,0.000412589,0.0007073541,0.0021842946,0.000406745,0.0032952826,0.0027023223,0.0014747053,0.9154581],"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.00003760577,0.000030321182,0.00010943376,0.00016028098,0.000003777642,0.000048290633,0.000027082366,0.00004626705,0.0004632666,0.0022993835,0.8651709,0.1316033],"study_design_scores_gemma":[0.0000051795505,0.000011220665,0.00016717125,0.00004732464,0.000001550397,0.000049059327,0.000016357046,0.00003456772,0.00010759533,0.0005003891,0.9990558,0.0000037181735],"about_ca_topic_score_codex":0.0009390993,"about_ca_topic_score_gemma":0.0017012343,"teacher_disagreement_score":0.056239367,"about_ca_system_score_codex":0.00076178595,"about_ca_system_score_gemma":0.00089139165,"threshold_uncertainty_score":0.08021855},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021990065,0.00037791248,0.97286904,0.0014933912,0.00019883238,0.00007580931,0.00018515707,0.00021115133,0.022389624],"genre_scores_gemma":[0.200931,0.0015417924,0.76028484,0.0013690743,0.00035255594,0.00060803024,0.0007460788,0.0003233252,0.03384333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983924,0.00055713416,0.00007526506,0.00045716003,0.00037527469,0.00014282268],"domain_scores_gemma":[0.99840397,0.0007152507,0.00011820898,0.00033269209,0.0003121811,0.00011770512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185454,0.00074762315,0.0005245651,0.00046648015,0.0006357781,0.0025880027,0.0015603304,0.0011230011,0.012698497],"category_scores_gemma":[0.004501357,0.00048616846,0.0014014436,0.0010691162,0.0016849707,0.0029690824,0.002432443,0.0038916494,0.0025394873],"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.000031472497,0.000057423207,0.0002262545,0.00015915382,0.000031930453,0.00006740918,0.00012802877,0.041377414,0.000919962,0.8930983,0.011064551,0.052838158],"study_design_scores_gemma":[0.00003980201,0.000053735865,0.00014446703,0.0001165292,0.000024013563,0.000116542535,0.00006799188,0.21866024,0.002744735,0.69690096,0.08110348,0.00002752008],"about_ca_topic_score_codex":0.0013751514,"about_ca_topic_score_gemma":0.0016684892,"teacher_disagreement_score":0.012698497,"about_ca_system_score_codex":0.0017283371,"about_ca_system_score_gemma":0.0017592115,"threshold_uncertainty_score":0.042480707},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018688439,0.0001784203,0.99344146,0.00021191128,0.000024062796,0.00006367478,0.00015778065,0.00045083743,0.0036030295],"genre_scores_gemma":[0.096622646,0.0005954393,0.89854795,0.0002676193,0.000041802694,0.0005321818,0.00061666296,0.0003774933,0.0023982502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984188,0.0006553555,0.00009692716,0.00028928192,0.00041115505,0.00012854203],"domain_scores_gemma":[0.99803394,0.0012640856,0.00015731476,0.0003280263,0.00015360127,0.00006304751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205433,0.0014515056,0.001017125,0.0011108593,0.00056668743,0.002470883,0.002483446,0.0016405665,0.005158152],"category_scores_gemma":[0.005359576,0.0008745698,0.0019787278,0.002169215,0.0016323328,0.0027993054,0.0026518207,0.003344464,0.0008165455],"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.00004270742,0.00007913866,0.00038066306,0.0003003265,0.00006349826,0.0000602521,0.000091380476,0.68251806,0.0012067799,0.24387191,0.004359737,0.067025535],"study_design_scores_gemma":[0.000017127813,0.000014539832,0.00002865391,0.000027970484,0.000008497509,0.000020662352,0.000017700333,0.91540515,0.0007321766,0.078058705,0.005659976,0.000008793625],"about_ca_topic_score_codex":0.005077083,"about_ca_topic_score_gemma":0.0074245795,"teacher_disagreement_score":0.005158152,"about_ca_system_score_codex":0.0017205226,"about_ca_system_score_gemma":0.003121483,"threshold_uncertainty_score":0.017255723},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11352723,0.0049824854,0.83269626,0.0017559561,0.00035708075,0.0005407892,0.0008228046,0.0055053947,0.039811917],"genre_scores_gemma":[0.4144798,0.0014069536,0.5612417,0.0014802294,0.00036415915,0.00071971817,0.0029102727,0.0018244702,0.015572711],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775654,0.0010044342,0.00010193039,0.0005083961,0.0004096149,0.00021909575],"domain_scores_gemma":[0.9947076,0.0036697125,0.00022154309,0.00070591073,0.00051129144,0.00018394069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002492671,0.0019476467,0.0019172226,0.0014353489,0.0009375414,0.0018659942,0.0016444434,0.0019330638,0.011752052],"category_scores_gemma":[0.009708376,0.00071788847,0.0014336728,0.0021869037,0.0014733081,0.0039782682,0.0032088629,0.0029103567,0.0029776345],"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.00048233266,0.0007416387,0.002213837,0.001254973,0.00014068281,0.00024528685,0.00044617537,0.25499654,0.0060903667,0.058839176,0.03369797,0.64085114],"study_design_scores_gemma":[0.000110865716,0.00051789277,0.0008501094,0.00017505314,0.0000788384,0.00024543467,0.00022040393,0.85712975,0.0057211635,0.11735268,0.01755605,0.000041795312],"about_ca_topic_score_codex":0.0019326195,"about_ca_topic_score_gemma":0.0030610964,"teacher_disagreement_score":0.011752052,"about_ca_system_score_codex":0.0010027193,"about_ca_system_score_gemma":0.0012611535,"threshold_uncertainty_score":0.03931451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011693897,0.0010821677,0.9698831,0.0010442015,0.00012051685,0.000321572,0.0011046673,0.0004915261,0.014258328],"genre_scores_gemma":[0.09650376,0.0013917384,0.8953256,0.00029130554,0.00010810217,0.00049348536,0.0015147022,0.00020509532,0.0041662515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885535,0.00054492365,0.00006607786,0.00017432557,0.00024787674,0.00011135661],"domain_scores_gemma":[0.9982576,0.0012660448,0.00011307747,0.00011960493,0.00018061235,0.000063018044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013625778,0.00114008,0.0005160696,0.00093457376,0.0007536914,0.0020627829,0.0015974416,0.0010094994,0.011985771],"category_scores_gemma":[0.0037996557,0.00046191772,0.0010897242,0.003333154,0.0007189363,0.0015715573,0.0011998032,0.0019686448,0.0012397039],"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.00021703877,0.00023529505,0.00047710954,0.0008934726,0.00010477618,0.0003062238,0.00020835066,0.6664034,0.0035455925,0.1285108,0.01589744,0.18320051],"study_design_scores_gemma":[0.0000844396,0.00008163976,0.00025900587,0.00010118489,0.00003072067,0.00016057228,0.00012235003,0.91163784,0.0031271512,0.06124692,0.023125874,0.000022296326],"about_ca_topic_score_codex":0.009152127,"about_ca_topic_score_gemma":0.009846471,"teacher_disagreement_score":0.011985771,"about_ca_system_score_codex":0.0012244985,"about_ca_system_score_gemma":0.002242598,"threshold_uncertainty_score":0.040096402},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260274,0.0007408409,0.21471564,0.0016264124,0.00033410123,0.00048615015,0.0016867114,0.004603376,0.049779326],"genre_scores_gemma":[0.6025237,0.00019903056,0.37837425,0.0002960373,0.00005873757,0.0003470264,0.003709499,0.00092528464,0.013566459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.00027900442,0.000056853343,0.00021085078,0.000138022,0.00009847576],"domain_scores_gemma":[0.9970529,0.0018942502,0.00013952526,0.00041267334,0.00031748155,0.00018309911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012115205,0.0012707065,0.000997255,0.0006110549,0.000662928,0.0011314772,0.0017374107,0.0014225242,0.011210226],"category_scores_gemma":[0.0073145437,0.00040088975,0.0009257531,0.0007957815,0.00080742047,0.0012801784,0.0018468536,0.0012902435,0.0018347638],"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.0007950297,0.00086061633,0.0103196185,0.0011140188,0.00021431569,0.0009476418,0.0013466933,0.49870285,0.008762546,0.047378864,0.046581686,0.38297617],"study_design_scores_gemma":[0.0002943333,0.0003049697,0.001955633,0.00006352559,0.000034587843,0.00020758368,0.0006874551,0.93467206,0.0063790474,0.03578562,0.019574694,0.000040495557],"about_ca_topic_score_codex":0.003034674,"about_ca_topic_score_gemma":0.006392054,"teacher_disagreement_score":0.011210226,"about_ca_system_score_codex":0.0006444179,"about_ca_system_score_gemma":0.0010365122,"threshold_uncertainty_score":0.03750199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068735946,0.007893199,0.47010902,0.0036242877,0.0015257185,0.000110191366,0.0007884035,0.0007829499,0.5082926],"genre_scores_gemma":[0.22105983,0.014498918,0.2832959,0.0019849238,0.002271091,0.0005118397,0.0021125574,0.0010588703,0.4732061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942243,0.00012655804,0.000022238408,0.00011395771,0.0002774093,0.000037387766],"domain_scores_gemma":[0.9996643,0.000110540714,0.000033517652,0.000051099443,0.00011154622,0.000029032848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005127689,0.00107198,0.00055559905,0.0009385764,0.0009234815,0.0025427833,0.00074882817,0.000697046,0.023367077],"category_scores_gemma":[0.0013363855,0.00036654237,0.00050253764,0.0010045212,0.0018772744,0.0026540412,0.00140923,0.0020722442,0.009530746],"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.0000038580815,0.0000045053866,0.000026775593,0.000047150825,0.0000036243598,0.000028519165,0.00019118808,0.0012068793,0.00049557746,0.9627158,0.014518673,0.020757394],"study_design_scores_gemma":[0.00000233915,0.0000119931165,0.000063283995,0.00002804378,0.0000027067078,0.0000889002,0.00010318329,0.0037570072,0.00032975382,0.7800608,0.21554412,0.000007882353],"about_ca_topic_score_codex":0.0011788533,"about_ca_topic_score_gemma":0.0011411188,"teacher_disagreement_score":0.023367077,"about_ca_system_score_codex":0.0009385063,"about_ca_system_score_gemma":0.0006073305,"threshold_uncertainty_score":0.07817066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013552357,0.00043017865,0.99009913,0.00035459155,0.00007966252,0.0001516199,0.00058429746,0.001908635,0.0050367424],"genre_scores_gemma":[0.06888073,0.0016893459,0.91700906,0.00028226365,0.00010937293,0.0010419925,0.0020555446,0.0006638649,0.0082678115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987458,0.00042103775,0.00014870739,0.00023328986,0.0003092841,0.00014178261],"domain_scores_gemma":[0.99891174,0.0004979118,0.00011365413,0.00019496508,0.0001892449,0.00009259344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021837002,0.0015602569,0.0008499115,0.0015608654,0.0014255532,0.0049928427,0.004600178,0.0024269742,0.007088054],"category_scores_gemma":[0.004204733,0.0009868141,0.0033679025,0.0014052418,0.002602226,0.00475897,0.0037754313,0.0032549808,0.0017176741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006970014,0.00004897418,0.0011733973,0.00038621153,0.000095163814,0.00036195162,0.0010454023,0.23371918,0.0013387455,0.7149622,0.007736742,0.039062183],"study_design_scores_gemma":[0.000034009336,0.000043625143,0.00023415449,0.00020729293,0.00007017637,0.00022473556,0.00027854336,0.5798352,0.0013070231,0.24637756,0.17132907,0.000058540016],"about_ca_topic_score_codex":0.026220081,"about_ca_topic_score_gemma":0.027230594,"teacher_disagreement_score":0.026220081,"about_ca_system_score_codex":0.0022426567,"about_ca_system_score_gemma":0.0041407817,"threshold_uncertainty_score":0.05213493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09375216,0.0031700674,0.8637152,0.002154087,0.00027024362,0.00066366943,0.0025526707,0.0005023519,0.033219624],"genre_scores_gemma":[0.71638054,0.0033377656,0.25584346,0.0005219326,0.00017664307,0.0015836244,0.0021902486,0.00029745718,0.019668344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982205,0.00087915425,0.00006893985,0.0002962688,0.00021858556,0.0003165272],"domain_scores_gemma":[0.9948907,0.0041612405,0.0003719785,0.00012197142,0.00025903038,0.00019517835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025527196,0.002943336,0.0018795683,0.001359116,0.0008611472,0.002855703,0.002477476,0.0024571982,0.0064062634],"category_scores_gemma":[0.006713399,0.0011229845,0.0021461996,0.0023606117,0.0014454158,0.0017667557,0.00141893,0.003422652,0.00061080884],"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.0000155855,0.000028686769,0.00012870062,0.00004486555,0.000016618675,0.000029883564,0.0000150599835,0.9923718,0.00007161253,0.00512704,0.0005408534,0.0016092719],"study_design_scores_gemma":[0.000013426567,0.000015820151,0.00007233478,0.00001003449,0.0000075190915,0.000007999162,0.000022986509,0.99575377,0.000057873727,0.0034661524,0.0005673138,0.000004802141],"about_ca_topic_score_codex":0.03259419,"about_ca_topic_score_gemma":0.025575234,"teacher_disagreement_score":0.03259419,"about_ca_system_score_codex":0.0041453145,"about_ca_system_score_gemma":0.0027786766,"threshold_uncertainty_score":0.064808965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002828254,0.0002812174,0.61512,0.0004320385,0.00007982805,0.0004590142,0.008867823,0.3686408,0.0032909834],"genre_scores_gemma":[0.08296871,0.0007209979,0.8408062,0.001046151,0.00019388553,0.0013964773,0.04509963,0.016960518,0.010807432],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968471,0.000792964,0.0005039809,0.0007811566,0.00096748734,0.000107195],"domain_scores_gemma":[0.9923126,0.0044796737,0.00046063864,0.0011307086,0.0014029399,0.0002134224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036724338,0.0026547317,0.0015598595,0.0032520138,0.00093182013,0.0034111107,0.0046742205,0.0019006009,0.035552073],"category_scores_gemma":[0.017857417,0.0015070983,0.001827742,0.0016045215,0.0008960454,0.012168881,0.003600071,0.002499651,0.013632083],"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.0016521898,0.00050676457,0.0049651493,0.0024106856,0.00023053103,0.0005308381,0.0018337088,0.019283056,0.015573765,0.042572234,0.3097587,0.6006824],"study_design_scores_gemma":[0.0004367592,0.0002945632,0.0017561131,0.00033149772,0.00016348228,0.00056574907,0.0005545635,0.54973674,0.042838406,0.094615765,0.30841744,0.00028894367],"about_ca_topic_score_codex":0.005235354,"about_ca_topic_score_gemma":0.0068632127,"teacher_disagreement_score":0.035552073,"about_ca_system_score_codex":0.0015972926,"about_ca_system_score_gemma":0.0030481422,"threshold_uncertainty_score":0.11893356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019401286,0.004707807,0.8822671,0.00864571,0.0005593072,0.0001900002,0.001048676,0.00084162457,0.09979962],"genre_scores_gemma":[0.16953117,0.026396075,0.7166173,0.008965988,0.0028490955,0.0017011154,0.004086695,0.0020158358,0.06783671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616444,0.001715918,0.0002417672,0.00075506297,0.00094736513,0.00017543622],"domain_scores_gemma":[0.994091,0.0039749737,0.0002165865,0.0012182568,0.00039314877,0.00010597372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005003583,0.0023452723,0.0012296536,0.0019073017,0.0010451534,0.0046302634,0.0032346314,0.0022560435,0.022846883],"category_scores_gemma":[0.018875778,0.0010039537,0.00339865,0.0022140436,0.0035527607,0.006499775,0.00526417,0.0055852938,0.0072394125],"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.000010715724,0.000022644208,0.0002884101,0.00033767405,0.000084498904,0.00018518935,0.00038865767,0.019658918,0.00020099967,0.91531605,0.016490275,0.047016025],"study_design_scores_gemma":[0.000003948113,0.0000054435027,0.00005511576,0.00012534406,0.000011381354,0.00006717442,0.000044632485,0.012271097,0.000053519416,0.94740725,0.039947115,0.000007954268],"about_ca_topic_score_codex":0.0054935166,"about_ca_topic_score_gemma":0.0045964373,"teacher_disagreement_score":0.022846883,"about_ca_system_score_codex":0.0026032904,"about_ca_system_score_gemma":0.0022259154,"threshold_uncertainty_score":0.07643044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023217509,0.0006077765,0.9732275,0.0005847037,0.00004747285,0.000067639136,0.0003323343,0.00018515589,0.001729927],"genre_scores_gemma":[0.4000696,0.00054183404,0.59337497,0.00040705918,0.0001316761,0.00039589705,0.0017513133,0.00028441031,0.0030432018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942567,0.0030241641,0.00032938737,0.0012528017,0.0008931487,0.00024379842],"domain_scores_gemma":[0.9889858,0.0070648547,0.0008396714,0.0016326148,0.0009244643,0.0005527267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006469264,0.001420974,0.0016001604,0.0019160095,0.0009073984,0.002797872,0.0034127464,0.0022398513,0.0026370462],"category_scores_gemma":[0.02130479,0.0006032772,0.001805646,0.0025708056,0.0019220865,0.006066058,0.0051527084,0.004190826,0.0007072446],"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.00040133146,0.00038265417,0.006262781,0.00039369852,0.00031326627,0.00014042787,0.00031836674,0.59099156,0.0017864966,0.25818852,0.0067878347,0.13403304],"study_design_scores_gemma":[0.000023878685,0.00017104145,0.00063114444,0.00004086309,0.000018922734,0.000060942228,0.00005922726,0.8756547,0.00057116896,0.120172225,0.0025691537,0.000026755713],"about_ca_topic_score_codex":0.0028333326,"about_ca_topic_score_gemma":0.0025349122,"teacher_disagreement_score":0.006469264,"about_ca_system_score_codex":0.002156566,"about_ca_system_score_gemma":0.002027588,"threshold_uncertainty_score":0.034213126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00218839,0.07114074,0.74374586,0.009203534,0.0013422766,0.00015616177,0.00045406487,0.00055589277,0.17121314],"genre_scores_gemma":[0.06436933,0.08992614,0.80837536,0.0018095092,0.0027382537,0.0003515275,0.0010826952,0.00041647753,0.030930758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667114,0.0010182004,0.00025246225,0.00029590545,0.0016416108,0.000120667704],"domain_scores_gemma":[0.9920201,0.0058465297,0.00029404997,0.0007228808,0.0008920345,0.00022435369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032686917,0.001524559,0.0022492036,0.0046074726,0.00075910613,0.006497174,0.0021631843,0.00113834,0.0134211],"category_scores_gemma":[0.007222144,0.00089651,0.001203388,0.01371125,0.003128435,0.0075156232,0.0025701283,0.0045358385,0.0024253398],"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.000027392314,0.000084106745,0.0003129941,0.00096598273,0.00011665613,0.00008936704,0.000087819244,0.009053977,0.0005169349,0.6364959,0.0253271,0.32692173],"study_design_scores_gemma":[0.0000118799935,0.000027724842,0.00038313027,0.00041808267,0.00004443679,0.00015060655,0.000103702834,0.029752817,0.0005259683,0.85717094,0.111380376,0.00003046579],"about_ca_topic_score_codex":0.00505979,"about_ca_topic_score_gemma":0.008854508,"teacher_disagreement_score":0.0134211,"about_ca_system_score_codex":0.0020983985,"about_ca_system_score_gemma":0.0044334014,"threshold_uncertainty_score":0.044898033},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00218839,0.07114074,0.74374586,0.009203534,0.0013422766,0.00015616177,0.00045406487,0.00055589277,0.17121314],"genre_scores_gemma":[0.06436933,0.08992614,0.80837536,0.0018095092,0.0027382537,0.0003515275,0.0010826952,0.00041647753,0.030930758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667114,0.0010182004,0.00025246225,0.00029590545,0.0016416108,0.000120667704],"domain_scores_gemma":[0.9920201,0.0058465297,0.00029404997,0.0007228808,0.0008920345,0.00022435369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032686917,0.001524559,0.0022492036,0.0046074726,0.00075910613,0.006497174,0.0021631843,0.00113834,0.0134211],"category_scores_gemma":[0.007222144,0.00089651,0.001203388,0.01371125,0.003128435,0.0075156232,0.0025701283,0.0045358385,0.0024253398],"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.000027392314,0.000084106745,0.0003129941,0.00096598273,0.00011665613,0.00008936704,0.000087819244,0.009053977,0.0005169349,0.6364959,0.0253271,0.32692173],"study_design_scores_gemma":[0.0000118799935,0.000027724842,0.00038313027,0.00041808267,0.00004443679,0.00015060655,0.000103702834,0.029752817,0.0005259683,0.85717094,0.111380376,0.00003046579],"about_ca_topic_score_codex":0.00505979,"about_ca_topic_score_gemma":0.008854508,"teacher_disagreement_score":0.0134211,"about_ca_system_score_codex":0.0020983985,"about_ca_system_score_gemma":0.0044334014,"threshold_uncertainty_score":0.044898033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007187863,0.00034917,0.99477684,0.00023617933,0.000054437674,0.00005696685,0.00015454419,0.000254682,0.0033983646],"genre_scores_gemma":[0.027353292,0.0010857123,0.965953,0.00025529342,0.00013058874,0.00030744882,0.0008949076,0.00029487204,0.003724897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789774,0.0007636432,0.00028531178,0.00037131767,0.00056026306,0.00012166431],"domain_scores_gemma":[0.9978315,0.00067423214,0.00014536607,0.00078283454,0.00041058552,0.00015538775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023666,0.0014331446,0.0014448239,0.0019241303,0.0007766134,0.004556371,0.0040624402,0.0018330056,0.007045478],"category_scores_gemma":[0.006491774,0.0008816238,0.0028771919,0.005083738,0.0023786747,0.006008819,0.0038773224,0.0059799845,0.002657564],"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.000022602573,0.000049387156,0.00023920099,0.0003131099,0.000041607593,0.00008733265,0.00016450333,0.045305274,0.0012229368,0.85400945,0.0073754075,0.09116922],"study_design_scores_gemma":[0.000011928126,0.000027170316,0.00012655565,0.00011770526,0.00003037996,0.00012177703,0.00006338034,0.2882266,0.0005543979,0.6769129,0.033789266,0.000017940542],"about_ca_topic_score_codex":0.0023444458,"about_ca_topic_score_gemma":0.004089753,"teacher_disagreement_score":0.007045478,"about_ca_system_score_codex":0.0016842545,"about_ca_system_score_gemma":0.0014721033,"threshold_uncertainty_score":0.023569465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30873138,0.0041512703,0.6464657,0.0019060291,0.0003368229,0.0012581561,0.017452944,0.007885168,0.0118125575],"genre_scores_gemma":[0.33738038,0.000730857,0.6469394,0.00025412557,0.00007624807,0.00059188664,0.01236458,0.00034382252,0.0013185696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855112,0.0050121197,0.001986265,0.0017556364,0.0052985405,0.00043624753],"domain_scores_gemma":[0.9328877,0.054050017,0.0037712199,0.0030400525,0.0054727313,0.00077838445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0117913755,0.0018412434,0.0019150613,0.007168006,0.00078954845,0.0029009504,0.0030050857,0.0017166326,0.0028321794],"category_scores_gemma":[0.04804979,0.00034635927,0.0019312074,0.008565836,0.00095797237,0.0024985217,0.0015231328,0.001648935,0.00048491152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016496192,0.0010586604,0.03942298,0.0032564332,0.0017147845,0.00061001343,0.00038596455,0.38097897,0.008850374,0.012003604,0.02164283,0.5284257],"study_design_scores_gemma":[0.00012122732,0.00045467122,0.0072564543,0.00014112945,0.00012780075,0.00044264484,0.00030784405,0.9668415,0.010579582,0.008094569,0.0055628037,0.000069769],"about_ca_topic_score_codex":0.010125871,"about_ca_topic_score_gemma":0.011719627,"teacher_disagreement_score":0.0117913755,"about_ca_system_score_codex":0.0013946275,"about_ca_system_score_gemma":0.0032316456,"threshold_uncertainty_score":0.06235951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084272595,0.000084461746,0.90785164,0.00021445614,0.00005192255,0.00030072697,0.0027793476,0.07531187,0.0049783583],"genre_scores_gemma":[0.14635998,0.00024758262,0.8281506,0.00044554888,0.00004510462,0.0010983502,0.008243036,0.0037379747,0.01167189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934477,0.0001559766,0.000062534884,0.00018382302,0.00021805658,0.000034889985],"domain_scores_gemma":[0.997341,0.0016395118,0.000093110735,0.0003955808,0.0003596491,0.00017114238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011690703,0.0007624733,0.0007302761,0.0014196525,0.00061523693,0.0017158116,0.001957586,0.0011161966,0.037236523],"category_scores_gemma":[0.0064454423,0.0006163462,0.00085669494,0.0012409964,0.00035684695,0.0026403705,0.002355234,0.0015241505,0.0067431917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012850903,0.0010946157,0.0044180485,0.0008422084,0.00033688755,0.0008183026,0.0004972694,0.11152733,0.0180001,0.031472113,0.07224213,0.75746596],"study_design_scores_gemma":[0.00014794142,0.00005299004,0.00052841654,0.000040621664,0.00003757567,0.000117525095,0.00007377011,0.93673193,0.0078519555,0.028050205,0.0263261,0.000040845538],"about_ca_topic_score_codex":0.0056077386,"about_ca_topic_score_gemma":0.013663023,"teacher_disagreement_score":0.037236523,"about_ca_system_score_codex":0.0008606493,"about_ca_system_score_gemma":0.0013632586,"threshold_uncertainty_score":0.12456852},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007127996,0.012292622,0.3293682,0.016638976,0.0013334312,0.00003923033,0.0004969336,0.00058540463,0.63211715],"genre_scores_gemma":[0.60433704,0.01827739,0.19976519,0.005389852,0.004816912,0.00027461373,0.0012447897,0.00076604326,0.16512819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992937,0.00022679172,0.0000331794,0.00009585836,0.00028492752,0.00006544751],"domain_scores_gemma":[0.9992398,0.00042066065,0.000040738967,0.00011489721,0.00012752149,0.000056314533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084311375,0.0004480469,0.00076454255,0.0016813193,0.0016290792,0.0055729365,0.0014345912,0.001176947,0.009965771],"category_scores_gemma":[0.0016313741,0.00038027245,0.0008540518,0.0020753103,0.007108073,0.008065935,0.0019744008,0.005176839,0.0023084418],"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.0000010533205,9.4489303e-7,0.0000075825847,0.000009171034,6.4914485e-7,0.0000036523788,0.000026299458,0.00008364649,0.00002325419,0.9971148,0.000928211,0.0018007377],"study_design_scores_gemma":[0.0000010642226,0.0000016427917,0.0000142344425,0.0000062993986,7.6302405e-7,0.00001129426,0.000021095566,0.00038075258,0.00003166179,0.9861384,0.013391082,0.0000016988413],"about_ca_topic_score_codex":0.0018457815,"about_ca_topic_score_gemma":0.0018785604,"teacher_disagreement_score":0.009965771,"about_ca_system_score_codex":0.0028613461,"about_ca_system_score_gemma":0.0012337585,"threshold_uncertainty_score":0.033338845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084544525,0.00018601613,0.89552504,0.00022913085,0.00004124023,0.00015835266,0.00045455003,0.00035946106,0.018501723],"genre_scores_gemma":[0.5006968,0.0003459817,0.4873006,0.00017159144,0.00004540723,0.00019559574,0.0008004667,0.00020089233,0.010242607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999435,0.00015549563,0.000022299299,0.000117663636,0.00013892369,0.00013058442],"domain_scores_gemma":[0.9989027,0.00053662254,0.00012743704,0.00017829861,0.00016113684,0.00009386594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058072683,0.000501967,0.0004417963,0.00066931255,0.0006709117,0.00076799357,0.00089886686,0.00048472523,0.006769754],"category_scores_gemma":[0.0022508437,0.0003674622,0.000595857,0.0010419943,0.00086801243,0.0014290403,0.00090843905,0.0014155592,0.0007783882],"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.00028495287,0.00014960053,0.0013119582,0.00039549396,0.000034589106,0.00028998742,0.00031396962,0.49305934,0.025884675,0.33845422,0.009913125,0.1299081],"study_design_scores_gemma":[0.000038041777,0.00012954234,0.0006241038,0.000034225017,0.000010041067,0.00014193574,0.00013030211,0.81715214,0.008849076,0.16328283,0.009583355,0.000024404202],"about_ca_topic_score_codex":0.0034394094,"about_ca_topic_score_gemma":0.0063680164,"teacher_disagreement_score":0.006769754,"about_ca_system_score_codex":0.000766414,"about_ca_system_score_gemma":0.0007037679,"threshold_uncertainty_score":0.022647083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06120537,0.001549668,0.9192888,0.000825388,0.00016101998,0.00026619862,0.00041428948,0.0012444986,0.015044734],"genre_scores_gemma":[0.41118652,0.00067735545,0.57035905,0.00067713624,0.00015575498,0.0006047691,0.0012430104,0.00095271016,0.014143669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827325,0.00067933404,0.000091339745,0.00041478092,0.00036408383,0.00017719729],"domain_scores_gemma":[0.99618655,0.0026289541,0.0002396537,0.00030393255,0.0004477961,0.00019305995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021098875,0.0015890298,0.0020495525,0.0010601222,0.0009507345,0.0018329815,0.0015550354,0.001871726,0.00974425],"category_scores_gemma":[0.008157174,0.0008349391,0.0014545885,0.0017286128,0.0016655378,0.002757515,0.0023869176,0.0022441105,0.0017511976],"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.00022466363,0.00025622867,0.00094341976,0.00044164935,0.00009986173,0.00025739838,0.0002987578,0.77075547,0.0023014334,0.08914104,0.010557752,0.124722324],"study_design_scores_gemma":[0.00006284846,0.00015376855,0.00016801758,0.00005153534,0.000019764626,0.000077293575,0.00007153582,0.9021236,0.0013715458,0.090477765,0.0053990376,0.00002326072],"about_ca_topic_score_codex":0.003962159,"about_ca_topic_score_gemma":0.0046629794,"teacher_disagreement_score":0.00974425,"about_ca_system_score_codex":0.0013171874,"about_ca_system_score_gemma":0.0019055371,"threshold_uncertainty_score":0.03259778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022248138,0.0013913697,0.6262428,0.0017887979,0.00040865995,0.00008247819,0.00034102672,0.00073203497,0.34676477],"genre_scores_gemma":[0.60191435,0.0031159357,0.18761916,0.0006309701,0.000681803,0.00020032605,0.00078107615,0.00093151344,0.20412484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945444,0.00012359538,0.000025221381,0.00009252366,0.00023936821,0.00006487961],"domain_scores_gemma":[0.9996074,0.00017738098,0.00002779968,0.00008438965,0.00007949357,0.00002359038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005404395,0.00073351304,0.000692288,0.00090681884,0.0007678534,0.0026189724,0.0007446802,0.00048095259,0.020163074],"category_scores_gemma":[0.0014090261,0.0004726068,0.00084800395,0.0013176993,0.001953943,0.003704186,0.0011840758,0.0024628243,0.004016345],"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.000011503286,0.000009010813,0.000011480074,0.000023315413,0.0000034501268,0.000012092809,0.00004345789,0.001415797,0.00048403905,0.9843381,0.0021993364,0.011448309],"study_design_scores_gemma":[0.000007177093,0.000008299603,0.000022942639,0.000008700282,0.0000044713775,0.000026133312,0.000022409547,0.0060660136,0.00064255553,0.9809481,0.012237655,0.000005567378],"about_ca_topic_score_codex":0.0011132444,"about_ca_topic_score_gemma":0.0013924245,"teacher_disagreement_score":0.020163074,"about_ca_system_score_codex":0.0013561182,"about_ca_system_score_gemma":0.000556455,"threshold_uncertainty_score":0.06745225},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030650299,0.012885123,0.5846414,0.004407401,0.0013996395,0.0001307501,0.00080327364,0.0022676736,0.39039966],"genre_scores_gemma":[0.083013155,0.015877908,0.5116842,0.003629955,0.000970672,0.00053492386,0.0020135762,0.002481098,0.37979457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944097,0.00014229106,0.000032936816,0.00011512163,0.00021755078,0.000051140287],"domain_scores_gemma":[0.9995285,0.0002470617,0.000020191284,0.00008215186,0.000096584794,0.000025497853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066698453,0.00068465795,0.00051932986,0.0009150229,0.00087294506,0.0027685552,0.00091994234,0.0008492816,0.035208788],"category_scores_gemma":[0.0028631575,0.00044738132,0.00087939674,0.0015716307,0.0016741977,0.0052186158,0.0012926069,0.0027814356,0.015711177],"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.000009353517,0.000010001754,0.00008977351,0.00014436815,0.000008310278,0.000037161062,0.00034653762,0.0015976365,0.00039510897,0.8367127,0.06276509,0.09788398],"study_design_scores_gemma":[0.000006788112,0.000011932484,0.00013241725,0.00015826535,0.0000057209786,0.000119514756,0.000066876695,0.0038363445,0.00040076723,0.606789,0.38846064,0.000011788812],"about_ca_topic_score_codex":0.0019924243,"about_ca_topic_score_gemma":0.0027781853,"teacher_disagreement_score":0.035208788,"about_ca_system_score_codex":0.0014385722,"about_ca_system_score_gemma":0.0010583531,"threshold_uncertainty_score":0.117785156},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012950676,0.0043886444,0.76463854,0.0026510588,0.0019246478,0.00014655339,0.00042702557,0.002941817,0.22158657],"genre_scores_gemma":[0.04054728,0.0070920396,0.7127515,0.0019958757,0.0007277749,0.00041237962,0.0011959265,0.0031845435,0.23209266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985781,0.00026681644,0.00008014247,0.0002326404,0.0007474735,0.000094949704],"domain_scores_gemma":[0.99888295,0.0004042997,0.000044002405,0.00035741154,0.0002601087,0.00005120184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541817,0.0014632855,0.00088239356,0.0009820814,0.0008761241,0.003768837,0.0021095492,0.0013680357,0.07212059],"category_scores_gemma":[0.0071501983,0.00074425695,0.0012969917,0.0012815142,0.0016220965,0.0054519293,0.0028978263,0.0038519532,0.034230284],"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.000039757,0.000035407546,0.00014116199,0.0004473268,0.00002703098,0.00012055597,0.00030645408,0.009753689,0.001560224,0.6451353,0.11031569,0.23211737],"study_design_scores_gemma":[0.000015259717,0.000025600295,0.00011031882,0.00030231898,0.000016716582,0.00026692383,0.0000924755,0.018081846,0.0014630551,0.33685523,0.6427414,0.000028848206],"about_ca_topic_score_codex":0.0011143076,"about_ca_topic_score_gemma":0.0017745619,"teacher_disagreement_score":0.07212059,"about_ca_system_score_codex":0.0013556264,"about_ca_system_score_gemma":0.0011388259,"threshold_uncertainty_score":0.24126744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18103398,0.0031457348,0.6418429,0.010448261,0.00047553523,0.00030023654,0.0039643566,0.0038857812,0.15490326],"genre_scores_gemma":[0.80154073,0.0019486365,0.14180067,0.0015169181,0.0005487423,0.0004418512,0.0032358742,0.0016195218,0.04734705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927301,0.0013004234,0.00051274436,0.0011877642,0.003088407,0.0011805334],"domain_scores_gemma":[0.96733487,0.024565032,0.0011116919,0.0052543394,0.0012742341,0.00045985414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035821213,0.0010883259,0.0018636155,0.001628152,0.0027178635,0.007864773,0.0048876964,0.0025241624,0.024753314],"category_scores_gemma":[0.025853347,0.0015265784,0.002753894,0.0036818325,0.005030943,0.026049783,0.0066239215,0.005475389,0.0028955995],"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.0002872341,0.00009347127,0.0012393169,0.0004258625,0.00006265814,0.0002035154,0.00054302876,0.039266344,0.0013311344,0.8803538,0.012131369,0.06406229],"study_design_scores_gemma":[0.00002611618,0.00000963505,0.00015167498,0.000026970598,0.000028240318,0.00011553777,0.00006500053,0.034203123,0.0008195505,0.9595636,0.004968716,0.000021847914],"about_ca_topic_score_codex":0.0060090646,"about_ca_topic_score_gemma":0.005934132,"teacher_disagreement_score":0.024753314,"about_ca_system_score_codex":0.0049301772,"about_ca_system_score_gemma":0.0028313894,"threshold_uncertainty_score":0.08280802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93436027,0.00012433737,0.043091357,0.00075705437,0.0000630482,0.000013433341,0.000064892054,0.000058031896,0.021467539],"genre_scores_gemma":[0.99089795,0.00007584561,0.0043326225,0.000047348323,0.000028216702,0.0000073188453,0.000064819644,0.000040973704,0.0045048455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997625,0.000038148366,0.000010014259,0.00004339869,0.000081148195,0.000064754146],"domain_scores_gemma":[0.9996823,0.00007998562,0.00006460529,0.00005479415,0.00003667013,0.00008165099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004408909,0.0004171233,0.0003513028,0.00064478896,0.00075990084,0.0016564472,0.0005608131,0.0008351014,0.0065941527],"category_scores_gemma":[0.0021366216,0.00023750708,0.0002691818,0.00042210027,0.0016565794,0.0042201383,0.0020272639,0.0014021571,0.00037641084],"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.00012545723,0.00008105861,0.001636713,0.00005831749,0.0000147875,0.0005557182,0.00046477848,0.020930113,0.0070202723,0.9589071,0.0009665859,0.009239113],"study_design_scores_gemma":[0.00003369591,0.00007961895,0.0024663685,0.000034875848,0.0000136737,0.00028562694,0.0006209228,0.19332893,0.005626667,0.79453915,0.002938658,0.000031765696],"about_ca_topic_score_codex":0.00064493524,"about_ca_topic_score_gemma":0.00056189124,"teacher_disagreement_score":0.0065941527,"about_ca_system_score_codex":0.0008322789,"about_ca_system_score_gemma":0.00031558762,"threshold_uncertainty_score":0.02205962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09651108,0.00060886884,0.8987963,0.00047360564,0.000034953246,0.00011697764,0.0005537969,0.00045702868,0.0024473707],"genre_scores_gemma":[0.7307159,0.0006445055,0.26343217,0.00031741237,0.00012807972,0.00016142568,0.0019935055,0.00013115881,0.0024758724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984646,0.0004417927,0.000082593455,0.00044503296,0.00044714325,0.0001188033],"domain_scores_gemma":[0.9950818,0.002613518,0.0010851921,0.00043874545,0.00050481234,0.000275893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013463226,0.0011661851,0.0010400425,0.0027186743,0.0013055322,0.0014076983,0.0016644234,0.0014781788,0.0012728017],"category_scores_gemma":[0.009047104,0.000643951,0.0010701219,0.002106952,0.0011799431,0.003413264,0.0017300089,0.0011860298,0.00034744517],"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.00042935106,0.00017463313,0.013545353,0.00045503385,0.00023071078,0.001325648,0.0007183108,0.69234973,0.008503641,0.06972886,0.0067222845,0.20581654],"study_design_scores_gemma":[0.000016704282,0.000026607308,0.0009457002,0.000018373237,0.000023040304,0.00021599873,0.00012532537,0.91217744,0.0012214729,0.08340582,0.0018073068,0.000016197728],"about_ca_topic_score_codex":0.0039797593,"about_ca_topic_score_gemma":0.004774017,"teacher_disagreement_score":0.0039797593,"about_ca_system_score_codex":0.0009741019,"about_ca_system_score_gemma":0.0007660902,"threshold_uncertainty_score":0.007913232},"labels":[],"label_agreement":null},{"id":"W4404651431","doi":"10.1007/s10601-024-09377-4","title":"Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver","year":2024,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Solver; Heuristic; Selection (genetic algorithm); Constraint (computer-aided design); Computer science; Problem solver; Mathematical optimization; Value (mathematics); Constraint satisfaction problem; Constraint programming; Artificial intelligence; Mathematics; Machine learning; Stochastic programming","score_opus":0.014978644787270816,"score_gpt":0.2519402801471005,"score_spread":0.2369616353598297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404651431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404931,0.00017044978,0.9541784,0.00035577727,0.000053127667,0.000119957396,0.000060642982,0.00074676384,0.0038217502],"genre_scores_gemma":[0.57522047,0.0001230743,0.42169678,0.0003322483,0.000044903514,0.00026596562,0.00016786875,0.00024752005,0.0019011677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878424,0.00052814663,0.00005596887,0.00025005525,0.00019043748,0.00019127656],"domain_scores_gemma":[0.9956845,0.0031576643,0.00029666987,0.0003089118,0.0003810723,0.00017121782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025261694,0.0011241013,0.0010392581,0.00063384086,0.00042126997,0.0012737177,0.0017053416,0.0017934119,0.004487143],"category_scores_gemma":[0.008701343,0.00058175996,0.0007322193,0.00072644633,0.0011769683,0.0013125183,0.0016260032,0.002236693,0.0005291687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745962,0.00012330618,0.00076204527,0.00009030898,0.000027873564,0.00006355315,0.000044348213,0.933463,0.0017259547,0.01502672,0.0014228973,0.047162507],"study_design_scores_gemma":[0.000009191674,0.000013677345,0.00002752648,0.000005793004,0.000002866449,0.0000049605037,0.0000039441456,0.99692374,0.00038052496,0.0024478566,0.00017786276,0.0000020304678],"about_ca_topic_score_codex":0.003813445,"about_ca_topic_score_gemma":0.004349635,"teacher_disagreement_score":0.004487143,"about_ca_system_score_codex":0.0012337093,"about_ca_system_score_gemma":0.0020079748,"threshold_uncertainty_score":0.015011013},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020913218,0.00040305863,0.0018858903,0.0003302645,0.00015660065,0.0000448956,0.0007530787,0.0011138517,0.99510324],"genre_scores_gemma":[0.0006197844,0.00027981386,0.00069547474,0.00011229071,0.000032997294,0.00003379707,0.000513204,0.00033236676,0.9973801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995353,0.000031463525,0.00003080017,0.00015330041,0.00016413906,0.00008500551],"domain_scores_gemma":[0.99827826,0.0005563797,0.00011278267,0.00028691313,0.00032915274,0.0004364622],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009342991,0.002032071,0.0012584325,0.0018950233,0.0011730286,0.004787632,0.0027851479,0.0039290832,0.9778731],"category_scores_gemma":[0.001617124,0.0007944934,0.0008945244,0.0025211207,0.0011413357,0.0045853676,0.0027805164,0.0021095644,0.98782337],"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.0001259893,0.000113597926,0.00037055262,0.0004051013,0.000019199491,0.000111947615,0.00008698881,0.00045562274,0.0021870048,0.008436336,0.36097887,0.6267088],"study_design_scores_gemma":[0.0000150474925,0.000035616682,0.00039997185,0.00020865818,0.0000080131995,0.0001595255,0.00006866487,0.00018106576,0.00033742993,0.0013549901,0.99721956,0.000011399354],"about_ca_topic_score_codex":0.0032003575,"about_ca_topic_score_gemma":0.0029292903,"teacher_disagreement_score":0.022126913,"about_ca_system_score_codex":0.00093599205,"about_ca_system_score_gemma":0.00083647325,"threshold_uncertainty_score":0.031561255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001390566,0.0018581549,0.96885675,0.00064256485,0.00017441664,0.000048167873,0.00017470247,0.0005564967,0.026298152],"genre_scores_gemma":[0.075298816,0.006410341,0.87993085,0.0010038133,0.00049040833,0.00040079016,0.001170303,0.0014218572,0.033872757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987406,0.0005300025,0.00006454893,0.0002201574,0.00035094595,0.00009369806],"domain_scores_gemma":[0.9971469,0.002117254,0.00012092639,0.00034269024,0.00022459884,0.000047758007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018550439,0.0018529545,0.0012741503,0.0015057321,0.0008831148,0.0024318958,0.0030190933,0.0014769039,0.021028398],"category_scores_gemma":[0.007401115,0.0019113855,0.0015831385,0.004018308,0.0023920084,0.0063740774,0.0037623902,0.0061198277,0.0030317411],"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.000074595024,0.00007013705,0.00008965618,0.0007174817,0.00007312104,0.00007795677,0.00028936626,0.13164955,0.00082012627,0.57181454,0.030826006,0.26349744],"study_design_scores_gemma":[0.000024338655,0.00001819956,0.00003907125,0.00014199584,0.000028158043,0.000034468158,0.000057019966,0.15578412,0.0007370137,0.82063514,0.022484558,0.00001598601],"about_ca_topic_score_codex":0.0036327643,"about_ca_topic_score_gemma":0.004871322,"teacher_disagreement_score":0.021028398,"about_ca_system_score_codex":0.0012448652,"about_ca_system_score_gemma":0.0010018527,"threshold_uncertainty_score":0.07034701},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014345606,0.00053611415,0.9768926,0.00056984375,0.00010848435,0.0001876509,0.00028378767,0.0017808771,0.00529497],"genre_scores_gemma":[0.07194296,0.00033901134,0.92413306,0.00026703847,0.000029233646,0.00015799025,0.0005881952,0.00048939127,0.0020530997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998078,0.00076957187,0.00013584203,0.00037830646,0.00044829736,0.00018991556],"domain_scores_gemma":[0.99682236,0.0019845958,0.00023225199,0.0004876791,0.00038263807,0.00009054926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016904845,0.0017813372,0.0015893113,0.001527248,0.0013107775,0.0025592598,0.0025886921,0.001640904,0.012805869],"category_scores_gemma":[0.0094649205,0.001035837,0.0022472537,0.002249255,0.0012494172,0.0048060766,0.0030227595,0.003672907,0.002565878],"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.00032634937,0.00043100966,0.003465862,0.0014655299,0.0004055554,0.00047261504,0.0006254401,0.33387637,0.011848093,0.1233152,0.020887377,0.5028806],"study_design_scores_gemma":[0.00014880698,0.00019039221,0.00036699476,0.00015565805,0.00009169735,0.00027787578,0.00038018313,0.8723728,0.0104188565,0.0898991,0.02562857,0.00006906381],"about_ca_topic_score_codex":0.0048270477,"about_ca_topic_score_gemma":0.009749864,"teacher_disagreement_score":0.012805869,"about_ca_system_score_codex":0.00073379,"about_ca_system_score_gemma":0.0027271723,"threshold_uncertainty_score":0.042839944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066003084,0.012575129,0.7297882,0.009016837,0.0010681476,0.000113191316,0.0011758979,0.00047011,0.17978947],"genre_scores_gemma":[0.73679924,0.011046719,0.20538573,0.0024346241,0.0037336205,0.0003505153,0.0018485063,0.00033438572,0.03806661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970023,0.0010174165,0.00025201755,0.0005680454,0.0009400881,0.0002200991],"domain_scores_gemma":[0.99463993,0.0030940461,0.0003315997,0.0007001306,0.0008406801,0.00039359662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037302352,0.00092587696,0.0018867996,0.002807351,0.0025107672,0.0054416466,0.0020948998,0.0012194011,0.0072552287],"category_scores_gemma":[0.006596287,0.0008927814,0.0017956969,0.0038817893,0.0076175756,0.012447789,0.0033472676,0.004772533,0.001184628],"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.0000065703175,0.0000068092318,0.00003571142,0.0000149953385,0.000005195567,0.000013374757,0.00006406147,0.00039765198,0.00006983366,0.9971306,0.00049795414,0.0017573277],"study_design_scores_gemma":[0.000003965032,0.00000396366,0.00002451071,0.000005071257,0.0000026288817,0.000015048426,0.000015295087,0.0011432724,0.000033024247,0.996747,0.0020022485,0.000003966708],"about_ca_topic_score_codex":0.0022654322,"about_ca_topic_score_gemma":0.0016920215,"teacher_disagreement_score":0.0072552287,"about_ca_system_score_codex":0.0020582117,"about_ca_system_score_gemma":0.0013393761,"threshold_uncertainty_score":0.02427113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10979219,0.04450401,0.4796785,0.044928204,0.0035712328,0.00011264368,0.0012864803,0.00050769915,0.315619],"genre_scores_gemma":[0.8900424,0.014469259,0.0562481,0.0033701442,0.0044204965,0.00026284455,0.0007748319,0.00015117088,0.030260751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961152,0.0012995407,0.00024951407,0.0006021676,0.0014234432,0.00031019642],"domain_scores_gemma":[0.9872219,0.009595219,0.000622809,0.0011695022,0.0008694642,0.000521097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044705463,0.0006937714,0.0016059619,0.003987814,0.00240521,0.0069086165,0.0018447118,0.0019796055,0.010371484],"category_scores_gemma":[0.0074352208,0.00050482,0.0022070305,0.004008543,0.01038161,0.015541569,0.004315061,0.006535264,0.0008361437],"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.0000048648117,0.0000066461753,0.000091191774,0.000038715836,0.0000059761555,0.000026474747,0.00009983816,0.00037180103,0.0000628054,0.9969223,0.00087322935,0.0014960537],"study_design_scores_gemma":[0.0000034853854,0.000004958604,0.0000685055,0.000022909886,0.0000036001547,0.00004506621,0.000053969452,0.001700871,0.00006287071,0.9908647,0.0071653477,0.0000036200927],"about_ca_topic_score_codex":0.000931561,"about_ca_topic_score_gemma":0.00090706,"teacher_disagreement_score":0.010371484,"about_ca_system_score_codex":0.005337785,"about_ca_system_score_gemma":0.0011327585,"threshold_uncertainty_score":0.038728535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19555348,0.0012505183,0.756335,0.0053342897,0.00035713174,0.00055134186,0.0009047254,0.0033213247,0.036392156],"genre_scores_gemma":[0.7922806,0.00067929394,0.1918437,0.0014362069,0.00023219203,0.00032460582,0.0010553157,0.00074192975,0.011406092],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622405,0.00081650197,0.000240609,0.0009837621,0.0010513549,0.0006837169],"domain_scores_gemma":[0.98132515,0.010342981,0.0010230079,0.0048986482,0.0016325698,0.0007775437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020903233,0.001337987,0.0017661586,0.0006411096,0.0022620654,0.0027421906,0.0022003413,0.001704535,0.011167932],"category_scores_gemma":[0.021709692,0.0008413442,0.0017197782,0.0009866257,0.0022419153,0.007731085,0.005539497,0.0032363061,0.0022031886],"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.0018656319,0.0007022045,0.0074537545,0.0014877717,0.0004463368,0.0010909593,0.0012074943,0.18245547,0.029141849,0.26381907,0.056362547,0.4539669],"study_design_scores_gemma":[0.00029763955,0.00022169671,0.00094001036,0.00012910643,0.0001778294,0.0007571569,0.0006184612,0.34896508,0.01761106,0.60944873,0.020770151,0.00006307537],"about_ca_topic_score_codex":0.0014801966,"about_ca_topic_score_gemma":0.0020857202,"teacher_disagreement_score":0.011167932,"about_ca_system_score_codex":0.0010282388,"about_ca_system_score_gemma":0.0025198678,"threshold_uncertainty_score":0.03736049},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005493869,0.00025549874,0.9916306,0.00019461209,0.000035189205,0.0000397892,0.00003966319,0.0005251636,0.0017855281],"genre_scores_gemma":[0.33585322,0.00042657825,0.65812415,0.0006199359,0.00016602517,0.00038861792,0.000518147,0.0006051413,0.0032982063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873,0.00049138675,0.00005235353,0.00022350728,0.00036858628,0.00013408935],"domain_scores_gemma":[0.99564666,0.0025039203,0.00046908073,0.0005194234,0.000661915,0.00019900559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025022654,0.0015309149,0.0015505864,0.0009019846,0.0004913765,0.0014503864,0.0021613047,0.0017604195,0.0026773901],"category_scores_gemma":[0.008517969,0.0009118527,0.0010642057,0.0010156633,0.0015107386,0.0022056135,0.002456378,0.003968706,0.00087441015],"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.00006953102,0.000117517535,0.00078841095,0.00011141828,0.000050377348,0.00006170355,0.000084520725,0.89225477,0.001115753,0.021483745,0.0041112853,0.079750955],"study_design_scores_gemma":[0.0000048793363,0.0000066399866,0.000018928682,0.000006694503,0.0000017761503,0.0000035971316,0.000002764811,0.9956474,0.00015680812,0.0039272006,0.00022120154,0.0000020965322],"about_ca_topic_score_codex":0.003460007,"about_ca_topic_score_gemma":0.004152602,"teacher_disagreement_score":0.003460007,"about_ca_system_score_codex":0.0013514066,"about_ca_system_score_gemma":0.0021905683,"threshold_uncertainty_score":0.013233364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004094101,0.00006710605,0.9882229,0.00010921866,0.000033948425,0.000037727616,0.000068227724,0.00095266214,0.0064140647],"genre_scores_gemma":[0.193267,0.00022760197,0.7962792,0.0001541969,0.000037443522,0.00019193519,0.0002998793,0.0007399115,0.008802803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.00014617186,0.00003175474,0.00009569807,0.00027934887,0.00003688571],"domain_scores_gemma":[0.9992829,0.0003916684,0.000057961704,0.00013483326,0.00009955796,0.000032974447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010090013,0.00072611205,0.00043788028,0.0005139969,0.00057132955,0.0014262878,0.0018192581,0.0009280691,0.010451011],"category_scores_gemma":[0.0035505956,0.00044460708,0.0006600762,0.00063210796,0.001323802,0.001599427,0.0019836249,0.0013000513,0.001708043],"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.000093823495,0.0000603748,0.00054685056,0.00021587606,0.000056960853,0.00032769423,0.00024946133,0.61000097,0.0113760615,0.21172379,0.0043588537,0.16098922],"study_design_scores_gemma":[0.000012961829,0.000018124376,0.000041356947,0.000018441177,0.000007674183,0.00006423603,0.000019557765,0.93504435,0.0058480403,0.0497548,0.009159004,0.000011562336],"about_ca_topic_score_codex":0.0027522747,"about_ca_topic_score_gemma":0.0057397983,"teacher_disagreement_score":0.010451011,"about_ca_system_score_codex":0.00057534856,"about_ca_system_score_gemma":0.0010840043,"threshold_uncertainty_score":0.034962118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090007123,0.00041555436,0.95507175,0.00047527207,0.000114258924,0.000089351626,0.00017834271,0.00047577155,0.0422797],"genre_scores_gemma":[0.0660438,0.0014203577,0.89232934,0.0005724405,0.00018842281,0.00052107184,0.0009200513,0.00081943825,0.037185106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982344,0.0004761369,0.000093713374,0.00024318577,0.00083057926,0.00012182473],"domain_scores_gemma":[0.9981388,0.00081066525,0.00007704225,0.0004950819,0.0004089791,0.00006953194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015616697,0.0012045875,0.00076591934,0.0014847465,0.0012560699,0.0030790647,0.0041550384,0.0013511775,0.0256117],"category_scores_gemma":[0.005481905,0.000855667,0.0014409272,0.002988947,0.0019703927,0.0042031817,0.0038890846,0.0034967246,0.0053681186],"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.000025616706,0.000056221506,0.000080724894,0.00025776692,0.000025836758,0.00006132518,0.00014421626,0.053880125,0.0007311979,0.81273675,0.011915478,0.12008468],"study_design_scores_gemma":[0.000026542875,0.000017527014,0.00004428247,0.000100941055,0.000021431133,0.000056611087,0.00007291148,0.26146814,0.0018092853,0.64887553,0.08748849,0.00001821152],"about_ca_topic_score_codex":0.005355947,"about_ca_topic_score_gemma":0.008408742,"teacher_disagreement_score":0.0256117,"about_ca_system_score_codex":0.0022961064,"about_ca_system_score_gemma":0.002571405,"threshold_uncertainty_score":0.08567965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004413204,0.00012269053,0.9921523,0.00013379901,0.000028413384,0.000060782797,0.00009849888,0.0011566068,0.0018336612],"genre_scores_gemma":[0.4105342,0.00045494898,0.5803483,0.00030330886,0.00006448273,0.0009074537,0.0007468164,0.0007764292,0.0058640377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.00020819232,0.00003570096,0.00014943237,0.00021351234,0.000059798003],"domain_scores_gemma":[0.9988938,0.000660308,0.00009610013,0.00014812063,0.00013396995,0.00006776019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080828,0.001266006,0.000879797,0.0006434697,0.00032380302,0.0009991794,0.0023115824,0.0012467864,0.0045020906],"category_scores_gemma":[0.004428956,0.0008412853,0.0011007326,0.00066046446,0.0011723596,0.0015482154,0.0020671121,0.001954355,0.0009423175],"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.00003502133,0.000021572458,0.00019545312,0.000046537883,0.000017143826,0.00003490263,0.00004278244,0.95547676,0.0008998863,0.015937245,0.0009185991,0.026374051],"study_design_scores_gemma":[0.000006160144,0.000011318381,0.000012195505,0.0000048838415,0.0000027630226,0.000006312835,0.0000035876403,0.9901455,0.00027715048,0.008881906,0.00064516376,0.000003052507],"about_ca_topic_score_codex":0.00446609,"about_ca_topic_score_gemma":0.006782781,"teacher_disagreement_score":0.0045020906,"about_ca_system_score_codex":0.0009840787,"about_ca_system_score_gemma":0.0018990763,"threshold_uncertainty_score":0.015060961},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057243966,0.0031494705,0.8450165,0.0007157038,0.00031124696,0.00013291133,0.00892127,0.025901148,0.058607828],"genre_scores_gemma":[0.3534337,0.00318644,0.5998538,0.00022500382,0.00014643525,0.00020958367,0.0100713335,0.0049763066,0.027897308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986434,0.000023569748,0.000009340486,0.000032527463,0.000050783172,0.000019521029],"domain_scores_gemma":[0.9994512,0.00026079986,0.000046858026,0.00007732239,0.00009866283,0.00006516018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034619356,0.0006884135,0.0003457791,0.0018047257,0.00041744686,0.0018189594,0.0006598435,0.00041626388,0.031447183],"category_scores_gemma":[0.0013019039,0.00044344732,0.0006045598,0.0020835507,0.00022762123,0.0019875984,0.0009224544,0.0008218329,0.00261594],"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.0009733565,0.00014631724,0.0032658686,0.0013599425,0.00011901475,0.0010470607,0.0029759463,0.04299237,0.07324357,0.1726131,0.109898776,0.5913646],"study_design_scores_gemma":[0.00011376429,0.0001596831,0.006632092,0.0005664966,0.00016203217,0.001404415,0.0019709342,0.41254207,0.029873537,0.20647068,0.33998388,0.00012043643],"about_ca_topic_score_codex":0.0036786767,"about_ca_topic_score_gemma":0.0052309427,"teacher_disagreement_score":0.031447183,"about_ca_system_score_codex":0.00042267624,"about_ca_system_score_gemma":0.00032596992,"threshold_uncertainty_score":0.105201244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042245374,0.000089606976,0.9915176,0.00016896045,0.000036958052,0.00012310718,0.000315663,0.00083078374,0.0026927406],"genre_scores_gemma":[0.020289507,0.000097881115,0.9766975,0.00006748372,0.000028364859,0.00008056497,0.0005712274,0.00035382286,0.001813592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763894,0.0006097818,0.00017692671,0.00043599136,0.00096787326,0.00017044629],"domain_scores_gemma":[0.9947777,0.0034512242,0.00014881288,0.00069747365,0.00079138385,0.00013346193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033812677,0.0011963972,0.0017469408,0.002944663,0.0013476966,0.0029062375,0.0032711863,0.0013720453,0.022065455],"category_scores_gemma":[0.015404231,0.001348237,0.002177069,0.004811001,0.0016955207,0.005570601,0.0045672,0.004271602,0.0027239074],"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.0003041977,0.00020367734,0.0015429902,0.00053700636,0.00007931305,0.0004252835,0.0006053522,0.056843244,0.007720538,0.23284104,0.01733746,0.68156004],"study_design_scores_gemma":[0.00008256078,0.00008679551,0.0008100195,0.00013908773,0.00008754811,0.00030898658,0.00039175362,0.5805997,0.010982414,0.37666774,0.029757427,0.000085974316],"about_ca_topic_score_codex":0.0057588755,"about_ca_topic_score_gemma":0.009991987,"teacher_disagreement_score":0.022065455,"about_ca_system_score_codex":0.00096444925,"about_ca_system_score_gemma":0.0019579495,"threshold_uncertainty_score":0.0738163},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021010689,0.06913478,0.74440163,0.008676426,0.0013401182,0.00015639697,0.00045072773,0.00055456115,0.1731842],"genre_scores_gemma":[0.061657693,0.08990356,0.8104833,0.0017180286,0.0026832963,0.00034800684,0.0010854966,0.00041542348,0.031705216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967348,0.0009793651,0.0002492772,0.00029083344,0.0016293265,0.00011628862],"domain_scores_gemma":[0.99226964,0.005637317,0.00028640014,0.0007012018,0.0008829451,0.0002224946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031769972,0.0015195735,0.0022418364,0.0046548494,0.00074917474,0.0065068156,0.0021381471,0.001123899,0.013932986],"category_scores_gemma":[0.0069809104,0.00088887307,0.001212876,0.013927451,0.0030120558,0.0073483093,0.0025621902,0.0044265348,0.002533654],"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.00002700952,0.00008316036,0.00030393264,0.0009794487,0.00011458042,0.00009014851,0.00008553129,0.009194437,0.0005259532,0.62856674,0.026009997,0.33401895],"study_design_scores_gemma":[0.000012024002,0.000028556906,0.0003868091,0.00043415936,0.00004496044,0.00015777054,0.00010271271,0.03162401,0.00054522895,0.8495587,0.11707364,0.000031379663],"about_ca_topic_score_codex":0.004947577,"about_ca_topic_score_gemma":0.008473854,"teacher_disagreement_score":0.013932986,"about_ca_system_score_codex":0.0020680763,"about_ca_system_score_gemma":0.0043206965,"threshold_uncertainty_score":0.046610415},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021010689,0.06913478,0.74440163,0.008676426,0.0013401182,0.00015639697,0.00045072773,0.00055456115,0.1731842],"genre_scores_gemma":[0.061657693,0.08990356,0.8104833,0.0017180286,0.0026832963,0.00034800684,0.0010854966,0.00041542348,0.031705216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967348,0.0009793651,0.0002492772,0.00029083344,0.0016293265,0.00011628862],"domain_scores_gemma":[0.99226964,0.005637317,0.00028640014,0.0007012018,0.0008829451,0.0002224946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031769972,0.0015195735,0.0022418364,0.0046548494,0.00074917474,0.0065068156,0.0021381471,0.001123899,0.013932986],"category_scores_gemma":[0.0069809104,0.00088887307,0.001212876,0.013927451,0.0030120558,0.0073483093,0.0025621902,0.0044265348,0.002533654],"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.00002700952,0.00008316036,0.00030393264,0.0009794487,0.00011458042,0.00009014851,0.00008553129,0.009194437,0.0005259532,0.62856674,0.026009997,0.33401895],"study_design_scores_gemma":[0.000012024002,0.000028556906,0.0003868091,0.00043415936,0.00004496044,0.00015777054,0.00010271271,0.03162401,0.00054522895,0.8495587,0.11707364,0.000031379663],"about_ca_topic_score_codex":0.004947577,"about_ca_topic_score_gemma":0.008473854,"teacher_disagreement_score":0.013932986,"about_ca_system_score_codex":0.0020680763,"about_ca_system_score_gemma":0.0043206965,"threshold_uncertainty_score":0.046610415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023154127,0.00007040779,0.95561856,0.00010634667,0.000065195854,0.000081669175,0.0016659852,0.035279218,0.004797232],"genre_scores_gemma":[0.0895378,0.00027007476,0.8766799,0.00025120686,0.000028739341,0.00035283237,0.005702872,0.023264043,0.0039124303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993772,0.000082670835,0.000037743925,0.000099205565,0.00034564617,0.00005763159],"domain_scores_gemma":[0.99931073,0.00029090486,0.00003514339,0.0002002575,0.00010558024,0.000057368172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092977594,0.0015397334,0.0008751075,0.0009914633,0.00063707767,0.002814562,0.0031930916,0.0011438406,0.017844442],"category_scores_gemma":[0.0030822398,0.0010921214,0.0021099036,0.0006681936,0.0011762035,0.002169123,0.003202812,0.0024902946,0.004848439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000647333,0.00026254155,0.0021336447,0.0018615483,0.00026707083,0.000857399,0.0018813778,0.27342862,0.08165673,0.20509547,0.14271112,0.28919718],"study_design_scores_gemma":[0.00014069442,0.000047824517,0.0003382421,0.00011134868,0.000029455432,0.0003251264,0.00014562909,0.7530746,0.053476196,0.061689887,0.130502,0.00011896763],"about_ca_topic_score_codex":0.0034806628,"about_ca_topic_score_gemma":0.0067782914,"teacher_disagreement_score":0.017844442,"about_ca_system_score_codex":0.0008528083,"about_ca_system_score_gemma":0.0010558149,"threshold_uncertainty_score":0.0596956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50104356,0.0029261752,0.46010697,0.0062599415,0.0002528326,0.00053829345,0.0042241593,0.0023204247,0.022327535],"genre_scores_gemma":[0.8379368,0.0017400451,0.14864825,0.0005654986,0.00024599783,0.0003713493,0.003863663,0.0006367137,0.0059915567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690896,0.00077256555,0.00018805759,0.0008081333,0.00061550573,0.0007069266],"domain_scores_gemma":[0.98437077,0.011981708,0.0012125131,0.001390564,0.00051732943,0.00052706874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669433,0.0012046827,0.0014615301,0.00086679455,0.0013439775,0.003419246,0.0024639561,0.0017295148,0.00984477],"category_scores_gemma":[0.01500447,0.00081078894,0.0020656215,0.0023968185,0.0013738365,0.006935097,0.0022508244,0.0027663023,0.00061767997],"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.00076890335,0.00028747332,0.0042703026,0.0010092547,0.00022546043,0.0006408662,0.0005173047,0.82900846,0.009380959,0.073919445,0.009140898,0.07083064],"study_design_scores_gemma":[0.00009754079,0.00008376519,0.0011947057,0.000056027333,0.000092035625,0.00039182248,0.0002205362,0.8629523,0.0027386965,0.12816456,0.0039754156,0.0000326784],"about_ca_topic_score_codex":0.005513079,"about_ca_topic_score_gemma":0.0053704637,"teacher_disagreement_score":0.00984477,"about_ca_system_score_codex":0.00303178,"about_ca_system_score_gemma":0.0016635474,"threshold_uncertainty_score":0.03293407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024192235,0.00012672767,0.98986137,0.00034752465,0.000058525085,0.00006670033,0.00029686873,0.0015508698,0.0052721607],"genre_scores_gemma":[0.053866677,0.00031409579,0.93349475,0.00024820885,0.00007206597,0.00028354398,0.0011127987,0.000784638,0.009823159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.00034617173,0.00006978467,0.00017770992,0.00026923703,0.00006267938],"domain_scores_gemma":[0.9977718,0.0015839083,0.0000722528,0.00030133512,0.00021721501,0.000053587984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010807795,0.0009779717,0.0007102756,0.00082276535,0.0010163172,0.0023797147,0.0022176248,0.00096376357,0.014416558],"category_scores_gemma":[0.004621079,0.0009728057,0.0018891349,0.0015326221,0.0012168306,0.005007865,0.002576761,0.0029129426,0.0035144095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014561614,0.0002733987,0.00057051494,0.0007820129,0.00010672968,0.0006834808,0.0005978762,0.22459798,0.0146558415,0.46822152,0.033810265,0.2555547],"study_design_scores_gemma":[0.000037641374,0.000037775295,0.000084772284,0.00004714825,0.000047438887,0.00013579674,0.00013141865,0.7443554,0.003473243,0.21852764,0.033091124,0.00003067568],"about_ca_topic_score_codex":0.0077378154,"about_ca_topic_score_gemma":0.020158693,"teacher_disagreement_score":0.014416558,"about_ca_system_score_codex":0.0010969301,"about_ca_system_score_gemma":0.0022493652,"threshold_uncertainty_score":0.048228145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33846393,0.0010119489,0.57750505,0.0016168663,0.00015872718,0.00009595374,0.0002937243,0.00025497607,0.080598764],"genre_scores_gemma":[0.92594856,0.0003649812,0.06629022,0.00029268727,0.0001283325,0.00010505145,0.00038178422,0.00008596205,0.0064023896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663925,0.00082698616,0.00023406338,0.0007991832,0.0010818213,0.0004185927],"domain_scores_gemma":[0.9889419,0.006055758,0.0011665907,0.0013905733,0.0014535282,0.0009917165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003373384,0.00047838435,0.00074134517,0.0017095439,0.0020203248,0.0034018236,0.0011683378,0.0009465317,0.0059278263],"category_scores_gemma":[0.008297019,0.0005536463,0.0010187367,0.0011682248,0.007397274,0.008749034,0.0037150541,0.0030551518,0.0004654575],"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.000033815457,0.000011911926,0.00045431842,0.000035967438,0.000008682367,0.00010990397,0.00036761613,0.0009661773,0.0011237295,0.9940235,0.00018542078,0.002678919],"study_design_scores_gemma":[0.00002316764,0.000088392975,0.0011137173,0.00004672415,0.000018586079,0.00057378755,0.0008835176,0.016237402,0.0030754886,0.9677751,0.010131039,0.00003297458],"about_ca_topic_score_codex":0.0011491616,"about_ca_topic_score_gemma":0.000977267,"teacher_disagreement_score":0.0059278263,"about_ca_system_score_codex":0.0011455831,"about_ca_system_score_gemma":0.0007748935,"threshold_uncertainty_score":0.019830585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5209624,0.0020037545,0.4325125,0.0013700988,0.000096941636,0.000097124765,0.00033586283,0.0003356195,0.042285692],"genre_scores_gemma":[0.9475469,0.000778919,0.0463362,0.00015457871,0.00014100104,0.00018709913,0.00037759,0.00005066776,0.0044270465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970651,0.0007929453,0.00021270495,0.0005230164,0.0008873845,0.00051879085],"domain_scores_gemma":[0.99640816,0.001761373,0.00043322376,0.0006079878,0.00044235095,0.00034689446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003163837,0.0005541983,0.00064641493,0.0017769142,0.0024590364,0.0034013514,0.0013071073,0.0015021453,0.0031833218],"category_scores_gemma":[0.0046292082,0.00041317687,0.0013289062,0.0022097898,0.009493893,0.0075024986,0.0041856375,0.0016853837,0.0002948053],"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.000023097988,0.000021460219,0.0002889142,0.000035274345,0.0000077033865,0.00007512931,0.0005389036,0.0011350751,0.0011501523,0.9927897,0.0001033505,0.0038314047],"study_design_scores_gemma":[0.0000108692275,0.000043085576,0.00043404783,0.000029251076,0.000013516025,0.00019198799,0.00025288915,0.00631032,0.0021282986,0.9869746,0.0035911736,0.00002001486],"about_ca_topic_score_codex":0.0014415153,"about_ca_topic_score_gemma":0.00089802576,"teacher_disagreement_score":0.0034013514,"about_ca_system_score_codex":0.0020854403,"about_ca_system_score_gemma":0.0008961376,"threshold_uncertainty_score":0.016732156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025853163,0.0003407819,0.99483156,0.00043732586,0.000027581034,0.00005691844,0.00012180991,0.00025257876,0.001346076],"genre_scores_gemma":[0.19945258,0.0008926957,0.79219633,0.00056853396,0.00024405733,0.0007802078,0.00089939433,0.0005228545,0.004443322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954411,0.0026642974,0.00019074215,0.000745108,0.0007397309,0.00021906853],"domain_scores_gemma":[0.97311133,0.024403125,0.0006364421,0.0007949686,0.0008068333,0.0002473398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065259547,0.0018403085,0.0020656402,0.0012259096,0.0010326619,0.0022992557,0.002778596,0.001895958,0.004760813],"category_scores_gemma":[0.023433547,0.0016916003,0.0017748281,0.0025997742,0.0031650173,0.0029079113,0.002937466,0.0047827563,0.0007289665],"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.00005841783,0.000059113594,0.00047393754,0.00020114623,0.00011804923,0.0001081728,0.000081048136,0.84499025,0.00028979176,0.11574467,0.0020049994,0.03587027],"study_design_scores_gemma":[0.0000127550675,0.000009641077,0.00003173787,0.000011903257,0.0000051464895,0.000008031289,0.0000066680095,0.9055993,0.00015256452,0.093457684,0.00069878274,0.000005805335],"about_ca_topic_score_codex":0.013465995,"about_ca_topic_score_gemma":0.020012474,"teacher_disagreement_score":0.013465995,"about_ca_system_score_codex":0.002935513,"about_ca_system_score_gemma":0.0039627426,"threshold_uncertainty_score":0.034512937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033215273,0.002840526,0.8651817,0.015682342,0.0004616861,0.00067620224,0.00272594,0.001038198,0.07817809],"genre_scores_gemma":[0.20569865,0.00227113,0.769249,0.0012085969,0.00016996461,0.00045010186,0.0026903364,0.0005807788,0.017681502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988617,0.0005024749,0.000034452045,0.00014208467,0.00029523938,0.00016419214],"domain_scores_gemma":[0.99827087,0.0006976394,0.00009368391,0.00013950944,0.00052429945,0.00027404248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027137734,0.0010128022,0.0005750884,0.0009026337,0.0009736833,0.003476889,0.001792714,0.0018492056,0.011548048],"category_scores_gemma":[0.006620848,0.0005132239,0.00072664954,0.0019173922,0.0017531961,0.0015898879,0.0017675371,0.0018713884,0.0010784479],"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.00008336926,0.00007085046,0.001048036,0.00029707295,0.000040814004,0.00020571728,0.00024499674,0.6563893,0.0012934379,0.2225019,0.048344962,0.069479495],"study_design_scores_gemma":[0.00006875819,0.000059927133,0.0011388273,0.00023449292,0.00002350485,0.00006895927,0.00032938668,0.78338385,0.0010026201,0.100006975,0.11363952,0.00004312674],"about_ca_topic_score_codex":0.30776927,"about_ca_topic_score_gemma":0.46273735,"teacher_disagreement_score":0.30776927,"about_ca_system_score_codex":0.00753186,"about_ca_system_score_gemma":0.0129709365,"threshold_uncertainty_score":0.6119557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040211134,0.0015468011,0.716372,0.0023722842,0.0014557616,0.0002522317,0.0012020385,0.0033410985,0.23324661],"genre_scores_gemma":[0.56335896,0.0011907935,0.3289821,0.0025895548,0.0005496507,0.0005082008,0.001711751,0.0014443838,0.09966466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870324,0.0002611637,0.00010077865,0.0005078185,0.00019171083,0.00023536284],"domain_scores_gemma":[0.9991856,0.000119186974,0.000038537717,0.00041459463,0.00014048118,0.000101514874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011239584,0.0006340082,0.0007617943,0.0015173005,0.0020515574,0.0021071776,0.001826774,0.001051077,0.018650863],"category_scores_gemma":[0.001476767,0.00060701685,0.0016101443,0.0013622254,0.0028934043,0.00524028,0.0077506765,0.002205308,0.005732586],"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.0000711371,0.000035952537,0.0005926778,0.00018990257,0.00001778007,0.0002839512,0.0005120162,0.00061316177,0.00371663,0.9466708,0.008843874,0.038452018],"study_design_scores_gemma":[0.000055499288,0.00008946857,0.0007846066,0.00006826796,0.00006092702,0.0014683321,0.00041075333,0.008710572,0.007537757,0.7072258,0.27352205,0.00006609171],"about_ca_topic_score_codex":0.0010687832,"about_ca_topic_score_gemma":0.00085874996,"teacher_disagreement_score":0.018650863,"about_ca_system_score_codex":0.0014760246,"about_ca_system_score_gemma":0.0009022416,"threshold_uncertainty_score":0.062393367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30254313,0.0003865439,0.68067944,0.0032278397,0.000078364385,0.0001946679,0.0020171113,0.00047835876,0.010394464],"genre_scores_gemma":[0.7055226,0.00023435896,0.28940225,0.0006280357,0.00008261123,0.0002976426,0.002073651,0.000453608,0.0013053356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9846795,0.010430682,0.000616191,0.0017529693,0.0016030298,0.0009176816],"domain_scores_gemma":[0.81630623,0.1663089,0.004716249,0.008073246,0.003302909,0.0012923754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030190904,0.001370122,0.001958313,0.0015952429,0.0016105114,0.0051317685,0.0021305112,0.0025831023,0.0064019673],"category_scores_gemma":[0.15107849,0.0010286851,0.0021670226,0.0021170105,0.0032831966,0.006411535,0.0031188163,0.005238685,0.0005981204],"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.002619223,0.0004214385,0.012580486,0.00050208956,0.00089361635,0.00042093763,0.00058144174,0.5661155,0.0031019084,0.334195,0.005453666,0.07311468],"study_design_scores_gemma":[0.00024962178,0.00013493422,0.0021089343,0.00006887908,0.00005930951,0.00007482567,0.00015639333,0.6777728,0.0016973768,0.3164651,0.0011472689,0.00006448457],"about_ca_topic_score_codex":0.0071816873,"about_ca_topic_score_gemma":0.007162745,"teacher_disagreement_score":0.030190904,"about_ca_system_score_codex":0.002153285,"about_ca_system_score_gemma":0.0037790812,"threshold_uncertainty_score":0.15966666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017079255,0.00017078221,0.9642491,0.0003675301,0.00007886326,0.000099479665,0.00040890026,0.0023075242,0.01523866],"genre_scores_gemma":[0.34204665,0.0002126835,0.64574236,0.00049611187,0.000084746134,0.0002388759,0.0010938027,0.0002798006,0.00980492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923515,0.0001758547,0.000046453097,0.00016072427,0.00031047023,0.000071445895],"domain_scores_gemma":[0.99930394,0.00041266438,0.00006274313,0.000060777766,0.0001352446,0.000024677294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551366,0.00048299704,0.00042028003,0.00053793844,0.00031189033,0.0008291186,0.0010303358,0.00071583525,0.0072728274],"category_scores_gemma":[0.00209521,0.0003120902,0.00067513314,0.0006890298,0.00036869664,0.00073750794,0.00082921225,0.00070846797,0.0007803819],"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.00017237841,0.0001452584,0.0010648977,0.0003268576,0.00008215314,0.00024498475,0.00006257026,0.6779475,0.012792244,0.108835354,0.009923402,0.18840241],"study_design_scores_gemma":[0.000033925127,0.000025078523,0.000055645985,0.0000070076926,0.000009900607,0.0000485508,0.000007389686,0.9833354,0.0021897496,0.011175884,0.003106866,0.0000046157775],"about_ca_topic_score_codex":0.0023246948,"about_ca_topic_score_gemma":0.004397755,"teacher_disagreement_score":0.0072728274,"about_ca_system_score_codex":0.0006518923,"about_ca_system_score_gemma":0.0013766695,"threshold_uncertainty_score":0.02433008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03364948,0.00083993556,0.87020934,0.0013742105,0.00018849294,0.00074912095,0.028555859,0.05524857,0.009184993],"genre_scores_gemma":[0.20739023,0.0004790759,0.69727486,0.00047252668,0.000049856313,0.00060324965,0.08621725,0.003024925,0.004487963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983485,0.00064373587,0.00009434853,0.00046414512,0.00037130955,0.00007794328],"domain_scores_gemma":[0.9960312,0.0023751142,0.00015652069,0.00069551653,0.00064622785,0.000095356525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010860815,0.0017911387,0.00051806023,0.0028099928,0.00071977475,0.0013739811,0.0018239314,0.0016632243,0.011296986],"category_scores_gemma":[0.009943767,0.000544067,0.0018545567,0.0019651281,0.00063149584,0.0022324445,0.0023784982,0.0014666729,0.0047905724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039021758,0.0003465719,0.005048392,0.002871926,0.00018558725,0.00093065,0.0016213605,0.114953734,0.023999956,0.041521486,0.17752856,0.6306015],"study_design_scores_gemma":[0.00018445506,0.00013326152,0.0019740197,0.00024849584,0.00012288878,0.00045319303,0.0013973201,0.69644725,0.029112227,0.117786035,0.1520508,0.00009006234],"about_ca_topic_score_codex":0.012341946,"about_ca_topic_score_gemma":0.029814955,"teacher_disagreement_score":0.012341946,"about_ca_system_score_codex":0.0015453773,"about_ca_system_score_gemma":0.0022282328,"threshold_uncertainty_score":0.037792206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00804871,0.000345148,0.9748955,0.0003168161,0.000040679617,0.00012049927,0.00027738936,0.013237021,0.0027182435],"genre_scores_gemma":[0.22416139,0.00029937868,0.7632462,0.0007522178,0.000057457935,0.00037508892,0.0016052332,0.0015786006,0.007924516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906677,0.00026662415,0.000046813115,0.00024659783,0.00025691857,0.000116287665],"domain_scores_gemma":[0.99915016,0.00039842565,0.000042540396,0.00016868803,0.0001589877,0.00008119484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017682204,0.0012939151,0.0010774159,0.0009407959,0.0006192712,0.0015526776,0.00404122,0.001852533,0.009813324],"category_scores_gemma":[0.005211271,0.0007750911,0.0016825492,0.00062539434,0.0009373847,0.0032682274,0.0039428216,0.0029371418,0.0032313846],"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.0006071217,0.00033800144,0.0021931182,0.00037043315,0.000307452,0.0002927982,0.00048944994,0.46883115,0.010739166,0.0397372,0.03010772,0.4459864],"study_design_scores_gemma":[0.000032082764,0.000027436583,0.00007181009,0.00001434455,0.000018087565,0.000037358757,0.000024845487,0.979508,0.0023122833,0.014634569,0.0033055397,0.000013622164],"about_ca_topic_score_codex":0.008600166,"about_ca_topic_score_gemma":0.018058427,"teacher_disagreement_score":0.009813324,"about_ca_system_score_codex":0.0015546371,"about_ca_system_score_gemma":0.0019594007,"threshold_uncertainty_score":0.032828867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03142541,0.0019567166,0.901276,0.010391335,0.0012607846,0.00006223955,0.0003101546,0.0012758634,0.052041516],"genre_scores_gemma":[0.52957666,0.0022722955,0.39315,0.003485893,0.0005716875,0.00012050583,0.0005266179,0.00046404163,0.06983235],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932873,0.0001698285,0.00004025357,0.00020938627,0.00017377746,0.000078036035],"domain_scores_gemma":[0.99879116,0.00043583356,0.0000740603,0.00022865452,0.0003801611,0.00009014258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012909515,0.00042831054,0.00093841285,0.00042490367,0.0007631316,0.0023169,0.0011788517,0.0019720616,0.018787093],"category_scores_gemma":[0.005090995,0.00036322235,0.00036227805,0.0008274403,0.001355964,0.0030153235,0.00091152743,0.0015804869,0.004441996],"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.00047288812,0.00007870135,0.0020850343,0.00022874518,0.000106840875,0.000061260886,0.000116985975,0.055121277,0.0052461666,0.4380263,0.024317892,0.47413796],"study_design_scores_gemma":[0.0001302521,0.00012121857,0.0009034789,0.00010087627,0.00005240979,0.00019909868,0.000103544706,0.41143802,0.0052733747,0.5314357,0.050197627,0.000044306915],"about_ca_topic_score_codex":0.0045571346,"about_ca_topic_score_gemma":0.004288709,"teacher_disagreement_score":0.018787093,"about_ca_system_score_codex":0.0010238307,"about_ca_system_score_gemma":0.00152323,"threshold_uncertainty_score":0.062849045},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028096433,0.0019593246,0.9875639,0.00043014644,0.00005736801,0.000073072995,0.000058947182,0.0003104153,0.0067371503],"genre_scores_gemma":[0.118345685,0.0028057545,0.8726138,0.00051847025,0.00020087126,0.00038491935,0.0003164932,0.00040444575,0.0044094855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600816,0.0018656984,0.0001480649,0.00048225414,0.0012584436,0.00023729943],"domain_scores_gemma":[0.9944254,0.004312825,0.00025046666,0.00040968886,0.00046095692,0.0001406098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032041948,0.0014381087,0.0017135277,0.001708575,0.0015613812,0.002570314,0.001941791,0.001880319,0.007318506],"category_scores_gemma":[0.010709772,0.0010931705,0.001515771,0.004937156,0.0029806914,0.0033747582,0.0033074692,0.0057498347,0.0018083105],"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.00017978603,0.00010490697,0.00069100445,0.00063836103,0.00010527198,0.00016086003,0.00041067842,0.32973155,0.003019826,0.3736727,0.010923374,0.28036168],"study_design_scores_gemma":[0.00006726978,0.000056335924,0.00014882254,0.00014056895,0.00003653939,0.00011921846,0.000050867315,0.6259832,0.0029601415,0.35107288,0.019331736,0.000032443688],"about_ca_topic_score_codex":0.0046153828,"about_ca_topic_score_gemma":0.003533362,"teacher_disagreement_score":0.007318506,"about_ca_system_score_codex":0.001918747,"about_ca_system_score_gemma":0.0017297567,"threshold_uncertainty_score":0.024482787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014395693,0.00031738752,0.9821937,0.00022016326,0.000019945606,0.00006733864,0.000056853674,0.00029724833,0.0024315936],"genre_scores_gemma":[0.1420613,0.000367331,0.8554116,0.00016774597,0.00003981342,0.00015438767,0.00029532905,0.00015178118,0.0013507135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983084,0.000716915,0.000083168,0.00019317969,0.0005244302,0.0001738411],"domain_scores_gemma":[0.99564856,0.0029233177,0.00042101252,0.00054559344,0.00031352375,0.00014798802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002090572,0.0011848615,0.0011082592,0.0011783578,0.0007354386,0.0014818402,0.0007895837,0.0010658746,0.002692216],"category_scores_gemma":[0.006543321,0.00071942667,0.0011289595,0.0020237225,0.0010756324,0.002254776,0.0025177689,0.0027770505,0.00085021276],"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.00020477809,0.00022766394,0.0022794714,0.00048709943,0.00013889119,0.00045507742,0.00038050182,0.5416893,0.024008293,0.07372218,0.007868857,0.34853786],"study_design_scores_gemma":[0.00002873566,0.00006542286,0.00022610044,0.000036077294,0.000020146885,0.00016225781,0.000051276562,0.9558872,0.0044410755,0.035369936,0.0036997444,0.00001204148],"about_ca_topic_score_codex":0.0018725796,"about_ca_topic_score_gemma":0.0028853538,"teacher_disagreement_score":0.002692216,"about_ca_system_score_codex":0.000515908,"about_ca_system_score_gemma":0.0011466198,"threshold_uncertainty_score":0.011056125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083338446,0.00016963475,0.9945475,0.0006756964,0.000039345294,0.00012302214,0.00003214646,0.00020182758,0.0033775482],"genre_scores_gemma":[0.02960564,0.00020228968,0.96659887,0.0002542283,0.000055797882,0.0003530906,0.00010459041,0.00006238367,0.0027630706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99346787,0.0043904027,0.0002829886,0.0007055273,0.000947171,0.0002060931],"domain_scores_gemma":[0.9933541,0.0050159628,0.0003275835,0.00063955353,0.00043570818,0.00022722337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006271221,0.0015393697,0.00073040876,0.0015137929,0.0017822406,0.0030107612,0.0025958738,0.0028338176,0.010357149],"category_scores_gemma":[0.012500061,0.0007528533,0.002247784,0.0012520427,0.0046705594,0.0054429392,0.004946176,0.0034931176,0.001461654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081485894,0.00010980384,0.00038352396,0.00071448233,0.0000960329,0.0003221837,0.0038684988,0.021649493,0.0027643791,0.85624355,0.0056464314,0.10812008],"study_design_scores_gemma":[0.00008967446,0.00009181531,0.00018895848,0.00018453393,0.0000721818,0.0003754929,0.0008403992,0.12500519,0.0029134243,0.7699008,0.10025387,0.00008373771],"about_ca_topic_score_codex":0.0019251782,"about_ca_topic_score_gemma":0.0033184213,"teacher_disagreement_score":0.010357149,"about_ca_system_score_codex":0.0013156133,"about_ca_system_score_gemma":0.0022141438,"threshold_uncertainty_score":0.03464806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09560289,0.0005126572,0.8700168,0.0003312577,0.00010589389,0.00030176173,0.00080216944,0.005536389,0.02679023],"genre_scores_gemma":[0.7336656,0.00046541332,0.25020236,0.00021660085,0.00006836355,0.00031367232,0.0009571397,0.0018757625,0.01223506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982792,0.00052816054,0.00012443324,0.00035497564,0.0005284926,0.00018474435],"domain_scores_gemma":[0.9957563,0.002051907,0.00022443393,0.0010935382,0.0005664265,0.000307247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018268331,0.00093629974,0.0006577154,0.0010340962,0.00051460654,0.0032159765,0.0017604111,0.0006842894,0.0073230597],"category_scores_gemma":[0.00839008,0.0006332552,0.0005807329,0.0015582866,0.00065422786,0.00468236,0.0015649877,0.001517895,0.002260984],"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.0010164623,0.000982417,0.007857942,0.0008105961,0.00020329418,0.00076420035,0.0008221371,0.1865038,0.11728416,0.09124523,0.02128011,0.5712296],"study_design_scores_gemma":[0.000059547627,0.00012727504,0.002494352,0.00009257796,0.00012142933,0.00029539267,0.0003298266,0.84022176,0.051776294,0.078418076,0.02595399,0.00010944142],"about_ca_topic_score_codex":0.0017263885,"about_ca_topic_score_gemma":0.0036853154,"teacher_disagreement_score":0.0073230597,"about_ca_system_score_codex":0.00061884226,"about_ca_system_score_gemma":0.00083303184,"threshold_uncertainty_score":0.024498045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05031398,0.0070461542,0.92332196,0.0020436156,0.0005585575,0.00032638712,0.0024755674,0.004136601,0.009777198],"genre_scores_gemma":[0.24560697,0.0023946688,0.7359131,0.0005730517,0.0005454772,0.0003508217,0.0051762173,0.0012932185,0.008146448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969674,0.0009937591,0.00014230158,0.00066184433,0.0009886264,0.00024617492],"domain_scores_gemma":[0.9709815,0.022954712,0.00080645515,0.0019121214,0.0028750561,0.00047027934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618113,0.0021611566,0.0013872009,0.0041682585,0.0010783806,0.0020764344,0.003134177,0.0031988532,0.006846524],"category_scores_gemma":[0.02551448,0.00100768,0.001827414,0.0038309984,0.0012747919,0.0039308416,0.0013332207,0.0042588757,0.0024509658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036203492,0.00043380144,0.008611652,0.0006502608,0.00028854446,0.00010947704,0.00012359013,0.39024258,0.0033888186,0.02382476,0.067574754,0.5043897],"study_design_scores_gemma":[0.000022529593,0.00003436198,0.00054798706,0.00004923286,0.000030031137,0.000039037575,0.000021490367,0.9757447,0.0013289825,0.020382643,0.0017840164,0.0000149312245],"about_ca_topic_score_codex":0.0072476696,"about_ca_topic_score_gemma":0.015018952,"teacher_disagreement_score":0.0072476696,"about_ca_system_score_codex":0.0014244642,"about_ca_system_score_gemma":0.001788386,"threshold_uncertainty_score":0.024423182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009340478,0.00011467775,0.9868699,0.00015661742,0.000019781864,0.00006344635,0.00009080517,0.0007386052,0.002605714],"genre_scores_gemma":[0.35867187,0.00021293388,0.6365651,0.00027987818,0.00004334906,0.00039212956,0.00045850142,0.00033871498,0.0030375593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.0003288947,0.000034334196,0.00013037764,0.00030474234,0.000081676924],"domain_scores_gemma":[0.9981273,0.0012709656,0.00011281757,0.00026922743,0.00016169868,0.00005806919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009896377,0.0005681948,0.00079911813,0.00068154023,0.0004141619,0.00069525925,0.002012466,0.0008830682,0.0046683787],"category_scores_gemma":[0.0046802764,0.000449634,0.00080787105,0.00091787084,0.0009713642,0.0010840038,0.0016486157,0.0015058409,0.000847922],"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.00009742355,0.00006866825,0.00059314375,0.000187873,0.00004678407,0.00007288119,0.00007274253,0.82387304,0.0050612255,0.09139066,0.0033408054,0.07519468],"study_design_scores_gemma":[0.000020458234,0.000025004189,0.000033052554,0.0000046262358,0.000005791416,0.000014456362,0.000004149217,0.9829268,0.00080351956,0.015358361,0.0007995074,0.000004240619],"about_ca_topic_score_codex":0.0023365149,"about_ca_topic_score_gemma":0.00535041,"teacher_disagreement_score":0.0046683787,"about_ca_system_score_codex":0.0011970139,"about_ca_system_score_gemma":0.0017019818,"threshold_uncertainty_score":0.015617311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008125549,0.08273191,0.3336409,0.0152797215,0.014962412,0.0007134534,0.01835557,0.008201903,0.51798856],"genre_scores_gemma":[0.01291014,0.027762981,0.07111888,0.00084064424,0.00077826885,0.00018077018,0.015851788,0.0014030915,0.8691534],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994673,0.00007655788,0.00003833467,0.000098505145,0.00026003437,0.00005929581],"domain_scores_gemma":[0.99858785,0.0003002646,0.00003349657,0.00017027615,0.0007378092,0.00017034567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016304672,0.0016191492,0.0011186928,0.0016351357,0.0016290264,0.0053433594,0.00203522,0.0010116339,0.08821253],"category_scores_gemma":[0.0030190814,0.00091458275,0.00069015037,0.0031102353,0.0013751588,0.003190532,0.0014670305,0.0017758827,0.028917903],"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.00017290039,0.00005847335,0.00038800546,0.00030597663,0.00003109221,0.00018111858,0.00035876702,0.0014166059,0.0019169465,0.01490042,0.78647745,0.1937922],"study_design_scores_gemma":[0.00003497252,0.000019120002,0.0013421809,0.00028737733,0.00004111098,0.00025489135,0.00028241356,0.0057248343,0.0010330494,0.010176774,0.98077637,0.000026984544],"about_ca_topic_score_codex":0.4498037,"about_ca_topic_score_gemma":0.635685,"teacher_disagreement_score":0.4498037,"about_ca_system_score_codex":0.0074626277,"about_ca_system_score_gemma":0.009147368,"threshold_uncertainty_score":0.89437115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007102468,0.0069298553,0.92217183,0.0023338865,0.00046597578,0.000058504484,0.0002715466,0.0002946978,0.060371295],"genre_scores_gemma":[0.2074086,0.019704081,0.738547,0.0013892159,0.0022116906,0.0004276934,0.0008792948,0.0009300857,0.02850232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982786,0.0007156812,0.00009870453,0.00021941034,0.00052092836,0.00016671812],"domain_scores_gemma":[0.99388075,0.0049503455,0.00028938265,0.00041373083,0.00033227378,0.00013361083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003372964,0.0026521084,0.0015988232,0.002040171,0.00093394844,0.003959311,0.00256858,0.0017013897,0.013981292],"category_scores_gemma":[0.013848643,0.0015663062,0.0012187673,0.0069562285,0.0036493228,0.009646822,0.0023155017,0.009646933,0.002533872],"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.000075470714,0.00005923719,0.00016165993,0.00020066189,0.000024406043,0.000043760156,0.000116600735,0.044775184,0.0010688942,0.8581349,0.008379344,0.08695983],"study_design_scores_gemma":[0.000009554827,0.000013280804,0.00006684057,0.00006103032,0.000009145896,0.000029110952,0.000023329263,0.0601874,0.00033248335,0.93454313,0.00471274,0.000011974956],"about_ca_topic_score_codex":0.0018673677,"about_ca_topic_score_gemma":0.0019823792,"teacher_disagreement_score":0.013981292,"about_ca_system_score_codex":0.001838751,"about_ca_system_score_gemma":0.0011677059,"threshold_uncertainty_score":0.046772063},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026890854,0.0011441719,0.9673127,0.00072144065,0.00015291705,0.000096879885,0.00023949411,0.0013383796,0.026305042],"genre_scores_gemma":[0.05839676,0.00345367,0.9195698,0.00051334687,0.00028929705,0.00027460506,0.0013258703,0.0011655487,0.015011133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978543,0.00053170614,0.00016905797,0.00032049275,0.0009932196,0.00013122274],"domain_scores_gemma":[0.9949876,0.00409969,0.00009322773,0.00045309283,0.00030186176,0.00006455609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025804094,0.0017545836,0.0016470231,0.0028355387,0.0019871935,0.0044825953,0.003279337,0.0014749231,0.009800761],"category_scores_gemma":[0.0076444596,0.0023544468,0.003398535,0.0032646458,0.0057825875,0.011309947,0.0038286443,0.0070587937,0.003287647],"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.000026788222,0.000053490603,0.00012083101,0.00048262902,0.00004431648,0.00008351469,0.0004126405,0.00499337,0.0015848932,0.87108314,0.011667622,0.10944681],"study_design_scores_gemma":[0.00001596592,0.00000986276,0.00004130705,0.00007833656,0.000024352315,0.000060498132,0.000049143327,0.01074595,0.001943067,0.9640398,0.022979168,0.000012603754],"about_ca_topic_score_codex":0.0016019676,"about_ca_topic_score_gemma":0.0021928668,"teacher_disagreement_score":0.009800761,"about_ca_system_score_codex":0.0019022432,"about_ca_system_score_gemma":0.0017004586,"threshold_uncertainty_score":0.032786787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041185986,0.0006653261,0.9450039,0.00036876753,0.0002664165,0.00019182892,0.00013250131,0.001484735,0.010700547],"genre_scores_gemma":[0.34676212,0.00044484602,0.6466155,0.0003459547,0.00013288858,0.00022638269,0.00053667865,0.0006802601,0.0042553865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628556,0.00153979,0.00020851464,0.00035977576,0.0011423845,0.0004638624],"domain_scores_gemma":[0.9819546,0.012660821,0.00068955723,0.0029898463,0.0013567309,0.00034844247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037953244,0.0020696593,0.0022188006,0.0025418473,0.0013134467,0.0020767823,0.0033800576,0.001734648,0.0086790705],"category_scores_gemma":[0.02355806,0.0015207125,0.0022311574,0.002518375,0.0016921278,0.0046938257,0.003789358,0.004976857,0.0009913117],"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.0004199877,0.00033455895,0.0014725467,0.0003775611,0.00019632421,0.00021927732,0.00043538655,0.73050755,0.0041644145,0.07014764,0.0060010324,0.18572374],"study_design_scores_gemma":[0.00006185477,0.00009038221,0.0001841156,0.00004569052,0.00007568876,0.00005583127,0.000042805485,0.9324478,0.0013385813,0.063806586,0.001826586,0.000024090445],"about_ca_topic_score_codex":0.0044877836,"about_ca_topic_score_gemma":0.007519529,"teacher_disagreement_score":0.0086790705,"about_ca_system_score_codex":0.0017384846,"about_ca_system_score_gemma":0.002389394,"threshold_uncertainty_score":0.029034376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14128952,0.0037620584,0.55376846,0.0033254996,0.0006781402,0.00017912447,0.00203435,0.00093645,0.29402643],"genre_scores_gemma":[0.80754375,0.002945739,0.12967795,0.00071993837,0.0012650191,0.00045364088,0.0020716358,0.00038619922,0.05493613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774617,0.0006339707,0.00018029562,0.00033630343,0.0008738368,0.00022941033],"domain_scores_gemma":[0.9976528,0.0011337422,0.00023005599,0.00027431906,0.00034225846,0.00036690023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001628,0.00069319736,0.0012958834,0.002779283,0.0030528668,0.007765388,0.0016650677,0.001348341,0.012433676],"category_scores_gemma":[0.003124762,0.0009100951,0.0009916504,0.0044360915,0.004650567,0.0104726385,0.0018945156,0.0029546055,0.0020810142],"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.000018810388,0.000011269675,0.000041819283,0.000023781053,0.0000035668331,0.000027430937,0.0001046118,0.00044159376,0.00030702402,0.9942985,0.00068637665,0.004035291],"study_design_scores_gemma":[0.000009542196,0.0000064608716,0.000039328857,0.0000076074107,0.0000025696313,0.000045949804,0.000054274446,0.001853986,0.00018587323,0.9935596,0.0042278212,0.000006909552],"about_ca_topic_score_codex":0.0017200902,"about_ca_topic_score_gemma":0.0014178886,"teacher_disagreement_score":0.012433676,"about_ca_system_score_codex":0.0019862046,"about_ca_system_score_gemma":0.0012023351,"threshold_uncertainty_score":0.041594803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000343138,0.00017247802,0.9952246,0.000096029886,0.000024359686,0.000070024515,0.00013861549,0.0026257683,0.0013049457],"genre_scores_gemma":[0.025853315,0.00056087814,0.96878135,0.00019170364,0.00009563154,0.0004967964,0.00066447636,0.001242316,0.0021135288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993676,0.002314077,0.0004214735,0.0006394497,0.0025115386,0.00043752167],"domain_scores_gemma":[0.9918643,0.00472066,0.0003718464,0.0017873887,0.0010691778,0.0001866184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051912,0.0030926792,0.001946218,0.0022221496,0.001592484,0.00509058,0.007642463,0.0020043051,0.015322333],"category_scores_gemma":[0.01270535,0.0021154096,0.0033802104,0.0022520497,0.0035943063,0.0062050517,0.0042377906,0.0063333525,0.0057164025],"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.00023544359,0.000120430595,0.00045389324,0.0012728985,0.00019009548,0.00016837036,0.00020981317,0.21205296,0.004239402,0.55974257,0.024791388,0.19652282],"study_design_scores_gemma":[0.00008744535,0.000055642995,0.00009873125,0.00015950203,0.00005720844,0.00008060093,0.00004636346,0.5711131,0.0067193415,0.38711923,0.034414344,0.000048452446],"about_ca_topic_score_codex":0.0050211023,"about_ca_topic_score_gemma":0.0061799614,"teacher_disagreement_score":0.015322333,"about_ca_system_score_codex":0.0023636592,"about_ca_system_score_gemma":0.004314133,"threshold_uncertainty_score":0.051258266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006131897,0.01850379,0.00039341496,0.0029558283,0.0036698736,0.000025842262,0.002808851,0.00018041111,0.97084874],"genre_scores_gemma":[0.0016789803,0.0032161141,0.00015615691,0.00015171693,0.00016450508,0.000010601821,0.00033614849,0.0000955006,0.9941902],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995869,0.00003146089,0.000019886578,0.000084350104,0.00021060866,0.00006689948],"domain_scores_gemma":[0.99972624,0.000041547162,0.000017696433,0.000024569792,0.00014056604,0.000049450682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003709656,0.001067468,0.00076295814,0.0021950745,0.0034552768,0.0054913154,0.00087612914,0.0016453172,0.34263414],"category_scores_gemma":[0.0015502416,0.00052864687,0.00038075194,0.0045421664,0.00080318993,0.0022109582,0.0013324516,0.0022729274,0.10437572],"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.00003331517,0.000009527876,0.00015119476,0.0001021067,0.0000051716615,0.00007074182,0.00009758265,0.00016820458,0.000088690096,0.019899573,0.9284536,0.05092028],"study_design_scores_gemma":[0.000002035932,0.0000024492397,0.0002802909,0.00006366598,0.0000011169868,0.000017471015,0.00003213519,0.000032746004,0.000035927224,0.0008612836,0.99866796,0.0000029458479],"about_ca_topic_score_codex":0.14384402,"about_ca_topic_score_gemma":0.5349171,"teacher_disagreement_score":0.856156,"about_ca_system_score_codex":0.004565626,"about_ca_system_score_gemma":0.002950797,"threshold_uncertainty_score":0.9376526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060900594,0.0004001135,0.9891556,0.00021396138,0.000040776016,0.00008324139,0.000091581256,0.00044561666,0.0034790556],"genre_scores_gemma":[0.18678059,0.0005086908,0.8074915,0.00039721178,0.00007324571,0.0007426203,0.0005913914,0.00036176085,0.00305303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983368,0.00089595135,0.000066787085,0.00025553053,0.00033288932,0.00011204151],"domain_scores_gemma":[0.9975206,0.0018125252,0.00014923843,0.00021042401,0.00022814967,0.00007895281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002498064,0.0010604187,0.0014111948,0.0011923664,0.0006729917,0.0013490282,0.0015141908,0.0012938498,0.005853156],"category_scores_gemma":[0.0063049914,0.00080701936,0.001287885,0.0018423647,0.0013532154,0.001694596,0.0022312233,0.0026182064,0.00088648463],"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.00010055039,0.0001316827,0.0010537525,0.00024362627,0.000115385636,0.00007627129,0.00010804851,0.8001088,0.001978405,0.09711345,0.0063576084,0.092612445],"study_design_scores_gemma":[0.00002765932,0.00003426948,0.00006356437,0.00001826796,0.00001030173,0.000015199481,0.000012380174,0.97142315,0.00041774087,0.025573494,0.0023962935,0.000007643033],"about_ca_topic_score_codex":0.0028801141,"about_ca_topic_score_gemma":0.0054209367,"teacher_disagreement_score":0.005853156,"about_ca_system_score_codex":0.0010632591,"about_ca_system_score_gemma":0.0017875063,"threshold_uncertainty_score":0.019580722},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004745307,0.0025224246,0.0032954118,0.0005632706,0.0007429594,0.00020006094,0.037346635,0.0010991847,0.9494847],"genre_scores_gemma":[0.06760136,0.005821877,0.02041598,0.0004602068,0.00025902412,0.0003263308,0.08662384,0.0012126089,0.81727874],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999449,0.000003888226,0.0000031946363,0.000015679117,0.000021299536,0.00001096974],"domain_scores_gemma":[0.99995184,0.000006362638,0.0000075877792,0.000006087563,0.000016532444,0.000011513626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000045867106,0.0007303523,0.00023938633,0.00150759,0.0007079462,0.00043125314,0.00042934067,0.0004036993,0.35151267],"category_scores_gemma":[0.00018450005,0.00018077523,0.00024727674,0.0013585952,0.00040407473,0.0007662745,0.00056928786,0.0006920337,0.11883556],"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.00009656215,0.000020649104,0.0010555437,0.000754281,0.000008519535,0.00023211111,0.00025496597,0.00050285115,0.0033580589,0.011464058,0.75913894,0.22311352],"study_design_scores_gemma":[0.0000055410605,0.00000457054,0.0030480619,0.00006305622,0.0000029707423,0.00021198571,0.00007649008,0.00007755205,0.00027459135,0.0011610914,0.9950706,0.0000033761332],"about_ca_topic_score_codex":0.017509943,"about_ca_topic_score_gemma":0.040023874,"teacher_disagreement_score":0.35151267,"about_ca_system_score_codex":0.0006316048,"about_ca_system_score_gemma":0.00046559348,"threshold_uncertainty_score":0.92498845},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010383942,0.0005082714,0.27438205,0.00038999296,0.00032468606,0.00033777318,0.15641865,0.5026315,0.063968726],"genre_scores_gemma":[0.01632299,0.0010116752,0.16605428,0.0007426143,0.00015503464,0.0013915617,0.43217888,0.32472786,0.05741509],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814403,0.00021251092,0.00022640207,0.00035447124,0.0007982489,0.0002642873],"domain_scores_gemma":[0.9974718,0.0006901658,0.00013301593,0.0007739991,0.0007460262,0.00018492743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021899638,0.0028785341,0.001632921,0.0031809364,0.00086757087,0.004989108,0.006168489,0.0017950593,0.2469496],"category_scores_gemma":[0.008478161,0.0023777368,0.0020506156,0.0037430478,0.0007017316,0.0045236815,0.0046315403,0.0035135145,0.21795404],"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.00015889427,0.00004294769,0.0005505363,0.0005193319,0.0000553559,0.00007681537,0.00012305254,0.0036224576,0.0008530215,0.015119129,0.9256836,0.05319477],"study_design_scores_gemma":[0.00019565535,0.000013311085,0.0004365948,0.00015169637,0.000025263615,0.00013378402,0.000054964785,0.01589214,0.005526067,0.014648934,0.962847,0.00007460924],"about_ca_topic_score_codex":0.014209983,"about_ca_topic_score_gemma":0.014704449,"teacher_disagreement_score":0.2469496,"about_ca_system_score_codex":0.0018491122,"about_ca_system_score_gemma":0.0026182402,"threshold_uncertainty_score":0.8261287},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99362516,0.0014100787,0.0013277228,0.00022528555,0.000013695171,0.000068153626,0.0002445118,0.000012519475,0.003072757],"genre_scores_gemma":[0.99229103,0.0027733296,0.0018522696,0.00006297695,0.000027677072,0.0001005282,0.00035082118,0.0000112795005,0.0025301473],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.997552,0.0011402708,0.00020123522,0.0002762136,0.0005324633,0.00029777363],"domain_scores_gemma":[0.9945702,0.0033251427,0.0012284352,0.00012876227,0.00059100677,0.00015647036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025428631,0.0006499138,0.00038784326,0.0027729757,0.0010726668,0.0030021158,0.0006317448,0.00089571206,0.002134192],"category_scores_gemma":[0.009265899,0.00045569084,0.00073293457,0.001760971,0.0013940816,0.001345048,0.0010158302,0.0010236932,0.00042148912],"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.00026439485,0.00035845977,0.83886534,0.00031033944,0.00011889,0.002923654,0.069202624,0.00047823336,0.0017745512,0.0027819457,0.0005525312,0.08236905],"study_design_scores_gemma":[0.000013601793,0.00027550492,0.9403956,0.00019552775,0.00007682841,0.002932006,0.043784365,0.0010212291,0.0014825145,0.0005802554,0.009195202,0.00004733442],"about_ca_topic_score_codex":0.057958808,"about_ca_topic_score_gemma":0.04062599,"teacher_disagreement_score":0.057958808,"about_ca_system_score_codex":0.001940601,"about_ca_system_score_gemma":0.0016528544,"threshold_uncertainty_score":0.1152429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24742351,0.002382648,0.68435323,0.0010819295,0.00035590708,0.00039920915,0.0019141445,0.0021153004,0.059974134],"genre_scores_gemma":[0.7622324,0.00065038854,0.2161376,0.00026436255,0.00004790917,0.00024640406,0.0014631336,0.0004319699,0.018525783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969137,0.00010003969,0.0000109220055,0.000060780345,0.000067425055,0.00006944763],"domain_scores_gemma":[0.9990313,0.00064725673,0.00008537199,0.000046146535,0.00013295062,0.000057054218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004980901,0.0011131464,0.0008837559,0.0009306743,0.00043775653,0.0012611336,0.001024503,0.0010672082,0.010076926],"category_scores_gemma":[0.0020135925,0.000685139,0.00094237307,0.0009652403,0.0006409422,0.0009398463,0.0006965472,0.0010252564,0.0010102104],"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.000104056984,0.000058498073,0.00040036972,0.00010824849,0.000022439994,0.000053745644,0.000023753673,0.9719569,0.0011096178,0.0051587853,0.0013336248,0.01967006],"study_design_scores_gemma":[0.000018973444,0.00006509374,0.00016356856,0.0000146186085,0.000010712893,0.000015920037,0.000026122121,0.99366367,0.0005899027,0.0041897623,0.0012364973,0.0000052034507],"about_ca_topic_score_codex":0.008313821,"about_ca_topic_score_gemma":0.014984024,"teacher_disagreement_score":0.010076926,"about_ca_system_score_codex":0.0015115531,"about_ca_system_score_gemma":0.0011952975,"threshold_uncertainty_score":0.03371072},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052323365,0.00027496548,0.0023910566,0.0007532391,0.00011841884,0.017328003,0.965125,0.00020963246,0.008567462],"genre_scores_gemma":[0.11984257,0.0013707147,0.047348663,0.0028051415,0.00036596844,0.5063862,0.27803946,0.0008116965,0.043029554],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979704,0.001012373,0.00035015182,0.00026813333,0.0002118954,0.0001870741],"domain_scores_gemma":[0.949021,0.042122222,0.0028063597,0.0015950998,0.0035368288,0.00091853045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051355194,0.000889776,0.0015386693,0.0017198495,0.0016513318,0.0013473937,0.002448428,0.0014163217,0.8175102],"category_scores_gemma":[0.05961448,0.0007304765,0.0013599402,0.0024672118,0.00031363918,0.0016627167,0.00092256686,0.0011530097,0.042922337],"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.006899653,0.001867256,0.008017573,0.02187335,0.00040694076,0.0002680649,0.0013552324,0.0010725653,0.00008810721,0.004196073,0.8893887,0.064566515],"study_design_scores_gemma":[0.11581571,0.0066777025,0.09197308,0.046242613,0.0028782175,0.0015160892,0.008055142,0.00663554,0.0010801285,0.03370192,0.6848501,0.0005738325],"about_ca_topic_score_codex":0.009563626,"about_ca_topic_score_gemma":0.017630039,"teacher_disagreement_score":0.8175102,"about_ca_system_score_codex":0.0018998202,"about_ca_system_score_gemma":0.0040530097,"threshold_uncertainty_score":0.26029956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006786654,0.00019955446,0.9888297,0.00020145166,0.000032341082,0.0000634336,0.00009073568,0.00020689498,0.0035892804],"genre_scores_gemma":[0.35390863,0.00066764734,0.6389371,0.00036195555,0.00009030163,0.00041457862,0.0004726272,0.0004107633,0.004736395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595153,0.001627367,0.00022491506,0.0007109918,0.0010748927,0.0004103137],"domain_scores_gemma":[0.99244505,0.0056776544,0.00035773992,0.0006007098,0.00071031926,0.00020848226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041866372,0.0011906191,0.0010432409,0.0011936955,0.0008706159,0.0027742696,0.0018218837,0.00096490193,0.0032298858],"category_scores_gemma":[0.012895744,0.0009373017,0.0015670082,0.0013088231,0.002382729,0.0040031155,0.0033124497,0.0036279713,0.0004706669],"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.000103424834,0.000093277995,0.0007555917,0.00028925136,0.00006896074,0.00017419443,0.0002090744,0.58080417,0.0026506102,0.34441268,0.00217104,0.06826771],"study_design_scores_gemma":[0.000020999549,0.0000364974,0.000073602714,0.000038819468,0.00001585285,0.0000474383,0.000027681286,0.8075411,0.0017324549,0.18659033,0.0038587307,0.00001657193],"about_ca_topic_score_codex":0.004744274,"about_ca_topic_score_gemma":0.0051324014,"teacher_disagreement_score":0.004744274,"about_ca_system_score_codex":0.0018540386,"about_ca_system_score_gemma":0.0031206284,"threshold_uncertainty_score":0.022141278},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044261254,0.0046008225,0.77033055,0.0030214442,0.0007851684,0.0003232255,0.0134427985,0.0048371833,0.19823273],"genre_scores_gemma":[0.09878654,0.0065847123,0.63242763,0.0019506434,0.0013244636,0.0014087189,0.038430896,0.0058566006,0.21322984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991259,0.00019486893,0.00007759042,0.0002090156,0.0003026213,0.00009000732],"domain_scores_gemma":[0.9994899,0.0002493291,0.000036006106,0.00010228036,0.000084717496,0.000037769496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010695313,0.0019730446,0.0011835181,0.0012611522,0.0008537886,0.0028663585,0.0014604297,0.0012156935,0.05813882],"category_scores_gemma":[0.0023054772,0.00058319984,0.0015725887,0.002406326,0.0007571558,0.0024087846,0.0025213172,0.003231867,0.01830421],"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.00009836379,0.00013837006,0.00024277339,0.0010338395,0.00008359402,0.00010346868,0.00009092488,0.024691787,0.0017024898,0.5066629,0.21498835,0.25016314],"study_design_scores_gemma":[0.00012614901,0.000040140585,0.00033905418,0.00015166667,0.000042317013,0.00016227091,0.000053431053,0.08822351,0.001932325,0.5484079,0.36049202,0.000029170751],"about_ca_topic_score_codex":0.001637712,"about_ca_topic_score_gemma":0.0037571394,"teacher_disagreement_score":0.05813882,"about_ca_system_score_codex":0.0010325497,"about_ca_system_score_gemma":0.0012096041,"threshold_uncertainty_score":0.19449371},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015656522,0.00073930714,0.98752135,0.00050947745,0.00016637449,0.00016623049,0.00007878704,0.00094939326,0.008303399],"genre_scores_gemma":[0.040329926,0.0010499671,0.9507241,0.00060651347,0.00020577197,0.00034026543,0.00032320342,0.00036554132,0.0060546543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947231,0.0021202608,0.00036619065,0.00083469297,0.0015280981,0.0004276498],"domain_scores_gemma":[0.9938174,0.003851528,0.00036815045,0.0011474784,0.0006775994,0.00013790734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043164073,0.0017840619,0.00090054236,0.002270514,0.0010159507,0.0031439236,0.004543933,0.0016617348,0.017161904],"category_scores_gemma":[0.014008,0.0012480791,0.002387533,0.0032034027,0.002275221,0.0065616746,0.003908943,0.006086311,0.004393529],"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.00016553607,0.00019260208,0.00043710298,0.0008695571,0.00015471534,0.0002298666,0.000398259,0.089429624,0.005942151,0.54385877,0.014332857,0.34398893],"study_design_scores_gemma":[0.00015457693,0.00014150473,0.00023148021,0.00029185534,0.0001514483,0.00027608455,0.00017285979,0.5193134,0.010012675,0.40583432,0.06334197,0.000077815545],"about_ca_topic_score_codex":0.003102135,"about_ca_topic_score_gemma":0.005994025,"teacher_disagreement_score":0.017161904,"about_ca_system_score_codex":0.0019625027,"about_ca_system_score_gemma":0.0023068178,"threshold_uncertainty_score":0.057412267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026753782,0.074652806,0.6601361,0.08936933,0.0064721964,0.000065993016,0.001932979,0.0011807233,0.1635145],"genre_scores_gemma":[0.29283452,0.1460976,0.32149065,0.034878194,0.02922363,0.00063023274,0.004212977,0.003794615,0.16683751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763966,0.00084354234,0.000098424374,0.00032292798,0.00097194244,0.00012340133],"domain_scores_gemma":[0.99650383,0.0017905473,0.00017933782,0.0007872524,0.0005918201,0.00014724012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027343975,0.0015023992,0.001467771,0.0032386435,0.0010119024,0.0062361415,0.002589633,0.0030034904,0.027538516],"category_scores_gemma":[0.01255402,0.00081542385,0.0009922539,0.0043361583,0.00458468,0.016101839,0.002472683,0.007001494,0.006831427],"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.000036639023,0.000021271922,0.00013400835,0.0003055199,0.000025311116,0.00006331561,0.00010627909,0.0066886703,0.00031099227,0.8696348,0.074435264,0.04823796],"study_design_scores_gemma":[0.000014340954,0.000015178705,0.00014140307,0.00010421735,0.000008420198,0.00013826454,0.00005813301,0.01613119,0.00014481571,0.8348641,0.14835942,0.000020533655],"about_ca_topic_score_codex":0.0036780564,"about_ca_topic_score_gemma":0.0034147291,"teacher_disagreement_score":0.027538516,"about_ca_system_score_codex":0.0017319178,"about_ca_system_score_gemma":0.0010999643,"threshold_uncertainty_score":0.092125475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076119713,0.0904597,0.6131728,0.015627146,0.00238837,0.00016291189,0.001392137,0.0007670787,0.26841784],"genre_scores_gemma":[0.15889479,0.119055726,0.56186706,0.0028789407,0.006285696,0.00068694964,0.00517343,0.0013636978,0.14379367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982293,0.00031226582,0.0000980408,0.0002827292,0.0009904198,0.000087277345],"domain_scores_gemma":[0.99574393,0.0032288092,0.0001316753,0.00043691802,0.00038434964,0.00007429834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014175139,0.0015614325,0.0016073984,0.0015680477,0.0009247133,0.006024224,0.002118278,0.0016581836,0.016074033],"category_scores_gemma":[0.008756564,0.0011999918,0.0015570542,0.0061052972,0.0035174,0.008462407,0.0020552315,0.0064729676,0.0037175084],"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.00004607477,0.000057480538,0.00020604406,0.0009884256,0.000046415505,0.00006003497,0.00022751029,0.02101431,0.00046744072,0.67091364,0.08518592,0.22078659],"study_design_scores_gemma":[0.000015645444,0.000011394,0.00017378687,0.00022617757,0.000018439057,0.00013702619,0.00006724098,0.02506177,0.0003180172,0.88545066,0.088501364,0.000018536206],"about_ca_topic_score_codex":0.003953349,"about_ca_topic_score_gemma":0.0033456406,"teacher_disagreement_score":0.016074033,"about_ca_system_score_codex":0.003104305,"about_ca_system_score_gemma":0.0025435814,"threshold_uncertainty_score":0.053772986},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024439039,0.0019228904,0.9311976,0.0037389419,0.00036782396,0.0005413834,0.0052506765,0.0040236916,0.028518014],"genre_scores_gemma":[0.28407738,0.0024910085,0.6791746,0.001457523,0.0005140153,0.0010796739,0.017411105,0.00089875964,0.012895917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972675,0.001191899,0.00016813652,0.00047110603,0.0006415406,0.00025998816],"domain_scores_gemma":[0.9911007,0.0071201464,0.0003241856,0.0006489579,0.0006542218,0.00015174825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019855003,0.0016345613,0.00090596953,0.0017584163,0.0007913151,0.002834862,0.0022781075,0.0017372875,0.018466672],"category_scores_gemma":[0.017916648,0.0009698361,0.002235915,0.003018509,0.0014204666,0.003641522,0.0020693345,0.0045693116,0.0027525104],"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.0003165807,0.0004108708,0.00167318,0.00088897266,0.00013981508,0.0002664561,0.0003160285,0.46174335,0.0016704942,0.21721928,0.04078272,0.2745723],"study_design_scores_gemma":[0.00010746482,0.0000711383,0.00022999801,0.00014280643,0.000032477896,0.000087407956,0.00012755825,0.7312897,0.0013106986,0.25368354,0.012895712,0.000021503543],"about_ca_topic_score_codex":0.0040943394,"about_ca_topic_score_gemma":0.010355077,"teacher_disagreement_score":0.018466672,"about_ca_system_score_codex":0.00252985,"about_ca_system_score_gemma":0.0021159118,"threshold_uncertainty_score":0.061777174},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004879759,0.2132118,0.52634054,0.04184669,0.025751375,0.00025944473,0.001198307,0.0014695167,0.1850426],"genre_scores_gemma":[0.09989718,0.16385475,0.33261687,0.0052261944,0.027589992,0.0004347823,0.0028231384,0.002142158,0.365415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99689734,0.00082725915,0.0002553174,0.00057160493,0.0012956025,0.00015299472],"domain_scores_gemma":[0.9960639,0.0018997813,0.00011337411,0.0006104843,0.0010591637,0.0002532986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004042773,0.00086480385,0.0013833435,0.001992411,0.0013844328,0.005617977,0.0016334249,0.0013315794,0.049326442],"category_scores_gemma":[0.0056435727,0.0007510773,0.0012438892,0.0027227015,0.0023826722,0.006150916,0.0019001622,0.0037142355,0.008980509],"study_design_candidate":"not_applicable","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.00007875202,0.000076360084,0.00025081838,0.00072347594,0.00007474246,0.00008775977,0.0005605888,0.0011866917,0.0023532645,0.49318436,0.30188063,0.1995426],"study_design_scores_gemma":[0.000031249994,0.000050919552,0.0005804665,0.00032673829,0.000043435255,0.00027914776,0.00017376107,0.002985294,0.0017544411,0.238924,0.754818,0.000032577173],"about_ca_topic_score_codex":0.0019494467,"about_ca_topic_score_gemma":0.003203444,"teacher_disagreement_score":0.9980506,"about_ca_system_score_codex":0.003013459,"about_ca_system_score_gemma":0.0019763373,"threshold_uncertainty_score":0.16501343},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23666443,0.0021962908,0.6661971,0.0070132767,0.00051991973,0.00083487097,0.005836081,0.002378545,0.07835949],"genre_scores_gemma":[0.6514918,0.00062626373,0.3226077,0.0009613656,0.00012279184,0.00044739892,0.007138946,0.00053295476,0.016070774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,0.0007110321,0.000050314,0.00021339295,0.00026481232,0.00012019162],"domain_scores_gemma":[0.98717695,0.0114900945,0.00021884416,0.00049507344,0.00044215875,0.000176844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364031,0.0005828497,0.00046249796,0.0005110148,0.0005825029,0.0010784899,0.0014401596,0.0012454333,0.013556716],"category_scores_gemma":[0.019413697,0.00055813964,0.0009145008,0.000799451,0.0008380097,0.0017223991,0.0014049675,0.0020314637,0.0008720875],"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.00061560486,0.00070336676,0.0017838856,0.0010440884,0.00009051761,0.00053733605,0.0004651445,0.6364971,0.0049711773,0.12259912,0.054920275,0.17577234],"study_design_scores_gemma":[0.00015422935,0.00012766468,0.0004354873,0.00007119583,0.000027533593,0.00013834724,0.00029819418,0.86321163,0.0031721755,0.121427916,0.010917278,0.000018343566],"about_ca_topic_score_codex":0.003445927,"about_ca_topic_score_gemma":0.007867627,"teacher_disagreement_score":0.013556716,"about_ca_system_score_codex":0.0011314265,"about_ca_system_score_gemma":0.00077229564,"threshold_uncertainty_score":0.045351744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000806573,0.021577531,0.00051947794,0.015276128,0.0155088445,0.000035763154,0.0015221405,0.00016966436,0.9445839],"genre_scores_gemma":[0.002534639,0.0038346497,0.00013844679,0.00078722846,0.0011383317,0.000015265725,0.00025648397,0.00010916485,0.99118584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989994,0.0001005098,0.000055830096,0.00018714737,0.0005453131,0.00011177041],"domain_scores_gemma":[0.99894005,0.00023670658,0.00006888101,0.00011362127,0.00049193087,0.00014884616],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007962829,0.0011149144,0.00046585122,0.002613147,0.0044787666,0.0072017787,0.00077182223,0.001507714,0.31727967],"category_scores_gemma":[0.0034444553,0.00045198094,0.0003478873,0.003572615,0.0017168835,0.0026463228,0.0016004376,0.0022639032,0.100375615],"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.000016829055,0.0000062139493,0.00010867246,0.000052006937,0.0000018256594,0.00003098403,0.000065495056,0.000044870252,0.00006561126,0.009270726,0.97371405,0.01662274],"study_design_scores_gemma":[9.3942384e-7,0.0000023180403,0.00022527463,0.000049424387,0.0000010002727,0.000015639096,0.00003726393,0.000015189204,0.000045929315,0.0008129118,0.99879175,0.000002416482],"about_ca_topic_score_codex":0.0506311,"about_ca_topic_score_gemma":0.14233159,"teacher_disagreement_score":0.31727967,"about_ca_system_score_codex":0.008005955,"about_ca_system_score_gemma":0.0033360475,"threshold_uncertainty_score":0.9738177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9507927,0.0011159716,0.0007216952,0.0019959938,0.00003199905,0.0000068757963,0.0001306339,0.0000036188767,0.045200493],"genre_scores_gemma":[0.9727489,0.0011292506,0.00054201885,0.0001444691,0.0000085502215,0.0000072304915,0.00016745384,0.000019594007,0.025232552],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9998037,0.00005758272,0.0000047247167,0.000024162871,0.000023995603,0.00008580332],"domain_scores_gemma":[0.99989843,0.000031882868,0.0000224306,0.0000043768696,0.000011588248,0.000031281823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022969846,0.00013161208,0.00014034034,0.00021667065,0.002380136,0.0014702793,0.00043062848,0.00040717333,0.0051175514],"category_scores_gemma":[0.00086034386,0.0001761934,0.00010623166,0.0006613192,0.0020482487,0.0009972522,0.0010579983,0.0005890976,0.0002802807],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006818195,0.00036002044,0.09958534,0.00037892233,0.000068211,0.0116391005,0.41349584,0.012155328,0.0025497363,0.23375918,0.037891604,0.18743497],"study_design_scores_gemma":[0.00005222162,0.000098448414,0.08986166,0.00030156286,0.00003133439,0.0014125727,0.618651,0.005325582,0.0007919841,0.033090014,0.25030997,0.00007375091],"about_ca_topic_score_codex":0.17158727,"about_ca_topic_score_gemma":0.40801486,"teacher_disagreement_score":0.17158727,"about_ca_system_score_codex":0.0033736257,"about_ca_system_score_gemma":0.0010475647,"threshold_uncertainty_score":0.3411771},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30748737,0.010010588,0.07253627,0.23951034,0.0006412512,0.0016566602,0.00016459115,0.0005194048,0.36747348],"genre_scores_gemma":[0.9067615,0.0051639895,0.039236624,0.029159017,0.00012673855,0.0010186454,0.000110164256,0.000058795744,0.018364508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97943866,0.011703388,0.0012032172,0.0012077076,0.0050680866,0.0013789258],"domain_scores_gemma":[0.9510376,0.024645625,0.00898113,0.0033894118,0.010045857,0.0019004449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025555553,0.00034421583,0.00030814175,0.0024707844,0.0046842895,0.0072028697,0.0021642034,0.003304688,0.0036266788],"category_scores_gemma":[0.03243866,0.00030893128,0.0004385913,0.0020699361,0.008115802,0.0073298495,0.00489246,0.0044706375,0.000742273],"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.000046744895,0.0007696108,0.030669762,0.001548891,0.000050948736,0.0012776407,0.12009414,0.0013954696,0.00487156,0.51548725,0.031531956,0.29225597],"study_design_scores_gemma":[0.000046277844,0.0003531868,0.029489938,0.005671245,0.00011323511,0.0009656234,0.19072689,0.0032451688,0.0072359936,0.098857924,0.663119,0.00017554764],"about_ca_topic_score_codex":0.008776027,"about_ca_topic_score_gemma":0.010795587,"teacher_disagreement_score":0.025555553,"about_ca_system_score_codex":0.006554325,"about_ca_system_score_gemma":0.026531005,"threshold_uncertainty_score":0.13515228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024973376,0.010401485,0.0063547636,0.33323732,0.069906645,0.00030267437,0.00057597086,0.0027466954,0.55150104],"genre_scores_gemma":[0.093356244,0.004582536,0.0022293776,0.13973723,0.0056088124,0.00019650072,0.00032229515,0.0017115994,0.7522555],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99623895,0.0011633973,0.00008707433,0.00041593265,0.0007925456,0.0013022164],"domain_scores_gemma":[0.99506736,0.00062990567,0.00029600348,0.00028191268,0.0011730657,0.002551762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481854,0.0020782612,0.001007982,0.0018377474,0.019824347,0.006967971,0.0018761444,0.0071151634,0.15326062],"category_scores_gemma":[0.015442536,0.00077197194,0.0010313287,0.00090416713,0.006692144,0.009242849,0.011348556,0.01395953,0.061587922],"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.000030468464,0.000043041076,0.0006667299,0.000049258255,0.000007369073,0.0018513555,0.012505872,0.00002073315,0.00016538589,0.0057382686,0.95499563,0.023925804],"study_design_scores_gemma":[0.0000058794158,0.000030468005,0.00038784556,0.00022865133,0.000005225148,0.0021385802,0.036797114,0.000045727822,0.00008748428,0.0024664062,0.95778054,0.000026173222],"about_ca_topic_score_codex":0.009456225,"about_ca_topic_score_gemma":0.022749618,"teacher_disagreement_score":0.15326062,"about_ca_system_score_codex":0.0024870785,"about_ca_system_score_gemma":0.002690135,"threshold_uncertainty_score":0.5127078},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020188356,0.062059976,0.8617714,0.009136492,0.0019505688,0.0003355232,0.0007813396,0.00041514722,0.061530627],"genre_scores_gemma":[0.12692682,0.089020275,0.7392056,0.0036837042,0.007086833,0.002108839,0.0025223894,0.0006122886,0.028833322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98221385,0.010151545,0.0014128757,0.0015964385,0.0041015064,0.0005237101],"domain_scores_gemma":[0.97014725,0.024075458,0.0012425937,0.0017521351,0.0023970655,0.0003855344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013960298,0.0025101595,0.0025398303,0.0051570563,0.0020039855,0.0065498124,0.0025059422,0.002548332,0.017571589],"category_scores_gemma":[0.021546973,0.001186645,0.0029627457,0.014088734,0.0060266373,0.006742879,0.003678301,0.0076017417,0.0047577075],"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.000037427708,0.000059336453,0.00026887187,0.0012464505,0.00016845642,0.00016611653,0.00046015228,0.012180555,0.0002510307,0.8706131,0.025447255,0.08910115],"study_design_scores_gemma":[0.00003649967,0.000040963627,0.00023048712,0.00043567747,0.00004574894,0.00014153904,0.00017991812,0.020866122,0.00029972903,0.88597894,0.09171175,0.0000325714],"about_ca_topic_score_codex":0.0056473953,"about_ca_topic_score_gemma":0.004794689,"teacher_disagreement_score":0.017571589,"about_ca_system_score_codex":0.004992288,"about_ca_system_score_gemma":0.006561243,"threshold_uncertainty_score":0.07383001},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28974777,0.0025526574,0.17915285,0.0017396392,0.0011465243,0.0008634824,0.008691024,0.0025109835,0.51359516],"genre_scores_gemma":[0.89228845,0.00075350504,0.06693875,0.00039756222,0.00018685327,0.0005245955,0.0043536723,0.0003455642,0.034211088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978258,0.00043796352,0.00021368303,0.0005984203,0.0006093402,0.0003147768],"domain_scores_gemma":[0.9970463,0.00047325125,0.00054615154,0.00088336715,0.00076984864,0.000281128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008227493,0.0005569426,0.00041639686,0.0021026265,0.0016305161,0.002890767,0.0006464688,0.0006362722,0.020927062],"category_scores_gemma":[0.0042995657,0.0003249658,0.00073684205,0.0026499927,0.0021582586,0.004196254,0.002543059,0.0009024892,0.0034608885],"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.0004132733,0.0001434666,0.023155741,0.0006663319,0.00012493538,0.0008266798,0.005404257,0.0041874624,0.012334698,0.7398438,0.030477654,0.18242168],"study_design_scores_gemma":[0.00009732406,0.00024686859,0.04132226,0.0003470082,0.000109741144,0.0021246634,0.007459455,0.006344934,0.0061708093,0.31490386,0.62071204,0.00016103174],"about_ca_topic_score_codex":0.0039660376,"about_ca_topic_score_gemma":0.0059276433,"teacher_disagreement_score":0.020927062,"about_ca_system_score_codex":0.00094964815,"about_ca_system_score_gemma":0.0011052444,"threshold_uncertainty_score":0.07000804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010754248,0.025670195,0.722062,0.04641949,0.034374356,0.0008965981,0.0028322258,0.0031093308,0.15388155],"genre_scores_gemma":[0.095135994,0.025129098,0.6015339,0.009974194,0.015764816,0.0011073906,0.012815629,0.0034275458,0.23511131],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930443,0.0019667516,0.00047074616,0.0013689386,0.002426445,0.00072279095],"domain_scores_gemma":[0.98909503,0.004917332,0.00022064334,0.0015399738,0.0029814136,0.0012456396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008530995,0.0015904111,0.0016723466,0.0013932681,0.0016377462,0.0065492443,0.0048761927,0.0036129807,0.043581553],"category_scores_gemma":[0.0150287105,0.0010853817,0.003494833,0.0027047624,0.001607733,0.00638429,0.005047794,0.008569014,0.009738942],"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.00042835425,0.00045431327,0.00041544627,0.0006478117,0.00017466447,0.00041656426,0.0005786255,0.023669513,0.0024150498,0.10480716,0.5497011,0.31629142],"study_design_scores_gemma":[0.00009087463,0.00015817516,0.00044696563,0.00034648704,0.00006138871,0.00033441512,0.00035968426,0.03148815,0.0028319082,0.048592772,0.91523296,0.000056093864],"about_ca_topic_score_codex":0.008549066,"about_ca_topic_score_gemma":0.0070135193,"teacher_disagreement_score":0.043581553,"about_ca_system_score_codex":0.0040590772,"about_ca_system_score_gemma":0.005475791,"threshold_uncertainty_score":0.14579481},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13383316,0.03367364,0.02410629,0.043905508,0.012441619,0.0015345704,0.031577237,0.015740007,0.70318794],"genre_scores_gemma":[0.31018934,0.015360443,0.063630044,0.009223493,0.001740249,0.0010097193,0.21360675,0.0054154755,0.37982458],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9934517,0.0011711298,0.00026335285,0.0007861798,0.0029710904,0.0013564848],"domain_scores_gemma":[0.9894441,0.001591964,0.00017675049,0.00076772517,0.003848134,0.004171226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069928733,0.0020751623,0.0018114762,0.0036366412,0.006835554,0.008914083,0.0042049843,0.0034881465,0.053498],"category_scores_gemma":[0.01203878,0.0014460029,0.0013371474,0.008614228,0.0017455874,0.0020591365,0.0043376987,0.0041759633,0.020037359],"study_design_candidate":"observational","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.0004432688,0.00038554173,0.0023211918,0.00038368814,0.000087308275,0.00020530219,0.00015195252,0.00548963,0.0009125212,0.009534751,0.8852426,0.09484221],"study_design_scores_gemma":[0.00073147955,0.00029727304,0.0072549446,0.00027600682,0.000053295116,0.00021881942,0.00060141354,0.02259612,0.0021060947,0.009634113,0.95614207,0.00008849751],"about_ca_topic_score_codex":0.2159053,"about_ca_topic_score_gemma":0.46648887,"teacher_disagreement_score":0.7840947,"about_ca_system_score_codex":0.013043176,"about_ca_system_score_gemma":0.01603245,"threshold_uncertainty_score":0.4292972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06114196,0.009968572,0.78383744,0.005870155,0.00067853805,0.00040220574,0.00074860535,0.0027649403,0.13458759],"genre_scores_gemma":[0.46748975,0.006162788,0.49828386,0.00088627206,0.00055535353,0.0004710016,0.0017422556,0.0013512992,0.023057368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887123,0.0035303344,0.0004716378,0.001379198,0.005150026,0.0007564065],"domain_scores_gemma":[0.9448472,0.042648092,0.0011612693,0.0042819073,0.0062838453,0.0007776062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009113697,0.00179072,0.0013560847,0.004303205,0.0028205456,0.006960156,0.0037413517,0.0019891993,0.017997785],"category_scores_gemma":[0.05264703,0.0010115211,0.002134695,0.005281231,0.00438691,0.006115531,0.0026882566,0.0032948065,0.0022154092],"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.000551689,0.0003286972,0.0030822358,0.0008188684,0.00012547734,0.000099602315,0.00038163425,0.26256067,0.0015417332,0.55884206,0.016816737,0.15485063],"study_design_scores_gemma":[0.00012746101,0.00015744724,0.0007994591,0.0003247204,0.00008808622,0.000107014755,0.0001716771,0.7716944,0.0023613551,0.20563531,0.01849361,0.000039362374],"about_ca_topic_score_codex":0.04779915,"about_ca_topic_score_gemma":0.029334838,"teacher_disagreement_score":0.04779915,"about_ca_system_score_codex":0.014213764,"about_ca_system_score_gemma":0.008129402,"threshold_uncertainty_score":0.10312855},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071628396,0.02902186,0.008027058,0.07928218,0.22577445,0.0033986112,0.02853008,0.0027860678,0.6160168],"genre_scores_gemma":[0.010064387,0.007285989,0.0019857758,0.0023367102,0.006045125,0.00046060875,0.009197103,0.00045034377,0.962174],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824536,0.00015084009,0.00007009533,0.00039989807,0.0006525891,0.00048122116],"domain_scores_gemma":[0.99065393,0.00019663623,0.00014127899,0.00028243958,0.0032366898,0.005489094],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026890568,0.0016744592,0.001083626,0.0024537165,0.0045051,0.0061874366,0.0018021489,0.0021969897,0.40113464],"category_scores_gemma":[0.0027462714,0.0006578674,0.00076037925,0.003183452,0.00079735345,0.0020413226,0.0030980913,0.0024713743,0.18982211],"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.00007462608,0.000021693415,0.00016999684,0.00011331631,0.0000039751694,0.00006242251,0.00009201655,0.000118419375,0.00042938304,0.00084055885,0.97840023,0.019673295],"study_design_scores_gemma":[0.0000130795115,0.000014838084,0.00082272326,0.00010394976,0.000003671216,0.000017348586,0.00033606903,0.00006971007,0.000107388056,0.00022982036,0.99827194,0.000009559178],"about_ca_topic_score_codex":0.20908779,"about_ca_topic_score_gemma":0.5538419,"teacher_disagreement_score":0.5988654,"about_ca_system_score_codex":0.012437518,"about_ca_system_score_gemma":0.023711847,"threshold_uncertainty_score":0.85420877},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00963028,0.02308323,0.020350331,0.015046444,0.004546656,0.00033122263,0.017187668,0.002420828,0.9074034],"genre_scores_gemma":[0.057301585,0.014821383,0.020459825,0.001093821,0.0005198566,0.00027068457,0.009591767,0.0009124468,0.8950287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970939,0.00031617327,0.000071520786,0.0011318784,0.00087069767,0.00051580736],"domain_scores_gemma":[0.99781346,0.0006163225,0.000107278356,0.00030840808,0.0007586798,0.00039586864],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009980381,0.0021933424,0.0017303103,0.0019346606,0.002752966,0.005316004,0.0018327362,0.001682651,0.4128921],"category_scores_gemma":[0.0031238727,0.0005636716,0.0010003028,0.0024632027,0.001565589,0.0019622245,0.0025600025,0.0022590314,0.16305086],"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.0007417703,0.00023928587,0.004462867,0.0014515888,0.00015885821,0.0018132594,0.000606631,0.005849153,0.0056968695,0.19826077,0.40429848,0.37642038],"study_design_scores_gemma":[0.0000725913,0.00006137591,0.0031396477,0.00020343675,0.00002189789,0.00026866866,0.0001426317,0.0018904005,0.001485626,0.008992698,0.9836622,0.00005885523],"about_ca_topic_score_codex":0.16620488,"about_ca_topic_score_gemma":0.16538604,"teacher_disagreement_score":0.5871079,"about_ca_system_score_codex":0.0076562064,"about_ca_system_score_gemma":0.007665073,"threshold_uncertainty_score":0.83743817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065631038,0.024716511,0.8922001,0.018979326,0.0031598958,0.00050316483,0.0014816236,0.002392109,0.050004207],"genre_scores_gemma":[0.067995586,0.03206881,0.79945385,0.0018649903,0.002251721,0.00052284176,0.00522017,0.0014276066,0.0891944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942753,0.0018236237,0.0005403602,0.000977221,0.0019278745,0.0004557129],"domain_scores_gemma":[0.9903502,0.004240589,0.00029172533,0.0017867003,0.00262183,0.0007089004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008964626,0.0018897221,0.0032506692,0.0019105115,0.0029872467,0.009978251,0.0048732827,0.0026226842,0.032466784],"category_scores_gemma":[0.009514987,0.001959216,0.0018029414,0.006790643,0.005708329,0.0058157784,0.0036525251,0.0066627683,0.005111859],"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.00041035478,0.00035141976,0.0017678882,0.0015435347,0.00046147447,0.0008032718,0.0010768926,0.053829256,0.0042641996,0.20673336,0.27177542,0.45698288],"study_design_scores_gemma":[0.0002237709,0.00011627187,0.0012937547,0.0006677816,0.00020465185,0.0007405192,0.00075686496,0.2401805,0.005962608,0.14566149,0.60406893,0.00012290516],"about_ca_topic_score_codex":0.26773116,"about_ca_topic_score_gemma":0.39964107,"teacher_disagreement_score":0.26773116,"about_ca_system_score_codex":0.012630776,"about_ca_system_score_gemma":0.026769226,"threshold_uncertainty_score":0.5323456},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21563005,0.0071274475,0.0096226595,0.048679247,0.00026530278,0.000066114066,0.00045870687,0.000048809325,0.71810174],"genre_scores_gemma":[0.9866498,0.001273057,0.0014518724,0.000867362,0.000034947334,0.00003229728,0.00007794523,0.000034385714,0.0095783295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819934,0.00051529496,0.000030389516,0.0000958083,0.00054908596,0.00061015465],"domain_scores_gemma":[0.9972996,0.0010973988,0.0001821976,0.00012561776,0.00091244216,0.00038270903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016457997,0.00041197275,0.0004763349,0.002486402,0.00926959,0.008674497,0.0023284114,0.002326081,0.017097173],"category_scores_gemma":[0.008380129,0.00029465076,0.0004148702,0.007295888,0.019068152,0.0041785478,0.0024519209,0.0029116329,0.00028168366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000056781875,0.000013570792,0.00080755475,0.00004650686,0.000007153494,0.00009053474,0.006379645,0.0013337049,0.000064176515,0.9802351,0.0043984717,0.006566786],"study_design_scores_gemma":[0.00007775754,0.000058663474,0.026010891,0.0004937129,0.0000747501,0.00027139919,0.18014869,0.008360744,0.00024134302,0.5714977,0.2126348,0.00012954876],"about_ca_topic_score_codex":0.92087525,"about_ca_topic_score_gemma":0.9301861,"teacher_disagreement_score":0.07912475,"about_ca_system_score_codex":0.072457194,"about_ca_system_score_gemma":0.03684146,"threshold_uncertainty_score":0.5257162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008590449,0.009246904,0.22900102,0.045928374,0.088959955,0.0009817957,0.021884093,0.0058204765,0.589587],"genre_scores_gemma":[0.03484571,0.0051609944,0.089750305,0.002339397,0.0036178804,0.00019977785,0.007833441,0.004424332,0.85182816],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981731,0.00028721415,0.000121313526,0.00048837886,0.0007357108,0.00019413116],"domain_scores_gemma":[0.9922276,0.001723696,0.00023125047,0.0013100844,0.0038587702,0.0006486254],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032469216,0.0008849794,0.0018000663,0.0015912078,0.0026182102,0.008104421,0.0024773297,0.0015178914,0.4740287],"category_scores_gemma":[0.015438593,0.0009085554,0.0009891447,0.0042250524,0.0017373799,0.0038766982,0.0024908788,0.0021063958,0.11298126],"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.00022371944,0.00007953626,0.0011074329,0.00055159006,0.000096087104,0.00026502242,0.00022604183,0.0030665528,0.001566563,0.036156394,0.7572985,0.19936252],"study_design_scores_gemma":[0.000048720492,0.000030416975,0.00083700474,0.0001998468,0.000024865205,0.00021451968,0.00016664641,0.007841239,0.0016272949,0.013482291,0.975491,0.0000360482],"about_ca_topic_score_codex":0.03322599,"about_ca_topic_score_gemma":0.07556557,"teacher_disagreement_score":0.4740287,"about_ca_system_score_codex":0.0043772133,"about_ca_system_score_gemma":0.0063003357,"threshold_uncertainty_score":0.7502342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015867035,0.00009241894,0.9843353,0.00024288525,0.000043718363,0.00006427213,0.00021055316,0.0007374513,0.012686755],"genre_scores_gemma":[0.11177538,0.00025980093,0.87498516,0.00035310167,0.00009009899,0.00039124567,0.00070246734,0.0008426352,0.010600115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822074,0.0005342218,0.000086958295,0.00024077049,0.00076624996,0.00015098936],"domain_scores_gemma":[0.99853086,0.00050724496,0.00006514868,0.00039892783,0.0004134325,0.00008438685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022886088,0.0010881646,0.0007564058,0.00091043074,0.000863963,0.0024350386,0.0026064026,0.0010000255,0.019494247],"category_scores_gemma":[0.005504046,0.00050798437,0.0011887572,0.0010407115,0.0014345769,0.0021948863,0.0026455794,0.0027440654,0.004185055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037835554,0.000060025268,0.00023839317,0.00013648854,0.000025282201,0.000060726863,0.0000766402,0.2464974,0.0018482546,0.6816165,0.00900304,0.060399413],"study_design_scores_gemma":[0.000013951386,0.000017910894,0.000050464838,0.000023704242,0.000006642976,0.000028567287,0.000023811997,0.75859225,0.0011869047,0.220959,0.01908399,0.000012810621],"about_ca_topic_score_codex":0.0035044127,"about_ca_topic_score_gemma":0.0059268675,"teacher_disagreement_score":0.019494247,"about_ca_system_score_codex":0.0016886065,"about_ca_system_score_gemma":0.0025697555,"threshold_uncertainty_score":0.06521469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02451978,0.0009942048,0.93019086,0.002913532,0.00024013084,0.00037340893,0.0007884953,0.0018491625,0.038130417],"genre_scores_gemma":[0.26633778,0.0014389633,0.7044376,0.001192975,0.0007287647,0.0008290852,0.0030132872,0.0012355754,0.020785922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970722,0.0009197199,0.00014549654,0.0006300151,0.00088820443,0.00034428242],"domain_scores_gemma":[0.9949845,0.003114208,0.00026096284,0.0011037241,0.00034311262,0.00019351506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040204,0.0014422628,0.0012807363,0.0015361579,0.0013895709,0.0033654831,0.0035173781,0.0015475397,0.011149391],"category_scores_gemma":[0.011010055,0.000735495,0.0027793306,0.003156526,0.0020585095,0.005823879,0.0049454696,0.0056184484,0.0026876787],"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.00014383985,0.00023058259,0.00042635578,0.00033452286,0.000049143753,0.00012183432,0.0002730844,0.044593673,0.002004588,0.7917893,0.019211227,0.14082175],"study_design_scores_gemma":[0.000052768868,0.000022539787,0.00013212644,0.000038266397,0.000029801417,0.00011649571,0.00005508643,0.12951656,0.0015070713,0.85926586,0.009243675,0.000019760697],"about_ca_topic_score_codex":0.002317211,"about_ca_topic_score_gemma":0.0029616966,"teacher_disagreement_score":0.011149391,"about_ca_system_score_codex":0.003128442,"about_ca_system_score_gemma":0.0025645238,"threshold_uncertainty_score":0.03729838},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022602547,0.004825897,0.8061313,0.018357862,0.0010970365,0.0008226137,0.012130233,0.0017110733,0.13232142],"genre_scores_gemma":[0.38577378,0.008310023,0.5000679,0.007443886,0.0023054432,0.0016249827,0.024785694,0.0009718204,0.068716496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918937,0.0021855605,0.00072884123,0.001906429,0.0024166263,0.0008688172],"domain_scores_gemma":[0.9899995,0.006376181,0.00076172344,0.0011682815,0.0012096807,0.00048473597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036403998,0.0015058611,0.0019766195,0.00168307,0.0026026394,0.0065470045,0.0038923798,0.0030973256,0.030642526],"category_scores_gemma":[0.015931387,0.0008981559,0.00358868,0.0051796883,0.0029814225,0.010178109,0.004991812,0.006758459,0.005086085],"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.00009956761,0.0001086876,0.00039029762,0.00059786084,0.00009147649,0.00024841665,0.0002755339,0.014253809,0.0007785793,0.9012686,0.03539362,0.046493515],"study_design_scores_gemma":[0.00008025692,0.000040187264,0.00019653377,0.00011106063,0.000042141364,0.00044497676,0.00023241763,0.042052615,0.0010179137,0.8768772,0.0788605,0.000044233402],"about_ca_topic_score_codex":0.0029512781,"about_ca_topic_score_gemma":0.0035599743,"teacher_disagreement_score":0.030642526,"about_ca_system_score_codex":0.003307447,"about_ca_system_score_gemma":0.0029409456,"threshold_uncertainty_score":0.1025095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008427128,0.0004605331,0.9861369,0.0013413805,0.000048921145,0.00010609752,0.00046274296,0.0003783045,0.002637938],"genre_scores_gemma":[0.29968992,0.0022123698,0.6899657,0.000932473,0.00044611402,0.0005463157,0.0016448732,0.0002405252,0.004321775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971585,0.00084386,0.00017355345,0.00082840835,0.00070749153,0.00028811165],"domain_scores_gemma":[0.98077077,0.013569239,0.0015490121,0.0024451255,0.0011449384,0.00052090094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264663,0.0016571908,0.0018215724,0.0050492478,0.0012483092,0.0031079429,0.0050436407,0.0030887271,0.006837179],"category_scores_gemma":[0.024203075,0.0011697899,0.0034980222,0.0061107506,0.0041117645,0.0077706105,0.0033093465,0.0057741115,0.00084642577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052776642,0.00024689618,0.0036624507,0.00029525347,0.00017125011,0.00022640289,0.00014295444,0.33935645,0.001195673,0.5925837,0.008629206,0.053436972],"study_design_scores_gemma":[0.000015104302,0.000028823286,0.0005572331,0.000025386273,0.000020055877,0.00007203777,0.000024910669,0.54172474,0.00022038976,0.45546243,0.0018279966,0.000020863527],"about_ca_topic_score_codex":0.007841549,"about_ca_topic_score_gemma":0.007672799,"teacher_disagreement_score":0.007841549,"about_ca_system_score_codex":0.0021362435,"about_ca_system_score_gemma":0.0029071828,"threshold_uncertainty_score":0.022872686},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020072556,0.81283826,0.14215028,0.024711331,0.0010909007,0.000051564257,0.00014255036,0.00030771564,0.016700197],"genre_scores_gemma":[0.026872622,0.826269,0.1330435,0.0046101464,0.005829539,0.00013056981,0.0003591939,0.00029409604,0.002591336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99109113,0.004101295,0.0005382877,0.0009606853,0.0029141381,0.00039447923],"domain_scores_gemma":[0.9612495,0.03216452,0.00077787455,0.0017449281,0.0032799612,0.000783294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015466283,0.0020195413,0.0027763073,0.004567009,0.0011448708,0.010251944,0.0044536786,0.0039390423,0.007549338],"category_scores_gemma":[0.024931395,0.0016597772,0.001806423,0.015514919,0.004889225,0.025771236,0.0063805375,0.009932193,0.0024014155],"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.000093714494,0.00012911182,0.0010111923,0.006944271,0.00023606668,0.00012627596,0.0005483917,0.007995124,0.00039605395,0.28433007,0.025099136,0.6730905],"study_design_scores_gemma":[0.000031584,0.00011969936,0.0007531536,0.0060133,0.00011460987,0.00042714717,0.001113778,0.03756401,0.00087373675,0.5298343,0.4230014,0.00015329609],"about_ca_topic_score_codex":0.004158449,"about_ca_topic_score_gemma":0.004251909,"teacher_disagreement_score":0.015466283,"about_ca_system_score_codex":0.0032355308,"about_ca_system_score_gemma":0.005942097,"threshold_uncertainty_score":0.0817945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027222573,0.0065520457,0.01743805,0.0015625185,0.0018530964,0.000510835,0.018939028,0.020573784,0.9298483],"genre_scores_gemma":[0.0051116752,0.0028323748,0.0031409485,0.000857474,0.00013667026,0.0002721945,0.011107062,0.0026102343,0.9739314],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925655,0.000053832064,0.000058523383,0.00022409609,0.00024792473,0.00015907698],"domain_scores_gemma":[0.998664,0.00032810477,0.00007128129,0.00045873038,0.00027531004,0.0002025082],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016541531,0.0038037912,0.0026476635,0.0028668095,0.002397301,0.0045396923,0.0031607163,0.0050492506,0.9410723],"category_scores_gemma":[0.002996028,0.0019025059,0.0013781453,0.010353025,0.0014865771,0.009263129,0.005461025,0.0028877405,0.9564283],"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.00029486112,0.00020752504,0.00046266802,0.0006679195,0.000050313196,0.00020161933,0.00010005688,0.0010215086,0.0012721661,0.0077348505,0.64757895,0.3404076],"study_design_scores_gemma":[0.000052322983,0.000037789043,0.0007076211,0.00028857065,0.000051575742,0.00015057274,0.00007492527,0.0012518583,0.0005880027,0.0022249667,0.9945365,0.00003521204],"about_ca_topic_score_codex":0.020941786,"about_ca_topic_score_gemma":0.014705367,"teacher_disagreement_score":0.058927715,"about_ca_system_score_codex":0.0026264726,"about_ca_system_score_gemma":0.0011360829,"threshold_uncertainty_score":0.08405322},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8154466,0.003967814,0.11938897,0.0008182041,0.00033002553,0.00051184813,0.002871312,0.0029140401,0.053751152],"genre_scores_gemma":[0.8580886,0.0010452212,0.1338054,0.00021562015,0.00004144829,0.0003648968,0.003385616,0.0004971274,0.002556043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741864,0.0010790235,0.00016162271,0.00028467618,0.0008265527,0.00022944814],"domain_scores_gemma":[0.9956701,0.0028855084,0.00014338766,0.00065454707,0.00054145476,0.00010501617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030305076,0.000808481,0.0006420268,0.0010489358,0.00048167954,0.00086999923,0.0015019586,0.0010238786,0.0028936095],"category_scores_gemma":[0.009265916,0.0002682385,0.00052274304,0.0018136563,0.00076679204,0.0011200599,0.0010177037,0.00089499075,0.0005735994],"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.0004439251,0.0005407426,0.004964159,0.00088443846,0.00019462287,0.0001658935,0.00020258914,0.86461955,0.0042513623,0.014237054,0.00935851,0.10013714],"study_design_scores_gemma":[0.00021546033,0.00073849515,0.0033896524,0.00011641706,0.000039972783,0.00010755673,0.00023882606,0.96459323,0.008414313,0.009825224,0.012286891,0.00003398508],"about_ca_topic_score_codex":0.003918522,"about_ca_topic_score_gemma":0.005513518,"teacher_disagreement_score":0.003918522,"about_ca_system_score_codex":0.00066072354,"about_ca_system_score_gemma":0.0009901711,"threshold_uncertainty_score":0.016027033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04682677,0.00037370386,0.94352984,0.0004892044,0.000090345646,0.00016750552,0.00018643195,0.00095822866,0.007377954],"genre_scores_gemma":[0.4551939,0.00019615855,0.5396059,0.0002617421,0.00006551661,0.00027149275,0.00042489535,0.00036105717,0.0036193924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982516,0.00075595436,0.00005541189,0.00030830142,0.0003909915,0.00023759544],"domain_scores_gemma":[0.99308807,0.0050371755,0.00031657843,0.00088442414,0.0003983307,0.00027543056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024707785,0.00084935536,0.0009775832,0.0007540905,0.00072422373,0.0012392008,0.002628582,0.0012007544,0.0075654853],"category_scores_gemma":[0.011526075,0.0005874705,0.0011527247,0.0013994976,0.0015146472,0.002917306,0.0019989402,0.002298906,0.0007139824],"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.00037327455,0.00037807698,0.0014044187,0.00030702326,0.000120727134,0.00015908331,0.00028557816,0.7141233,0.00442221,0.12898365,0.0065369466,0.14290574],"study_design_scores_gemma":[0.00007471051,0.00006307091,0.00011502273,0.0000132666955,0.000017556302,0.000036830254,0.0000338403,0.9562422,0.0012482546,0.04001326,0.002130144,0.000011778405],"about_ca_topic_score_codex":0.004933716,"about_ca_topic_score_gemma":0.005142328,"teacher_disagreement_score":0.0075654853,"about_ca_system_score_codex":0.001036604,"about_ca_system_score_gemma":0.0018510867,"threshold_uncertainty_score":0.025309086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003278436,0.00010518268,0.99075717,0.00042163004,0.000044044897,0.00012073119,0.00012146987,0.0011427809,0.0040087374],"genre_scores_gemma":[0.15798517,0.00057530176,0.8210762,0.00063994917,0.00012754447,0.0012579757,0.00058536156,0.0010649491,0.016687613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972421,0.0011425875,0.00024390695,0.0003926338,0.0007053289,0.00027342583],"domain_scores_gemma":[0.9972011,0.0011834393,0.00031199446,0.00079745415,0.00025677672,0.0002491582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029545703,0.0013868879,0.0006736231,0.0008205136,0.0015542663,0.0034130514,0.0028606073,0.002448464,0.005853159],"category_scores_gemma":[0.005730184,0.0010856325,0.001992561,0.00086154277,0.0032738908,0.0067170025,0.0045783687,0.0042876196,0.0013974786],"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.00016024621,0.0000842147,0.00064918044,0.00020960327,0.000069126014,0.00030400197,0.00092365086,0.08054226,0.004065446,0.8797559,0.005215687,0.028020697],"study_design_scores_gemma":[0.00013304823,0.00012232106,0.00019599599,0.00014631776,0.00008974976,0.00028739078,0.00021903166,0.40962005,0.008732304,0.46364394,0.116726175,0.000083643616],"about_ca_topic_score_codex":0.0046042544,"about_ca_topic_score_gemma":0.0066017597,"teacher_disagreement_score":0.005853159,"about_ca_system_score_codex":0.0013474815,"about_ca_system_score_gemma":0.0028103509,"threshold_uncertainty_score":0.019580722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033571344,0.00063624117,0.9592401,0.0004951605,0.00009846424,0.00014017765,0.0004837068,0.0005584175,0.004776524],"genre_scores_gemma":[0.3138655,0.00089942175,0.67860174,0.0003449003,0.000103784514,0.00035846877,0.0016799812,0.00028315815,0.0038630909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963246,0.001265821,0.00019787838,0.00053106516,0.0012134821,0.00046715426],"domain_scores_gemma":[0.9919769,0.005592495,0.0004361346,0.0009990912,0.0007179184,0.0002774638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00426956,0.0014352383,0.0018544595,0.0016173904,0.00074873836,0.003000381,0.0018171499,0.0012258715,0.0053591058],"category_scores_gemma":[0.01714674,0.0006129567,0.0018434778,0.0033664317,0.00085353275,0.004758742,0.0021347743,0.0035356327,0.00091806724],"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.00059652556,0.00028021802,0.0022032429,0.00040530038,0.00020473423,0.00017396476,0.00022353865,0.6747487,0.0027622655,0.109779656,0.007941933,0.20068],"study_design_scores_gemma":[0.00001594197,0.00004205092,0.00013451277,0.000019509764,0.000022816359,0.000054774748,0.000035921472,0.9441782,0.00061256386,0.053765796,0.0011104922,0.0000073528404],"about_ca_topic_score_codex":0.005575921,"about_ca_topic_score_gemma":0.007596528,"teacher_disagreement_score":0.005575921,"about_ca_system_score_codex":0.0030566512,"about_ca_system_score_gemma":0.0028806645,"threshold_uncertainty_score":0.022579849},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022474172,0.00022750982,0.96399355,0.00017792801,0.000052086627,0.00013610635,0.0002652139,0.008441237,0.0042321947],"genre_scores_gemma":[0.21120854,0.00039707043,0.7820244,0.00018822329,0.00006498641,0.00053442677,0.0013452085,0.0017607271,0.0024764491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845755,0.00033014503,0.00011422614,0.0002772575,0.0006251283,0.00019571977],"domain_scores_gemma":[0.9960747,0.0024031233,0.0002858523,0.0007402871,0.0004242497,0.00007184465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009269031,0.001561202,0.00076273707,0.0008383213,0.00040360214,0.0013894975,0.0012590189,0.00059632084,0.0047580963],"category_scores_gemma":[0.0073077367,0.0007595761,0.001177546,0.0010228427,0.0009729675,0.0020788675,0.0019884924,0.0016120909,0.0014243814],"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.00027543472,0.00023607984,0.0012719877,0.00080277445,0.000079843645,0.0002761804,0.00036268626,0.5931622,0.027917884,0.073729016,0.009191727,0.29269415],"study_design_scores_gemma":[0.000068780784,0.00009883032,0.0001603286,0.000044327604,0.00002763281,0.0000619517,0.000065617874,0.9433813,0.012792248,0.035698038,0.007588696,0.000012290633],"about_ca_topic_score_codex":0.0012858553,"about_ca_topic_score_gemma":0.0022548481,"teacher_disagreement_score":0.0047580963,"about_ca_system_score_codex":0.0008345939,"about_ca_system_score_gemma":0.0018634949,"threshold_uncertainty_score":0.01591742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09584026,0.00037491944,0.8772085,0.0021572593,0.00021661294,0.00037216715,0.00033938308,0.0040443526,0.019446656],"genre_scores_gemma":[0.5845693,0.000549022,0.4073019,0.0004130235,0.00006019612,0.00028342853,0.000647724,0.00064030476,0.005535099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791235,0.00087986403,0.00011165986,0.0002792859,0.00057601836,0.00024076864],"domain_scores_gemma":[0.9951616,0.002966953,0.00023028257,0.00090334984,0.0004614205,0.00027650147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001901044,0.00087297295,0.00074634864,0.00058271893,0.0008058517,0.00277904,0.0023022802,0.0012437286,0.00489019],"category_scores_gemma":[0.011458509,0.0008365633,0.00076514133,0.0009861562,0.0012748016,0.0038167108,0.0033764022,0.0021538003,0.00093911093],"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.00018607624,0.00030655184,0.0014296809,0.00022845135,0.00009084351,0.00032654515,0.0004712075,0.875963,0.0073265587,0.048577093,0.0043401076,0.06075389],"study_design_scores_gemma":[0.000017638908,0.00003864121,0.00007026676,0.00001628792,0.000014883383,0.00002138862,0.00013654499,0.97086954,0.0014814625,0.024421094,0.0029047607,0.000007602449],"about_ca_topic_score_codex":0.010352526,"about_ca_topic_score_gemma":0.015597786,"teacher_disagreement_score":0.010352526,"about_ca_system_score_codex":0.0011810377,"about_ca_system_score_gemma":0.0021621275,"threshold_uncertainty_score":0.020584524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043820376,0.00013139287,0.9917338,0.00019458706,0.000045693043,0.00019862696,0.00005667026,0.00034180743,0.0029153384],"genre_scores_gemma":[0.18809806,0.00025796378,0.80658466,0.00017575973,0.00006423665,0.000711734,0.00027125163,0.00022524373,0.0036110207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644715,0.0016141287,0.00018436607,0.00037682772,0.0011644864,0.00021312035],"domain_scores_gemma":[0.9971106,0.0012867304,0.00028133337,0.0006855638,0.00034639856,0.00028934874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038313952,0.00066155556,0.0011057409,0.00090961653,0.0012095055,0.0017232463,0.0036953331,0.0014495923,0.0039046134],"category_scores_gemma":[0.008505602,0.00054192403,0.0006721555,0.0014681114,0.0013250604,0.0028947874,0.0048158825,0.0021679695,0.0008136174],"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.00025673117,0.0003538355,0.0012461479,0.0004061883,0.00019022591,0.00042818466,0.0005740754,0.4235021,0.008515938,0.267351,0.01322461,0.28395095],"study_design_scores_gemma":[0.00008451794,0.0000916379,0.00017881583,0.000029142479,0.000021942837,0.00020125981,0.000098250974,0.9060875,0.0028531079,0.07050427,0.019816808,0.000032709606],"about_ca_topic_score_codex":0.0031316143,"about_ca_topic_score_gemma":0.0034339563,"teacher_disagreement_score":0.0039046134,"about_ca_system_score_codex":0.0008848517,"about_ca_system_score_gemma":0.0028026018,"threshold_uncertainty_score":0.020262659},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8729004,0.0124436105,0.046312742,0.0038869744,0.00046450458,0.00039781496,0.031660214,0.0036669653,0.02826679],"genre_scores_gemma":[0.92115355,0.0024173115,0.021154568,0.0007870672,0.00017799539,0.00019562397,0.04983699,0.00061275205,0.0036641613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469805,0.002450567,0.00031629525,0.0011976494,0.0010491861,0.0002883402],"domain_scores_gemma":[0.9232189,0.065371856,0.0024539807,0.0059383702,0.002245406,0.0007714267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047577033,0.0012297017,0.0008864268,0.0023382339,0.0010505279,0.002270459,0.0020855297,0.0015848322,0.01561495],"category_scores_gemma":[0.058204792,0.0005913354,0.0012025011,0.00510721,0.0013713959,0.0062072338,0.0013169465,0.003200105,0.003501019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025568092,0.0025109071,0.328425,0.0036191647,0.0014648417,0.0010011096,0.0011855512,0.10551648,0.0029602125,0.03171266,0.18836448,0.33068284],"study_design_scores_gemma":[0.0004958113,0.0011883731,0.1374756,0.0007517582,0.0008298547,0.0043318802,0.0031477644,0.69600844,0.0061640637,0.05267921,0.0967811,0.0001461307],"about_ca_topic_score_codex":0.0067624,"about_ca_topic_score_gemma":0.009033596,"teacher_disagreement_score":0.01561495,"about_ca_system_score_codex":0.0011965096,"about_ca_system_score_gemma":0.00101911,"threshold_uncertainty_score":0.052237213},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125751095,0.00012764601,0.9795328,0.00021935017,0.000033127788,0.00007407634,0.000076823555,0.0004408752,0.006920157],"genre_scores_gemma":[0.35555393,0.00025938207,0.63974583,0.000083166546,0.000017745218,0.00018016373,0.00019494245,0.00013961036,0.0038252273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.0001519272,0.000029894307,0.00008543241,0.00016087039,0.00005292653],"domain_scores_gemma":[0.99926835,0.00042555027,0.00006668328,0.00008707662,0.00011752089,0.00003473666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008326033,0.00093863945,0.0006759182,0.0010530681,0.0011334665,0.0014923114,0.0013023347,0.0010623782,0.0045836223],"category_scores_gemma":[0.0023828298,0.0008086389,0.0009865602,0.0012782174,0.0009799056,0.0016829098,0.0014844821,0.0010046556,0.00043969284],"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.000046546254,0.000053663232,0.0004378101,0.00010382363,0.00003436065,0.000070211536,0.00010115582,0.9268358,0.0027920417,0.024125673,0.0008324435,0.044566445],"study_design_scores_gemma":[0.000006328253,0.000010123404,0.000039954848,0.0000061279984,0.000005751531,0.0000061643746,0.000017389433,0.9889789,0.0007621681,0.009372316,0.0007898558,0.000004935932],"about_ca_topic_score_codex":0.02530857,"about_ca_topic_score_gemma":0.03689016,"teacher_disagreement_score":0.02530857,"about_ca_system_score_codex":0.0015222692,"about_ca_system_score_gemma":0.0022144355,"threshold_uncertainty_score":0.050322533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19847797,0.0011655815,0.7692813,0.0039226697,0.00009351153,0.0002988194,0.0011171557,0.00092533435,0.024717743],"genre_scores_gemma":[0.77988994,0.0011779338,0.20266797,0.0009896104,0.00015409425,0.0006609447,0.0026965358,0.00046156053,0.011301485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348396,0.0024697077,0.0004966571,0.0013661431,0.0015070639,0.00067639054],"domain_scores_gemma":[0.9836789,0.011893561,0.00073662185,0.0018823784,0.0013913066,0.00041717626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038857958,0.001003087,0.0014723768,0.00096507155,0.0011803056,0.0031862704,0.0023922543,0.0013038893,0.004653608],"category_scores_gemma":[0.013943734,0.0007951235,0.0025131758,0.0012684164,0.0034809422,0.007033555,0.0038832352,0.005823056,0.000564286],"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.00024298279,0.00023025933,0.0009534831,0.0006094673,0.0001458142,0.00032929223,0.0011634866,0.11531235,0.0062714154,0.83047515,0.0042030113,0.04006324],"study_design_scores_gemma":[0.00007223773,0.000040825023,0.00030017443,0.000058237605,0.000037795737,0.00012508883,0.00022413842,0.1632159,0.006523245,0.8238676,0.0054996624,0.00003498759],"about_ca_topic_score_codex":0.0031025226,"about_ca_topic_score_gemma":0.0029073819,"teacher_disagreement_score":0.004653608,"about_ca_system_score_codex":0.00221734,"about_ca_system_score_gemma":0.0023419254,"threshold_uncertainty_score":0.020550251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03090521,0.00064287387,0.8962863,0.00063619943,0.00017257003,0.00034533348,0.005123947,0.053790275,0.012097256],"genre_scores_gemma":[0.19762467,0.00024702735,0.78245145,0.0005647808,0.000037956863,0.00043534173,0.010450454,0.0027820969,0.005406204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.00009559418,0.000036809597,0.00020163639,0.00021765259,0.00009357864],"domain_scores_gemma":[0.9994217,0.00022472642,0.000039229086,0.00014807416,0.00012376897,0.000042568317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559004,0.0021988333,0.0013807189,0.0007996755,0.0007547835,0.0017641312,0.004450158,0.0016877835,0.013917573],"category_scores_gemma":[0.0029951874,0.00096703065,0.00228608,0.0012530963,0.0009369307,0.002596044,0.003424017,0.0023613034,0.0041349735],"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.0002878097,0.00022788964,0.0014690346,0.0004746913,0.00016980496,0.00019291347,0.00013749718,0.6626016,0.006548304,0.010230789,0.060542386,0.25711724],"study_design_scores_gemma":[0.00003822653,0.000025482192,0.00008953843,0.000009732851,0.000008619712,0.000023352171,0.000036690362,0.99009037,0.0012261069,0.004865586,0.0035768799,0.000009394707],"about_ca_topic_score_codex":0.03818619,"about_ca_topic_score_gemma":0.07114874,"teacher_disagreement_score":0.03818619,"about_ca_system_score_codex":0.0015168621,"about_ca_system_score_gemma":0.0035481078,"threshold_uncertainty_score":0.07592785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028878697,0.0005167742,0.98885125,0.0011065205,0.00014315105,0.000083628685,0.00011807624,0.00071169576,0.0055809487],"genre_scores_gemma":[0.14131232,0.0008895116,0.8493744,0.0013382051,0.00054798136,0.00052447664,0.0006811545,0.0008924686,0.004439515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995421,0.0016649213,0.00023473051,0.00070952886,0.0017167979,0.0002529867],"domain_scores_gemma":[0.9821133,0.012440585,0.0006734517,0.0023608285,0.0020250746,0.00038670644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044823657,0.0017607715,0.0017830738,0.0011819246,0.0007871643,0.0035388581,0.003663082,0.0027232144,0.0089226905],"category_scores_gemma":[0.031599455,0.0012413351,0.0020468633,0.0015072433,0.0022998576,0.0041494463,0.0040517645,0.0066217068,0.0023142265],"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.00013007862,0.00021332497,0.0012775217,0.0004373668,0.00008239224,0.0001022872,0.00016411363,0.696577,0.0014747989,0.19212638,0.008561904,0.09885287],"study_design_scores_gemma":[0.000022497728,0.000022401577,0.000036831072,0.000033823955,0.0000066106118,0.000020276912,0.000011062333,0.94904083,0.00046805234,0.046602998,0.0037261606,0.000008432667],"about_ca_topic_score_codex":0.0028168757,"about_ca_topic_score_gemma":0.003967658,"teacher_disagreement_score":0.0089226905,"about_ca_system_score_codex":0.001945153,"about_ca_system_score_gemma":0.0041372026,"threshold_uncertainty_score":0.02984941},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059409393,0.001795297,0.98427147,0.0026823212,0.00010808105,0.00017338587,0.00013552266,0.00025098748,0.0046420405],"genre_scores_gemma":[0.1934736,0.0039917124,0.7974541,0.0008585903,0.00049397623,0.00042799258,0.00038811303,0.00015654392,0.0027553414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893742,0.0044843624,0.0011029894,0.0018541346,0.0027576,0.00042667548],"domain_scores_gemma":[0.95966256,0.03324099,0.001527301,0.0030366317,0.0019690776,0.0005635604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013928046,0.0012034264,0.0011253125,0.0031207455,0.001624769,0.0064114956,0.0034817397,0.0030611446,0.0042857123],"category_scores_gemma":[0.050332207,0.0016061201,0.0027308578,0.0041240216,0.0107780835,0.019253815,0.0061321226,0.0069897356,0.0006481576],"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.00003160875,0.000046582885,0.00042107355,0.00023991089,0.000040460603,0.00013879468,0.00037891092,0.010748794,0.000639723,0.94199884,0.0009777462,0.044337604],"study_design_scores_gemma":[0.00002522721,0.000018474479,0.00009107621,0.00012448546,0.000028616914,0.000103372884,0.0001227382,0.06448937,0.0014682234,0.92864573,0.0048567904,0.000025838439],"about_ca_topic_score_codex":0.004464767,"about_ca_topic_score_gemma":0.0027646087,"teacher_disagreement_score":0.013928046,"about_ca_system_score_codex":0.0031163162,"about_ca_system_score_gemma":0.003322207,"threshold_uncertainty_score":0.07365942},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016137222,0.0005671203,0.97334075,0.00028592933,0.00010247499,0.00008145714,0.00007757336,0.00060642173,0.008801043],"genre_scores_gemma":[0.2726192,0.0007074024,0.7198783,0.00024222181,0.00008883427,0.00045854063,0.00032569648,0.0004279473,0.0052518477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995994,0.00012563913,0.000022885231,0.000070921145,0.0001453202,0.000035810186],"domain_scores_gemma":[0.9995629,0.00023473657,0.000031850323,0.000064913394,0.00007649886,0.000029093399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006240262,0.00075641944,0.000723113,0.00032636608,0.00045652193,0.0007406683,0.00088103727,0.0008344464,0.003981644],"category_scores_gemma":[0.002271253,0.0004629331,0.0008306112,0.0006837125,0.00074975076,0.0007947686,0.0009851195,0.0016195979,0.00069269515],"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.00006228602,0.00004646239,0.0004125355,0.00015665335,0.000054539454,0.000054561722,0.00006760199,0.8983124,0.004535492,0.03862836,0.0023296857,0.055339456],"study_design_scores_gemma":[0.000014795767,0.00001108081,0.000043991233,0.0000064432297,0.000004351205,0.000012911351,0.0000047466597,0.9854534,0.0010202379,0.012052179,0.0013721144,0.0000036944753],"about_ca_topic_score_codex":0.0024118344,"about_ca_topic_score_gemma":0.0021645958,"teacher_disagreement_score":0.003981644,"about_ca_system_score_codex":0.0006282802,"about_ca_system_score_gemma":0.00083413476,"threshold_uncertainty_score":0.013319969},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13864611,0.001121024,0.8448195,0.0026499892,0.000052916013,0.00016267927,0.00047559058,0.00064727274,0.011424929],"genre_scores_gemma":[0.83453166,0.0009064479,0.1584106,0.0005347273,0.00006270604,0.0005518695,0.0007528831,0.00033538704,0.003913811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956434,0.0021333578,0.00022888625,0.0008451538,0.0007945537,0.00035481816],"domain_scores_gemma":[0.9407272,0.048269488,0.0038953975,0.0042380583,0.0022543045,0.00061560294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007040329,0.0011021185,0.0013354657,0.0016714034,0.0008210431,0.0027438358,0.002307168,0.002243883,0.005189575],"category_scores_gemma":[0.0822682,0.001191479,0.0011022739,0.0017654409,0.0039302274,0.0075098597,0.0019937246,0.0040375656,0.0007439357],"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.00012628948,0.00010803038,0.004661308,0.00019296995,0.00009862899,0.00008045796,0.00041227328,0.7264406,0.0009213793,0.24252817,0.002029798,0.0224],"study_design_scores_gemma":[0.000016852104,0.00004299016,0.00072473293,0.000033357686,0.000009522883,0.000039146496,0.000054037366,0.87979317,0.0003795738,0.11840152,0.0004869647,0.00001816262],"about_ca_topic_score_codex":0.005795995,"about_ca_topic_score_gemma":0.0063325483,"teacher_disagreement_score":0.007040329,"about_ca_system_score_codex":0.0032836227,"about_ca_system_score_gemma":0.0025624805,"threshold_uncertainty_score":0.037233233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061281104,0.001268626,0.91238785,0.002254705,0.00017757711,0.0002808988,0.00056320225,0.00048018232,0.021305917],"genre_scores_gemma":[0.7609009,0.0013678938,0.22203596,0.00078229624,0.0001779391,0.0006862595,0.00063280144,0.0003766035,0.01303919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.00083510595,0.000041161686,0.00019179612,0.00021551718,0.0002974943],"domain_scores_gemma":[0.99359506,0.0055376776,0.00028748866,0.00010674029,0.00029682307,0.00017628046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340326,0.0022003883,0.0018937953,0.00080548547,0.0006078404,0.0026670445,0.0017080422,0.0018846518,0.0055773305],"category_scores_gemma":[0.0068906234,0.0011174084,0.0008659971,0.0016177717,0.0012208208,0.0017834931,0.0011927286,0.0023260356,0.0007561867],"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.000024395624,0.000034129884,0.00011069679,0.00003841035,0.000011144882,0.000029561104,0.000010582871,0.99273986,0.00012950064,0.0027106146,0.0006233849,0.0035376926],"study_design_scores_gemma":[0.0000075445155,0.000015689564,0.000048263744,0.000006098407,0.0000034249374,0.000005378285,0.000014419993,0.9966673,0.00007972226,0.0029530793,0.00019588637,0.0000031475245],"about_ca_topic_score_codex":0.0109527465,"about_ca_topic_score_gemma":0.009956662,"teacher_disagreement_score":0.0109527465,"about_ca_system_score_codex":0.0024099078,"about_ca_system_score_gemma":0.0022825967,"threshold_uncertainty_score":0.021777987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008130725,0.00028477836,0.98742455,0.0005053214,0.000063496,0.00010663293,0.00031605715,0.00072959776,0.0024389385],"genre_scores_gemma":[0.2583768,0.0011378172,0.73358804,0.0004519989,0.00025046602,0.00020743693,0.0012334527,0.00036063703,0.004393222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978842,0.0007547139,0.00014721155,0.0005170907,0.0005524681,0.00014422124],"domain_scores_gemma":[0.9902492,0.0071721533,0.00048611042,0.0010729536,0.00074127404,0.00027833416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022250344,0.0010746993,0.0010503328,0.001928419,0.0007124188,0.0013628912,0.0018763863,0.0011661825,0.0070750588],"category_scores_gemma":[0.010192608,0.0006891612,0.0024021273,0.0021158918,0.0013634138,0.0037635968,0.0024947408,0.0022229236,0.00060359144],"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.00030099484,0.0002989751,0.0017461295,0.0010679049,0.00018277243,0.0010252276,0.00044652153,0.44146192,0.006984564,0.31468815,0.005655418,0.2261415],"study_design_scores_gemma":[0.000050171617,0.00005880185,0.00021277484,0.000048859263,0.00007963952,0.00014489367,0.000057781665,0.49930483,0.0019567194,0.49060443,0.0074611623,0.00001995529],"about_ca_topic_score_codex":0.0073180837,"about_ca_topic_score_gemma":0.00791812,"teacher_disagreement_score":0.0073180837,"about_ca_system_score_codex":0.0014354166,"about_ca_system_score_gemma":0.0017379193,"threshold_uncertainty_score":0.023668468},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013639495,0.0009497407,0.97536564,0.00017220403,0.00007811448,0.00010588774,0.0017439176,0.0033553396,0.00458959],"genre_scores_gemma":[0.070021026,0.0015428156,0.9137709,0.00013090958,0.000086161504,0.00014475964,0.007598311,0.0009955497,0.005709638],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994617,0.000035983187,0.000033427135,0.00011794451,0.00028150473,0.00006931801],"domain_scores_gemma":[0.9993831,0.00017632292,0.00005477796,0.00013692668,0.00021725602,0.000031587162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044925848,0.0021269985,0.0023001188,0.004318371,0.0005984748,0.0032373215,0.0017161007,0.0011512932,0.005684435],"category_scores_gemma":[0.0012711951,0.0013251455,0.001753999,0.006820776,0.00060767384,0.0024494764,0.002038558,0.0011114056,0.0044646333],"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.00023146169,0.00009723294,0.0010786788,0.0007780598,0.0000856767,0.00039719514,0.00017725979,0.01647863,0.16775942,0.0070140283,0.012530208,0.79337215],"study_design_scores_gemma":[0.00007196965,0.00017220518,0.00765179,0.00020579543,0.0002690973,0.0017858687,0.00043478564,0.7173278,0.18861368,0.023740921,0.059513927,0.0002122639],"about_ca_topic_score_codex":0.0027836822,"about_ca_topic_score_gemma":0.008420359,"teacher_disagreement_score":0.005684435,"about_ca_system_score_codex":0.00047383172,"about_ca_system_score_gemma":0.0010672407,"threshold_uncertainty_score":0.019016325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052123796,0.00022913823,0.98467064,0.00013859829,0.000083151004,0.000092705755,0.000076369026,0.00025257925,0.00924444],"genre_scores_gemma":[0.07514118,0.00054436387,0.91340345,0.00015297385,0.00013256015,0.00045950993,0.00041846378,0.0004673666,0.009280121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865484,0.0004299711,0.000079380865,0.000241758,0.0004325709,0.00016134378],"domain_scores_gemma":[0.9976131,0.0017997476,0.00011580306,0.00017376174,0.00022953138,0.00006809048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017628153,0.0021354712,0.001438119,0.0010648805,0.0006592253,0.0014683456,0.002686015,0.0012408798,0.0113082295],"category_scores_gemma":[0.0050854166,0.0017740568,0.0025474944,0.002331289,0.0013476055,0.0026100657,0.0029980494,0.0045696218,0.001777629],"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.0001417115,0.0001853166,0.0001721092,0.0007030934,0.00016278074,0.00015174397,0.00024775727,0.67242426,0.0068665966,0.14249378,0.00895167,0.16749926],"study_design_scores_gemma":[0.000048694706,0.00005588559,0.000048384878,0.00004058639,0.000034521418,0.00006154425,0.000049584898,0.91084564,0.0017531373,0.08235626,0.0046906658,0.000015065779],"about_ca_topic_score_codex":0.0029484425,"about_ca_topic_score_gemma":0.0042678514,"teacher_disagreement_score":0.0113082295,"about_ca_system_score_codex":0.0008240521,"about_ca_system_score_gemma":0.001347171,"threshold_uncertainty_score":0.037829757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003999343,0.0015074303,0.8709728,0.0014638422,0.0006033589,0.00016687378,0.0017685959,0.0032108559,0.11630696],"genre_scores_gemma":[0.13509801,0.0060755103,0.66015506,0.00096257153,0.00045080952,0.0006708515,0.011648365,0.0030152455,0.18192367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941754,0.0001787292,0.00004050403,0.00015294389,0.00015876778,0.000051503026],"domain_scores_gemma":[0.9996635,0.000092415125,0.0000212962,0.0001329546,0.0000700399,0.000019732164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041048875,0.0012624009,0.00069059315,0.0016790207,0.00083537,0.0043412815,0.0015206814,0.000956823,0.03746943],"category_scores_gemma":[0.0016185474,0.0006050279,0.0010949972,0.0035277773,0.0012302182,0.0057489574,0.0018971061,0.0018858516,0.011993391],"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.000023230767,0.000024580939,0.000055348693,0.0001711229,0.000013862679,0.00006301122,0.00020744196,0.005345141,0.0009885597,0.8450559,0.026004806,0.12204695],"study_design_scores_gemma":[0.0000091664015,0.00001037824,0.000036002857,0.00007188952,0.000017957971,0.00007544303,0.000087358756,0.013018542,0.001031033,0.80856407,0.1770666,0.000011436115],"about_ca_topic_score_codex":0.0021683057,"about_ca_topic_score_gemma":0.0019722297,"teacher_disagreement_score":0.03746943,"about_ca_system_score_codex":0.0010569063,"about_ca_system_score_gemma":0.00075969554,"threshold_uncertainty_score":0.12534767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056222968,0.00020631174,0.89872676,0.00756899,0.000103632476,0.0010344314,0.001621499,0.0017828464,0.032732457],"genre_scores_gemma":[0.5025488,0.00020855568,0.48956943,0.0008726307,0.000052646115,0.0009500049,0.0023687864,0.0003115894,0.0031176072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97615427,0.010895374,0.0018815764,0.0013488274,0.008591099,0.0011288429],"domain_scores_gemma":[0.9662267,0.01881328,0.0018462444,0.0045459364,0.007828343,0.00073953095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017845185,0.000518366,0.00058822514,0.00071880856,0.0016859142,0.0054687867,0.0027884515,0.0010545151,0.0057616616],"category_scores_gemma":[0.043316025,0.0004741374,0.00096357404,0.0019329323,0.0023013777,0.005722417,0.003857732,0.0024776042,0.0006790468],"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.00019115364,0.00026941075,0.004409843,0.00055447,0.000055939032,0.0007300074,0.0025630158,0.17207547,0.0044481363,0.76022774,0.0090735825,0.04540123],"study_design_scores_gemma":[0.00008857539,0.00009049128,0.0009105731,0.00019889364,0.00002942799,0.0003572696,0.0032859682,0.71277624,0.00816755,0.2113072,0.06273922,0.00004851393],"about_ca_topic_score_codex":0.017496504,"about_ca_topic_score_gemma":0.020305403,"teacher_disagreement_score":0.017845185,"about_ca_system_score_codex":0.0027244242,"about_ca_system_score_gemma":0.0051786196,"threshold_uncertainty_score":0.09437549},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008704198,0.00051970535,0.9796643,0.00092900975,0.000116918585,0.00019172352,0.0003281728,0.0006802318,0.00886576],"genre_scores_gemma":[0.18948434,0.0017120022,0.7914083,0.00070430624,0.00022758506,0.00065893255,0.0018312479,0.00072414795,0.013249252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751127,0.0008526548,0.000191411,0.00049862807,0.00071224925,0.00023370942],"domain_scores_gemma":[0.9948384,0.0035241887,0.00027705985,0.00050452235,0.0006773331,0.00017854651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023232375,0.0008391452,0.0010242928,0.0010988116,0.001657097,0.0028682684,0.0020673058,0.0011640736,0.008233562],"category_scores_gemma":[0.008385376,0.00076835556,0.0020681492,0.0018899227,0.002350692,0.004448789,0.0027013225,0.004023592,0.0012359911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110189714,0.00008949206,0.00040281477,0.00055877207,0.00007390313,0.00026120074,0.0002761968,0.2121903,0.0032891226,0.6731911,0.00963908,0.099917874],"study_design_scores_gemma":[0.00004102161,0.000023862201,0.000072653245,0.000047495996,0.00002700437,0.00007920489,0.000080275684,0.31528828,0.004030699,0.6618998,0.018385876,0.000023879506],"about_ca_topic_score_codex":0.005929602,"about_ca_topic_score_gemma":0.008602476,"teacher_disagreement_score":0.008233562,"about_ca_system_score_codex":0.0022326813,"about_ca_system_score_gemma":0.0032149376,"threshold_uncertainty_score":0.027544081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069400534,0.006971756,0.9642482,0.00057579327,0.00021423482,0.00006976844,0.0003429482,0.0002475384,0.026635792],"genre_scores_gemma":[0.04360302,0.01394394,0.91622293,0.0003635696,0.0005749748,0.0006777353,0.0012729419,0.00049010664,0.022850715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986198,0.0004266915,0.00008416577,0.00019850851,0.000593637,0.000077150195],"domain_scores_gemma":[0.998939,0.00071403704,0.00004696645,0.00010018295,0.0001682591,0.00003165347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180653,0.0021542453,0.0018439404,0.0010752098,0.00079436816,0.002520308,0.0030906172,0.001571636,0.014620238],"category_scores_gemma":[0.0036555473,0.0011933157,0.0016615869,0.0045444807,0.0014710166,0.0026297097,0.001903591,0.004473669,0.003086747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004014823,0.00005844185,0.000093620234,0.0010684759,0.00010109611,0.00012889368,0.00015192543,0.2345168,0.0011914948,0.4816447,0.032302413,0.24870202],"study_design_scores_gemma":[0.000023061333,0.000018232235,0.00007737198,0.00029336722,0.000033041902,0.0000831198,0.00004339666,0.31659594,0.0007133373,0.6190929,0.06298905,0.00003722605],"about_ca_topic_score_codex":0.009257967,"about_ca_topic_score_gemma":0.008503842,"teacher_disagreement_score":0.014620238,"about_ca_system_score_codex":0.0022569331,"about_ca_system_score_gemma":0.0018381481,"threshold_uncertainty_score":0.048909605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014854507,0.00023232056,0.96258634,0.00053404307,0.00029421193,0.00047701667,0.00045758608,0.0015782603,0.01898565],"genre_scores_gemma":[0.13042691,0.00041822542,0.85219234,0.0005569581,0.00015104278,0.0005149758,0.00081871054,0.00096600835,0.013954914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921484,0.0020706987,0.0004606549,0.0011476203,0.0036202262,0.000552344],"domain_scores_gemma":[0.989805,0.0050174696,0.00061019923,0.0019841497,0.0022968526,0.00028641988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006442014,0.0018279421,0.0010065242,0.0028569903,0.0016209085,0.0034001523,0.0023665787,0.0015868851,0.01761838],"category_scores_gemma":[0.019542126,0.0012614874,0.0016295213,0.002700208,0.0017273758,0.006404558,0.0061015775,0.0029417858,0.0024281752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047423205,0.00031992994,0.002343929,0.0010228999,0.00038227133,0.001351328,0.001084666,0.050420783,0.041283492,0.49777913,0.02191422,0.38162318],"study_design_scores_gemma":[0.00018876028,0.00022128229,0.00075356464,0.0003629446,0.0005146928,0.0007292336,0.0007074054,0.35201955,0.09281664,0.43476132,0.11674075,0.0001838956],"about_ca_topic_score_codex":0.0014806632,"about_ca_topic_score_gemma":0.0035936367,"teacher_disagreement_score":0.01761838,"about_ca_system_score_codex":0.0011280408,"about_ca_system_score_gemma":0.0019146411,"threshold_uncertainty_score":0.058939397},"labels":[],"label_agreement":null}]}