{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":698,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":698,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e47bdbb6d638","filters":{"topic":"Constraint Satisfaction and Optimization"}},"results":[{"id":"W2950680102","doi":"10.1613/jair.2861","title":"ParamILS: An Automatic Algorithm Configuration Framework","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":868,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Algorithm; Artificial intelligence","authors":[{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true},{"name":"T. Stuetzle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1317989993784504,"gpt":0.4330978139636827,"spread":0.3012988145852324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006468293,0.002075024,0.001619586,0.002535275,0.001000177,0.003973432,0.006449062,0.001573955,0.01377877],"category_scores_gemma":[0.02153515,0.001821895,0.001824011,0.001571793,0.001448039,0.004779598,0.004456338,0.004476169,0.005830805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001706553,"about_ca_system_score_gemma":0.003747485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001804111,"about_ca_topic_score_gemma":0.002722797,"domain_scores_codex":[0.9938542,0.002120579,0.000562782,0.0009525534,0.00203448,0.0004755273],"domain_scores_gemma":[0.9921207,0.003754105,0.0005655599,0.002169012,0.001141269,0.0002492581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001082551,0.0005225237,0.002177864,0.001126792,0.0002185843,0.0004399251,0.0004207735,0.2122748,0.01805091,0.07652105,0.0643884,0.6227758],"study_design_scores_gemma":[0.0002819512,0.000159941,0.0004129253,0.0001242443,0.00005136942,0.000249839,0.0000691782,0.888005,0.02124219,0.04584089,0.04343589,0.0001266719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002245158,0.0001620963,0.9335461,0.0001436788,0.00004408438,0.0003086526,0.0005587641,0.06036428,0.002627165],"genre_scores_gemma":[0.06390143,0.0001639958,0.9239173,0.0002155921,0.0000606367,0.001217581,0.001818835,0.007122113,0.001582541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01377877,"threshold_uncertainty_score":0.0460946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147148915","doi":"10.1613/jair.2490","title":"SATzilla: Portfolio-based Algorithm Selection for SAT","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":835,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Solver; Portfolio; Scalability; Selection (genetic algorithm); Set (abstract data type); Class (philosophy); Local search (optimization); Algorithm; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Programming language","authors":[{"name":"Lizhong Xu","is_ca":true},{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1824121673170033,"gpt":0.4086704943385303,"spread":0.226258327021527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008243506,0.002342821,0.00218039,0.003739722,0.00105517,0.002677919,0.003869922,0.002147947,0.009380968],"category_scores_gemma":[0.02380115,0.001282369,0.002298181,0.003378795,0.001128536,0.003167713,0.003297297,0.003185463,0.003970207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001931851,"about_ca_system_score_gemma":0.003688131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001964646,"about_ca_topic_score_gemma":0.004253292,"domain_scores_codex":[0.9917258,0.004263974,0.0004296505,0.0009375994,0.00211051,0.0005324443],"domain_scores_gemma":[0.9887109,0.007056963,0.0006930759,0.002293707,0.0009198337,0.0003255747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000592912,0.0005672815,0.006345519,0.0004394731,0.0004090352,0.0001438765,0.0001708842,0.3125704,0.003330608,0.02845646,0.05176182,0.5952117],"study_design_scores_gemma":[0.000188161,0.0001220994,0.0003966409,0.00002412886,0.00003629907,0.00007503811,0.00002333325,0.9705498,0.001741316,0.02159689,0.005230302,0.00001600797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02139261,0.000907001,0.95072,0.0006951679,0.000195478,0.0007775427,0.0009518656,0.01583701,0.008523314],"genre_scores_gemma":[0.18787,0.0003715409,0.8007858,0.0005309802,0.0002047965,0.001414079,0.003272606,0.001965727,0.003584602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009380968,"threshold_uncertainty_score":0.04359633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026753685","doi":"10.1137/s0097539700376676","title":"Classifying the Complexity of Constraints Using Finite Algebras","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":580,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Universal algebra; Surjective function; Mathematics; Constraint satisfaction; Class (philosophy); Constraint (computer-aided design); Set (abstract data type); Algebra over a field; Algebraic number; Simple (philosophy); Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Peter Jeavons","is_ca":false},{"name":"Andrei Krokhin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08292401402696233,"gpt":0.3007412606629095,"spread":0.2178172466359471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003063805,0.0005230657,0.001136877,0.002715432,0.001306909,0.005754228,0.001535034,0.001359365,0.003210224],"category_scores_gemma":[0.01814604,0.0004819205,0.00218611,0.002914454,0.004282611,0.01424702,0.002615558,0.002513337,0.000199937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00355043,"about_ca_system_score_gemma":0.001958695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003037826,"about_ca_topic_score_gemma":0.002203082,"domain_scores_codex":[0.9951031,0.001627573,0.0004783265,0.0008359481,0.001453992,0.0005010705],"domain_scores_gemma":[0.9799168,0.01498477,0.00194793,0.001814139,0.0007426206,0.0005938133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001640978,0.0002081812,0.006120481,0.0002824438,0.0001399634,0.0001689506,0.0007973919,0.09934875,0.00362557,0.8571529,0.000922517,0.03106886],"study_design_scores_gemma":[0.00002611031,0.00003447731,0.001115681,0.0000284648,0.00002746185,0.0000763849,0.000184582,0.1414628,0.001729107,0.8542411,0.001044649,0.00002915837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6176532,0.000811878,0.3680657,0.002157834,0.00002278249,0.0002406819,0.0007635567,0.0003160127,0.009968425],"genre_scores_gemma":[0.9341984,0.0006652772,0.06228119,0.0001477758,0.00009548265,0.0002252707,0.0009185704,0.00004565911,0.001422341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005754228,"threshold_uncertainty_score":0.02576023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997649256","doi":"10.1145/1120582.1120584","title":"A dichotomy theorem for constraint satisfaction problems on a 3-element set","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":372,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Element (criminal law); Set (abstract data type); Mathematics; Domain (mathematical analysis); Class (philosophy); Local consistency; Time complexity; Constraint satisfaction dual problem; Maximal element; Mathematical optimization; Algebraic number; Computer science; Discrete mathematics; Artificial intelligence","authors":[{"name":"Andreǐ A. Bulatov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01866132233556832,"gpt":0.2543906495361,"spread":0.2357293272005317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039638,0.001062075,0.001726628,0.002060372,0.002463088,0.006370883,0.002356482,0.002341533,0.01302575],"category_scores_gemma":[0.01506346,0.0007615853,0.003427427,0.002884744,0.006054336,0.01275586,0.004924457,0.01078844,0.001793865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0035235,"about_ca_system_score_gemma":0.001881288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001739468,"about_ca_topic_score_gemma":0.001254004,"domain_scores_codex":[0.9946779,0.001097672,0.0002824451,0.001122368,0.002154012,0.0006655491],"domain_scores_gemma":[0.9804007,0.01699543,0.0006746221,0.0008134098,0.0007067856,0.0004091511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000139453,0.0001150158,0.0005150461,0.0003075032,0.00005596739,0.0001197092,0.0003747119,0.01475275,0.001345264,0.9472016,0.007054168,0.02801875],"study_design_scores_gemma":[0.00004267443,0.00004022825,0.0002859077,0.00005424004,0.00001803614,0.0001011036,0.00006563434,0.04952151,0.0008195988,0.9435154,0.005518297,0.00001727925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05274674,0.001830075,0.8615219,0.01060711,0.0002129511,0.0003497005,0.001170287,0.0005590213,0.07100215],"genre_scores_gemma":[0.6085934,0.004021517,0.3576058,0.004983801,0.001430844,0.002032176,0.003176625,0.0004230706,0.01773291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01302575,"threshold_uncertainty_score":0.04357553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041091076","doi":"10.1145/502102.502106","title":"Interval arithmetic","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Interval arithmetic; Interval (graph theory); Arithmetic; Multiplication (music); Affine arithmetic; Division (mathematics); Subtraction; Arbitrary-precision arithmetic; Saturation arithmetic; Mathematics; Real number; Second-order arithmetic; Set (abstract data type); Floating point; Algorithm; Computer science; Discrete mathematics; Combinatorics; Pure mathematics","authors":[{"name":"Timothy J. Hickey","is_ca":false},{"name":"Qun Ju","is_ca":false},{"name":"M. H. van Emden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01825708143144391,"gpt":0.2500798188606352,"spread":0.2318227374291913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523986,0.001153851,0.0007694645,0.001486945,0.00106142,0.004573745,0.002494497,0.0009059979,0.01870722],"category_scores_gemma":[0.006281598,0.0004677167,0.00102218,0.00326001,0.002681909,0.005901007,0.002768384,0.002976558,0.00669607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445281,"about_ca_system_score_gemma":0.001153958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253559,"about_ca_topic_score_gemma":0.001133258,"domain_scores_codex":[0.9976802,0.0004395322,0.0002567012,0.0004496815,0.00102568,0.000148285],"domain_scores_gemma":[0.9983206,0.0005811781,0.0001891216,0.000413005,0.0004236225,0.00007242787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001417754,0.000007990341,0.00005135633,0.0001154665,0.000006979403,0.00002654602,0.00009342916,0.002370878,0.0003830274,0.962768,0.005853692,0.02830851],"study_design_scores_gemma":[0.0000155526,0.0000317546,0.0001131787,0.0001400813,0.000014178,0.0001943747,0.00008513196,0.01139311,0.001274355,0.760539,0.2261776,0.00002171148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002414939,0.003229158,0.8855579,0.0009014135,0.0005652936,0.0001473375,0.0007513836,0.0006125877,0.1058199],"genre_scores_gemma":[0.1172252,0.008198501,0.8364382,0.001128454,0.00110168,0.00062055,0.001900735,0.0005002244,0.03288654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01870722,"threshold_uncertainty_score":0.0625819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1487965496","doi":"","title":"SATLIB: An Online Resource for Research on SAT","year":2000,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":312,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Suite; Computer science; Resource (disambiguation); Implementation; Set (abstract data type); World Wide Web; Data science; Theoretical computer science; Programming language","authors":[{"name":"Holger H. Hoos","is_ca":true},{"name":"Thomas Stützle","is_ca":false},{"name":"Ian P. Gent","is_ca":false},{"name":"Hans van Maaren","is_ca":false},{"name":"Toby Walsh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.184314762949718,"gpt":0.3995988594853813,"spread":0.2152840965356633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003165225,0.002466223,0.002391023,0.007459019,0.001228717,0.004851104,0.00654334,0.001789958,0.1983003],"category_scores_gemma":[0.0189729,0.001713405,0.002097055,0.01577639,0.0007782569,0.00537411,0.004524517,0.004476822,0.1433139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002266143,"about_ca_system_score_gemma":0.004251255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003062179,"about_ca_topic_score_gemma":0.004451016,"domain_scores_codex":[0.9967349,0.0008452993,0.0004017197,0.0004666523,0.001284514,0.0002668225],"domain_scores_gemma":[0.9840643,0.008126702,0.0008381162,0.002701316,0.002991057,0.001278551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001533149,0.00009875643,0.0002747798,0.001055035,0.00005267723,0.0000749666,0.00003449297,0.002944487,0.0008559467,0.013601,0.8864534,0.0944012],"study_design_scores_gemma":[0.0003734452,0.00008198494,0.001072571,0.0003434738,0.00007770489,0.0003053547,0.00005379115,0.01745386,0.004594019,0.04808237,0.9274817,0.00007966923],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"dataset","genre_gemma":"software","genre_scores_codex":[0.003956692,0.009343931,0.2396139,0.004500282,0.001991455,0.0009599013,0.2845001,0.2722698,0.182864],"genre_scores_gemma":[0.02751972,0.005933743,0.228132,0.00185707,0.001027058,0.002004105,0.6575871,0.04004294,0.03589626],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.1983003,"threshold_uncertainty_score":0.6633807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000977215","doi":"10.1080/00029890.2000.12005203","title":"A Better Bound on the Variance","year":2000,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Variance (accounting); Mathematics; Statistics; Combinatorics; Economics","authors":[{"name":"Rajendra Bhatia","is_ca":false},{"name":"Chandler Davis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009707701948663027,"gpt":0.2248565767065913,"spread":0.2151488747579283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01815801,0.003259632,0.004154685,0.003964032,0.0030049,0.007812824,0.005229663,0.00735396,0.02861491],"category_scores_gemma":[0.07657769,0.001813645,0.003430453,0.006132076,0.006455588,0.02206642,0.00726132,0.01938014,0.007724295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006829063,"about_ca_system_score_gemma":0.003013653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004887279,"about_ca_topic_score_gemma":0.004700187,"domain_scores_codex":[0.9809378,0.006274828,0.001147403,0.003579581,0.006132261,0.001928187],"domain_scores_gemma":[0.9342532,0.04760221,0.002540744,0.007592259,0.006799637,0.001211922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000404825,0.00008394306,0.001116788,0.0003669294,0.0002499039,0.0001700594,0.0003022272,0.02199386,0.001284018,0.7810153,0.110072,0.0829401],"study_design_scores_gemma":[0.00008638093,0.00008014188,0.001068652,0.0003803546,0.0001733106,0.0002624854,0.00008057364,0.05657617,0.001866853,0.8929057,0.04638973,0.0001296182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008796183,0.04967941,0.8436508,0.04534448,0.006329112,0.00007761342,0.002245212,0.001102026,0.04277519],"genre_scores_gemma":[0.4607738,0.03192005,0.3691231,0.04189599,0.03079328,0.0007916793,0.00419833,0.005296304,0.0552075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02861491,"threshold_uncertainty_score":0.09602994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519526968","doi":"10.1007/3-540-46135-3_16","title":"Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Smoothing; Probabilistic logic; Computer science; Novelty; Scaling; Range (aeronautics); Algorithm; Focus (optics); Probabilistic analysis of algorithms; Mathematical optimization; Artificial intelligence; Mathematics","authors":[{"name":"Frank Hutter","is_ca":true},{"name":"Dave A. D. Tompkins","is_ca":true},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01669627243050656,"gpt":0.2472365281927607,"spread":0.2305402557622541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585821,0.0008728473,0.00212632,0.001465714,0.0008184295,0.001028212,0.002622526,0.001101794,0.00859828],"category_scores_gemma":[0.006909313,0.0009511979,0.00110868,0.002902683,0.001171199,0.002797026,0.003240302,0.001822725,0.001505476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020575,"about_ca_system_score_gemma":0.001071487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493051,"about_ca_topic_score_gemma":0.006597093,"domain_scores_codex":[0.9990324,0.0003817259,0.00004926484,0.0001824245,0.0002588521,0.0000952419],"domain_scores_gemma":[0.997668,0.001513796,0.00009993437,0.0004901541,0.000151625,0.00007645562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004059524,0.0001649544,0.0005679187,0.0002471046,0.00007536861,0.00005236986,0.0001865459,0.525026,0.003841525,0.07616603,0.01175724,0.3815089],"study_design_scores_gemma":[0.00003285288,0.00002737753,0.00006325031,0.000005821712,0.00001163945,0.00001195343,0.00001142953,0.9633859,0.0005363791,0.0349057,0.00100167,0.00000598933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01945478,0.0005208912,0.9715344,0.0002332024,0.00005594322,0.00009483157,0.000136883,0.002639467,0.005329573],"genre_scores_gemma":[0.3857268,0.0003876356,0.6051192,0.0002431911,0.0001112041,0.000433021,0.0005350569,0.0009033846,0.006540556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00859828,"threshold_uncertainty_score":0.02876407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1490176645","doi":"10.1609/aaai.v24i1.7565","title":"Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Set (abstract data type); Algorithm; Domain (mathematical analysis); Exploit; Solver; Selection (genetic algorithm); Process (computing); Portfolio; Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","authors":[{"name":"Lin Xu","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04901435405641711,"gpt":0.2953699114374654,"spread":0.2463555573810483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004367223,0.001623456,0.001432405,0.001547607,0.0006126007,0.001847081,0.00331882,0.001504643,0.004961977],"category_scores_gemma":[0.01188116,0.001008075,0.00123164,0.001385546,0.001119371,0.002308789,0.002221673,0.001867808,0.002345358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001008218,"about_ca_system_score_gemma":0.002682521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001987975,"about_ca_topic_score_gemma":0.002801157,"domain_scores_codex":[0.9973537,0.001189032,0.0001974144,0.0004392151,0.00063135,0.0001894156],"domain_scores_gemma":[0.9941983,0.003509007,0.0003399906,0.001247943,0.0005175533,0.0001871814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005201997,0.0003465182,0.004793043,0.0004233629,0.0002711909,0.0001916806,0.0001903493,0.5167754,0.009987707,0.0181092,0.01882847,0.4295628],"study_design_scores_gemma":[0.0001142517,0.00007261443,0.0002464612,0.00001474372,0.00002448208,0.00004937472,0.00002253357,0.9845547,0.004755475,0.006174479,0.003954714,0.00001614529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03290797,0.0005811047,0.9365918,0.0002741457,0.0001024982,0.000329992,0.0003427109,0.02412356,0.004746257],"genre_scores_gemma":[0.2028433,0.000225574,0.7927552,0.0002234942,0.00006169992,0.0005360373,0.00084866,0.001147115,0.001358882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004961977,"threshold_uncertainty_score":0.02309632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130202378","doi":"10.1111/j.0824-7935.2004.00234.x","title":"Preference‐Based Constrained Optimization with CP‐Nets","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Backtracking; Mathematical optimization; Computer science; Preference; Set (abstract data type); Pareto principle; Property (philosophy); Optimization problem; Mathematics","authors":[{"name":"Craig Boutilier","is_ca":true},{"name":"Ronen I. Brafman","is_ca":false},{"name":"Carmel Domshlak","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"David Poole","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04561028564651798,"gpt":0.2598856250634991,"spread":0.2142753394169811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00320911,0.001572992,0.001357513,0.001042067,0.0005682541,0.001823512,0.001640254,0.001355193,0.0049028],"category_scores_gemma":[0.007762008,0.0009758473,0.001291132,0.002218842,0.001380388,0.002574437,0.001894891,0.002472961,0.0005740359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178376,"about_ca_system_score_gemma":0.002286345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007688899,"about_ca_topic_score_gemma":0.008726167,"domain_scores_codex":[0.9982958,0.0009579586,0.00008393371,0.0002009004,0.0003462165,0.0001152799],"domain_scores_gemma":[0.9964618,0.00278442,0.0002299319,0.0001639463,0.0002707238,0.00008919404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004421805,0.00003097436,0.0001316588,0.00008551741,0.00003377881,0.00003903186,0.00002238771,0.8776661,0.0001888969,0.105422,0.0008246029,0.01551076],"study_design_scores_gemma":[0.00002161029,0.00001211327,0.0000188887,0.00001149048,0.000006963899,0.000007926376,0.000006082912,0.9182987,0.0001757723,0.08028895,0.001145554,0.000006057517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002599024,0.0001204202,0.9937505,0.0001234354,0.00002066009,0.00005855634,0.00007546323,0.00007795038,0.00317391],"genre_scores_gemma":[0.2173573,0.0006975897,0.7732916,0.0002552825,0.000081468,0.0009847265,0.0005350682,0.0001421014,0.0066549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007688899,"threshold_uncertainty_score":0.01697165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978526866","doi":"10.5555/777092.777193","title":"An adaptive noise mechanism for walkSAT","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Noise (video); Computer science; Novelty; Satisfiability; Algorithm; Simple (philosophy); Process (computing); Noise measurement; Mathematical optimization; Artificial intelligence; Mathematics; Noise reduction","authors":[{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0285513143877047,"gpt":0.2366861883306424,"spread":0.2081348739429377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245598,0.0008078038,0.001145485,0.0008748019,0.0009421092,0.00130486,0.002910423,0.001607692,0.002158923],"category_scores_gemma":[0.01067895,0.0005519923,0.0006423502,0.001147507,0.001492421,0.002097706,0.002266826,0.00157658,0.001227166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007015486,"about_ca_system_score_gemma":0.001014079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008372128,"about_ca_topic_score_gemma":0.001672953,"domain_scores_codex":[0.9980799,0.0005682027,0.0001612493,0.0004494403,0.0006128147,0.0001283258],"domain_scores_gemma":[0.9939203,0.002450452,0.0005178914,0.001780686,0.001050528,0.0002801018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001454531,0.0005961226,0.007939604,0.0004094474,0.0002601274,0.0003273468,0.0004910277,0.5653886,0.07683033,0.06847987,0.01090579,0.266917],"study_design_scores_gemma":[0.00007475991,0.0001590068,0.0004676806,0.00001297723,0.00003048634,0.0001285273,0.00002407972,0.968008,0.01331449,0.014545,0.003198041,0.00003693571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09493224,0.0003199854,0.892395,0.0003408891,0.0001204858,0.0001836208,0.0002065959,0.008342129,0.003159124],"genre_scores_gemma":[0.6451348,0.0001420206,0.3489822,0.0004679251,0.00008320509,0.0004742979,0.0006351428,0.0008331717,0.003247201],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002910423,"threshold_uncertainty_score":0.01187605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145996207","doi":"10.1016/j.artint.2006.02.003","title":"Constraint-based optimization and utility elicitation using the minimax decision criterion","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Waterloo; University of Toronto","funders":"","keywords":"Regret; Minimax; Computer science; Mathematical optimization; Preference elicitation; Exploit; Set (abstract data type); Constraint (computer-aided design); Function (biology); Preference; Mathematics; Machine learning","authors":[{"name":"Craig Boutilier","is_ca":true},{"name":"Relu Patrascu","is_ca":true},{"name":"Pascal Poupart","is_ca":true},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04697374374933979,"gpt":0.3001038880978434,"spread":0.2531301443485036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01208138,0.001608296,0.002615171,0.001897834,0.00100907,0.002798399,0.002410506,0.002191675,0.006361439],"category_scores_gemma":[0.04009123,0.001104584,0.001352423,0.003242391,0.001860757,0.00325123,0.00273358,0.002536379,0.000629323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002420065,"about_ca_system_score_gemma":0.003478945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003961762,"about_ca_topic_score_gemma":0.004774592,"domain_scores_codex":[0.98348,0.01242055,0.0004916588,0.000871818,0.002328577,0.0004073492],"domain_scores_gemma":[0.9703299,0.02593763,0.0007817998,0.001041369,0.001571345,0.0003379534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003603631,0.0002741942,0.0006564464,0.0005111403,0.0001962335,0.0001190224,0.0004315374,0.5731917,0.001240287,0.2988537,0.004409086,0.1197564],"study_design_scores_gemma":[0.00005196942,0.00007021793,0.0001310459,0.00005187074,0.00002027767,0.00002421163,0.00004386359,0.8685714,0.0007229687,0.1292657,0.001024551,0.00002192767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007150915,0.0001578269,0.9872792,0.000354809,0.00001749705,0.000187254,0.0000771304,0.00006128424,0.00471424],"genre_scores_gemma":[0.3230669,0.0003770659,0.6715096,0.0001932895,0.00005390093,0.001017341,0.0002621175,0.0001252523,0.003394582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01208138,"threshold_uncertainty_score":0.06389326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W139194355","doi":"10.1007/978-3-642-23786-7_19","title":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Sequence (biology); Computer science; Conjunctive normal form; Boolean satisfiability problem; Generalization; Satisfiability; Algorithm; Set (abstract data type); Mathematical optimization; Theoretical computer science; Mathematics; Boolean function; Programming language","authors":[{"name":"Jessica Davies","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02642937924592157,"gpt":0.2449300714418118,"spread":0.2185006921958902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100246,0.001636488,0.001959432,0.001039206,0.001025363,0.00204143,0.003085937,0.001442641,0.03946724],"category_scores_gemma":[0.004817985,0.00143687,0.003025649,0.00192917,0.0007601271,0.003864408,0.002047134,0.004916254,0.008091441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001133105,"about_ca_system_score_gemma":0.002028082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002736049,"about_ca_topic_score_gemma":0.006646894,"domain_scores_codex":[0.998731,0.0003078426,0.00009874548,0.0003448889,0.0003747111,0.0001429364],"domain_scores_gemma":[0.9976729,0.001311358,0.0001182364,0.0005181599,0.0003000713,0.00007928284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001091032,0.001468409,0.001310665,0.002536638,0.0003619074,0.0007864729,0.0004325605,0.2061741,0.03649214,0.1231704,0.05985454,0.566321],"study_design_scores_gemma":[0.0005020213,0.0006389582,0.001277537,0.0001683677,0.0003321898,0.0008299965,0.0003338617,0.6274474,0.01816413,0.2796107,0.07056738,0.0001274263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03944299,0.0007653118,0.892188,0.001554595,0.0008695398,0.001517475,0.001440371,0.004453307,0.05776853],"genre_scores_gemma":[0.05998385,0.0004044994,0.9194731,0.0005174899,0.0002555047,0.0005228644,0.002258503,0.0006937313,0.01589045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03946724,"threshold_uncertainty_score":0.1320311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1660649481","doi":"10.1007/b138243","title":"Fuzzy Modeling with Spatial Information for Geographic Problems","year":2005,"lang":"en","type":"book","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Geographic information system; Computer science; Fuzzy logic; Spatial analysis; Cartography; Geography; Data science; Information retrieval; Artificial intelligence; Remote sensing","authors":[{"name":"Frederick E. Petry","is_ca":false},{"name":"Vincent Β. Robinson","is_ca":true},{"name":"Maria A. Cobb","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01011123818097235,"gpt":0.1942757624426246,"spread":0.1841645242616523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004879836,0.001076815,0.001024607,0.0008997982,0.0004685911,0.001412178,0.001555263,0.0007446195,0.00919226],"category_scores_gemma":[0.001037082,0.0006186945,0.00103814,0.002241885,0.0007817526,0.001991907,0.0006360436,0.001528413,0.001731162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195223,"about_ca_system_score_gemma":0.001000807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01025169,"about_ca_topic_score_gemma":0.01492586,"domain_scores_codex":[0.99975,0.00004071307,0.00001333316,0.00003311222,0.0001514539,0.00001133184],"domain_scores_gemma":[0.9997362,0.0001202802,0.00001561354,0.00004226549,0.00007190563,0.00001375613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001648884,0.00002948539,0.0001294226,0.0002495161,0.00004313652,0.00006393814,0.0001350643,0.1621851,0.0011504,0.6439687,0.04073501,0.1512937],"study_design_scores_gemma":[0.000009179073,0.00001656138,0.0001540476,0.00009418698,0.00002790169,0.00010277,0.00004564656,0.3457971,0.0005472352,0.5489972,0.1041869,0.00002134109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001724087,0.005784296,0.9344922,0.0009922512,0.0003232474,0.0000378512,0.0003514441,0.0003468949,0.05594784],"genre_scores_gemma":[0.1149025,0.01406324,0.766167,0.0004362792,0.0006195293,0.0002191604,0.001116555,0.0003619958,0.1021137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01025169,"threshold_uncertainty_score":0.03075117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033044509","doi":"10.1609/aaai.v35i5.16484","title":"Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Combinatorial optimization; Mathematical optimization; Reinforcement learning; Constraint programming; Knapsack problem; Travelling salesman problem; Computer science; Optimization problem; Solver; Heuristics; Context (archaeology); Quadratic assignment problem; Integer programming; Lin–Kernighan heuristic; Mathematics; Stochastic programming; 2-opt; Artificial intelligence","authors":[{"name":"Quentin Cappart","is_ca":true},{"name":"Thierry Moisan","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Isabeau Prémont-Schwarz","is_ca":false},{"name":"André A. Ciré","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04400025295225241,"gpt":0.2862828622392445,"spread":0.2422826092869921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061545,0.001724118,0.001691387,0.0008818653,0.0003844722,0.002001118,0.001878309,0.001626218,0.004227802],"category_scores_gemma":[0.005652525,0.0006790503,0.001091274,0.001491799,0.001451626,0.001625103,0.001766273,0.003384291,0.0006976727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001351416,"about_ca_system_score_gemma":0.002339954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006496829,"about_ca_topic_score_gemma":0.007379756,"domain_scores_codex":[0.9987225,0.0005498214,0.00006994542,0.0001990269,0.0003365048,0.0001222924],"domain_scores_gemma":[0.9965966,0.002676298,0.0001742714,0.0001869467,0.0002678764,0.00009799347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002530124,0.00005626595,0.0003299361,0.0001928627,0.00005277844,0.00006433334,0.0000278423,0.89977,0.0004855022,0.03907723,0.001839957,0.05807795],"study_design_scores_gemma":[0.000006893112,0.0000119695,0.00002665604,0.00001358741,0.000005568776,0.00001061483,0.000003971696,0.9835111,0.0001682861,0.01507982,0.001157333,0.000004186841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002386039,0.0006039744,0.9926373,0.0003579771,0.00004638525,0.00004632822,0.00003771724,0.0002624873,0.003621799],"genre_scores_gemma":[0.31498,0.002035091,0.6761071,0.0006951977,0.0003196519,0.0005744931,0.0003279856,0.0003352775,0.004625275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006496829,"threshold_uncertainty_score":0.01414335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1591802374","doi":"10.1007/978-3-540-24605-3_26","title":"Effective Preprocessing with Hyper-Resolution and Equality Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; DPLL algorithm; Reduction (mathematics); Search tree; Preprocessor; Pruning; Solver; Boolean satisfiability problem; Tree (set theory); Algorithm; Node (physics); Benchmark (surveying); Theoretical computer science; Mathematical optimization; Search algorithm; Artificial intelligence; Mathematics; Programming language","authors":[{"name":"Fahiem Bacchus","is_ca":true},{"name":"Jonathan M. Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01220269376855133,"gpt":0.2419361708464378,"spread":0.2297334770778865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557933,0.001429883,0.001685944,0.001990294,0.002035425,0.004173668,0.004031321,0.001520503,0.02573397],"category_scores_gemma":[0.006842238,0.001429607,0.002437391,0.003819389,0.001802773,0.008513758,0.005658505,0.005623288,0.01028123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069554,"about_ca_system_score_gemma":0.001934674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001373801,"about_ca_topic_score_gemma":0.003029815,"domain_scores_codex":[0.9961002,0.001003108,0.0002774345,0.0008097251,0.001291335,0.0005182651],"domain_scores_gemma":[0.9955339,0.00155808,0.0001116375,0.002060574,0.0006512661,0.00008436384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004237469,0.0002801125,0.0004618181,0.001013729,0.0001570841,0.0003932615,0.0004602037,0.01632191,0.02108446,0.3425202,0.04672917,0.5701544],"study_design_scores_gemma":[0.00008352406,0.00004974828,0.0004123886,0.0001476773,0.0001454237,0.0004162323,0.0002803582,0.07376561,0.05392029,0.7980861,0.07261179,0.00008077554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006332159,0.001038028,0.9628072,0.0009223219,0.0003611541,0.0001324446,0.0006123307,0.003907974,0.02388639],"genre_scores_gemma":[0.1107477,0.0009536268,0.8544887,0.0007113818,0.0003443889,0.0002345029,0.002671591,0.002592701,0.02725543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02573397,"threshold_uncertainty_score":0.08608872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092520161","doi":"10.1016/s0304-3975(01)00164-5","title":"Frozen development in graph coloring","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Graph coloring; Complete coloring; Combinatorics; Fractional coloring; Edge coloring; Mathematics; List coloring; Discrete mathematics; Random graph; Greedy coloring; Dense graph; Graph; Line graph; Graph power; 1-planar graph","authors":[{"name":"Joseph Culberson","is_ca":true},{"name":"Ian P. Gent","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01116320134667742,"gpt":0.2351134554278947,"spread":0.2239502540812173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445383,0.0004556748,0.0006879354,0.001104064,0.002016953,0.001979734,0.001886952,0.001041661,0.005671616],"category_scores_gemma":[0.00737329,0.001170016,0.0009073137,0.001300613,0.003399248,0.004085622,0.002313615,0.004225223,0.0006187739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354253,"about_ca_system_score_gemma":0.001740627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008003358,"about_ca_topic_score_gemma":0.009883406,"domain_scores_codex":[0.9992889,0.0002824976,0.00002024637,0.0001476259,0.0001332327,0.0001275564],"domain_scores_gemma":[0.995194,0.002950264,0.0002299271,0.0007137834,0.0004981724,0.0004138191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003220181,0.00002489966,0.0003751514,0.00004311483,0.000008680847,0.00008475257,0.0003123827,0.01044266,0.0007102333,0.9755335,0.003053887,0.009378545],"study_design_scores_gemma":[0.00001113268,0.000008394944,0.0001271021,0.00001381154,0.000008784027,0.00004465507,0.00006740895,0.03067218,0.0005082307,0.9653815,0.003149294,0.000007516615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1828933,0.001937332,0.7157581,0.003036109,0.0003053532,0.0001728259,0.0003214754,0.0007700644,0.0948054],"genre_scores_gemma":[0.8206178,0.001319633,0.1312893,0.0006408255,0.0001643031,0.000210597,0.0005522372,0.0005213948,0.04468382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008003358,"threshold_uncertainty_score":0.01897347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1871585472","doi":"10.14288/1.0051500","title":"SATenstein : automatically building local search SAT solvers from components","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Boolean satisfiability problem; Satisfiability; Task (project management); Context (archaeology); Solver; Local search (optimization); Range (aeronautics); Satisfiability modulo theories; Theoretical computer science; Selection (genetic algorithm); Programming language; Algorithm; Artificial intelligence","authors":[{"name":"Ashiqur R. KhudaBukhsh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009889219578066074,"gpt":0.1833860784666706,"spread":0.1734968588886046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002351001,0.001427588,0.000887607,0.001065524,0.0006352019,0.001903117,0.003594709,0.001251986,0.008954324],"category_scores_gemma":[0.01036287,0.001242179,0.001581859,0.001443975,0.001256823,0.003392539,0.003095456,0.002119204,0.002583949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001399536,"about_ca_system_score_gemma":0.002628358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002167957,"about_ca_topic_score_gemma":0.004884949,"domain_scores_codex":[0.9980121,0.0007047055,0.0001530013,0.0003873201,0.0005877692,0.0001551085],"domain_scores_gemma":[0.9961419,0.002119367,0.000228327,0.00106279,0.0003541967,0.00009339786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004152933,0.0003226219,0.004113709,0.001072351,0.0003167574,0.0002678215,0.0004484276,0.4584784,0.02023801,0.08478189,0.02026928,0.4092755],"study_design_scores_gemma":[0.00007804243,0.00005167748,0.0001985008,0.00002564589,0.00003583293,0.00006643619,0.00004704862,0.9667627,0.01009472,0.01485867,0.007765378,0.00001527886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01261048,0.0001199117,0.9653468,0.0001165143,0.00003174293,0.0002533811,0.0002269797,0.01762592,0.003668324],"genre_scores_gemma":[0.1138269,0.0001070189,0.8809207,0.0001198791,0.0000185931,0.0004562613,0.001101888,0.001616297,0.00183248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008954324,"threshold_uncertainty_score":0.02995515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047467760","doi":"10.1002/rsa.20061","title":"Cores in random hypergraphs and Boolean formulas","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; struct; Mathematics; Literal (mathematical logic); Combinatorics; Core (optical fiber); Discrete mathematics; Random graph; Algorithm; Computer science; Graph","authors":[{"name":"Michael Molloy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005996719707171033,"gpt":0.2216096229441444,"spread":0.2156129032369733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088483,0.0002569925,0.0007632308,0.001916868,0.0006717927,0.001751872,0.0009422066,0.0007770194,0.002574091],"category_scores_gemma":[0.01851732,0.0007758695,0.0006001721,0.001082524,0.001723929,0.002582578,0.001369613,0.001213612,0.0001958963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001498878,"about_ca_system_score_gemma":0.0005502173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001083081,"about_ca_topic_score_gemma":0.001638112,"domain_scores_codex":[0.9980454,0.0007519203,0.0001185873,0.0003148062,0.0005162557,0.0002529382],"domain_scores_gemma":[0.9850501,0.009843964,0.001750389,0.001370214,0.00125005,0.0007353326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006963592,0.000177681,0.01078421,0.0001838787,0.0001060362,0.0007306114,0.0006062512,0.1320066,0.01174524,0.7918308,0.003800042,0.04733245],"study_design_scores_gemma":[0.00009227467,0.00008045331,0.002426132,0.00003208111,0.00003209549,0.0003735514,0.0001224184,0.4783832,0.005885577,0.5108154,0.001730937,0.00002590985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949804,0.0004277419,0.2947053,0.0005842866,0.00003447134,0.0001167452,0.000265007,0.0008358909,0.008050154],"genre_scores_gemma":[0.9524162,0.00009226433,0.04525099,0.0001773082,0.00002623749,0.0001249191,0.0002537839,0.00009741756,0.001560774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002574091,"threshold_uncertainty_score":0.0110451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1258972194","doi":"10.1613/jair.4726","title":"AutoFolio: An Automatically Configured Algorithm Selector","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Benchmark (surveying); Parameterized complexity; Set (abstract data type); Algorithm; Exploit; Hyperparameter; Variety (cybernetics); Selection (genetic algorithm); Range (aeronautics); State (computer science); Machine learning; Artificial intelligence","authors":[{"name":"Marius Lindauer","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Frank Hutter","is_ca":false},{"name":"Torsten Schaub","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2320042108967314,"gpt":0.4389980739433883,"spread":0.2069938630466569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004000746,0.002283289,0.000916618,0.001546881,0.0005760036,0.001995356,0.003784577,0.001503434,0.01075486],"category_scores_gemma":[0.01259907,0.001022392,0.001116269,0.001051924,0.001138117,0.002835284,0.002021507,0.001920366,0.00551615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268553,"about_ca_system_score_gemma":0.002046425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001348433,"about_ca_topic_score_gemma":0.001945941,"domain_scores_codex":[0.9971789,0.0008534029,0.0002548829,0.000657174,0.0007907815,0.0002648958],"domain_scores_gemma":[0.9942698,0.003255424,0.0004347561,0.001146546,0.0006417581,0.0002517344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00344063,0.0009244869,0.01608429,0.002325238,0.0003575107,0.0007785499,0.0006699829,0.1498404,0.04596286,0.01693004,0.1198516,0.6428345],"study_design_scores_gemma":[0.000945139,0.0008008033,0.00207014,0.000184422,0.0001008091,0.0006055683,0.0002099853,0.8306456,0.07965329,0.01417575,0.07044844,0.0001601145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08745124,0.001441506,0.5457155,0.0008603614,0.0004433566,0.0007571931,0.002877828,0.3396827,0.02077045],"genre_scores_gemma":[0.435146,0.0006401378,0.5256333,0.001214818,0.0001242787,0.001458431,0.007016465,0.02038238,0.008384137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01075486,"threshold_uncertainty_score":0.03597856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W32539537","doi":"10.1007/978-3-642-31612-8_18","title":"Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Solver; Exploit; Computer science; Portfolio; Set (abstract data type); Competition (biology); Algorithm; Theoretical computer science; Programming language","authors":[{"name":"Lin Xu","is_ca":true},{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02370113490786962,"gpt":0.3029840092867271,"spread":0.2792828743788575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104998,0.001901073,0.001578302,0.002449751,0.0007250931,0.003580216,0.002118435,0.002209557,0.01025695],"category_scores_gemma":[0.06440447,0.0008646136,0.001046502,0.002329741,0.0009233451,0.00331736,0.002495791,0.002019681,0.001379631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001819565,"about_ca_system_score_gemma":0.002639901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002271048,"about_ca_topic_score_gemma":0.004838574,"domain_scores_codex":[0.9912761,0.004272644,0.0003783236,0.0005923482,0.002911968,0.00056851],"domain_scores_gemma":[0.9551264,0.03504111,0.001034407,0.002734638,0.005139799,0.0009237082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00241622,0.0003916195,0.005655631,0.0004359853,0.0002803331,0.0001265138,0.0001206922,0.5918114,0.002316278,0.02248161,0.01021438,0.3637494],"study_design_scores_gemma":[0.00006146583,0.0001176705,0.000388605,0.0000342087,0.00006793533,0.00002376062,0.00002538064,0.9902225,0.001579176,0.006545772,0.0009266011,0.000006992561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2108275,0.003929588,0.7370796,0.001371382,0.0007500775,0.0004750024,0.0006728173,0.004761672,0.04013233],"genre_scores_gemma":[0.6227394,0.0007898998,0.3668011,0.0002230138,0.0002537692,0.0002582515,0.001139187,0.001202541,0.006592861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0104998,"threshold_uncertainty_score":0.05552894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155616412","doi":"10.1007/s10732-006-6550-4","title":"On global warming: Flow-based soft global constraints","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Cardinality (data modeling); Graph; Constraint graph; Constraint satisfaction; Computer science; Mathematical optimization; Consistency (knowledge bases); Flow (mathematics); Mathematics; Theoretical computer science; Discrete mathematics; Artificial intelligence; Data mining","authors":[{"name":"Willem‐Jan van Hoeve","is_ca":false},{"name":"Gilles Pesant","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008280661343385138,"gpt":0.2432512250558484,"spread":0.2349705637124633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900182,0.001229741,0.001442887,0.001619263,0.001135183,0.002307637,0.00205478,0.001827728,0.009074659],"category_scores_gemma":[0.01365197,0.0008326537,0.00123041,0.002020103,0.00260363,0.007760481,0.00315198,0.003873725,0.0003422589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116757,"about_ca_system_score_gemma":0.001206432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006735604,"about_ca_topic_score_gemma":0.007869856,"domain_scores_codex":[0.9985133,0.0007699589,0.00005003784,0.0001749806,0.0002824679,0.0002093238],"domain_scores_gemma":[0.9913298,0.007015067,0.0003789829,0.0004099506,0.0006047294,0.0002614966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001873175,0.0000817134,0.0006006536,0.0002624557,0.00006415991,0.0001548752,0.0002342293,0.6248423,0.000797142,0.3031662,0.006251024,0.06335792],"study_design_scores_gemma":[0.00004202328,0.00005204645,0.0002600184,0.00005662442,0.00003600442,0.00004144941,0.00009886426,0.6607459,0.0006185342,0.3339252,0.004093905,0.00002947714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04008775,0.001380275,0.9303933,0.002747652,0.0004607443,0.0001816675,0.000302324,0.0002352533,0.02421092],"genre_scores_gemma":[0.6928072,0.001972571,0.29146,0.00116668,0.0005312081,0.0002496939,0.0003905983,0.0002983344,0.01112365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009074659,"threshold_uncertainty_score":0.03035778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984853564","doi":"10.1016/s0004-3702(01)00151-5","title":"Local search characteristics of incomplete SAT procedures","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Weighting; Local search (optimization); Descent (aeronautics); Computer science; Mathematical optimization; Linear search; Mathematics; Algorithm; Artificial intelligence; Engineering","authors":[{"name":"Dale Schuurmans","is_ca":true},{"name":"Finnegan Southey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05189737654584579,"gpt":0.2973862910330178,"spread":0.2454889144871721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002811753,0.0002945367,0.001153814,0.00135501,0.0007970774,0.001792218,0.001229819,0.0007355322,0.008252863],"category_scores_gemma":[0.03047109,0.0004221695,0.0005652415,0.002112168,0.001465051,0.00312347,0.001190241,0.001499874,0.0007931749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009418713,"about_ca_system_score_gemma":0.001450142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001162926,"about_ca_topic_score_gemma":0.002365038,"domain_scores_codex":[0.9977404,0.0009502104,0.0001104137,0.0001994081,0.0007995859,0.0001999474],"domain_scores_gemma":[0.9702892,0.02255154,0.002054202,0.002852048,0.001747079,0.000505902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001030926,0.0003492735,0.00865357,0.0006879641,0.0001402973,0.0005425006,0.001522049,0.3177278,0.01451701,0.4917179,0.007071815,0.1560389],"study_design_scores_gemma":[0.0001147057,0.0003295768,0.003536641,0.00007322766,0.0001207011,0.0005356197,0.0004595308,0.703845,0.01013662,0.2753092,0.005492505,0.00004669662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3121254,0.00112016,0.6437038,0.0006744306,0.00003731704,0.000253063,0.0004956382,0.001331396,0.04025882],"genre_scores_gemma":[0.9137167,0.0004134316,0.0775039,0.0001102202,0.00006702933,0.0003175439,0.0005430161,0.0004353516,0.006892787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008252863,"threshold_uncertainty_score":0.02760857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025473159","doi":"10.1007/s10951-008-0080-x","title":"A theoretic and practical framework for scheduling in a stochastic environment","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Mathematical optimization","authors":[{"name":"Julien Bidot","is_ca":false},{"name":"Thierry Vidal","is_ca":false},{"name":"Philippe Laborie","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0288714523609218,"gpt":0.2837969058946502,"spread":0.2549254535337284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006873243,0.001846658,0.001858324,0.002044562,0.002440368,0.005298066,0.004476142,0.002794301,0.007247581],"category_scores_gemma":[0.01873807,0.001562683,0.001959689,0.003389207,0.005336466,0.007011371,0.004542706,0.00638915,0.001233782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004201659,"about_ca_system_score_gemma":0.006145223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006934546,"about_ca_topic_score_gemma":0.007183987,"domain_scores_codex":[0.9936721,0.002646014,0.0003481379,0.0007474847,0.002085652,0.0005005565],"domain_scores_gemma":[0.9917767,0.00479978,0.0005402065,0.001359058,0.001031538,0.000492735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002325589,0.00004959794,0.0001251327,0.00007066453,0.00001926757,0.00007243791,0.0001041819,0.1929312,0.0004396228,0.7935154,0.002392587,0.01025677],"study_design_scores_gemma":[0.00001701512,0.00002830392,0.00004142836,0.00001848655,0.00001095558,0.00005623118,0.00004727744,0.5470083,0.0001942458,0.4472593,0.005300099,0.00001828172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001018633,0.0001005892,0.995184,0.0006908195,0.00005681412,0.00004756623,0.00006255994,0.0001193403,0.002719638],"genre_scores_gemma":[0.1955294,0.0008826965,0.7960644,0.0004186764,0.0007583739,0.0005176645,0.0002958835,0.0002307333,0.00530212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007247581,"threshold_uncertainty_score":0.03634965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999823208","doi":"10.5555/777092.777187","title":"Enhancing Davis Putnam with extended binary clause reasoning","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"DPLL algorithm; Backtracking; Computer science; Heuristics; Boolean satisfiability problem; Binary number; Solver; Satisfiability; Theoretical computer science; Heuristic; Conjunctive normal form; Algorithm; Artificial intelligence; Mathematics; Programming language; Arithmetic","authors":[{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01142885634625179,"gpt":0.2137317807357935,"spread":0.2023029243895417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018754,0.001218081,0.0008638742,0.001749705,0.0006326112,0.002122633,0.003346367,0.001233769,0.01319356],"category_scores_gemma":[0.00919187,0.0006852252,0.001380923,0.002028312,0.001492048,0.004120015,0.003577952,0.002425016,0.001936705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382077,"about_ca_system_score_gemma":0.001738071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005392378,"about_ca_topic_score_gemma":0.01035291,"domain_scores_codex":[0.9977584,0.0005954885,0.0001414196,0.0002707521,0.00102175,0.0002121731],"domain_scores_gemma":[0.9960091,0.002447576,0.0001868424,0.0006166048,0.0006482894,0.00009149275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004556856,0.0004976291,0.001461287,0.0009604134,0.0001237226,0.0005914216,0.000500541,0.1586245,0.01687027,0.3221225,0.01797204,0.47982],"study_design_scores_gemma":[0.0002684387,0.0001598928,0.0002879326,0.0001045781,0.00009163693,0.0002782441,0.0001247486,0.7616434,0.03186014,0.1707495,0.03437195,0.00005953934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03433194,0.0006573402,0.9163326,0.001006139,0.0001955336,0.0004337636,0.0004852951,0.006186887,0.0403705],"genre_scores_gemma":[0.2065756,0.0004409005,0.7802565,0.0006670097,0.0000790522,0.0002110867,0.0008671337,0.0006010795,0.01030166],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01319356,"threshold_uncertainty_score":0.04413694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125336041","doi":"","title":"Generalized nogoods in CSPs","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Solver; Computer science; Boolean satisfiability problem; Mathematical optimization; Yield (engineering); Artificial intelligence; Theoretical computer science; Mathematics; Programming language","authors":[{"name":"George Katsirelos","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1145998237209562,"gpt":0.3476652843411281,"spread":0.2330654606201719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003386635,0.0008109578,0.001050419,0.0009663551,0.001133426,0.001907094,0.002026497,0.000996199,0.004415701],"category_scores_gemma":[0.01193492,0.0006162244,0.001681312,0.001368451,0.002895667,0.005236121,0.00322852,0.003713175,0.0005539603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362969,"about_ca_system_score_gemma":0.002433061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003922661,"about_ca_topic_score_gemma":0.007416582,"domain_scores_codex":[0.9968732,0.001166956,0.0002436638,0.0006027322,0.000842881,0.0002705596],"domain_scores_gemma":[0.9934101,0.003919867,0.0003965061,0.001089009,0.0009275556,0.0002569813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001980551,0.0001347361,0.001203703,0.0005171665,0.0001187292,0.0003555418,0.0004141726,0.2878692,0.004885084,0.5652801,0.005121863,0.1339017],"study_design_scores_gemma":[0.00003524329,0.000032878,0.0001140421,0.00002635122,0.00002471014,0.00009809757,0.00006751413,0.2307551,0.002422502,0.7609527,0.005446642,0.0000243212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01989001,0.0002602822,0.975105,0.0005092668,0.00006787298,0.00012103,0.0002241243,0.0007074159,0.003115025],"genre_scores_gemma":[0.3568901,0.0006463838,0.6356642,0.0006434611,0.0001420571,0.000408759,0.0007279252,0.0004097173,0.004467491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004415701,"threshold_uncertainty_score":0.01791042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147012241","doi":"10.1016/s0304-3975(01)00154-2","title":"Rigorous results for random (2+p)-SAT","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","authors":[{"name":"Dimitris Achlioptas","is_ca":false},{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01110638169363145,"gpt":0.2534107792008292,"spread":0.2423043975071978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01696531,0.003548099,0.005039928,0.005773493,0.003707191,0.009318782,0.008497845,0.005176124,0.01856445],"category_scores_gemma":[0.07568291,0.003035038,0.00618188,0.006634406,0.0102271,0.02279756,0.009837535,0.0142493,0.002694862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006504861,"about_ca_system_score_gemma":0.004138731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002749557,"about_ca_topic_score_gemma":0.00349174,"domain_scores_codex":[0.9822827,0.007352474,0.0009067158,0.002781889,0.004964584,0.00171161],"domain_scores_gemma":[0.9202651,0.06267099,0.003106731,0.008023372,0.003794156,0.002139741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001348592,0.0001132232,0.000591401,0.0003342895,0.0001124859,0.00007676298,0.0001185701,0.02122524,0.0006215302,0.9593572,0.007586017,0.00972849],"study_design_scores_gemma":[0.00005395112,0.00003026646,0.0002477053,0.00004928602,0.00004193027,0.00006893974,0.00002577638,0.06377093,0.0002940527,0.9332407,0.00214599,0.00003046367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02901089,0.004605602,0.895347,0.008639239,0.0007777481,0.0002574941,0.001569448,0.001243001,0.05854959],"genre_scores_gemma":[0.6676254,0.00747767,0.2647198,0.007109929,0.004976833,0.001968028,0.004431999,0.00284077,0.03884954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01856445,"threshold_uncertainty_score":0.08972222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104749823","doi":"","title":"Learning to solve QBF","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Solver; Heuristic; Boolean satisfiability problem; Mathematical optimization; Maximum satisfiability problem; Boolean data type; Classifier (UML); Set (abstract data type); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Boolean function","authors":[{"name":"Horst Samulowitz","is_ca":true},{"name":"Roland Memisevic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008842868261025316,"gpt":0.2458777848377235,"spread":0.2370349165766981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003282085,0.001326132,0.001387345,0.001171975,0.0007392404,0.001497242,0.002027483,0.001664427,0.006710601],"category_scores_gemma":[0.02065816,0.0007047877,0.001385443,0.001706588,0.001521629,0.002692575,0.001607374,0.002295231,0.0008931805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00140638,"about_ca_system_score_gemma":0.003009715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004627512,"about_ca_topic_score_gemma":0.006063864,"domain_scores_codex":[0.997376,0.00109915,0.0001615991,0.0005148969,0.0006190435,0.0002293189],"domain_scores_gemma":[0.9905701,0.007559969,0.0004577368,0.0004475267,0.0008395008,0.0001252401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001221335,0.0002401653,0.001503816,0.0007236228,0.0001307581,0.0001678954,0.0002807855,0.5708641,0.001478076,0.1395867,0.00721055,0.2776914],"study_design_scores_gemma":[0.00005020851,0.00005013602,0.00008052734,0.00003779283,0.00001899283,0.00003708875,0.00002999552,0.8619145,0.0008062074,0.1345653,0.002399713,0.000009592583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005144292,0.0002080146,0.9915401,0.0004843312,0.00003644729,0.00008886327,0.0001053912,0.0004206791,0.001971835],"genre_scores_gemma":[0.1630035,0.0004702736,0.8320566,0.0004557488,0.0001205648,0.0005416936,0.000616585,0.0001965823,0.002538375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006710601,"threshold_uncertainty_score":0.02244914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993886628","doi":"10.1016/j.tcs.2008.12.049","title":"Affine systems of equations and counting infinitary logic","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unary operation; Discrete mathematics; Constraint satisfaction problem; Affine transformation; Counting problem; Abelian group; Datalog; Algebra over a field; Pure mathematics; Computer science; Theoretical computer science","authors":[{"name":"Albert Atserias","is_ca":false},{"name":"Andreǐ A. Bulatov","is_ca":true},{"name":"Anuj Dawar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01276918873415195,"gpt":0.2434179504003676,"spread":0.2306487616662157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039905,0.0008810688,0.001133365,0.001912889,0.001832207,0.004107565,0.002358862,0.001157745,0.008438068],"category_scores_gemma":[0.009257187,0.0009706828,0.001760885,0.003053572,0.005059506,0.00669776,0.002557627,0.004855818,0.0007158185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002863691,"about_ca_system_score_gemma":0.001273843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005451149,"about_ca_topic_score_gemma":0.00757418,"domain_scores_codex":[0.9978412,0.0007934657,0.0002020841,0.0003692349,0.000546118,0.0002478008],"domain_scores_gemma":[0.9950051,0.003409301,0.0004131534,0.0004300272,0.0005496006,0.0001928063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008165184,0.000009310947,0.0001398678,0.00001893795,0.000006587255,0.00002076104,0.00007687166,0.001689819,0.00009583699,0.9948884,0.0004591623,0.002586298],"study_design_scores_gemma":[0.000004293147,0.00000215269,0.00004296275,0.000004225049,0.000005198133,0.00001118753,0.00001303727,0.005703676,0.00009415795,0.9933974,0.000716875,0.000004910452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320812,0.002734862,0.7881167,0.003441198,0.0003947101,0.00008405562,0.0004892545,0.0005816194,0.07207637],"genre_scores_gemma":[0.8458491,0.001390946,0.1257193,0.0006491707,0.0005800841,0.0001363258,0.0007620943,0.0001691449,0.02474379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008438068,"threshold_uncertainty_score":0.02822816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1528564561","doi":"","title":"A fast and simple algorithm for bounds consistency of the all different constraint","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; Backtracking; Constraint programming; Constraint (computer-aided design); Consistency (knowledge bases); Constraint logic programming; Computer science; Constraint satisfaction; Mathematical optimization; Binary constraint; Benchmark (surveying); Constraint learning; Interleaving; Algorithm; Constraint satisfaction problem; Simple (philosophy); Mathematics; Artificial intelligence; Stochastic programming; Probabilistic logic","authors":[{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":true},{"name":"John Tromp","is_ca":false},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01529265733168559,"gpt":0.2373962479057004,"spread":0.2221035905740148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004465878,0.002048076,0.0016003,0.002484258,0.001692802,0.002472368,0.003499936,0.002393642,0.0139441],"category_scores_gemma":[0.01553384,0.00128428,0.001564704,0.00299863,0.002284253,0.00484886,0.004800221,0.004640057,0.004025497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001391171,"about_ca_system_score_gemma":0.004233249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003718434,"about_ca_topic_score_gemma":0.005126897,"domain_scores_codex":[0.9964265,0.0009027517,0.0002475328,0.0008240305,0.001337991,0.0002611584],"domain_scores_gemma":[0.9896327,0.006507957,0.0006882658,0.00157651,0.001394559,0.0002000329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003010734,0.0002854401,0.0007662361,0.0004491704,0.0001120784,0.0001742936,0.0003741006,0.08063663,0.01066613,0.1088059,0.01991966,0.7775093],"study_design_scores_gemma":[0.0002895103,0.0001507089,0.0002627879,0.0000990366,0.00008483571,0.0003298123,0.0001408605,0.8073325,0.01915893,0.1485053,0.02352422,0.0001214986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001052808,0.00005818997,0.9960323,0.0001211724,0.00003042905,0.0001173404,0.00005086603,0.001507509,0.00102948],"genre_scores_gemma":[0.02323912,0.00008133803,0.9738446,0.0001180441,0.00003543467,0.0002369648,0.0002426435,0.0005584662,0.001643356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0139441,"threshold_uncertainty_score":0.04664761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W152517204","doi":"10.1007/s10462-004-5899-8","title":"Relation Algebras and their Application in Temporal and Spatial Reasoning","year":2005,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Binary relation; Relation (database); Spatial intelligence; Relational calculus; Converse; Relation algebra; Computer science; Spatial relation; Formalism (music); Algebra over a field; Mathematics; Relational model; Calculus (dental); Relational database; Discrete mathematics; Pure mathematics; Artificial intelligence; Information retrieval; Two-element Boolean algebra","authors":[{"name":"Ivo D�ntsch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02811598587504287,"gpt":0.2862117436893437,"spread":0.2580957578143008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007630852,0.001066973,0.002455231,0.00559603,0.001434049,0.006350071,0.003703449,0.002277818,0.004868493],"category_scores_gemma":[0.0144533,0.001399238,0.002510765,0.01450141,0.008700569,0.00973337,0.002821777,0.005976312,0.001200519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004328254,"about_ca_system_score_gemma":0.003547226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01200635,"about_ca_topic_score_gemma":0.009986214,"domain_scores_codex":[0.9956051,0.001537982,0.0004421686,0.0004757649,0.001797941,0.0001409463],"domain_scores_gemma":[0.9881285,0.00902312,0.0005253285,0.0008687112,0.001270676,0.0001836402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001520609,0.00003150399,0.0002083148,0.0006910985,0.00008538979,0.00004221091,0.0001412291,0.008516769,0.0001844748,0.925532,0.003129874,0.0614218],"study_design_scores_gemma":[0.000009955276,0.00001453687,0.0002537011,0.0002167758,0.00003200241,0.0001092551,0.00006847387,0.01790512,0.0002461018,0.9426273,0.03848092,0.00003601619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00453798,0.3587224,0.5897648,0.005552871,0.0009115765,0.0001799735,0.0004855153,0.0001960264,0.03964885],"genre_scores_gemma":[0.1092237,0.3246074,0.5510667,0.002044034,0.003547396,0.0004427459,0.0006573138,0.000109812,0.008300983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01200635,"threshold_uncertainty_score":0.04035628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970251068","doi":"10.1016/s0166-218x(00)00262-6","title":"Investigations on autark assignments","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics","authors":[{"name":"Oliver Kullmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01423618923611557,"gpt":0.232626912351096,"spread":0.2183907231149804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001525876,0.0007736156,0.0008954957,0.002387541,0.004537169,0.004220761,0.002061945,0.001802706,0.03578403],"category_scores_gemma":[0.01181646,0.0005315981,0.000819271,0.004149586,0.00339402,0.00916462,0.003422908,0.004031965,0.003294979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136977,"about_ca_system_score_gemma":0.0007756146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005701491,"about_ca_topic_score_gemma":0.0006444121,"domain_scores_codex":[0.9979512,0.0008920282,0.000115634,0.0003405082,0.0004424535,0.0002581735],"domain_scores_gemma":[0.9943258,0.003675039,0.0004315078,0.0007603127,0.0004518476,0.0003555593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002160575,0.00002437419,0.0001116846,0.00003564509,0.000001988452,0.00004187033,0.0001603925,0.0004792862,0.0001314886,0.9903458,0.001346796,0.007299078],"study_design_scores_gemma":[0.000006528434,0.00001308714,0.0001044829,0.00001927088,0.000002883063,0.00008766804,0.0001959522,0.001955555,0.0003260283,0.9905758,0.006707148,0.000005567502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1871282,0.001283271,0.1527229,0.004557761,0.0008122608,0.000142665,0.0003083081,0.0004176268,0.6526271],"genre_scores_gemma":[0.8519806,0.001688171,0.05521512,0.001784869,0.0009293011,0.0002027495,0.0006317591,0.000372697,0.08719468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03578403,"threshold_uncertainty_score":0.1197096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575452963","doi":"10.1613/jair.788","title":"Conflict-Directed Backjumping Revisited","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Look-ahead; Beam stack search; Constraint learning; Consistency (knowledge bases); Local consistency; Heuristic; Computer science; Constraint satisfaction problem; Focus (optics); Constraint (computer-aided design); Mathematical optimization; Algorithm; Contrast (vision); Constraint satisfaction; Search algorithm; Mathematics; Artificial intelligence; Incremental heuristic search; Beam search","authors":[{"name":"Xinguang Chen","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2109980789570575,"gpt":0.4285933742557623,"spread":0.2175952952987048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002996451,0.001084859,0.001452652,0.001144364,0.001392808,0.001754437,0.004042278,0.001575383,0.004145621],"category_scores_gemma":[0.01124012,0.0009769218,0.00152872,0.003241691,0.002569134,0.00306983,0.002195892,0.003989325,0.0007569704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476903,"about_ca_system_score_gemma":0.002072828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007300815,"about_ca_topic_score_gemma":0.006748482,"domain_scores_codex":[0.9963959,0.001110513,0.000194146,0.0005969481,0.001334343,0.0003681231],"domain_scores_gemma":[0.990699,0.004756548,0.0005825026,0.002426479,0.001272849,0.0002626707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005743664,0.0005006729,0.006569677,0.001592414,0.0003276474,0.0008201448,0.001314793,0.2240378,0.01513967,0.1539164,0.01454788,0.5806585],"study_design_scores_gemma":[0.0002305987,0.0002969047,0.002042311,0.0001629315,0.0003092758,0.001466609,0.0003369143,0.7848572,0.03418275,0.1338502,0.04212702,0.000137292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08283518,0.007856597,0.8884766,0.002135949,0.0003852264,0.0002988499,0.0002389452,0.003919553,0.01385315],"genre_scores_gemma":[0.4612482,0.002841089,0.5271543,0.00111365,0.0001659142,0.0001891921,0.0004146152,0.0006250442,0.006247989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007300815,"threshold_uncertainty_score":0.01584691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185085875","doi":"10.1016/j.artint.2015.11.002","title":"SATenstein: Automatically building local search SAT solvers from components","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Solver; Parameterized complexity; Boolean satisfiability problem; Local search (optimization); Satisfiability; Task (project management); Theoretical computer science; State (computer science); Algorithm; Programming language","authors":[{"name":"Ashiqur R. KhudaBukhsh","is_ca":false},{"name":"Lin Xu","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1141609460867904,"gpt":0.3091856572084594,"spread":0.195024711121669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001012321,0.002393586,0.001274815,0.001906733,0.0008172254,0.001709754,0.003561588,0.001577925,0.02148844],"category_scores_gemma":[0.006828846,0.00161551,0.002467274,0.002086691,0.001058154,0.002998892,0.002640539,0.00276792,0.00548804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062963,"about_ca_system_score_gemma":0.002369319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005399802,"about_ca_topic_score_gemma":0.01998364,"domain_scores_codex":[0.9991308,0.0002834259,0.00005498639,0.0001882538,0.0002622256,0.00008020403],"domain_scores_gemma":[0.9975056,0.001692199,0.00007710903,0.000380264,0.0002949151,0.00004996027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006272364,0.0004643992,0.002822308,0.002117161,0.0004554038,0.0004010794,0.0002807404,0.2734805,0.01308155,0.04432954,0.08653526,0.5754048],"study_design_scores_gemma":[0.0001605109,0.00006548559,0.0002318015,0.00006061726,0.00008463174,0.00005348016,0.00005850552,0.9630673,0.005175594,0.02291726,0.008108315,0.0000165553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01407071,0.0005660508,0.9166148,0.0003412197,0.0001369391,0.0005153492,0.002166005,0.05319459,0.01239428],"genre_scores_gemma":[0.1051269,0.0002424923,0.8802177,0.0003381663,0.00003795782,0.0005733035,0.00543482,0.003562996,0.004465652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02148844,"threshold_uncertainty_score":0.07188594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2717681899","doi":"10.1111/tops.12277","title":"Representation and Computation in Cognitive Models","year":2017,"lang":"en","type":"article","venue":"Topics in Cognitive Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Science North","funders":"Air Force Office of Scientific Research; Office of Naval Research; National Science Foundation","keywords":"Cognition; Representation (politics); Computation; Computer science; Cognitive science; Cognitive model; Artificial intelligence; Theoretical computer science; Cognitive psychology; Psychology; Algorithm","authors":[{"name":"Kenneth D. Forbus","is_ca":true},{"name":"Chen Liang","is_ca":true},{"name":"Irina Rabkina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1057287436027888,"gpt":0.388826642501243,"spread":0.2830978988984542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003265497,0.0007982209,0.0009566279,0.001370567,0.001167887,0.005626617,0.001962856,0.001965286,0.006011688],"category_scores_gemma":[0.007543196,0.0004866215,0.001898483,0.002015147,0.007199969,0.008610556,0.00311378,0.003055884,0.0008452812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00328651,"about_ca_system_score_gemma":0.001784362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005413815,"about_ca_topic_score_gemma":0.004382601,"domain_scores_codex":[0.9976696,0.001182205,0.0001521267,0.000364172,0.0004722404,0.0001596261],"domain_scores_gemma":[0.9969751,0.001818565,0.0001578642,0.0006729442,0.0002675055,0.0001080142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002547798,0.000002221055,0.00003129316,0.00002006949,0.000005417283,0.000009817686,0.00008410396,0.004289274,0.00002823647,0.9935411,0.000354972,0.001630851],"study_design_scores_gemma":[0.000002342738,0.000001377845,0.0000155741,0.00000882537,0.000002175093,0.000006176892,0.00002034053,0.01216274,0.0000210536,0.9851966,0.002560366,0.000002381674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01841508,0.005730049,0.8809204,0.01593684,0.000260167,0.00007847599,0.0005302505,0.000376396,0.07775237],"genre_scores_gemma":[0.6350581,0.004603318,0.3427922,0.001211718,0.0005989687,0.0005716525,0.0009002229,0.0002150032,0.01404866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006011688,"threshold_uncertainty_score":0.02384543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481022196","doi":"10.1007/978-3-540-45193-8_11","title":"hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Computer science; Constraint satisfaction; Scheduling (production processes); Constraint satisfaction problem; Mathematical optimization; Modular design; Heuristic; Benchmark (surveying); Nurse scheduling problem; Constraint logic programming; Job shop scheduling; Operations research; Artificial intelligence; Flow shop scheduling; Programming language; Schedule; Mathematics; Stochastic programming","authors":[{"name":"S. Bourdais","is_ca":true},{"name":"Philippe Galinier","is_ca":true},{"name":"Gilles Pesant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01152992932066334,"gpt":0.2606834279933662,"spread":0.2491534986727029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234309,0.0011964,0.0008682255,0.0007061528,0.0009249503,0.001783918,0.002115458,0.001135473,0.03189925],"category_scores_gemma":[0.003446813,0.0009221384,0.0009637517,0.001921951,0.0006073554,0.001445116,0.001737415,0.001755007,0.003468645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007515663,"about_ca_system_score_gemma":0.001571271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02011347,"about_ca_topic_score_gemma":0.0369531,"domain_scores_codex":[0.9995031,0.0001544331,0.00003492341,0.0000699291,0.0001915982,0.00004603906],"domain_scores_gemma":[0.9989574,0.0007231379,0.00005142024,0.00005695742,0.0001395877,0.00007150195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003126497,0.0002137769,0.001032249,0.001439343,0.0001295428,0.0008764971,0.0009203184,0.2745355,0.00506806,0.1779708,0.1714369,0.3660643],"study_design_scores_gemma":[0.0002045843,0.00005230951,0.0004897764,0.0002098938,0.00007275052,0.0003478046,0.0002481166,0.7232875,0.005027416,0.08396538,0.186022,0.00007236351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002865268,0.0004309026,0.9676152,0.0008318988,0.00021611,0.0002343077,0.001900474,0.006778736,0.01912708],"genre_scores_gemma":[0.03144442,0.0008643309,0.9504527,0.0003622319,0.0001183112,0.000433502,0.001209387,0.001772298,0.01334276],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03189925,"threshold_uncertainty_score":0.1067136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151266168","doi":"10.1023/a:1011402324562","title":"Random Constraint Satisfaction: A More Accurate Picture","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Complement (music); Constraint (computer-aided design); Mathematics; Applied mathematics; Point (geometry); Constraint satisfaction problem; Mathematical optimization; Statistics; Geometry","authors":[{"name":"Dimitris Achlioptas","is_ca":true},{"name":"Michael Molloy","is_ca":true},{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Yannis C. Stamatiou","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01599495645134832,"gpt":0.257697762280475,"spread":0.2417028058291266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006009879,0.002033324,0.002801638,0.00362067,0.001549086,0.008718511,0.005028345,0.005002607,0.01260654],"category_scores_gemma":[0.02010613,0.00121909,0.00143944,0.003679507,0.01088816,0.02868351,0.003545386,0.01059884,0.002372294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002287357,"about_ca_system_score_gemma":0.001656693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003463832,"about_ca_topic_score_gemma":0.002754769,"domain_scores_codex":[0.9952304,0.001779839,0.0002453367,0.0007270986,0.001805991,0.0002113273],"domain_scores_gemma":[0.9912621,0.004714045,0.000417743,0.002203066,0.001141378,0.0002617172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001961124,0.00001839897,0.0001167308,0.0001693447,0.00002381868,0.00003446912,0.0000953218,0.004316008,0.0002000583,0.9724305,0.00923128,0.0133445],"study_design_scores_gemma":[0.00001295996,0.00001141599,0.0000839208,0.00005454241,0.000009843937,0.00005917165,0.00005599,0.01494709,0.00010689,0.9641216,0.02051883,0.00001771491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004010992,0.02868126,0.8691533,0.0489149,0.002106366,0.00005562537,0.0008041807,0.0003948259,0.04587843],"genre_scores_gemma":[0.3673832,0.07763115,0.4599689,0.02566852,0.01972809,0.0006581625,0.002677981,0.001656561,0.0446274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01260654,"threshold_uncertainty_score":0.04217303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018508868","doi":"10.1007/s11786-013-0149-6","title":"Near Sets: An Introduction","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Set (abstract data type); Combinatorics; Relation (database); Space (punctuation); Discrete mathematics; Data mining; Computer science","authors":[{"name":"James F. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01423836951559186,"gpt":0.2504741927382823,"spread":0.2362358232226904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034268,0.001622832,0.001307257,0.00523131,0.002494821,0.006381841,0.002658177,0.003283754,0.02025764],"category_scores_gemma":[0.005476879,0.000957211,0.001883949,0.005269811,0.004705478,0.01267237,0.004600032,0.006027728,0.007468836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003034674,"about_ca_system_score_gemma":0.001598035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002183135,"about_ca_topic_score_gemma":0.001160622,"domain_scores_codex":[0.9969718,0.0008216416,0.0002842045,0.000754951,0.0009931658,0.0001741939],"domain_scores_gemma":[0.997126,0.001824823,0.0001351607,0.0003016342,0.0004759013,0.0001364362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001803714,0.00004356739,0.0004736099,0.0009365843,0.00002587607,0.0002297664,0.0006530312,0.001364198,0.0003589739,0.8840832,0.02712057,0.08469269],"study_design_scores_gemma":[0.000004140672,0.00003601208,0.0003125361,0.0005533315,0.0000124667,0.0007896284,0.000226251,0.001856858,0.0001611801,0.4499356,0.5460846,0.00002741165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.005018665,0.3760805,0.2827682,0.01050762,0.009764954,0.0002914055,0.001512389,0.0006534538,0.3134028],"genre_scores_gemma":[0.1418833,0.44471,0.2633976,0.01449449,0.02616525,0.001540591,0.004268108,0.001166094,0.1023746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02025764,"threshold_uncertainty_score":0.06776851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076946745","doi":"10.1016/j.ic.2009.05.003","title":"The complexity of constraint satisfaction games and QCSP","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Ministerio de Educación, Cultura y Deporte","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Local consistency; Constraint (computer-aided design); Constraint satisfaction dual problem; Mathematics; Predicate (mathematical logic); Surjective function; Sentence; Set (abstract data type); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","authors":[{"name":"Ferdinand Börner","is_ca":false},{"name":"А. А. Булатов","is_ca":true},{"name":"H. Chen","is_ca":false},{"name":"Peter Jeavons","is_ca":false},{"name":"Andrei Krokhin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01776225052734606,"gpt":0.2474102144643625,"spread":0.2296479639370164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481065,0.0009990932,0.002284375,0.001164477,0.002091053,0.0064872,0.002919145,0.002584605,0.01515244],"category_scores_gemma":[0.02515207,0.001064971,0.001922165,0.003239243,0.003278009,0.01144826,0.003083839,0.004694068,0.0006748828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005045694,"about_ca_system_score_gemma":0.004880677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01656329,"about_ca_topic_score_gemma":0.01340747,"domain_scores_codex":[0.9956643,0.00153623,0.0002232984,0.0006507997,0.001231545,0.0006938156],"domain_scores_gemma":[0.9707946,0.02437701,0.001334524,0.001513541,0.001134446,0.0008457884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002859222,0.0001708471,0.001255932,0.0003162387,0.0001121824,0.0001680012,0.0003741207,0.174,0.0005428608,0.7941092,0.008458029,0.02020657],"study_design_scores_gemma":[0.00005042008,0.00001289709,0.0002277287,0.00001590001,0.0000206832,0.00003620573,0.00006834626,0.1987702,0.0001396566,0.7994757,0.001165892,0.00001633435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.315708,0.002199328,0.5904886,0.01812725,0.0003148961,0.0004283048,0.004248929,0.0007460135,0.06773878],"genre_scores_gemma":[0.8965877,0.001416715,0.08329656,0.0009282341,0.0004296546,0.0004262163,0.002251396,0.0002740694,0.01438946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01656329,"threshold_uncertainty_score":0.05069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1765613701","doi":"10.1007/978-3-642-44973-4_40","title":"Identifying Key Algorithm Parameters and Instance Features Using Forward Selection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Key (lock); Salient; Set (abstract data type); Algorithm; Variety (cybernetics); Selection (genetic algorithm); Machine learning; Feature (linguistics); Artificial intelligence","authors":[{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01973576009910112,"gpt":0.2501540446791399,"spread":0.2304182845800388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003204263,0.001892754,0.002352316,0.001981328,0.0007221393,0.00370789,0.003029295,0.002621527,0.007317651],"category_scores_gemma":[0.0192435,0.0009656423,0.001696271,0.001536948,0.0006195852,0.004807902,0.001487816,0.002938504,0.003419539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008987876,"about_ca_system_score_gemma":0.001575631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016971,"about_ca_topic_score_gemma":0.001422156,"domain_scores_codex":[0.9973788,0.0006863364,0.0002453454,0.0007087335,0.0007287454,0.000252001],"domain_scores_gemma":[0.9937128,0.003840507,0.0003374929,0.001170371,0.0008173609,0.0001213962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001417664,0.0004028564,0.01072946,0.0006131057,0.0002685568,0.0003467902,0.0001308939,0.08401558,0.03211503,0.01212138,0.01515855,0.8426802],"study_design_scores_gemma":[0.00009885679,0.0001629833,0.00205949,0.00008064971,0.0002476652,0.0002845502,0.00008502448,0.9430797,0.02756295,0.02254091,0.003754697,0.00004258152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03978695,0.0006059936,0.949498,0.0003548034,0.0001290069,0.0002507706,0.0005928708,0.005509033,0.003272543],"genre_scores_gemma":[0.375599,0.0003613188,0.617768,0.0001780727,0.0001039319,0.0003507612,0.001841498,0.001337628,0.002459724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007317651,"threshold_uncertainty_score":0.02448004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062671967","doi":"10.1016/j.jcss.2003.07.011","title":"A sharp threshold in proof complexity yields lower bounds for satisfiability search","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Mathematics; Combinatorics; Resolution (logic); Range (aeronautics); Conjunctive normal form; Discrete mathematics; Exponential function; Boolean satisfiability problem; Upper and lower bounds; Exponential time hypothesis; Time complexity; Computer science","authors":[{"name":"Dimitris Achlioptas","is_ca":false},{"name":"Paul Beame","is_ca":false},{"name":"Michael Molloy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05440909133257375,"gpt":0.293218237044864,"spread":0.2388091457122902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02625149,0.00490571,0.006115537,0.007220441,0.003231021,0.01461067,0.01040583,0.00904359,0.01858016],"category_scores_gemma":[0.2205057,0.005166959,0.006070323,0.007180035,0.0106113,0.04105743,0.01352857,0.03105208,0.005245871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009107842,"about_ca_system_score_gemma":0.007143813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002024217,"about_ca_topic_score_gemma":0.002760963,"domain_scores_codex":[0.964872,0.009988924,0.001730768,0.005672005,0.01157643,0.006159866],"domain_scores_gemma":[0.6076341,0.3440857,0.005884812,0.02936894,0.007326073,0.005700343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002093798,0.0007890539,0.003727982,0.001905525,0.0003469287,0.0003614933,0.0009550284,0.09868736,0.0150813,0.6882346,0.02612913,0.1616879],"study_design_scores_gemma":[0.0001100511,0.00022928,0.0006906259,0.0003653189,0.0002010628,0.000332812,0.0001183452,0.3218755,0.008001424,0.6624849,0.005488024,0.0001026822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02656274,0.01002049,0.9141059,0.01232988,0.000700959,0.0002842174,0.000731241,0.003295328,0.03196933],"genre_scores_gemma":[0.5587479,0.008991348,0.3966438,0.00629099,0.0030227,0.001146468,0.001357428,0.004838461,0.01896101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02625149,"threshold_uncertainty_score":0.1388327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092928619","doi":"10.1016/j.jcss.2007.06.015","title":"The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Corollary; Combinatorics; Mathematics; Satisfiability; Randomized algorithm; Discrete mathematics; Time complexity; Boolean satisfiability problem; Computability; Ramsey's theorem","authors":[{"name":"Chris Calabro","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Ramamohan Paturi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05216442578228685,"gpt":0.2959712926665272,"spread":0.2438068668842404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004207079,0.001496625,0.003118161,0.001639679,0.003587245,0.008751538,0.007419641,0.002914011,0.01841643],"category_scores_gemma":[0.04005218,0.001677269,0.003500044,0.0035713,0.005114533,0.029907,0.01006823,0.01171971,0.001984605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004408424,"about_ca_system_score_gemma":0.004794464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003690131,"about_ca_topic_score_gemma":0.004831947,"domain_scores_codex":[0.9909814,0.001696042,0.0006422483,0.002037056,0.002461978,0.002181147],"domain_scores_gemma":[0.9229794,0.06362764,0.002276077,0.007175389,0.002229475,0.001712031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003362873,0.000632862,0.00791471,0.002658716,0.0004063996,0.001005945,0.002039581,0.1419034,0.01174019,0.6862237,0.03580774,0.1063039],"study_design_scores_gemma":[0.0001512123,0.00008938006,0.0010669,0.00009209126,0.0001772526,0.000518275,0.0003225441,0.1911954,0.00532493,0.7963682,0.004615706,0.00007819859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2887507,0.003711066,0.6135734,0.017175,0.0007727354,0.0005250361,0.004235535,0.002990945,0.06826563],"genre_scores_gemma":[0.9192491,0.001166968,0.0655867,0.001524709,0.0006502277,0.0004233552,0.002008772,0.0009147277,0.008475281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01841643,"threshold_uncertainty_score":0.06160909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3131262006","doi":"10.24963/ijcai.2021/595","title":"Combinatorial Optimization and Reasoning with Graph Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"Deutsche Forschungsgemeinschaft; Australian Government","keywords":"Computer science; Combinatorial optimization; Key (lock); Artificial intelligence; Artificial neural network; Theoretical computer science; Graph; Block (permutation group theory); Machine learning; Algorithm; Mathematics","authors":[{"name":"Quentin Cappart","is_ca":true},{"name":"Didier Chételat","is_ca":true},{"name":"Elias B. Khalil","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Christopher Morris","is_ca":true},{"name":"Petar Veličković","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007260825204586705,"gpt":0.2083105452298668,"spread":0.20104972002528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078437,0.00141659,0.001164401,0.001743521,0.0007088789,0.003375693,0.002241326,0.002301167,0.007153294],"category_scores_gemma":[0.009838896,0.0008162545,0.001955953,0.003366942,0.002949601,0.005179163,0.002114784,0.003511163,0.0009732387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002278901,"about_ca_system_score_gemma":0.001402551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005888138,"about_ca_topic_score_gemma":0.006994592,"domain_scores_codex":[0.9976177,0.001161567,0.0001397629,0.0004006275,0.0005514232,0.0001289182],"domain_scores_gemma":[0.9964774,0.002752476,0.0002168099,0.0002472854,0.0002229409,0.00008311757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000028005,0.00003746096,0.0003703807,0.0004524292,0.0001136901,0.0001121868,0.0000866336,0.1569796,0.0002697824,0.7902719,0.008210136,0.04306781],"study_design_scores_gemma":[0.00000936048,0.00000480555,0.0000913679,0.00005204195,0.00001103131,0.00003249473,0.00001669573,0.1787857,0.0001255478,0.8153439,0.005517502,0.000009749813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006905867,0.0118245,0.9542544,0.004681861,0.0003278371,0.00009173666,0.0005384548,0.0003122673,0.02106308],"genre_scores_gemma":[0.3648222,0.02901499,0.5808222,0.002465684,0.002197817,0.0006181619,0.002817583,0.0004129884,0.0168284],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007153294,"threshold_uncertainty_score":0.02393019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001157763","doi":"10.1023/b:jmma.0000026709.24659.da","title":"A General Approach for Constraint Solving by Local Search","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Guided Local Search; Tabu search; Constraint programming; Mathematical optimization; Constraint (computer-aided design); Set (abstract data type); Computer science; Local search (optimization); Constraint satisfaction; Resolution (logic); Mathematics; Artificial intelligence; Stochastic programming","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Jin‐Kao Hao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03257880984352848,"gpt":0.2623488479533102,"spread":0.2297700381097817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084425,0.001433259,0.002012935,0.001718272,0.001308899,0.002075166,0.005165814,0.00235851,0.01125226],"category_scores_gemma":[0.006865683,0.001016514,0.002393596,0.003683547,0.002338839,0.00391646,0.003666231,0.004081358,0.002874718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028434,"about_ca_system_score_gemma":0.001563523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004196543,"about_ca_topic_score_gemma":0.005403104,"domain_scores_codex":[0.9984369,0.000533907,0.00007728465,0.0002867235,0.0005719324,0.00009333206],"domain_scores_gemma":[0.9985337,0.0007856243,0.00006403206,0.0003121919,0.0002534689,0.00005096193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004020459,0.00006602396,0.0001815568,0.000395507,0.0001241539,0.0001246222,0.0002375017,0.2641504,0.002656066,0.6285625,0.007175711,0.09628583],"study_design_scores_gemma":[0.0000345744,0.00003652781,0.00005391215,0.00004275712,0.00003892271,0.00009259625,0.00003288931,0.6846849,0.0008681284,0.3009865,0.0131012,0.00002706172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002540245,0.00008474146,0.9974983,0.00009246083,0.00001886869,0.00002400987,0.00001615344,0.00008273778,0.001928607],"genre_scores_gemma":[0.03121635,0.0005554345,0.9605497,0.0002235386,0.0001129795,0.000445664,0.0001283646,0.0002818886,0.006486087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01125226,"threshold_uncertainty_score":0.03764254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1585071718","doi":"10.1023/a:1008788926897","title":"Temporal Granularity: Completing the Puzzle","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Granularity; Computer science; Temporal database; Semantics (computer science); Data mining; Theoretical computer science; Programming language","authors":[{"name":"Iqbal A. Goralwalla","is_ca":true},{"name":"Yuri Leontiev","is_ca":true},{"name":"M. TAMER ÖZSU","is_ca":true},{"name":"Duane Szafron","is_ca":true},{"name":"Carlo Combi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02279624169315993,"gpt":0.2435481714601876,"spread":0.2207519297670277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003932808,0.0004807175,0.001151411,0.001005185,0.001563324,0.004002863,0.002249668,0.00237675,0.01128429],"category_scores_gemma":[0.02596997,0.0007785507,0.001218756,0.001863927,0.003863173,0.01798595,0.003925386,0.005457491,0.001521225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259408,"about_ca_system_score_gemma":0.002106493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003175238,"about_ca_topic_score_gemma":0.003356478,"domain_scores_codex":[0.9974539,0.0009386215,0.0002103943,0.0004954069,0.0006259034,0.0002758413],"domain_scores_gemma":[0.986286,0.008362919,0.0007491165,0.003109023,0.0008927306,0.0006002158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002870647,0.00006510175,0.0007516935,0.000293309,0.00004505842,0.0001741992,0.0005804024,0.009965823,0.001270579,0.8720789,0.01542555,0.0990623],"study_design_scores_gemma":[0.00004203419,0.00001445926,0.0002387937,0.00004904406,0.00001808073,0.0000998779,0.0002332134,0.01540576,0.0003597357,0.9683409,0.0151852,0.00001309335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05408571,0.01054842,0.8147202,0.05824507,0.0017091,0.0001118486,0.0007470002,0.0009565446,0.05887608],"genre_scores_gemma":[0.6832803,0.006119988,0.2900922,0.003661565,0.001756989,0.0001678345,0.0007910557,0.0007447507,0.01338528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01128429,"threshold_uncertainty_score":0.03774971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2292954498","doi":"10.1109/lra.2016.2522096","title":"Mixed-Integer and Constraint Programming Techniques for Mobile Robot Task Planning","year":2016,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Constraint programming; Robot; Integer programming; Task (project management); Computer science; Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Plan (archaeology); Mobile robot; Integer (computer science); Motion planning; Artificial intelligence; Mathematics; Algorithm; Stochastic programming; Engineering; Programming language","authors":[{"name":"Kyle E. C. Booth","is_ca":true},{"name":"Tony Tran","is_ca":true},{"name":"Goldie Nejat","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01616640003394109,"gpt":0.2481487157063605,"spread":0.2319823156724194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002637792,0.001686324,0.001130277,0.001180749,0.0007493932,0.001854982,0.002102628,0.001059073,0.007942156],"category_scores_gemma":[0.005532339,0.001125374,0.001536889,0.003215934,0.0007786861,0.002152145,0.001546958,0.003736632,0.001253094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115187,"about_ca_system_score_gemma":0.001887169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008828691,"about_ca_topic_score_gemma":0.01509978,"domain_scores_codex":[0.9981705,0.0008759134,0.0001132186,0.0001916314,0.0005158401,0.0001329126],"domain_scores_gemma":[0.9972866,0.002040582,0.0001890524,0.0001263585,0.00028768,0.00006975925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001103694,0.0001025011,0.0002377119,0.0005376753,0.0001594104,0.0001521387,0.0001255577,0.648377,0.001746984,0.1310421,0.01236,0.2050487],"study_design_scores_gemma":[0.00001796828,0.00002300333,0.00005024346,0.00004756184,0.00001665802,0.00002639073,0.00002177469,0.9403238,0.0005412022,0.05096663,0.007952525,0.00001221261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004657232,0.0005309105,0.9960556,0.0002434154,0.00008824495,0.00003779706,0.00005561634,0.000126074,0.002396644],"genre_scores_gemma":[0.03848744,0.001159547,0.9557651,0.0002227663,0.0001455015,0.0002804915,0.0001646531,0.000181182,0.003593334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008828691,"threshold_uncertainty_score":0.02656919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170780172","doi":"10.1613/jair.3463","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Benchmark (surveying); Constraint programming; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Search tree; Mathematical optimization; Local search (optimization); Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence; Algorithm","authors":[{"name":"Gilles Pesant","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":false},{"name":"Alessandro Zanarini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2126970487318262,"gpt":0.408101652300917,"spread":0.1954046035690908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004417024,0.001277933,0.00158847,0.002082513,0.0007643208,0.001491374,0.002523106,0.001552769,0.002352534],"category_scores_gemma":[0.01876333,0.0006076397,0.001010203,0.004224699,0.001621947,0.002284652,0.001549747,0.002073417,0.0004132998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796906,"about_ca_system_score_gemma":0.001951939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003806674,"about_ca_topic_score_gemma":0.005127515,"domain_scores_codex":[0.9971411,0.001466381,0.0002067368,0.0003305251,0.0006261749,0.000229042],"domain_scores_gemma":[0.9915023,0.006203283,0.0006743075,0.0008728685,0.0005505565,0.0001967427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002413432,0.0001912221,0.001900448,0.0003984952,0.0001064366,0.0001095713,0.0002222451,0.646166,0.003650113,0.05468564,0.004239761,0.2880888],"study_design_scores_gemma":[0.0000730566,0.00006495733,0.0001777633,0.0000344029,0.00002400919,0.00005692324,0.00003561327,0.9634135,0.00154731,0.03262223,0.001934307,0.00001590946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01179322,0.000577424,0.9846967,0.0001781661,0.00002830868,0.0001695999,0.00009236686,0.0007648567,0.001699357],"genre_scores_gemma":[0.1842302,0.0004908977,0.8130314,0.0002332015,0.00005121106,0.0003855697,0.000441888,0.0002614339,0.0008741705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004417024,"threshold_uncertainty_score":0.02335972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104290979","doi":"10.1016/s0004-3702(99)00099-5","title":"Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Heuristic; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Exploit; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Schedule","authors":[{"name":"J. Christopher Beck","is_ca":false},{"name":"Mark S. Fox","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01929389070529535,"gpt":0.284133776847167,"spread":0.2648398861418716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452659,0.001248048,0.001367467,0.0030903,0.00165077,0.002802338,0.003004399,0.001428104,0.006201113],"category_scores_gemma":[0.01410819,0.00136845,0.001749007,0.003556046,0.00177813,0.003311426,0.001823764,0.003595013,0.0007217574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00259445,"about_ca_system_score_gemma":0.004370639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009203472,"about_ca_topic_score_gemma":0.01389025,"domain_scores_codex":[0.998113,0.0006790793,0.00008943119,0.0002353867,0.0006992631,0.0001837177],"domain_scores_gemma":[0.9934429,0.004776201,0.0003340734,0.0005584826,0.000734484,0.0001538423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008213481,0.0001695388,0.0006225429,0.0002557625,0.00007201607,0.00009772642,0.0001855233,0.6845816,0.001595558,0.2082706,0.005114105,0.09895294],"study_design_scores_gemma":[0.00001856955,0.00001960683,0.00006730056,0.00002974197,0.00001664862,0.00001596804,0.00003342809,0.8976538,0.0005337023,0.09903517,0.002566668,0.000009297389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004343663,0.0001703092,0.9895586,0.0003905027,0.00004621004,0.0002036131,0.0001949252,0.0003187474,0.0047735],"genre_scores_gemma":[0.1099123,0.0004773907,0.8857013,0.0002110753,0.00007160201,0.0005876588,0.0009584537,0.0002351228,0.00184512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009203472,"threshold_uncertainty_score":0.0207448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985398779","doi":"10.1080/13658810802022814","title":"Qualified topological relations between spatial objects with possible vague shape","year":2008,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Boundary (topology); Closeness; Mathematics; Intersection (aeronautics); Social connectedness; Vagueness; Topology (electrical circuits); Object (grammar); Topological space; Spatial relation; Pure mathematics; Geography; Computer science; Fuzzy logic; Geometry; Cartography; Combinatorics; Artificial intelligence; Mathematical analysis","authors":[{"name":"Lotfi Bejaoui","is_ca":true},{"name":"François Pinet","is_ca":false},{"name":"Yves Bédard","is_ca":true},{"name":"Michel Schneider","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02042566497445259,"gpt":0.2517280324831861,"spread":0.2313023675087335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777707,0.0005101211,0.0004888657,0.003931785,0.001521406,0.003857941,0.001037945,0.001001511,0.004092625],"category_scores_gemma":[0.009219252,0.0003817751,0.00101001,0.003517065,0.002678201,0.005004787,0.001747287,0.000624005,0.0004484047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442382,"about_ca_system_score_gemma":0.0008836784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002050949,"about_ca_topic_score_gemma":0.002247332,"domain_scores_codex":[0.9962687,0.001089353,0.0005627814,0.0005755919,0.001208646,0.0002947916],"domain_scores_gemma":[0.9948448,0.001926952,0.0009726757,0.0008942193,0.00111049,0.0002508054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000503185,0.0001015866,0.01280501,0.0006017996,0.0001314469,0.00276068,0.008700516,0.02756636,0.01990958,0.8597144,0.002081739,0.06512371],"study_design_scores_gemma":[0.0001012058,0.0002919343,0.02635024,0.0003359621,0.0003286412,0.003172826,0.009582493,0.1470174,0.01901842,0.7447618,0.04876886,0.0002702089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5288301,0.0005426957,0.4405615,0.0004741502,0.00005722385,0.0002566493,0.001434008,0.00032633,0.02751735],"genre_scores_gemma":[0.900335,0.0001587898,0.0958348,0.00005640172,0.00003300511,0.0001705514,0.001359327,0.00003263976,0.002019454],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004092625,"threshold_uncertainty_score":0.01369125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1583185913","doi":"10.1007/978-3-540-45193-8_70","title":"Unrestricted Nogood Recording in CSP Search","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Backtracking; Algorithm; Artificial intelligence","authors":[{"name":"George Katsirelos","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02160351198768318,"gpt":0.2525285820532642,"spread":0.2309250700655811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002202736,0.0006525441,0.001503594,0.001021886,0.001278105,0.002485264,0.002539717,0.000923167,0.01033321],"category_scores_gemma":[0.008359746,0.0008863701,0.0008268401,0.00346187,0.002011079,0.005800704,0.0023244,0.003272104,0.002080917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187196,"about_ca_system_score_gemma":0.002044712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003506578,"about_ca_topic_score_gemma":0.005375351,"domain_scores_codex":[0.9976596,0.0008994722,0.0001594042,0.0002515798,0.0007989561,0.000230995],"domain_scores_gemma":[0.9950192,0.003055467,0.0001142733,0.001368546,0.0003144688,0.0001280882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007587545,0.0001619464,0.0003506441,0.0005942829,0.00004301728,0.0001568431,0.0003509507,0.050676,0.003949533,0.5930926,0.01480007,0.3350654],"study_design_scores_gemma":[0.00009363316,0.00009044633,0.000139689,0.00008633907,0.00004640463,0.0002409509,0.00009132452,0.1834739,0.006040193,0.7928589,0.01679105,0.00004725088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01637564,0.001314689,0.9423921,0.0003880829,0.0001553759,0.0001273389,0.0004169134,0.002254451,0.03657544],"genre_scores_gemma":[0.3812132,0.001981093,0.5818794,0.0002241645,0.0002275675,0.0002979015,0.001210041,0.001653747,0.03131295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01033321,"threshold_uncertainty_score":0.03456801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}