{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":58,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":58,"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":"3c29a04d9409","filters":{"venue":"Discrete Optimization"}},"results":[{"id":"W1992769367","doi":"10.1016/j.disopt.2014.03.001","title":"A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Mathematics; Upper and lower bounds; Algorithm; Branch and cut; Computer science; Linear programming","authors":[{"name":"Claudio Contardo","is_ca":true},{"name":"Rafael Martinelli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02244022931863883,"gpt":0.2567384899092984,"spread":0.2342982605906596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000961261,0.0009078022,0.001520271,0.0009199791,0.0006053105,0.001384913,0.002108136,0.001616288,0.007086833],"category_scores_gemma":[0.002874703,0.0007413279,0.000754336,0.001495319,0.0006204838,0.002019308,0.001472174,0.001760157,0.001234281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275996,"about_ca_system_score_gemma":0.002323449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005606479,"about_ca_topic_score_gemma":0.007684908,"domain_scores_codex":[0.999364,0.0001117724,0.00002978606,0.0001288039,0.0002892607,0.00007645263],"domain_scores_gemma":[0.9991525,0.0004435983,0.00005690002,0.0001106767,0.0001858635,0.00005041596],"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.0001461773,0.0001399749,0.0002779543,0.0001604515,0.00004634264,0.00006232237,0.00006612585,0.6855214,0.002707109,0.03102729,0.006619652,0.2732252],"study_design_scores_gemma":[0.00005031504,0.00002278929,0.00004596514,0.000008924653,0.000006706189,0.0000238646,0.000008537439,0.9894792,0.0003435644,0.007781419,0.002221734,0.000006853892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002527856,0.0001276134,0.9942898,0.0001018262,0.0001030901,0.00004285523,0.0000503841,0.0003457993,0.002410844],"genre_scores_gemma":[0.05838074,0.000210787,0.935883,0.0001395353,0.00009040764,0.000204425,0.0002065835,0.0001677159,0.00471673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007086833,"threshold_uncertainty_score":0.02370787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002576503","doi":"10.1016/j.disopt.2005.03.001","title":"A semidefinite optimization approach for the single-row layout problem with unequal dimensions","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematical optimization; Relaxation (psychology); Mathematics; Heuristic; Upper and lower bounds; Linear programming; Linear programming relaxation; Simple (philosophy); Matrix (chemical analysis); Space (punctuation); Facility location problem; Computer science","authors":[{"name":"Miguel F. Anjos","is_ca":false},{"name":"Andrew Kennings","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01482290958933528,"gpt":0.2092666094721759,"spread":0.1944436998828406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569336,0.001491982,0.001455955,0.0005713083,0.0004002164,0.001433069,0.001830219,0.001510575,0.009667464],"category_scores_gemma":[0.004097955,0.001084273,0.001065609,0.001074355,0.0009411802,0.001929249,0.001526289,0.002638301,0.001489313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008026524,"about_ca_system_score_gemma":0.001277783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001976007,"about_ca_topic_score_gemma":0.002900917,"domain_scores_codex":[0.9991946,0.0003703532,0.00002351298,0.0001145724,0.0002453293,0.00005163415],"domain_scores_gemma":[0.9980884,0.001333832,0.0001118827,0.000127647,0.0002541741,0.00008413808],"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.00005465229,0.0001077539,0.0001050471,0.0001843541,0.00003690205,0.00007894065,0.00004740477,0.9037552,0.001921805,0.06256823,0.006205867,0.0249339],"study_design_scores_gemma":[0.0000101181,0.00001746093,0.00001736545,0.000006243077,0.000003857238,0.00001716434,0.000007037665,0.9877183,0.0001728857,0.01118734,0.0008376126,0.000004549639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001271377,0.0000781031,0.995801,0.0001274487,0.00003120913,0.00002057516,0.00006663606,0.00007283399,0.00253083],"genre_scores_gemma":[0.1412568,0.0005245837,0.8441227,0.0003427749,0.0001717976,0.0004057022,0.0005418108,0.0004506798,0.01218321],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009667464,"threshold_uncertainty_score":0.03234088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064816527","doi":"10.1016/j.disopt.2008.04.001","title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tardiness; Travelling salesman problem; Sequence (biology); Mathematical optimization; Single-machine scheduling; Scheduling (production processes); Computation; Branch and bound; Integer programming; Computer science; Job shop scheduling; Linear programming relaxation; Mathematics; Algorithm; Schedule","authors":[{"name":"Louis-Philippe Bigras","is_ca":true},{"name":"Michel Gamache","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01172588068999795,"gpt":0.1993286561662797,"spread":0.1876027754762818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673312,0.00208024,0.002535719,0.00123542,0.0009055759,0.002814088,0.003330152,0.003839406,0.006948476],"category_scores_gemma":[0.01240459,0.001880243,0.001736518,0.004174615,0.001999837,0.006109382,0.001489037,0.00385566,0.0008245819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094117,"about_ca_system_score_gemma":0.002079139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003090469,"about_ca_topic_score_gemma":0.002728084,"domain_scores_codex":[0.9979556,0.0009536584,0.00007583642,0.0004510066,0.0003973579,0.0001665943],"domain_scores_gemma":[0.9939566,0.004388363,0.0007395567,0.0002449472,0.000341601,0.0003289433],"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.0002654161,0.0001762959,0.0004195914,0.0004395203,0.0001085767,0.0002158713,0.00008084088,0.784559,0.0009366754,0.1837938,0.006006368,0.02299796],"study_design_scores_gemma":[0.00003603581,0.00005177826,0.000247238,0.00002054255,0.00002657968,0.00006280094,0.00003922618,0.8890653,0.0002846745,0.108014,0.002127706,0.00002402756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04344192,0.005513518,0.933295,0.002469488,0.0007294106,0.0001213944,0.0005899072,0.0001577281,0.01368177],"genre_scores_gemma":[0.7128755,0.01140121,0.2319203,0.0007173455,0.002112253,0.0005722821,0.00160634,0.0003849936,0.03840976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006948476,"threshold_uncertainty_score":0.02324498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; Tree structure; K-ary tree; Binary tree","authors":[{"name":"Ruonan Zhang","is_ca":true},{"name":"Santosh N. Kabadi","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01236291145485941,"gpt":0.2336600920583558,"spread":0.2212971806034964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123986,0.001001541,0.00189986,0.001165006,0.0008828785,0.002910821,0.002651307,0.002293224,0.003491195],"category_scores_gemma":[0.01013703,0.0007115816,0.001024027,0.004716706,0.001709621,0.00757996,0.002222574,0.003747968,0.0004457308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001323428,"about_ca_system_score_gemma":0.001183654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001800437,"about_ca_topic_score_gemma":0.001535348,"domain_scores_codex":[0.9984176,0.0006336678,0.00007909257,0.0002881782,0.0004588198,0.0001225675],"domain_scores_gemma":[0.9940252,0.004437894,0.0005831966,0.0003901937,0.0003100751,0.0002534331],"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.0002042955,0.0001835526,0.0004862693,0.0003603371,0.00008751558,0.0001681802,0.0001433363,0.3928778,0.001232982,0.5328387,0.01045799,0.06095896],"study_design_scores_gemma":[0.00003559254,0.0000276556,0.0002319263,0.00002476735,0.00002203694,0.0001548608,0.00004071803,0.5138286,0.0002524612,0.480693,0.004668837,0.00001945087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027585,0.00675537,0.9160095,0.003274437,0.0003085441,0.00006524428,0.0005294501,0.0001531913,0.02262838],"genre_scores_gemma":[0.5958053,0.008354646,0.3753563,0.0008041437,0.001670447,0.0003124748,0.001043141,0.0003514914,0.01630199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003491195,"threshold_uncertainty_score":0.01167923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970402125","doi":"10.1016/j.disopt.2013.07.005","title":"A computational comparison of flow formulations for the capacitated location-routing problem","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":58,"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; HEC Montréal; Transport Canada; École de Technologie Supérieure; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Flow (mathematics); Mathematical optimization; Index (typography); Routing (electronic design automation); Mathematics; Flow routing; Scale (ratio); Computer science; Algorithm; Engineering","authors":[{"name":"Claudio Contardo","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Bernard Gendron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0230630677586105,"gpt":0.2875200500293179,"spread":0.2644569822707074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488165,0.0008602795,0.001063016,0.001099433,0.0006790484,0.001883757,0.001681684,0.001806296,0.007859287],"category_scores_gemma":[0.008986499,0.0004554264,0.0008244943,0.00154034,0.0006825461,0.002143304,0.001200266,0.002085201,0.0005995653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180561,"about_ca_system_score_gemma":0.002070485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007678181,"about_ca_topic_score_gemma":0.00921828,"domain_scores_codex":[0.9992062,0.0004529341,0.00003371177,0.00006466598,0.0001836287,0.00005881249],"domain_scores_gemma":[0.9941943,0.004652399,0.0001594206,0.0003393344,0.0005320541,0.0001224645],"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.0002594913,0.0003209259,0.000471983,0.0001901906,0.0000338684,0.00002803278,0.00007168417,0.8914173,0.0003433308,0.05075759,0.003126032,0.05297948],"study_design_scores_gemma":[0.00002791648,0.00003160866,0.00006370486,0.00001356382,0.000005770316,0.000007471888,0.0000271777,0.9942521,0.0001295656,0.004710167,0.0007265027,0.000004428007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1260731,0.001858231,0.8194142,0.002000778,0.0004423247,0.0002662076,0.000607454,0.0007179122,0.04861972],"genre_scores_gemma":[0.5424573,0.001357266,0.4471776,0.0003205582,0.0001367316,0.0004064862,0.000680742,0.0004917387,0.006971649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007859287,"threshold_uncertainty_score":0.02629197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030028156","doi":"10.1016/j.disopt.2004.12.001","title":"Facility location problems with uncertainty on the plane","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Minimax; Mathematics; Ackermann function; Interval (graph theory); Euclidean geometry; Mathematical optimization; Combinatorics; Function (biology); Facility location problem; Euclidean distance; Inverse; Statistics; Geometry","authors":[{"name":"Igor Averbakh","is_ca":true},{"name":"Sergei Bereg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01848136077061519,"gpt":0.2049505661645586,"spread":0.1864692053939434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003724431,0.00129356,0.003307662,0.001482943,0.0007505543,0.004018228,0.002134485,0.003486413,0.003728146],"category_scores_gemma":[0.01700164,0.001616066,0.0011279,0.003609076,0.002712884,0.0042977,0.001977209,0.003232609,0.0002638753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003950166,"about_ca_system_score_gemma":0.00138194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01137902,"about_ca_topic_score_gemma":0.004443924,"domain_scores_codex":[0.9977704,0.001254624,0.00008351945,0.0003151919,0.0003286313,0.0002476491],"domain_scores_gemma":[0.9857723,0.01174517,0.001353735,0.0002382412,0.0004747288,0.000415721],"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.0001088779,0.00002542394,0.0004815118,0.00008273675,0.00004329999,0.00009605863,0.00003824747,0.8954266,0.0001025314,0.09866221,0.001405974,0.003526546],"study_design_scores_gemma":[0.00003401988,0.00001978963,0.0002262983,0.00002059869,0.00001379376,0.00002948809,0.00003846394,0.9082029,0.00007784666,0.09037945,0.0009423661,0.0000150115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08176689,0.004611571,0.8918443,0.005673622,0.0002187605,0.00007456768,0.001740687,0.0001568997,0.0139127],"genre_scores_gemma":[0.931114,0.003214933,0.05383557,0.0002661152,0.0003626187,0.0001762716,0.000978096,0.0000872308,0.009965287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01137902,"threshold_uncertainty_score":0.0286606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020257725","doi":"10.1016/j.disopt.2006.05.006","title":"Algorithms for time-dependent bicriteria shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":54,"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":"Shortest path problem; K shortest path routing; Yen's algorithm; Constrained Shortest Path First; Path (computing); Mathematical optimization; Algorithm; Computer science; Euclidean shortest path; Shortest Path Faster Algorithm; Travel time; Mathematics; Dijkstra's algorithm; Theoretical computer science; Graph","authors":[{"name":"Horst W. Hamacher","is_ca":false},{"name":"Stefan Ruzika","is_ca":false},{"name":"Stevanus A. Tjandra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0143382204143877,"gpt":0.2744137807614725,"spread":0.2600755603470848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002287934,0.001598472,0.002323388,0.001857404,0.001273493,0.002355776,0.003849979,0.002146458,0.007338675],"category_scores_gemma":[0.01016346,0.00124801,0.001321865,0.003627027,0.001163352,0.003192099,0.003231309,0.003100513,0.001589687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001944653,"about_ca_system_score_gemma":0.002587048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008852746,"about_ca_topic_score_gemma":0.01057325,"domain_scores_codex":[0.998542,0.0004677873,0.00009079868,0.0003111286,0.0003745882,0.0002137498],"domain_scores_gemma":[0.995759,0.002651596,0.0003317322,0.0004260009,0.0006241187,0.0002075217],"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.0002427021,0.0001469747,0.0005149404,0.0002901817,0.00008121823,0.00004208904,0.0001848419,0.7834795,0.0006035618,0.07090334,0.007257659,0.136253],"study_design_scores_gemma":[0.00007010893,0.00003035426,0.00008758302,0.00003053578,0.00001602334,0.00002876836,0.00004389364,0.9473733,0.0002931436,0.04907202,0.002941468,0.00001284029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006082437,0.0006307627,0.988264,0.0002676526,0.00009828443,0.000084303,0.0001158501,0.000333154,0.004123718],"genre_scores_gemma":[0.151686,0.000947319,0.8385698,0.0001926354,0.0001109884,0.0005179486,0.0007499622,0.0003250765,0.00690039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008852746,"threshold_uncertainty_score":0.02455032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098775996","doi":"10.1016/j.disopt.2009.04.001","title":"Rectangle packing with one-dimensional resource augmentation","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Rectangle; Bin packing problem; Mathematics; Combinatorics; Packing problems; Approximation algorithm; Set packing; Constant (computer programming); Mathematical optimization; Square (algebra); Bin; Algorithm; Set (abstract data type); Geometry; Computer science","authors":[{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008249441214177488,"gpt":0.2028664908287158,"spread":0.1946170496145383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485467,0.001299257,0.00259047,0.0007491362,0.0005789389,0.002255163,0.0021167,0.001412242,0.005778567],"category_scores_gemma":[0.005131416,0.001025388,0.001161942,0.002487197,0.001206297,0.003629209,0.002229088,0.001838496,0.0009164338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009716862,"about_ca_system_score_gemma":0.0008040097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001462974,"about_ca_topic_score_gemma":0.001192297,"domain_scores_codex":[0.9983986,0.0007476714,0.00008286222,0.0002534146,0.000291144,0.0002263387],"domain_scores_gemma":[0.9979808,0.001181472,0.0001753325,0.0003955232,0.0001350814,0.000131844],"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.00036492,0.0001843034,0.0002366624,0.0002683006,0.00004653396,0.0001979621,0.00006172125,0.8240241,0.003456286,0.1204975,0.004612025,0.04604962],"study_design_scores_gemma":[0.00002771033,0.00007801658,0.00009097018,0.00001332394,0.00001421562,0.00009234813,0.00002036229,0.9557646,0.001160503,0.04087332,0.001846654,0.00001787324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03525041,0.0008838175,0.9472937,0.0003830762,0.0001865848,0.0001000816,0.0002021427,0.0004365807,0.01526362],"genre_scores_gemma":[0.5066832,0.00135414,0.4730608,0.0002322313,0.0002201256,0.0003375596,0.0003883517,0.0002552638,0.01746816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005778567,"threshold_uncertainty_score":0.01933128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004802557","doi":"10.1016/j.disopt.2008.10.004","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Martine Labbé","is_ca":false},{"name":"David Schindl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1211367297478479,"gpt":0.3512656153859113,"spread":0.2301288856380634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003647642,0.003747964,0.003655403,0.002452759,0.001762226,0.006103266,0.004617876,0.003640699,0.01306453],"category_scores_gemma":[0.01569457,0.002483964,0.00397678,0.007210232,0.003035016,0.008708119,0.003229033,0.009220511,0.001752196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005601956,"about_ca_system_score_gemma":0.003122808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008639455,"about_ca_topic_score_gemma":0.006711199,"domain_scores_codex":[0.9971486,0.001087529,0.0001047231,0.000426314,0.0008045509,0.0004283846],"domain_scores_gemma":[0.9897065,0.008032206,0.0004717214,0.0007105263,0.0007570957,0.0003219377],"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.0002255582,0.0003394868,0.0003211116,0.0005890022,0.00008453647,0.00005601134,0.0003702871,0.4216376,0.0008932846,0.4698707,0.01992418,0.08568825],"study_design_scores_gemma":[0.0000485553,0.00007137011,0.000139124,0.00008399996,0.00004208701,0.00005117508,0.00007388063,0.6464001,0.0007721653,0.3471898,0.005097951,0.00002989418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009865524,0.001859677,0.9615523,0.001152315,0.0003791424,0.0002236196,0.0004022842,0.0002159786,0.02434907],"genre_scores_gemma":[0.2224928,0.006250053,0.7278253,0.001217121,0.001666828,0.001520837,0.001841347,0.001032607,0.03615311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01306453,"threshold_uncertainty_score":0.04370522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088165054","doi":"10.1016/j.disopt.2009.04.004","title":"Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"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":"Heuristics; Heuristic; Benchmark (surveying); Mathematical optimization; Variable neighborhood search; Mathematics; Local search (optimization); Variable (mathematics); Scale (ratio); Incremental heuristic search; Beam search; Algorithm; Search algorithm; Computer science; Metaheuristic","authors":[{"name":"Snežana Mitrović-Minić","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02201980069949839,"gpt":0.2781955289469787,"spread":0.2561757282474803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001268183,0.0004891827,0.001100804,0.0003947146,0.0003181224,0.0006698811,0.001298691,0.0009909996,0.002547392],"category_scores_gemma":[0.003043305,0.0003452066,0.0004712148,0.0005862466,0.0006437862,0.001134277,0.001207967,0.001122974,0.0002684759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005437686,"about_ca_system_score_gemma":0.0006434228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002282237,"about_ca_topic_score_gemma":0.002897135,"domain_scores_codex":[0.9996009,0.0002289536,0.00001040435,0.00004095149,0.00008543257,0.00003341104],"domain_scores_gemma":[0.999306,0.0004457675,0.00004905074,0.00007846679,0.00008571293,0.00003496264],"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.0001195456,0.00007553633,0.0002640191,0.00007634157,0.00003640832,0.00005064513,0.00005192422,0.9273531,0.001157863,0.02025425,0.002718127,0.04784226],"study_design_scores_gemma":[0.00001587738,0.00001847466,0.0000363319,0.000003315518,0.000003576301,0.000006299374,0.000004341279,0.996494,0.0001225662,0.003068461,0.0002250047,0.00000184437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0313113,0.0004066845,0.9636924,0.0002229319,0.00005531803,0.00004651879,0.00004892509,0.0002503719,0.003965503],"genre_scores_gemma":[0.6736957,0.0002778553,0.3203297,0.0002043533,0.00008212448,0.000261501,0.0001490282,0.000148044,0.004851568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002547392,"threshold_uncertainty_score":0.008521855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984167047","doi":"10.1016/j.disopt.2005.07.001","title":"Computing and minimizing the relative regret in combinatorial optimization with interval data","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Mathematical optimization; Mathematics; Interval (graph theory); Minimax; Function (biology); Set (abstract data type); Minification; Computer science; Combinatorics; Statistics","authors":[{"name":"Igor Averbakh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06296760241526711,"gpt":0.3605790427625292,"spread":0.2976114403472621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009926562,0.001551528,0.003409624,0.001594809,0.0005729216,0.003306876,0.002824842,0.002602847,0.001519997],"category_scores_gemma":[0.03837018,0.00139768,0.001329955,0.001799087,0.001951963,0.004722664,0.002041446,0.00349534,0.0003458506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001716503,"about_ca_system_score_gemma":0.001508926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002413431,"about_ca_topic_score_gemma":0.001596845,"domain_scores_codex":[0.9960673,0.002437674,0.0001974153,0.0004497734,0.0006517188,0.0001959795],"domain_scores_gemma":[0.9783016,0.01851694,0.0009410809,0.001022257,0.0008414265,0.0003767268],"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.0001612448,0.00008341338,0.000696905,0.0001191294,0.00008189759,0.00003724818,0.00004256172,0.9486473,0.0003894853,0.02142487,0.0008006123,0.02751526],"study_design_scores_gemma":[0.000009316036,0.00002765241,0.00009323312,0.000007981913,0.000007217443,0.0000100018,0.000006903812,0.9849429,0.0002053251,0.01459634,0.00008835547,0.000004860242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04105131,0.0007682897,0.9560551,0.0006409751,0.00005998768,0.00003592945,0.00007843636,0.0002434125,0.001066593],"genre_scores_gemma":[0.485902,0.0008047621,0.5100491,0.0002311179,0.0002814101,0.0002090566,0.0004323156,0.0002836359,0.001806701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009926562,"threshold_uncertainty_score":0.05249727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084046657","doi":"10.1016/j.disopt.2012.01.001","title":"Emergency path restoration problems","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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","keywords":"Server; Scheduling (production processes); Computer science; Path (computing); Time complexity; Node (physics); Computer network; Distributed computing; Mathematical optimization; Mathematics; Algorithm; Engineering","authors":[{"name":"Igor Averbakh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02471990667949928,"gpt":0.2708562861310064,"spread":0.2461363794515072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175296,0.000961741,0.001235058,0.0008282015,0.0008549935,0.001951779,0.001421465,0.002264851,0.01791007],"category_scores_gemma":[0.003165204,0.0005049283,0.0008550133,0.0009510766,0.001224524,0.001846067,0.001734646,0.002716498,0.001370931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204277,"about_ca_system_score_gemma":0.001270552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002040596,"about_ca_topic_score_gemma":0.001684489,"domain_scores_codex":[0.9993917,0.0001713161,0.0000188069,0.0001618478,0.0001478958,0.0001084595],"domain_scores_gemma":[0.9992573,0.0003655643,0.00008655885,0.00008129598,0.0001075104,0.0001017419],"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.000175783,0.0001438043,0.0003975462,0.0002972299,0.00005169487,0.0002744343,0.0001187854,0.5189404,0.0009589979,0.3615189,0.0318101,0.0853123],"study_design_scores_gemma":[0.00005976121,0.00007159742,0.0002504846,0.00006662535,0.00002621325,0.0003476112,0.0001616414,0.6455126,0.001080376,0.3210116,0.03138696,0.0000245924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02302864,0.001650944,0.896603,0.002365588,0.0005750565,0.0001809594,0.0006203664,0.000419284,0.07455624],"genre_scores_gemma":[0.5992092,0.002704532,0.2619058,0.0007000066,0.0006392369,0.0004380725,0.001528227,0.0005436123,0.1323312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01791007,"threshold_uncertainty_score":0.05991513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068748054","doi":"10.1016/j.disopt.2011.05.002","title":"Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Matching (statistics); Integer (computer science); Graph; Constructive; Mathematical optimization; Discrete mathematics; Graph coloring; Computer science; Statistics","authors":[{"name":"Sylvia Boyd","is_ca":true},{"name":"Robert D. Carr","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05271715870122828,"gpt":0.2790077682209249,"spread":0.2262906095196967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004603055,0.0009961687,0.0009609817,0.001017232,0.0007275851,0.001246634,0.001430854,0.001218484,0.007250597],"category_scores_gemma":[0.002650415,0.0005205205,0.0009229603,0.001686203,0.0005627021,0.001587075,0.001317433,0.001130288,0.0006309656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009005496,"about_ca_system_score_gemma":0.0009048368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003616553,"about_ca_topic_score_gemma":0.00401831,"domain_scores_codex":[0.9997036,0.00009080675,0.0000111408,0.00005318659,0.00007995713,0.00006134736],"domain_scores_gemma":[0.9995226,0.0003010497,0.00005280124,0.00005030604,0.0000454303,0.00002790889],"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.0003435812,0.000202574,0.0006400365,0.00033311,0.00005813263,0.000163391,0.0002092888,0.7735553,0.006892686,0.111339,0.003760052,0.1025029],"study_design_scores_gemma":[0.00003499975,0.00006702208,0.0001657577,0.00001645185,0.00001262318,0.00003741478,0.00004948991,0.9428978,0.001804327,0.05354968,0.001355367,0.000009009019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08711562,0.0001802409,0.8967322,0.0002256574,0.00005334091,0.0001441997,0.0002743212,0.0002330304,0.01504134],"genre_scores_gemma":[0.4520044,0.0002588343,0.536721,0.0001102744,0.00003561834,0.0002485632,0.0004708878,0.0001888574,0.009961507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007250597,"threshold_uncertainty_score":0.02425569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114675299","doi":"10.1016/j.disopt.2010.06.002","title":"The Delivery Man Problem with time windows","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Travelling salesman problem; Heuristic; Integer programming; Window (computing); Computer science; Mathematics; Algorithm","authors":[{"name":"Géraldine Heilporn","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004443702601807077,"gpt":0.2073381164278795,"spread":0.2028944138260724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00296941,0.00171067,0.002143072,0.0008306982,0.0005942607,0.002112212,0.002859509,0.00224299,0.005288325],"category_scores_gemma":[0.006970747,0.001409979,0.001070024,0.001660304,0.001436831,0.003743992,0.001726345,0.002606786,0.0005324325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002003363,"about_ca_system_score_gemma":0.00163481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00531926,"about_ca_topic_score_gemma":0.002808124,"domain_scores_codex":[0.9987502,0.0006271725,0.00004110903,0.0002354451,0.0001649096,0.0001811297],"domain_scores_gemma":[0.997461,0.00190241,0.0002563953,0.00009354794,0.0001080268,0.0001785601],"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.0001993897,0.00008096669,0.0003439981,0.000196196,0.00008054873,0.0001290662,0.00006618009,0.8242376,0.0005645948,0.1551223,0.003375468,0.01560373],"study_design_scores_gemma":[0.00003405898,0.00003546498,0.0000995929,0.00001156819,0.00002533625,0.00003138235,0.00002877237,0.9554594,0.0002337269,0.04227832,0.001751723,0.0000105923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02017099,0.001456909,0.9707619,0.001153163,0.0002365864,0.00007806124,0.0002740742,0.0001026423,0.005765632],"genre_scores_gemma":[0.7091216,0.005560652,0.2125805,0.0004872407,0.0008246847,0.0005859237,0.000672271,0.0003604514,0.06980665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00531926,"threshold_uncertainty_score":0.01769125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013219867","doi":"10.1016/j.disopt.2010.09.003","title":"An exact algorithm for the network pricing problem","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal; Wilfrid Laurier University","funders":"","keywords":"Column generation; Network topology; Scheme (mathematics); Mathematical optimization; Algorithm; Computer science; Mathematics; Work (physics); Engineering","authors":[{"name":"Luce Brotcorne","is_ca":false},{"name":"Fabien Cirinei","is_ca":true},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005526421708420291,"gpt":0.2278157221231009,"spread":0.2222893004146806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421427,0.0009722225,0.001672401,0.0009349474,0.000904577,0.002258455,0.002277021,0.002207993,0.0137165],"category_scores_gemma":[0.006901341,0.0007784067,0.0007721673,0.001928506,0.001090892,0.002775944,0.001939472,0.002665766,0.001875832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001979712,"about_ca_system_score_gemma":0.003529702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006225226,"about_ca_topic_score_gemma":0.006790134,"domain_scores_codex":[0.9990606,0.0002372351,0.00004154841,0.0001625122,0.0003558947,0.0001422054],"domain_scores_gemma":[0.9980516,0.001252786,0.00007695658,0.0002383534,0.0002944243,0.00008581992],"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.0002687896,0.0002791351,0.0003571149,0.000185352,0.00004602316,0.00008530336,0.0001031222,0.5790452,0.001421617,0.1321289,0.01567272,0.2704068],"study_design_scores_gemma":[0.0001180796,0.00002243803,0.00006403409,0.00001189678,0.000009182451,0.00003340433,0.00001468942,0.9419381,0.0002547481,0.05546942,0.002055592,0.000008344211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004664165,0.0001968641,0.9866866,0.0004883439,0.0001455735,0.00007827635,0.0001157758,0.0004669058,0.007157529],"genre_scores_gemma":[0.1418026,0.0003422462,0.8486428,0.0002918574,0.0001764828,0.0003514138,0.0003469423,0.0002490624,0.007796768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0137165,"threshold_uncertainty_score":0.04588622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980190773","doi":"10.1016/j.disopt.2013.02.003","title":"A linear time algorithm for the Koopmans–Beckmann QAP linearization and related problems","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadratic assignment problem; Mathematics; Weapon target assignment problem; Mathematical optimization; Multiplicative function; Linearization; Assignment problem; Linear bottleneck assignment problem; Generalized assignment problem; Optimization problem; Nonlinear system","authors":[{"name":"Abraham P. Punnen","is_ca":true},{"name":"Santosh N. Kabadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005582494992715322,"gpt":0.1959777075951276,"spread":0.1903952126024123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964641,0.0009809115,0.0008748844,0.0004510274,0.0006508054,0.0008654893,0.001063514,0.001186416,0.01115198],"category_scores_gemma":[0.001723881,0.0004399609,0.0006364541,0.0005912692,0.0006355503,0.001059388,0.001459813,0.00160084,0.002435826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006593842,"about_ca_system_score_gemma":0.001334585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00481877,"about_ca_topic_score_gemma":0.005070418,"domain_scores_codex":[0.9997446,0.00007393986,0.00001365993,0.00005147313,0.00008492896,0.00003131381],"domain_scores_gemma":[0.9996175,0.0002297869,0.00002257628,0.00002781868,0.00008037629,0.0000219389],"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.0001968611,0.0001511569,0.000235558,0.0002713874,0.00005174966,0.0001403988,0.0002216033,0.6259084,0.007703423,0.09119149,0.008018091,0.2659099],"study_design_scores_gemma":[0.00003206249,0.00004143654,0.00004302625,0.00001128833,0.000007882461,0.00002753444,0.00002089609,0.9801733,0.0009614065,0.0159056,0.002761433,0.00001404583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001290017,0.00006623768,0.9957215,0.00007433784,0.00004544805,0.00002812192,0.00001774526,0.0001991326,0.002557496],"genre_scores_gemma":[0.1708058,0.0002366814,0.8165635,0.0001975297,0.00008912093,0.0003631106,0.0001821706,0.0002780403,0.01128416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01115198,"threshold_uncertainty_score":0.03730708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2894812324","doi":"10.1016/j.disopt.2023.100795","title":"Principled deep neural network training through linear programming","year":2023,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Institut de Valorisation des Données; National Science Foundation","keywords":"Computer science; Deep learning; Polyhedron; Artificial intelligence; Artificial neural network; Linear programming; Perspective (graphical); Dependency (UML); Task (project management); Representation (politics); Sample (material); Function (biology); Machine learning; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Geometry","authors":[{"name":"Daniel Bienstock","is_ca":false},{"name":"Gonzalo Muñoz","is_ca":false},{"name":"Sebastian Pokutta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04017734624734458,"gpt":0.2895398856964629,"spread":0.2493625394491183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001450398,0.0009229489,0.0009681083,0.0003809315,0.0003972864,0.001003368,0.001503219,0.001423128,0.004876105],"category_scores_gemma":[0.003782729,0.001081147,0.0005469181,0.0005608174,0.001183353,0.00141484,0.002071309,0.002833828,0.0009597789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000806882,"about_ca_system_score_gemma":0.001462002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001873661,"about_ca_topic_score_gemma":0.003124789,"domain_scores_codex":[0.9995056,0.0001923573,0.00001979916,0.00008117711,0.0001662712,0.00003480553],"domain_scores_gemma":[0.9989153,0.0007404126,0.00006729219,0.00008408965,0.0001451695,0.00004781233],"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.00006694903,0.00005718154,0.0001845737,0.0001341213,0.00003966111,0.00002795144,0.00004516065,0.8533142,0.001639038,0.06917565,0.003935243,0.07138035],"study_design_scores_gemma":[0.00000374427,0.000005984513,0.00000904125,0.000003761801,0.000001558305,0.000003683279,0.000001097775,0.9927359,0.0002096277,0.006788405,0.0002359003,0.000001321426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001525642,0.00006342278,0.9969339,0.0001378653,0.00002184199,0.00001727088,0.00002171087,0.0001868987,0.001091348],"genre_scores_gemma":[0.2062439,0.0002811968,0.7820092,0.0003607417,0.0001175602,0.0004440136,0.00018523,0.0005856634,0.009772485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004876105,"threshold_uncertainty_score":0.01631218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2923556723","doi":"10.1016/j.disopt.2019.03.004","title":"Combinatorial optimization with interaction costs: Complexity and solvable cases","year":2019,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Parameterized complexity; Combinatorial optimization; Matroid; Mathematics; Quadratic assignment problem; Diagonal; Combinatorics; Matrix (chemical analysis); Mathematical optimization; Intersection (aeronautics); Rank (graph theory); Optimization problem; Computational complexity theory; Algorithm","authors":[{"name":"Stefan Lendl","is_ca":false},{"name":"Ante Ćustić","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0148475165915815,"gpt":0.239395156831513,"spread":0.2245476402399315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005029086,0.001936037,0.002869203,0.002115289,0.00162297,0.007898756,0.003946584,0.00464731,0.01603753],"category_scores_gemma":[0.04043695,0.001298664,0.002676274,0.004772198,0.003403615,0.008504356,0.003836203,0.006204652,0.0009446883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002869502,"about_ca_system_score_gemma":0.00230596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003140848,"about_ca_topic_score_gemma":0.002607384,"domain_scores_codex":[0.994221,0.002575626,0.0002384871,0.0006940922,0.001452339,0.0008185451],"domain_scores_gemma":[0.9553624,0.0392213,0.00176033,0.001916762,0.0009570091,0.0007822088],"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.0002403158,0.0003838169,0.001046036,0.0004048012,0.0001461558,0.0005227684,0.0001591831,0.1945505,0.000426544,0.7711115,0.009722346,0.02128602],"study_design_scores_gemma":[0.00007301324,0.00003432648,0.0002796338,0.00003267435,0.00004512191,0.0001775841,0.00007171988,0.4120455,0.0002444609,0.585277,0.001693035,0.00002587982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1492974,0.002233523,0.7184098,0.007861599,0.0002870639,0.0003558491,0.001398068,0.0003720684,0.1197847],"genre_scores_gemma":[0.8376357,0.001654226,0.1298507,0.0006441153,0.0009038901,0.0007495942,0.001094407,0.0003169,0.02715041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01603753,"threshold_uncertainty_score":0.05365086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070134421","doi":"10.1016/j.disopt.2010.09.002","title":"Strengthening lattice-free cuts using non-negativity","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Negativity effect; Lattice (music); Algorithm; Cognitive psychology; Psychology; Physics","authors":[{"name":"Ricardo Fukasawa","is_ca":true},{"name":"Oktay Günlük","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01331334693684623,"gpt":0.2658952204674746,"spread":0.2525818735306284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006871967,0.001951688,0.001770701,0.001634298,0.001378206,0.002310948,0.002938948,0.001877073,0.007937814],"category_scores_gemma":[0.02301158,0.001433954,0.001594483,0.001117271,0.004352667,0.004893753,0.005665614,0.005873953,0.001007202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375195,"about_ca_system_score_gemma":0.001117157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001421323,"about_ca_topic_score_gemma":0.002025905,"domain_scores_codex":[0.9962203,0.001877286,0.000154834,0.0005740589,0.0009465296,0.0002269668],"domain_scores_gemma":[0.9873009,0.009248726,0.0005754013,0.001262841,0.001129742,0.0004823175],"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.0003488523,0.0001127817,0.0003189367,0.0002973835,0.00008372543,0.0001063985,0.0002437056,0.2113907,0.005116203,0.7381828,0.003065629,0.04073282],"study_design_scores_gemma":[0.00005234959,0.00007017975,0.00007342434,0.00004236291,0.00002755722,0.0000464236,0.00005076888,0.3830202,0.00157483,0.6118574,0.003165027,0.00001959156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008136279,0.0001485273,0.9852117,0.0002510407,0.0001383287,0.00003257356,0.00004512159,0.0001052356,0.005931075],"genre_scores_gemma":[0.4022214,0.0005992514,0.5810375,0.0007902751,0.000342239,0.0004081969,0.0003467255,0.0005684083,0.01368605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007937814,"threshold_uncertainty_score":0.03634286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163661406","doi":"10.1016/j.disopt.2012.10.002","title":"A bad example for the iterative rounding method for mincost <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si52.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-connected spanning subgraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Norm (philosophy); Algorithm; Discrete mathematics; Iterative method; Iterative refinement; Relaxation (psychology); Computer science; Combinatorics","authors":[{"name":"Ashkan Aazami","is_ca":true},{"name":"Joseph Cheriyan","is_ca":true},{"name":"Bundit Laekhanukit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02173933753129435,"gpt":0.2639957199895441,"spread":0.2422563824582497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661908,0.0008071063,0.0005746923,0.0006994542,0.001093235,0.001260115,0.001107537,0.001214837,0.01976217],"category_scores_gemma":[0.006198298,0.0003364902,0.0008830038,0.001299948,0.00102903,0.00171097,0.0011258,0.002804419,0.004634058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007553016,"about_ca_system_score_gemma":0.0008610762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002284904,"about_ca_topic_score_gemma":0.004910618,"domain_scores_codex":[0.9993073,0.0002091874,0.00003380094,0.0001018754,0.0002763982,0.00007139574],"domain_scores_gemma":[0.998965,0.0005113732,0.0000351626,0.0002166808,0.0002361903,0.00003568848],"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.00024779,0.00007903253,0.0003432964,0.0003060618,0.0000463272,0.0003668681,0.0001911286,0.05760949,0.005715989,0.6569772,0.06444182,0.213675],"study_design_scores_gemma":[0.00008985004,0.00009119885,0.0002971076,0.0001205206,0.00003932838,0.0007083723,0.0001052259,0.339837,0.007759665,0.5588363,0.09205458,0.00006084447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004292153,0.0005117236,0.9644447,0.002003352,0.0004200193,0.00004611894,0.0001616805,0.000894043,0.02722626],"genre_scores_gemma":[0.0853888,0.0005071575,0.8918282,0.0006920713,0.0001868258,0.0001271582,0.0002006862,0.0008185298,0.02025058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01976217,"threshold_uncertainty_score":0.06611109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008488464","doi":"10.1016/j.disopt.2007.11.003","title":"Solving mirrored traveling tournament problem benchmark instances with eight teams","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"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":"Tournament; Benchmark (surveying); Mathematical optimization; Mathematics; Travelling salesman problem; Computer science; Tournament selection; Operations research; Combinatorics","authors":[{"name":"Kevin K. H. Cheung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05474765679449342,"gpt":0.3143357916928812,"spread":0.2595881348983878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170996,0.001176909,0.00127607,0.0009843047,0.000707788,0.001364277,0.001949133,0.001809322,0.005535934],"category_scores_gemma":[0.006139043,0.0005263908,0.0008306298,0.001168988,0.0004369619,0.001128274,0.0007103725,0.001161175,0.0002932232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001551767,"about_ca_system_score_gemma":0.001413889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006690981,"about_ca_topic_score_gemma":0.006928296,"domain_scores_codex":[0.9991567,0.0003399944,0.00004096903,0.0001670052,0.0001165886,0.0001787247],"domain_scores_gemma":[0.9969485,0.002132875,0.0002163866,0.000227878,0.000228716,0.0002456705],"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.001135512,0.0009437566,0.002392687,0.0003257809,0.000184369,0.0002078833,0.00006394435,0.9350622,0.001606436,0.006023791,0.008017663,0.04403604],"study_design_scores_gemma":[0.0002853195,0.0004166524,0.0007536644,0.00001197608,0.00003148276,0.00003628648,0.00005638584,0.993453,0.001322377,0.002674402,0.000949473,0.000009037777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9463336,0.0003569908,0.03407628,0.0005706357,0.0002360622,0.0003121756,0.001483061,0.000548748,0.01608237],"genre_scores_gemma":[0.9284849,0.0001071535,0.06470279,0.0001011603,0.00005146342,0.0002672278,0.001575307,0.00009676227,0.004613178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006690981,"threshold_uncertainty_score":0.01851952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115713772","doi":"10.1016/j.disopt.2008.01.001","title":"A sequential elimination algorithm for computing bounds on the clique number of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Clique graph; Clique problem; Mathematics; Clique; Block graph; Simplex graph; Upper and lower bounds; Split graph; Branch and bound; Combinatorics; Graph; Computation; Algorithm; Discrete mathematics; Line graph; Graph power; Pathwidth","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Patrick St‐Louis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03037697177775578,"gpt":0.2851965819208649,"spread":0.2548196101431092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218727,0.00165058,0.001743066,0.002497279,0.00123261,0.001857671,0.003169462,0.001278773,0.007947572],"category_scores_gemma":[0.00773118,0.0009776964,0.001465846,0.003447504,0.001347337,0.003523253,0.002424126,0.002767951,0.001521866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001814269,"about_ca_system_score_gemma":0.003545129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006306775,"about_ca_topic_score_gemma":0.01223103,"domain_scores_codex":[0.9982787,0.0003619277,0.0000952099,0.0004024166,0.0006429474,0.0002186963],"domain_scores_gemma":[0.9930395,0.00427371,0.0002820966,0.001218628,0.000911547,0.0002744831],"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.001426456,0.0007176199,0.002401397,0.0004701029,0.0002518146,0.0001283801,0.0002475198,0.2692248,0.01639895,0.09464179,0.01855613,0.595535],"study_design_scores_gemma":[0.0001917317,0.0001357492,0.0006076219,0.00002143481,0.00006074715,0.00008984271,0.00003465579,0.9136518,0.004847679,0.07621738,0.004113903,0.00002743253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01209792,0.0001496669,0.9830525,0.000201164,0.00005907172,0.0001344377,0.0002353913,0.0008875181,0.003182351],"genre_scores_gemma":[0.1315447,0.0001857457,0.8613989,0.0001629112,0.0001314088,0.0004232283,0.001270113,0.0004061227,0.004476874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007947572,"threshold_uncertainty_score":0.02658725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090914983","doi":"10.1016/j.disopt.2011.01.001","title":"Valid inequalities and branch-and-cut for the clique pricing problem","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; HEC Montréal","funders":"","keywords":"Branch and cut; Mathematics; Polyhedron; Clique; Integer programming; Mathematical optimization; Inequality; Linear programming; Embedding; Flow network; Cutting-plane method; Combinatorics; Computer science","authors":[{"name":"Géraldine Heilporn","is_ca":true},{"name":"Martine Labbé","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04587999302022705,"gpt":0.2986937075859502,"spread":0.2528137145657231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006262726,0.001697679,0.001938863,0.001778582,0.002227457,0.005255667,0.00390316,0.003082001,0.01111539],"category_scores_gemma":[0.02736281,0.00145012,0.002055399,0.004125345,0.003856111,0.007716883,0.002782162,0.009310774,0.000907113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004657061,"about_ca_system_score_gemma":0.00528036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01405585,"about_ca_topic_score_gemma":0.01297334,"domain_scores_codex":[0.995031,0.002725526,0.0001541456,0.0003562191,0.00123944,0.0004935479],"domain_scores_gemma":[0.9819826,0.01450891,0.000686135,0.0007296851,0.001500056,0.0005927106],"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.0001358548,0.0001320287,0.0003953594,0.0001724618,0.00006020505,0.0001195577,0.000157768,0.1034042,0.0004620499,0.8630641,0.01073319,0.02116322],"study_design_scores_gemma":[0.00003180626,0.00001450391,0.000111925,0.00003952631,0.00002014669,0.00002765206,0.00003276702,0.2565532,0.0001998969,0.7405561,0.002399272,0.00001335368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01837162,0.001527901,0.9377695,0.004745903,0.0003751106,0.0002236086,0.001104984,0.0001186927,0.03576269],"genre_scores_gemma":[0.5206113,0.004154524,0.4408825,0.001536055,0.001105712,0.0009530282,0.002550077,0.0004168301,0.02778997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01405585,"threshold_uncertainty_score":0.0371846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986491739","doi":"10.1016/j.disopt.2008.09.001","title":"Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi; Memorial University of Newfoundland","funders":"","keywords":"Divide and conquer algorithms; Computer science; Scheduling (production processes); Parallel computing; Conjecture; Schedule; Class (philosophy); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Mathematical optimization","authors":[{"name":"Wiesław Kubiak","is_ca":true},{"name":"Djamal Rebaïne","is_ca":true},{"name":"Chris N. Potts","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01772737265669138,"gpt":0.2472389947255821,"spread":0.2295116220688907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863104,0.0008669003,0.00171287,0.001288366,0.0008382002,0.001342445,0.001084353,0.001134214,0.006411553],"category_scores_gemma":[0.009612884,0.0005010854,0.0004859362,0.0009535749,0.001072735,0.00182297,0.00108315,0.00118441,0.000539868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002136436,"about_ca_system_score_gemma":0.003425858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0104716,"about_ca_topic_score_gemma":0.01067612,"domain_scores_codex":[0.9987887,0.000428928,0.00005308285,0.0001438686,0.0002223426,0.0003631809],"domain_scores_gemma":[0.9958476,0.003058617,0.0002186213,0.0003083411,0.0003523243,0.000214422],"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.0006377224,0.000167139,0.0005748511,0.0001626385,0.00002646295,0.00003288007,0.00008398919,0.9266247,0.002375712,0.01833184,0.004227785,0.04675438],"study_design_scores_gemma":[0.00003910676,0.00006313687,0.0001969244,0.000007433459,0.000005838017,0.000005931084,0.00002605057,0.9881731,0.0005690923,0.01065081,0.0002586312,0.000003966005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1783005,0.0009743168,0.7926099,0.001282894,0.0002142219,0.0003583882,0.0007134335,0.001213268,0.02433309],"genre_scores_gemma":[0.8472618,0.0003343152,0.1455045,0.0002895987,0.0001292025,0.0002422213,0.0006791503,0.0003638858,0.005195285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0104716,"threshold_uncertainty_score":0.02144879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976051387","doi":"10.1016/j.disopt.2008.12.004","title":"A Benders approach for computing lower bounds for the mirrored traveling tournament problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"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":"Tournament; Benchmark (surveying); Benders' decomposition; Mathematical optimization; Mathematics; Tournament selection; Upper and lower bounds; Computer science; Combinatorics","authors":[{"name":"Kevin K. H. Cheung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.107184687758087,"gpt":0.382185916378766,"spread":0.275001228620679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003525811,0.002018841,0.001907654,0.002577294,0.0009995741,0.003085871,0.003024922,0.002118825,0.01274959],"category_scores_gemma":[0.01402868,0.001489568,0.002404266,0.00271563,0.001399795,0.003773054,0.002014805,0.004417202,0.001681146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924134,"about_ca_system_score_gemma":0.001995798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004477689,"about_ca_topic_score_gemma":0.004693367,"domain_scores_codex":[0.9983834,0.0005903241,0.00008784239,0.0003084966,0.0004300585,0.0001999992],"domain_scores_gemma":[0.9953715,0.003302201,0.0003240684,0.0004108312,0.0003980809,0.0001932948],"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.0003190523,0.0002683692,0.0006168134,0.000190846,0.0001303644,0.00006248349,0.0001233216,0.7639374,0.00208198,0.09951786,0.005864359,0.1268872],"study_design_scores_gemma":[0.00003903243,0.00007009875,0.0001008335,0.00002120294,0.00002284835,0.00001297835,0.00001554369,0.9377015,0.0004940509,0.06062101,0.0008873779,0.00001359344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01203373,0.0002404625,0.9821234,0.0002659622,0.00007740037,0.00007773844,0.0001468896,0.0005008062,0.004533546],"genre_scores_gemma":[0.1830671,0.0005638121,0.8067288,0.0003179923,0.0002440002,0.0004552953,0.0009359858,0.0004437012,0.007243289],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01274959,"threshold_uncertainty_score":0.04265159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081538319","doi":"10.1016/j.disopt.2020.100610","title":"BDD-based optimization for the quadratic stable set problem","year":2020,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary decision diagram; Quadratic programming; Solver; Mathematical optimization; Quadratic equation; Mathematics; Integer programming; Representation (politics); Set (abstract data type); Quadratic unconstrained binary optimization; Computer science; Optimization problem; Algorithm; Programming language","authors":[{"name":"Jaime E. González","is_ca":true},{"name":"André A. Ciré","is_ca":true},{"name":"Andrea Lodi","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08705139819538114,"gpt":0.3602594812897527,"spread":0.2732080830943715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381255,0.000907257,0.001303158,0.0008430033,0.0005686157,0.001590639,0.001064412,0.000931623,0.006207695],"category_scores_gemma":[0.004157448,0.0005060302,0.0008497904,0.001010825,0.001269747,0.001288699,0.001827797,0.002054746,0.000735847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001517485,"about_ca_system_score_gemma":0.001349153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003684216,"about_ca_topic_score_gemma":0.004068246,"domain_scores_codex":[0.9992597,0.0002281833,0.00002880366,0.00009469067,0.0003385842,0.00005003609],"domain_scores_gemma":[0.9986143,0.0009359624,0.00007859305,0.00007850039,0.0002343819,0.00005818657],"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.0001137275,0.00007893223,0.0003271394,0.0001994601,0.00004271403,0.00003479106,0.00004963222,0.7104136,0.001447421,0.2242313,0.004299426,0.05876195],"study_design_scores_gemma":[0.000007368659,0.00001324293,0.00002915504,0.000007096866,0.000003185198,0.000005485299,0.00000428174,0.9521856,0.0001923407,0.04688498,0.0006638697,0.000003362456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004560659,0.0002114724,0.9889938,0.000287316,0.00005719709,0.00002311007,0.00007990347,0.00006722466,0.005719305],"genre_scores_gemma":[0.5419098,0.0008491506,0.4376467,0.0003391629,0.0001851514,0.0003156182,0.0006896044,0.0003747166,0.01769015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006207695,"threshold_uncertainty_score":0.02076685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968959377","doi":"10.1016/j.disopt.2005.10.007","title":"How to recycle your facets","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Educational Foundation of America; HEC Montréal; Belgian American Educational Foundation","keywords":"Facet (psychology); Polytope; Mathematics; Construct (python library); Combinatorics; Polyhedral combinatorics; Mathematical optimization; Computer science; Geometry; Psychology","authors":[{"name":"Samuel Fiorini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01748651244667104,"gpt":0.2802205927815007,"spread":0.2627340803348296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001414771,0.0008513738,0.001311893,0.001189654,0.00189177,0.004729136,0.00170861,0.001422234,0.08081825],"category_scores_gemma":[0.01479159,0.000755839,0.002117827,0.001310037,0.00174436,0.008106131,0.003396926,0.005424735,0.0333136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007058803,"about_ca_system_score_gemma":0.001749089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002703401,"about_ca_topic_score_gemma":0.003733444,"domain_scores_codex":[0.9989737,0.0001841061,0.00005820318,0.0001312448,0.0004909988,0.0001617616],"domain_scores_gemma":[0.9932922,0.001056792,0.0001593127,0.004036362,0.001143913,0.0003114462],"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.0003329149,0.0003212027,0.00109451,0.0004048339,0.00009930072,0.0004845065,0.0005829224,0.00502693,0.005272404,0.2203111,0.2383938,0.5276756],"study_design_scores_gemma":[0.00009070271,0.00008726664,0.0006213328,0.000266404,0.00007258638,0.0007124802,0.0006256733,0.01527919,0.008084051,0.5928947,0.3811826,0.00008274169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02385362,0.002816016,0.6210492,0.03012397,0.009185428,0.0004088363,0.001392572,0.009763449,0.3014069],"genre_scores_gemma":[0.1826545,0.004215041,0.4786463,0.008103607,0.001720931,0.0003696424,0.001844246,0.009646675,0.3127991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08081825,"threshold_uncertainty_score":0.270364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3187519750","doi":"10.1016/j.disopt.2021.100657","title":"The Bipartite Boolean Quadric Polytope","year":2021,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Quadric; Combinatorics; Discrete mathematics; Bipartite graph; Clique; Duality (order theory); Graph","authors":[{"name":"Piyashat Sripratak","is_ca":false},{"name":"Abraham P. Punnen","is_ca":true},{"name":"Tamon Stephen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004837548440651212,"gpt":0.1978723109585278,"spread":0.1930347625178766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170257,0.0003052858,0.0004570754,0.000583125,0.0003696201,0.0009374401,0.0003973436,0.0003783676,0.01154033],"category_scores_gemma":[0.001084152,0.000204216,0.0002406371,0.0006415579,0.0007439821,0.0006480909,0.0006436712,0.0006637264,0.0008189096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005002782,"about_ca_system_score_gemma":0.0004329642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002548373,"about_ca_topic_score_gemma":0.002647777,"domain_scores_codex":[0.9997595,0.00007429247,0.000005984745,0.00003804441,0.00008756982,0.00003462134],"domain_scores_gemma":[0.9997938,0.00008560713,0.00002026149,0.00002376444,0.00004915896,0.00002745185],"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.00006766782,0.00004442735,0.0007069187,0.0001276498,0.00002335372,0.00009023025,0.00004897488,0.09281965,0.003144419,0.8485278,0.007604924,0.04679405],"study_design_scores_gemma":[0.00005389631,0.0001146241,0.001652461,0.00005936039,0.00001618769,0.0003053981,0.0001110172,0.481998,0.002213693,0.4904036,0.02304498,0.00002670889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1808505,0.0008044775,0.6638568,0.001211421,0.0001309568,0.00009792349,0.000852102,0.0001916951,0.1520041],"genre_scores_gemma":[0.8504738,0.0009511141,0.1084554,0.0004099857,0.00009465207,0.000109285,0.0008334311,0.0001350335,0.03853717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01154033,"threshold_uncertainty_score":0.03860623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077167828","doi":"10.1016/j.disopt.2010.10.003","title":"Charge and reduce: A fixed-parameter algorithm for String-to-String Correction","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"String (physics); String searching algorithm; String metric; Algorithm; Boyer–Moore string search algorithm; Mathematics; Approximate string matching; Character (mathematics); Commentz-Walter algorithm; Computer science; Discrete mathematics; Pattern matching; Artificial intelligence","authors":[{"name":"Faisal N. Abu-Khzam","is_ca":false},{"name":"Henning Fernau","is_ca":false},{"name":"Michael A. Langston","is_ca":false},{"name":"Serena Lee-Cultura","is_ca":true},{"name":"Ulrike Stege","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01030520164605645,"gpt":0.2627092934732544,"spread":0.252404091827198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009993503,0.001651314,0.001685264,0.002124093,0.001059367,0.001880986,0.003273659,0.001949469,0.01635623],"category_scores_gemma":[0.006124261,0.0006615269,0.001057679,0.002600783,0.001314753,0.002280368,0.003122378,0.002503414,0.00681265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009709098,"about_ca_system_score_gemma":0.001851761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003499331,"about_ca_topic_score_gemma":0.005146152,"domain_scores_codex":[0.9986822,0.0002413748,0.00007593501,0.0002289761,0.0006630131,0.0001084345],"domain_scores_gemma":[0.9981231,0.0006049723,0.00007053803,0.0007731775,0.000357553,0.00007058297],"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.0006474525,0.0001376468,0.0003847933,0.0001654145,0.00009947392,0.0001257402,0.000107076,0.05464084,0.009656232,0.03617456,0.03353797,0.8643229],"study_design_scores_gemma":[0.0002421544,0.0001546705,0.0004014804,0.00004157798,0.00006969033,0.0003470204,0.00007683019,0.8379079,0.03663796,0.09617268,0.02784248,0.0001055971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003651684,0.000253385,0.9856408,0.0002176069,0.0002139123,0.00009054619,0.0001750067,0.007596822,0.002160394],"genre_scores_gemma":[0.05715771,0.0001790457,0.9327378,0.0001976912,0.0001370373,0.0001963358,0.0004516969,0.001889155,0.007053634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01635623,"threshold_uncertainty_score":0.05471706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023058821","doi":"10.1016/j.disopt.2009.05.003","title":"Chip firing and all-terminal network reliability bounds","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Reliability (semiconductor); Bounding overwatch; Terminal (telecommunication); Computer science; Chip; Reliability theory; Graph; Mathematics; Graph theory; Reliability engineering; Algorithm; Combinatorics; Theoretical computer science; Failure rate; Engineering; Statistics; Computer network; Artificial intelligence","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Charles J. Colbourn","is_ca":false},{"name":"Richard J. Nowakowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02141643991881777,"gpt":0.3003653373785734,"spread":0.2789488974597557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117276,0.001487437,0.001558125,0.001380182,0.0009759853,0.001865932,0.003327462,0.001411054,0.007827712],"category_scores_gemma":[0.01602652,0.0007213961,0.001224976,0.001385617,0.002030272,0.004179969,0.002267853,0.00391606,0.0007899089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001945241,"about_ca_system_score_gemma":0.001120962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001771117,"about_ca_topic_score_gemma":0.002365748,"domain_scores_codex":[0.9988212,0.000341607,0.00003898093,0.0002195411,0.0003582446,0.0002203857],"domain_scores_gemma":[0.9883084,0.007878407,0.0008062187,0.001311555,0.001125715,0.0005696989],"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.0002356011,0.0000718122,0.0006348381,0.0001798787,0.00005928964,0.000108289,0.0001347716,0.6215197,0.003483366,0.3490681,0.003242963,0.02126145],"study_design_scores_gemma":[0.00001336506,0.00005116222,0.000434948,0.00006183118,0.00005052298,0.00007586872,0.0000401149,0.7364299,0.00309056,0.2586648,0.001063851,0.00002300889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09767742,0.001841114,0.8602396,0.001112554,0.0002365346,0.00004560087,0.0002748322,0.0004516592,0.03812062],"genre_scores_gemma":[0.9144586,0.001810532,0.06929398,0.0003260075,0.0001733949,0.0001218865,0.0002429744,0.0004322392,0.01314032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007827712,"threshold_uncertainty_score":0.02618629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087975652","doi":"10.1016/j.disopt.2008.10.002","title":"On the polyhedral lift-and-project methods and the fractional stable set polytope","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Mathematics; Conjecture; Combinatorics; Lift (data mining); Operator (biology); Polyhedral combinatorics; Set (abstract data type); Polyhedron; Symmetry (geometry); Birkhoff polytope; Discrete mathematics; Computer science; Geometry; Regular polygon","authors":[{"name":"Yu-Hin Au","is_ca":true},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08774811797470744,"gpt":0.4213729508608465,"spread":0.3336248328861391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074,0.001331429,0.001635824,0.001599934,0.001035528,0.001585506,0.001360644,0.001575583,0.005897752],"category_scores_gemma":[0.006391963,0.000617186,0.001288848,0.001438501,0.002893964,0.001916402,0.003582227,0.00279242,0.0005235266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143007,"about_ca_system_score_gemma":0.001189373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003953837,"about_ca_topic_score_gemma":0.003482253,"domain_scores_codex":[0.9993269,0.0003347924,0.00002010544,0.00007100155,0.0001915045,0.00005555613],"domain_scores_gemma":[0.9985683,0.001019438,0.00008106356,0.00009046062,0.0001524817,0.0000881852],"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.00008880922,0.00006244541,0.0003007384,0.0002145393,0.00005084388,0.00005282184,0.0001112062,0.4487576,0.0009996317,0.5066649,0.002822977,0.03987345],"study_design_scores_gemma":[0.00001155964,0.00002576273,0.00006076653,0.00002961968,0.000008510023,0.00001309205,0.00002652947,0.8475114,0.0001885846,0.1499861,0.002127151,0.00001086365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009404512,0.0008786396,0.97758,0.0005663809,0.0001980692,0.00004999603,0.00006087914,0.00003835482,0.0112232],"genre_scores_gemma":[0.4690076,0.004075466,0.4891843,0.0006424825,0.0006862954,0.0006776248,0.0003614833,0.0004268069,0.03493799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005897752,"threshold_uncertainty_score":0.01972997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999004550","doi":"10.1016/j.disopt.2014.01.001","title":"The quadratic balanced optimization problem","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Quadratic equation; Sequential quadratic programming; Geometry","authors":[{"name":"Abraham P. Punnen","is_ca":true},{"name":"Sara Taghipour","is_ca":true},{"name":"Daniel Karapetyan","is_ca":true},{"name":"Bishnu Bhattacharyya","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007785666697622099,"gpt":0.2354429841984911,"spread":0.227657317500869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001565436,0.0009385027,0.001195894,0.0006308742,0.0004848147,0.002078396,0.0009833425,0.001628813,0.01423567],"category_scores_gemma":[0.006393753,0.000513965,0.0004122401,0.00113584,0.001109449,0.002408461,0.001847973,0.001604908,0.001681113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009837816,"about_ca_system_score_gemma":0.0009773946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001319556,"about_ca_topic_score_gemma":0.0010251,"domain_scores_codex":[0.9991315,0.0003116423,0.00002822184,0.00020102,0.0002325171,0.00009516028],"domain_scores_gemma":[0.999095,0.0005499792,0.00007816121,0.00006214611,0.000133055,0.00008174992],"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.0002506454,0.0001100938,0.0004769554,0.0003723843,0.00005670982,0.00007777481,0.00006679157,0.2383388,0.003093841,0.6159306,0.01910693,0.1221185],"study_design_scores_gemma":[0.00006990886,0.00008140751,0.0003207499,0.00004482729,0.00001813849,0.00009955695,0.00003892717,0.6126769,0.0009814152,0.3693488,0.01630213,0.00001724003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0110424,0.001274133,0.9476455,0.00136405,0.0001815415,0.00005110866,0.0003125105,0.00009447991,0.03803436],"genre_scores_gemma":[0.5663785,0.003435495,0.3381164,0.0009692134,0.0006282884,0.0005248565,0.001616761,0.0005560687,0.08777437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01423567,"threshold_uncertainty_score":0.0476231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986446280","doi":"10.1016/j.disopt.2012.05.002","title":"Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Clique problem; Clique; Combinatorics; Approximation algorithm; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Time complexity; Integer (computer science); Branch and bound; Mathematical optimization; Discrete mathematics; Algorithm; Chordal graph; Computer science; Graph","authors":[{"name":"Abraham P. Punnen","is_ca":true},{"name":"Ruonan Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02307915925681601,"gpt":0.2736800363920509,"spread":0.2506008771352348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002696443,0.001416679,0.001775418,0.001248046,0.001156693,0.002637195,0.003384629,0.002163006,0.007301682],"category_scores_gemma":[0.01542866,0.0008173044,0.001184795,0.002350139,0.001387644,0.00332943,0.002331011,0.002136458,0.0009688908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002846333,"about_ca_system_score_gemma":0.004276153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004313074,"about_ca_topic_score_gemma":0.005347408,"domain_scores_codex":[0.9975756,0.0008793189,0.00008121794,0.0003017785,0.000807421,0.0003546747],"domain_scores_gemma":[0.9912122,0.006778435,0.0003677931,0.0006525046,0.000704014,0.0002849755],"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.0009094432,0.0003473931,0.001724695,0.0004329657,0.0001331971,0.0001179875,0.0002086318,0.7743114,0.004689241,0.09559946,0.01231164,0.1092139],"study_design_scores_gemma":[0.00005781454,0.00005021559,0.0001995514,0.00001346699,0.00002252021,0.00004465181,0.00003104051,0.9706978,0.0004019993,0.02760401,0.0008695076,0.000007510715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04525423,0.0009644039,0.9388779,0.001187297,0.000145869,0.0002625738,0.0002612387,0.0006461116,0.01240042],"genre_scores_gemma":[0.4084664,0.0007882726,0.5818174,0.0005878717,0.000284146,0.0006412001,0.0009366729,0.0005125725,0.005965492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007301682,"threshold_uncertainty_score":0.02442658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783589701","doi":"10.1016/j.disopt.2017.08.005","title":"A linear time algorithm for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml167\" display=\"inline\" overflow=\"scroll\" altimg=\"si167.gif\"><mml:mn>3</mml:mn></mml:math>-neighbour Travelling Salesman Problem on a Halin graph and extensions","year":2017,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","authors":[{"name":"Brad Woods","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true},{"name":"Tamon Stephen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02012742426041067,"gpt":0.2707476361752828,"spread":0.2506202119148722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001356882,0.002958268,0.001805323,0.001946853,0.001825326,0.003545457,0.004435689,0.003019403,0.06520268],"category_scores_gemma":[0.005974432,0.001154455,0.002618974,0.002612797,0.001275781,0.004899599,0.003816216,0.00367861,0.02332064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003314408,"about_ca_system_score_gemma":0.005031351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00787008,"about_ca_topic_score_gemma":0.01502641,"domain_scores_codex":[0.9981577,0.0002336277,0.000139448,0.0006983959,0.0004836153,0.0002873226],"domain_scores_gemma":[0.9971473,0.00157829,0.0001486669,0.0005544894,0.0003672116,0.0002040206],"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.0008871831,0.0009683013,0.0007970208,0.001012587,0.0001754696,0.0002930769,0.0004274353,0.08166296,0.008747185,0.08564517,0.1617558,0.6576279],"study_design_scores_gemma":[0.0009347809,0.0004041235,0.0007793652,0.0001447968,0.0001327162,0.0006459915,0.000376016,0.6558113,0.007240583,0.2814659,0.0519237,0.0001407563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006411565,0.00042933,0.9476553,0.001506316,0.0003785913,0.0007085226,0.001504561,0.01198616,0.02941965],"genre_scores_gemma":[0.06612011,0.000341984,0.8998302,0.0005054634,0.0002252055,0.001030184,0.004015265,0.001927299,0.0260043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06520268,"threshold_uncertainty_score":0.2181247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2919667091","doi":"10.1016/j.disopt.2019.03.002","title":"On the intrinsic volumes of intersections of congruent balls","year":2019,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ball (mathematics); Mathematics; Combinatorics; Intersection (aeronautics); Pairwise comparison; Convex body; Euclidean space; Euclidean geometry; Geometry; Discrete mathematics; Regular polygon; Convex hull","authors":[{"name":"Károly Bezdek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02363428599131756,"gpt":0.2764234025157367,"spread":0.2527891165244192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874242,0.001555499,0.002207101,0.005802202,0.001493239,0.005909901,0.00452768,0.001799686,0.006764518],"category_scores_gemma":[0.0373898,0.001389893,0.001707981,0.002810404,0.007428116,0.009775642,0.006351898,0.005035187,0.0005316832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00299731,"about_ca_system_score_gemma":0.001033111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001470968,"about_ca_topic_score_gemma":0.001105891,"domain_scores_codex":[0.9963709,0.001523248,0.0001608094,0.0004567032,0.001052699,0.0004355834],"domain_scores_gemma":[0.974572,0.01887673,0.002477187,0.000889291,0.001673849,0.001510933],"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.00005232175,0.0000185957,0.0005882951,0.00006249172,0.0000206694,0.00003413849,0.0001716808,0.01851118,0.0003251337,0.9756589,0.0004753142,0.004081166],"study_design_scores_gemma":[0.00001508023,0.00003116522,0.000717158,0.0000523152,0.00001922995,0.00007144186,0.0001466714,0.1199335,0.0004967263,0.8770212,0.001474522,0.00002109579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3013107,0.003905075,0.6296552,0.002121756,0.0002941801,0.0001024257,0.000530878,0.0001562897,0.06192359],"genre_scores_gemma":[0.9197169,0.002513917,0.06455981,0.0002210736,0.0006310601,0.0002029407,0.0005824663,0.0002829689,0.01128885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006764518,"threshold_uncertainty_score":0.02577776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981813514","doi":"10.1016/j.disopt.2005.03.005","title":"Multiroute flows: Cut-trees and realizability","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Realizability; Mathematics; Characterization (materials science); Combinatorics; Diagonal; Simple (philosophy); Context (archaeology); Discrete mathematics; Tree (set theory); Matrix (chemical analysis); Flow network; Integer (computer science); Algorithm; Computer science","authors":[{"name":"Santosh N. Kabadi","is_ca":true},{"name":"R. Chandrasekaran","is_ca":false},{"name":"K. P. K. Nair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006429571201527289,"gpt":0.215421699780067,"spread":0.2089921285785397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006958055,0.000485163,0.0004604821,0.0007083623,0.0005166496,0.001439318,0.0008128847,0.0008658539,0.006977339],"category_scores_gemma":[0.003507719,0.0004993199,0.0004593898,0.000829057,0.0009762811,0.00264833,0.0007491944,0.001783691,0.0004310645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005269272,"about_ca_system_score_gemma":0.0005005341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000668643,"about_ca_topic_score_gemma":0.001617812,"domain_scores_codex":[0.9996811,0.00007547153,0.00001581966,0.00005797944,0.0001314701,0.00003814101],"domain_scores_gemma":[0.9987184,0.0008503171,0.0001286994,0.0001486749,0.0001054914,0.00004850344],"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.0001293317,0.00008611553,0.0006877715,0.000137926,0.00001665905,0.0001107871,0.0001357905,0.08907205,0.003684751,0.762876,0.00230848,0.1407544],"study_design_scores_gemma":[0.0000313257,0.00004990327,0.0004061266,0.00004983621,0.00001866154,0.0001547206,0.00005213181,0.2335156,0.004043256,0.7559159,0.005748316,0.00001408992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0309458,0.0005701728,0.9537155,0.0003319182,0.00004021712,0.00002959836,0.00009661784,0.000225303,0.01404482],"genre_scores_gemma":[0.530034,0.001295318,0.4553094,0.0001506236,0.0001208167,0.0001285657,0.0004329455,0.0003319856,0.01219633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006977339,"threshold_uncertainty_score":0.02334154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036207413","doi":"10.1016/j.disopt.2011.02.004","title":"New bounds on the average distance from the Fermat–Weber center of a planar convex body","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convex body; Mathematics; Fermat's Last Theorem; Combinatorics; Conjecture; Regular polygon; Center (category theory); Planar; Upper and lower bounds; Plane (geometry); Geometry; Mathematical analysis; Convex hull; Crystallography","authors":[{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Minghui Jiang","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05430893569011083,"gpt":0.2672022445530197,"spread":0.2128933088629088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00472937,0.002866713,0.002309108,0.005910455,0.001689316,0.004043462,0.004926548,0.002853014,0.008191349],"category_scores_gemma":[0.02581836,0.001130476,0.002107181,0.003149131,0.005748922,0.009273829,0.006530785,0.008162477,0.001386125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003597739,"about_ca_system_score_gemma":0.001047631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009253933,"about_ca_topic_score_gemma":0.001063179,"domain_scores_codex":[0.9978703,0.0004891173,0.0001121736,0.0006130513,0.0006628507,0.0002524451],"domain_scores_gemma":[0.9787416,0.01488617,0.001881414,0.001327486,0.001757833,0.001405529],"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.0003393012,0.0001115907,0.001492337,0.0004781728,0.0001406926,0.0002064836,0.0003214252,0.1188595,0.008007524,0.8195214,0.004763978,0.04575757],"study_design_scores_gemma":[0.00002270022,0.0001604494,0.001556022,0.0001431215,0.00009264982,0.0002299524,0.0001147239,0.5419329,0.005270738,0.4413863,0.008949024,0.0001414929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04162883,0.006201013,0.9236201,0.001420154,0.0005460738,0.00004957085,0.0002747778,0.0002978034,0.02596162],"genre_scores_gemma":[0.7223539,0.007119474,0.2478625,0.0009674255,0.002205178,0.0003905589,0.0007377564,0.0008711227,0.0174921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008191349,"threshold_uncertainty_score":0.02740276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996281476","doi":"10.1016/j.disopt.2009.03.001","title":"The bipartite margin shop and maximum red matchings free of blue–red alternating cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Margin (machine learning); Mathematical optimization; Algorithm; Computer science; Graph","authors":[{"name":"Daniel Oron","is_ca":false},{"name":"George Steiner","is_ca":true},{"name":"Vadim G. Timkovsky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006651385411043069,"gpt":0.2180696223689897,"spread":0.2114182369579466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002396229,0.0009680659,0.002074285,0.0008382054,0.001399648,0.002332127,0.002501484,0.001871639,0.01109822],"category_scores_gemma":[0.00787595,0.001363629,0.001210058,0.001275242,0.002157762,0.003805919,0.002229959,0.002169269,0.0009120096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373302,"about_ca_system_score_gemma":0.001466574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002022091,"about_ca_topic_score_gemma":0.001957894,"domain_scores_codex":[0.9986005,0.0006062689,0.0000434625,0.0003189645,0.000157174,0.0002736226],"domain_scores_gemma":[0.9962953,0.00208406,0.0004643609,0.0004220855,0.000210999,0.0005231751],"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.001526688,0.0003013652,0.0009667765,0.0004616521,0.0001594489,0.0003176224,0.0003264475,0.3329371,0.004119294,0.6131225,0.01027332,0.03548779],"study_design_scores_gemma":[0.0001626321,0.0001292627,0.0004905803,0.00004189504,0.00004315511,0.000108828,0.0000978253,0.5366646,0.0009733167,0.4582443,0.003004193,0.00003949093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2754197,0.001003784,0.6757914,0.002288968,0.0002951501,0.000154507,0.0007177126,0.0005886742,0.04374005],"genre_scores_gemma":[0.8648039,0.0003542249,0.1052374,0.0005182546,0.0002030232,0.0001853391,0.000428101,0.0002246517,0.02804512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01109822,"threshold_uncertainty_score":0.0371272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081923266","doi":"10.1016/j.disopt.2005.11.001","title":"Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Edmond de Rothschild Foundation; University of Haifa","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Transitive relation; Vertex (graph theory); Discrete mathematics; Time complexity; Graph","authors":[{"name":"Jørgen Bang‐Jensen","is_ca":false},{"name":"Gregory Gutin","is_ca":false},{"name":"Anders Yeo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01092403794040013,"gpt":0.2639048718195904,"spread":0.2529808338791902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008963331,0.00111531,0.001667456,0.002066431,0.001087355,0.002177133,0.001923908,0.001311532,0.005562891],"category_scores_gemma":[0.005916356,0.00123265,0.00108259,0.001996716,0.001087786,0.00380431,0.001524634,0.00158139,0.0003739166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001239608,"about_ca_system_score_gemma":0.001123024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002782868,"about_ca_topic_score_gemma":0.006309702,"domain_scores_codex":[0.9994549,0.0001538443,0.00003378087,0.0001717534,0.00008910978,0.00009655872],"domain_scores_gemma":[0.9952528,0.003121852,0.0004496333,0.0004133631,0.0003067901,0.0004554611],"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.001122861,0.0006254485,0.006453107,0.001170106,0.0003613048,0.000750878,0.00103203,0.4009295,0.01013407,0.4409981,0.008318515,0.1281039],"study_design_scores_gemma":[0.0001072836,0.0001309168,0.0008426612,0.00007117749,0.00007745277,0.0001323654,0.0002427657,0.5455662,0.002660786,0.4485568,0.001585294,0.00002643388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6039449,0.0004160546,0.3847873,0.0005140217,0.00006484451,0.0002567594,0.001285538,0.000389561,0.008341034],"genre_scores_gemma":[0.7873074,0.0003657086,0.2013041,0.0001777746,0.00004661439,0.0002051372,0.001539651,0.0002277161,0.008825887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005562891,"threshold_uncertainty_score":0.01860976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2507811569","doi":"10.1016/j.disopt.2018.08.003","title":"Additive stabilizers for unstable graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Matching (statistics); Approximation algorithm; Chordal graph; Vertex cover; Maximal independent set; Edge cover; Discrete mathematics; Graph; 1-planar graph","authors":[{"name":"Karthekeyan Chandrasekaran","is_ca":false},{"name":"Corinna Gottschalk","is_ca":false},{"name":"Jochen Könemann","is_ca":true},{"name":"Britta Peis","is_ca":false},{"name":"Daniel Schmand","is_ca":false},{"name":"Andreas Wierz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02361287613948265,"gpt":0.2739444552874977,"spread":0.250331579148015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008438998,0.00107216,0.0008873402,0.001633055,0.001174818,0.003493215,0.001087657,0.00113184,0.008028037],"category_scores_gemma":[0.006095933,0.0003586002,0.0006784348,0.0009877039,0.001947343,0.003217211,0.002051217,0.002591168,0.0007254588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001470846,"about_ca_system_score_gemma":0.0007281374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001241017,"about_ca_topic_score_gemma":0.001726014,"domain_scores_codex":[0.999243,0.0002471622,0.0000286919,0.0001751134,0.000204018,0.0001019983],"domain_scores_gemma":[0.9967433,0.001895299,0.0003906748,0.0002785881,0.0002914957,0.0004007464],"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.00005366087,0.00002925858,0.0003975956,0.00004708423,0.00001720447,0.00004524938,0.000125344,0.01900255,0.001033083,0.970446,0.002326774,0.006476185],"study_design_scores_gemma":[0.00001228815,0.00001301296,0.0001532808,0.000007616032,0.00000894105,0.00001529236,0.00004240563,0.07410585,0.0004778591,0.9242567,0.000898535,0.000008214289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3835131,0.0009862586,0.56834,0.002974923,0.0002666934,0.00008283891,0.0005279543,0.0005173207,0.0427909],"genre_scores_gemma":[0.9520741,0.0005168863,0.02345408,0.0003172802,0.0003724059,0.0001416025,0.0004148417,0.0001814769,0.02252741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008028037,"threshold_uncertainty_score":0.02685642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006549279","doi":"10.1016/j.disopt.2007.12.002","title":"Minimum cycle factors in quasi-transitive digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Transitive relation; Discrete mathematics; Path (computing); Computer science","authors":[{"name":"Jørgen Bang‐Jensen","is_ca":false},{"name":"Morten H. Nielsen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006986559510435831,"gpt":0.189187229400176,"spread":0.1822006698897402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231121,0.0008000325,0.001297938,0.001940548,0.001353443,0.002787421,0.001053993,0.0009889591,0.009466467],"category_scores_gemma":[0.004665039,0.0009205847,0.0007904029,0.002011732,0.001201124,0.003311667,0.0009238216,0.00130861,0.0008574022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520071,"about_ca_system_score_gemma":0.0009836705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002832511,"about_ca_topic_score_gemma":0.004934629,"domain_scores_codex":[0.9993856,0.0001526,0.00003607744,0.000170667,0.000131674,0.0001233786],"domain_scores_gemma":[0.9967266,0.001915178,0.000356986,0.0003309548,0.0002999683,0.0003702197],"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.0001773656,0.0000694575,0.0007453845,0.0002020192,0.00004215024,0.0001351127,0.0003589546,0.02806343,0.003310898,0.9336489,0.003745435,0.02950089],"study_design_scores_gemma":[0.00005411096,0.00005396254,0.0004247021,0.00005863754,0.00003241919,0.0001380598,0.0001418322,0.05978118,0.001738816,0.93248,0.005075141,0.00002127037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4116436,0.001537301,0.5227658,0.001038717,0.0001302611,0.0002349187,0.001398917,0.0006091082,0.06064124],"genre_scores_gemma":[0.875277,0.00127652,0.09798282,0.0002752725,0.0001129787,0.0002406925,0.0009339229,0.0003308551,0.02356988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009466467,"threshold_uncertainty_score":0.03166848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015967296","doi":"10.1016/j.disopt.2005.08.008","title":"Berge’s theorem for the maximum charge problem","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Mathematics; Generalization; Combinatorics; Charge (physics); Graph; Matching (statistics); Discrete mathematics; Mathematical analysis; Statistics; Quantum mechanics; Physics","authors":[{"name":"Ramesh Krishnamurti","is_ca":true},{"name":"Daya Ram Gaur","is_ca":true},{"name":"Subir Kumar Ghosh","is_ca":false},{"name":"H. Sachs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01185349235856581,"gpt":0.2624375729190806,"spread":0.2505840805605148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563657,0.001489774,0.001894447,0.002393218,0.001956054,0.004400865,0.00305892,0.00369584,0.02251373],"category_scores_gemma":[0.01176191,0.0007632276,0.001827052,0.002796119,0.003931021,0.009844839,0.004129563,0.007665936,0.002514128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002204431,"about_ca_system_score_gemma":0.001296882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001600175,"about_ca_topic_score_gemma":0.001424135,"domain_scores_codex":[0.9988855,0.0002933838,0.00004405513,0.0002348085,0.0003559097,0.0001863471],"domain_scores_gemma":[0.9972212,0.001992784,0.00009663039,0.0002093566,0.0002971782,0.0001827964],"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.00002111231,0.00002016936,0.00005828551,0.00008803292,0.00001507977,0.00002179443,0.00005748167,0.0025578,0.0003641837,0.9812639,0.007171996,0.008360308],"study_design_scores_gemma":[0.00001826683,0.000005396663,0.00006664024,0.00001510172,0.000005825842,0.00003014958,0.0000173464,0.006274305,0.000152302,0.9874325,0.005974254,0.000007911871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02238049,0.006463703,0.6182325,0.02586741,0.00172768,0.0001415234,0.0007357322,0.0003115726,0.3241393],"genre_scores_gemma":[0.6043118,0.01218712,0.2105719,0.01096926,0.004367849,0.001084681,0.001118685,0.00110178,0.1542869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02251373,"threshold_uncertainty_score":0.07531589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975310381","doi":"10.1016/j.disopt.2013.07.004","title":"A polynomial time algorithm for unloading boxes off a gravity conveyor","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi; Polytechnique Montréal","funders":"","keywords":"Algorithm; Set (abstract data type); Time complexity; Mathematics; Polynomial; Dynamic programming; Mathematical optimization; Computer science; Mathematical analysis","authors":[{"name":"Pierre Baptiste","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"André Linhares","is_ca":true},{"name":"Djamal Rebaïne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0061230829875364,"gpt":0.2052522143263091,"spread":0.1991291313387727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003681393,0.001497464,0.001339672,0.0005523878,0.0008654873,0.000844364,0.001559775,0.001532497,0.008382807],"category_scores_gemma":[0.0009502966,0.0006233417,0.0008733132,0.000758314,0.0007416441,0.001072499,0.001374122,0.001268498,0.001192682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135538,"about_ca_system_score_gemma":0.001731943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008226763,"about_ca_topic_score_gemma":0.00977245,"domain_scores_codex":[0.9996488,0.00004439168,0.00001512131,0.0001187418,0.00008290952,0.00009000034],"domain_scores_gemma":[0.9996479,0.0001742888,0.00003766309,0.00006017839,0.00004073144,0.0000392526],"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.000437048,0.0002401014,0.0005077224,0.0002107454,0.00005091322,0.00009836267,0.0001137921,0.676209,0.01355746,0.01219308,0.005748002,0.2906337],"study_design_scores_gemma":[0.0001135056,0.00008159796,0.0001547818,0.000006022428,0.00001132814,0.00001893541,0.0000259135,0.9904619,0.001655787,0.00652405,0.000936312,0.000009944344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03416357,0.00009540055,0.9565785,0.0001805484,0.00007321118,0.0001585522,0.0001068946,0.002516064,0.006127212],"genre_scores_gemma":[0.2924614,0.00006541299,0.7013174,0.00008046671,0.00003160693,0.0002559501,0.0003131421,0.0002430657,0.005231427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008382807,"threshold_uncertainty_score":0.02804327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088470271","doi":"10.1016/j.disopt.2012.07.004","title":"Total domination and the Caccetta–Häggkvist conjecture","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","authors":[{"name":"Patrick St‐Louis","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00744222266980682,"gpt":0.2617487429915411,"spread":0.2543065203217343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002497717,0.0006199027,0.001652515,0.001589836,0.003544681,0.004166626,0.002165534,0.003262003,0.01255256],"category_scores_gemma":[0.01676644,0.0006110918,0.001434972,0.002247657,0.006385897,0.006452118,0.003270395,0.00533975,0.0009709594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002841541,"about_ca_system_score_gemma":0.001604126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005750178,"about_ca_topic_score_gemma":0.006082568,"domain_scores_codex":[0.9981914,0.0005869773,0.00003829785,0.0003549681,0.0004330657,0.0003953303],"domain_scores_gemma":[0.9882365,0.008342726,0.0004619681,0.001565575,0.0006852579,0.0007079894],"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.00004947483,0.00002198363,0.0004193498,0.00004169267,0.00001239238,0.00004553425,0.0001844243,0.004506248,0.0002090064,0.9843997,0.006264601,0.003845712],"study_design_scores_gemma":[0.00001995923,0.000003021531,0.0001515157,0.00001161873,0.000004626101,0.00002727673,0.0000369782,0.009000808,0.00007606525,0.9889005,0.0017624,0.000005113902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3736621,0.004940481,0.1763706,0.04215095,0.0009057432,0.00009888013,0.001079861,0.0005052813,0.4002861],"genre_scores_gemma":[0.9507298,0.00143934,0.01325808,0.002374505,0.000609168,0.0001640188,0.0004532724,0.0001923192,0.03077943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01255256,"threshold_uncertainty_score":0.04199249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2509691293","doi":"10.1016/j.disopt.2017.10.001","title":"Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypercube; Polytope; Mathematics; Semidefinite programming; Combinatorics; Vertex (graph theory); Lift (data mining); Operator (biology); Regular polygon; Polyhedron; Discrete mathematics; Computer science; Mathematical optimization","authors":[{"name":"Yu Hin Au","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02309696272240792,"gpt":0.2800881309899574,"spread":0.2569911682675495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275377,0.00141386,0.001455747,0.001527968,0.001376084,0.004610181,0.00160065,0.001607027,0.02017899],"category_scores_gemma":[0.006691241,0.0009640119,0.00147421,0.001064676,0.003111159,0.005967034,0.003174642,0.005413956,0.002036279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000957772,"about_ca_system_score_gemma":0.0008369819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004120464,"about_ca_topic_score_gemma":0.000873895,"domain_scores_codex":[0.9986548,0.0003289194,0.00005670412,0.0002837516,0.0004243022,0.0002515099],"domain_scores_gemma":[0.9955219,0.002420823,0.0004241514,0.0004805048,0.0003801767,0.000772553],"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.00006427096,0.00007378961,0.0002537899,0.00008160915,0.00001385802,0.00008025079,0.0000968363,0.009082842,0.001117712,0.9805921,0.003251636,0.005291264],"study_design_scores_gemma":[0.00001739496,0.00002354512,0.0001522335,0.00001297671,0.000006367572,0.00004962999,0.00004194289,0.03856443,0.0005153141,0.9595261,0.001076568,0.00001351432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2614407,0.0004812787,0.674408,0.001530332,0.0002963622,0.000150579,0.0008707372,0.000656501,0.06016554],"genre_scores_gemma":[0.8811969,0.0005608783,0.0818416,0.0005547098,0.000440084,0.000316522,0.001164553,0.0006407014,0.03328407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02017899,"threshold_uncertainty_score":0.06750548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090424186","doi":"10.1016/j.disopt.2007.08.005","title":"The travelling preacher, projection, and a lower bound for the stability number of a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Emmanuel Bible College; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Graph; Interpretation (philosophy); Independent set; Enhanced Data Rates for GSM Evolution; Projection (relational algebra); Stability (learning theory); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"Jack Edmonds","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02439590165167475,"gpt":0.315726119814678,"spread":0.2913302181630033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002690935,0.001746781,0.002009885,0.003563581,0.002576495,0.003302824,0.003349403,0.003445927,0.01429006],"category_scores_gemma":[0.0259309,0.001006401,0.001771734,0.002634828,0.006045619,0.008400262,0.003762133,0.007041253,0.00134465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002474736,"about_ca_system_score_gemma":0.001694037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363799,"about_ca_topic_score_gemma":0.00140201,"domain_scores_codex":[0.9985161,0.0005624004,0.00004402179,0.0003785866,0.0002977228,0.0002011623],"domain_scores_gemma":[0.9802763,0.01573199,0.0007558228,0.0009128795,0.0009834819,0.001339449],"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.0002947641,0.00006771368,0.0006311082,0.0002192386,0.00004420776,0.0001008261,0.000287809,0.05319504,0.003393623,0.9159792,0.007504233,0.01828234],"study_design_scores_gemma":[0.00003420842,0.0001263574,0.0004542874,0.00006766016,0.00003439678,0.0001349972,0.0001043917,0.2995532,0.001975319,0.6951921,0.002275,0.00004800853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1837424,0.003697071,0.7345154,0.006674966,0.0005799569,0.0001879934,0.0006541713,0.0005197311,0.06942835],"genre_scores_gemma":[0.8281397,0.003061908,0.138211,0.0007794091,0.0009672745,0.0006772121,0.0006569808,0.0005104339,0.026996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01429006,"threshold_uncertainty_score":0.04780501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W6625772","doi":"10.1016/j.disopt.2007.12.001","title":"A Special Issue in Memory of George B. Dantzig","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Academic and Historical Perspectives in Psychology","field":"Psychology","cited_by":1,"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":"George (robot); Mathematics; Mathematical economics; Operations research; Computer science; Artificial intelligence","authors":[{"name":"Egon Balas","is_ca":false},{"name":"Alan J. Hoffman","is_ca":false},{"name":"S. Thomas McCormick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01855816165973135,"gpt":0.3103188918491556,"spread":0.2917607301894242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002299995,0.001481736,0.002207423,0.001636263,0.001843622,0.004721178,0.001811826,0.005191872,0.04125348],"category_scores_gemma":[0.01151661,0.0004684596,0.0009189905,0.001102289,0.001544249,0.004936446,0.00181145,0.00739054,0.02144981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002223331,"about_ca_system_score_gemma":0.001433506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001069686,"about_ca_topic_score_gemma":0.001897987,"domain_scores_codex":[0.9986579,0.0002576559,0.0001333915,0.0004052784,0.0004136231,0.0001322149],"domain_scores_gemma":[0.9935626,0.002465967,0.0004707168,0.0003304984,0.001838319,0.001331925],"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.00003078331,0.00001340108,0.00004897725,0.00008649752,0.000007097942,0.00005348274,0.000017375,0.00004300067,0.00004578593,0.00234943,0.9873375,0.009966653],"study_design_scores_gemma":[0.00001347694,0.00002146985,0.0001900913,0.0001325684,0.000008818674,0.0001321412,0.00002879962,0.0001142008,0.0001097404,0.003451351,0.9957866,0.00001078319],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0002806764,0.03256334,0.0007872611,0.1829975,0.7700052,0.00002114239,0.0001984835,0.00007245237,0.01307388],"genre_scores_gemma":[0.004086626,0.02651672,0.0003591856,0.04044696,0.865436,0.00002981724,0.0001537923,0.0001791234,0.06279185],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.04125348,"threshold_uncertainty_score":0.1380066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2745314127","doi":"10.1016/j.disopt.2018.06.004","title":"The generalized vertex cover problem and some variations","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"Bipartite graph; Vertex cover; Mathematics; Vertex (graph theory); Generalization; Combinatorics; Cover (algebra); Edge cover; Mathematical optimization; Quadratic equation; Linear programming; Integer programming; Discrete mathematics; Approximation algorithm; Graph","authors":[{"name":"Pooja Pandey","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01554961387666857,"gpt":0.2494159079872457,"spread":0.2338662941105771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178104,0.001569819,0.002534061,0.001856153,0.001457729,0.004683056,0.004037844,0.003250006,0.006815735],"category_scores_gemma":[0.009072319,0.0007079205,0.002066402,0.005839316,0.003482557,0.007885827,0.003582727,0.006592419,0.0006886218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003527988,"about_ca_system_score_gemma":0.001395078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004335263,"about_ca_topic_score_gemma":0.004276356,"domain_scores_codex":[0.9977177,0.0007848532,0.00006343524,0.0005787895,0.0005861183,0.0002691703],"domain_scores_gemma":[0.9957918,0.002583971,0.0003364928,0.0006816933,0.0002789107,0.0003269846],"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.000129538,0.0001214027,0.0004073981,0.0002701416,0.00007265605,0.0001036062,0.0001351984,0.07359941,0.0006705595,0.8796449,0.01132011,0.03352503],"study_design_scores_gemma":[0.00003216802,0.0000228078,0.0003380053,0.00003176601,0.00002712681,0.00009440876,0.00004711248,0.1580911,0.0002089142,0.8329742,0.008108732,0.00002358624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1322715,0.02714616,0.7225216,0.01350749,0.001501995,0.0001637115,0.001207331,0.0003983685,0.1012819],"genre_scores_gemma":[0.7671611,0.01305839,0.1691702,0.002211224,0.004451049,0.0003723648,0.001355639,0.0005560673,0.041664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006815735,"threshold_uncertainty_score":0.02559745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041745502","doi":"10.1016/j.disopt.2010.08.004","title":"Generalized resolution search","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Resolution (logic); Mathematics; Mathematical optimization; Branch and bound; Flexibility (engineering); Process (computing); Guided Local Search; Algorithm; Search algorithm; Computer science; Artificial intelligence","authors":[{"name":"Marius Posta","is_ca":true},{"name":"Jacques A. Ferland","is_ca":true},{"name":"Philippe Michelon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01181640871950965,"gpt":0.2546175475482703,"spread":0.2428011388287607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386145,0.001245062,0.001938426,0.001873478,0.001035371,0.002441973,0.002223945,0.001928844,0.03044444],"category_scores_gemma":[0.005599861,0.0007429492,0.001545602,0.00283665,0.00153296,0.002529859,0.003561903,0.002828129,0.005108092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008988669,"about_ca_system_score_gemma":0.001189962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420161,"about_ca_topic_score_gemma":0.00294604,"domain_scores_codex":[0.9980621,0.0008062962,0.0000633094,0.0004305817,0.0005227207,0.00011506],"domain_scores_gemma":[0.9985537,0.0006196625,0.00006644579,0.0005262847,0.0001731311,0.00006082424],"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.0001783481,0.0001411816,0.0003476313,0.0004392519,0.0001779925,0.0002310143,0.0001469928,0.113764,0.00323752,0.5332203,0.02574969,0.3223661],"study_design_scores_gemma":[0.0001153542,0.00008939265,0.0002427808,0.000113366,0.00008563185,0.0002574593,0.00008927704,0.4809834,0.003053223,0.4629831,0.05194508,0.00004192995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006985511,0.001412156,0.9452195,0.0006330045,0.000271201,0.0001333602,0.0003382185,0.001346641,0.04366047],"genre_scores_gemma":[0.1804669,0.001138206,0.7786574,0.0007665404,0.000236122,0.0003100325,0.001321492,0.0009815838,0.0361217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03044444,"threshold_uncertainty_score":0.1018468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000678401","doi":"10.1016/j.disopt.2009.04.003","title":"On stars and Steiner stars","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Star (game theory); Combinatorics; Stars; Plane (geometry); Mathematics; Matching (statistics); Point (geometry); Line (geometry); Center (category theory); Physics; Mathematical analysis; Geometry; Astrophysics","authors":[{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00380459814755335,"gpt":0.1846824485308133,"spread":0.18087785038326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118967,0.0009216527,0.001616991,0.00143189,0.001409177,0.002348757,0.001300358,0.001685157,0.00983331],"category_scores_gemma":[0.006270149,0.0006460386,0.001034594,0.003617917,0.002953631,0.004958879,0.002572442,0.003699552,0.001083123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520811,"about_ca_system_score_gemma":0.0007707088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001385322,"about_ca_topic_score_gemma":0.001590031,"domain_scores_codex":[0.9991519,0.0004201843,0.00002789386,0.0001229397,0.0001879795,0.00008908269],"domain_scores_gemma":[0.997124,0.001922644,0.0002075451,0.0002310243,0.0002589079,0.0002559265],"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.00002610813,0.00001797988,0.0001296247,0.00003930864,0.000009218777,0.00001699718,0.00006995517,0.01012773,0.0001438307,0.975019,0.005086004,0.009314249],"study_design_scores_gemma":[0.00000719055,0.000008925839,0.0000656679,0.00001333327,0.000003494096,0.00001586035,0.00003660885,0.01609764,0.00005961446,0.9800488,0.003639335,0.000003463401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1067863,0.009528638,0.7078673,0.01008106,0.001346838,0.00008446954,0.0005080338,0.0001767302,0.1636206],"genre_scores_gemma":[0.7356392,0.01274537,0.1387014,0.003024794,0.002173481,0.0002228327,0.0008925612,0.0003759561,0.1062244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00983331,"threshold_uncertainty_score":0.03289568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}